| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
About the Collatz conjecture
|
Andrei, Ştefan
|
|
1998
|
|
2 |
p. 167-179
|
artikel
|
| 2 |
A criterion for atomicity revisited
|
Hesselink, Wim H.
|
|
2007
|
|
2 |
p. 123-151
|
artikel
|
| 3 |
A functional approach for temporal $\times$ modal logics
|
Burrieza, Alfredo
|
|
2003
|
|
2 |
p. 71-96
|
artikel
|
| 4 |
A general account of coinduction up-to
|
Bonchi, Filippo
|
|
2016
|
|
2 |
p. 127-190
|
artikel
|
| 5 |
An efficient simulation algorithm on Kripke structures
|
Ranzato, Francesco
|
|
2014
|
|
2 |
p. 107-125
|
artikel
|
| 6 |
An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs
|
Yen, William C.K.
|
|
1999
|
|
2 |
p. 143-172
|
artikel
|
| 7 |
A theory of structural stationarity in the π-Calculus
|
Meyer, Roland
|
|
2009
|
|
2 |
p. 87-137
|
artikel
|
| 8 |
A tool for deciding the satisfiability of continuous-time metric temporal logic
|
Bersani, Marcello M.
|
|
2015
|
|
2 |
p. 171-206
|
artikel
|
| 9 |
A trace-based service semantics guaranteeing deadlock freedom
|
Stahl, Christian
|
|
2012
|
|
2 |
p. 69-103
|
artikel
|
| 10 |
Average-energy games
|
Bouyer, Patricia
|
|
2016
|
|
2 |
p. 91-127
|
artikel
|
| 11 |
Bin stretching revisited
|
Epstein, Leah
|
|
2003
|
|
2 |
p. 97-117
|
artikel
|
| 12 |
Canonical prefixes of Petri net unfoldings
|
Khomenko, Victor
|
|
2003
|
|
2 |
p. 95-118
|
artikel
|
| 13 |
Compositional type checking of delta-oriented software product lines
|
Bettini, Lorenzo
|
|
2013
|
|
2 |
p. 77-122
|
artikel
|
| 14 |
Computational complexity via programming languages: constant factors do matter
|
Ben-Amram, Amir M.
|
|
2000
|
|
2 |
p. 83-120
|
artikel
|
| 15 |
Computational fractal geometry with WFA
|
Culik II, Karel
|
|
1997
|
|
2 |
p. 151-166
|
artikel
|
| 16 |
Data refinement of mixed specifications
|
Sanders, Beverly A.
|
|
1998
|
|
2 |
p. 91-129
|
artikel
|
| 17 |
Decentralized runtime verification of message sequences in message-based systems
|
Samadi, Mahboubeh
|
|
|
|
2 |
p. 145-178
|
artikel
|
| 18 |
Decidability of model checking for infinite-state concurrent systems
|
Esparza, Javier
|
|
1997
|
|
2 |
p. 85-107
|
artikel
|
| 19 |
Deciding probabilistic bisimilarity over infinite-state probabilistic systems
|
Brázdil, Tomáš
|
|
2007
|
|
2 |
p. 131-154
|
artikel
|
| 20 |
Decision problems for pushdown threads
|
Bergstra, Jan A.
|
|
2007
|
|
2 |
p. 75-90
|
artikel
|
| 21 |
Distance measures for point sets and their computation
|
Eiter, Thomas
|
|
1997
|
|
2 |
p. 109-133
|
artikel
|
| 22 |
Dynamic Bayesian networks for formal verification of structured stochastic processes
|
Esmaeil Zadeh Soudjani, Sadegh
|
|
2016
|
|
2 |
p. 217-242
|
artikel
|
| 23 |
Efficient execution of dynamically controllable simple temporal networks with uncertainty
|
Hunsberger, Luke
|
|
2015
|
|
2 |
p. 89-147
|
artikel
|
| 24 |
Efficiently building a parse tree from a regular expression
|
Dubé, Danny
|
|
2000
|
|
2 |
p. 121-144
|
artikel
|
| 25 |
Element distinctness on one-tape Turing machines: a complete solution
|
Ben-Amram, Amir M.
|
|
2003
|
|
2 |
p. 81-94
|
artikel
|
| 26 |
Embedding mappings and splittings with applications
|
Berghammer, Rudolf
|
|
2009
|
|
2 |
p. 77-110
|
artikel
|
| 27 |
Fairness of Actions in System Computations
|
Corradini, F.
|
|
2006
|
|
2 |
p. 73-130
|
artikel
|
| 28 |
Group weighted finite transducers
|
Ito, Masami
|
|
2001
|
|
2 |
p. 117-129
|
artikel
|
| 29 |
Infinitary rewriting: closure operators, equivalences and models
|
Kahrs, Stefan
|
|
2012
|
|
2 |
p. 123-156
|
artikel
|
| 30 |
Infinitary rewriting: meta-theory and convergence
|
Kahrs, Stefan
|
|
|
|
2 |
p. 91-121
|
artikel
|
| 31 |
Management of interval probabilistic data
|
Magnani, Matteo
|
|
2007
|
|
2 |
p. 93-130
|
artikel
|
| 32 |
Negotiation as concurrency primitive
|
Desel, Jörg
|
|
2018
|
|
2 |
p. 93-159
|
artikel
|
| 33 |
Nonatomic dual bakery algorithm with bounded tokens
|
Aravind, Alex A.
|
|
2011
|
|
2 |
p. 67-96
|
artikel
|
| 34 |
Nonterminal complexity of one-sided random context grammars
|
Meduna, Alexander
|
|
2012
|
|
2 |
p. 55-68
|
artikel
|
| 35 |
On-line graph coloring of $${\mathbb{P}_5}$$-free graphs
|
Cieślik, Iwona
|
|
2007
|
|
2 |
p. 79-91
|
artikel
|
| 36 |
On partial information retrieval: the unconstrained 100 prisoner problem
|
Lodato, Ivano
|
|
|
|
2 |
p. 179-208
|
artikel
|
| 37 |
On the observational theory of the CPS-calculus
|
Merro, Massimo
|
|
2009
|
|
2 |
p. 111-132
|
artikel
|
| 38 |
On weighted first-order logics with discounting
|
Mandrali, Eleni
|
|
2014
|
|
2 |
p. 61-106
|
artikel
|
| 39 |
Optimization in temporal qualitative constraint networks
|
Condotta, Jean-François
|
|
2015
|
|
2 |
p. 149-170
|
artikel
|
| 40 |
Parameterized linear temporal logics meet costs: still not costlier than LTL
|
Zimmermann, Martin
|
|
2016
|
|
2 |
p. 129-152
|
artikel
|
| 41 |
Preface for the special issue GandALF 2015
|
Esparza, Javier
|
|
2018
|
|
2 |
p. 89-90
|
artikel
|
| 42 |
Pushdown automata and constant height: decidability and bounds
|
Pighizzini, Giovanni
|
|
|
|
2 |
p. 123-144
|
artikel
|
| 43 |
Random walks for selected boolean implication and equivalence problems
|
Subramani, K.
|
|
2009
|
|
2 |
p. 155-168
|
artikel
|
| 44 |
Reachability analysis of reversal-bounded automata on series–parallel graphs
|
Dimitrova, Rayna
|
|
2016
|
|
2 |
p. 153-189
|
artikel
|
| 45 |
Refinement of fair action systems
|
Back, Ralph J.R.
|
|
1998
|
|
2 |
p. 131-165
|
artikel
|
| 46 |
Small universal accepting hybrid networks of evolutionary processors
|
Loos, Remco
|
|
2009
|
|
2 |
p. 133-146
|
artikel
|
| 47 |
Solving HPP and SAT by P Systems with Active Membranes and Separation Rules
|
Pan, Linqiang
|
|
2006
|
|
2 |
p. 131-145
|
artikel
|
| 48 |
Some results on the Collatz problem
|
Andrei, Ştefan
|
|
2000
|
|
2 |
p. 145-160
|
artikel
|
| 49 |
Special issue on temporal representation and reasoning (TIME’13)
|
Sanchez, Cesar
|
|
2016
|
|
2 |
p. 87-88
|
artikel
|
| 50 |
Sticky-free and overhang-free DNA languages
|
Kari, Lila
|
|
2003
|
|
2 |
p. 119-157
|
artikel
|
| 51 |
Stochastic cooperative distributed grammar systems and random graphs
|
Gašo, Ján
|
|
2003
|
|
2 |
p. 119-140
|
artikel
|
| 52 |
Testing for refinement in Circus
|
Cavalcanti, Ana
|
|
2011
|
|
2 |
p. 97-147
|
artikel
|
| 53 |
The additivity problem for functional dependencies in incomplete relations
|
Levene, Mark
|
|
1997
|
|
2 |
p. 135-149
|
artikel
|
| 54 |
The identity problem of finitely generated bi-ideals
|
Lorencs, A.
|
|
2012
|
|
2 |
p. 105-115
|
artikel
|
| 55 |
The time complexity of typechecking tree-walking tree transducers
|
Engelfriet, Joost
|
|
2008
|
|
2 |
p. 139-154
|
artikel
|
| 56 |
Timed tree automata with an application to temporal logic
|
La Torre, Salvatore
|
|
2001
|
|
2 |
p. 89-116
|
artikel
|
| 57 |
Towards a theory of consistency enforcement
|
Schewe, Klaus-Dieter
|
|
1999
|
|
2 |
p. 97-141
|
artikel
|
| 58 |
Tree-systems of morphisms
|
Dassow, Jürgen
|
|
2001
|
|
2 |
p. 131-153
|
artikel
|
| 59 |
Verification of asynchronous systems with an unspecified component
|
Abbasi, Rosa
|
|
2018
|
|
2 |
p. 161-203
|
artikel
|
| 60 |
Verification of population protocols
|
Esparza, Javier
|
|
2016
|
|
2 |
p. 191-215
|
artikel
|
| 61 |
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times
|
Levin, Asaf
|
|
|
|
2 |
p. 101-122
|
artikel
|
Tijdschrift beschrijving