| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A complete classification of the expressiveness of interval logics of Allen’s relations: the general and the dense cases
|
Aceto, Luca
|
|
2015
|
|
3 |
p. 207-246
|
artikel
|
| 2 |
A decomposition theorem for finite persistent transition systems
|
Best, Eike
|
|
2009
|
|
3 |
p. 237-254
|
artikel
|
| 3 |
A deterministic parsing algorithm for ambiguous regular expressions
|
Borsotti, Angelo
|
|
|
|
3 |
p. 195-229
|
artikel
|
| 4 |
A distributed QoS-Aware multicast routing protocol
|
Layuan, Li
|
|
2003
|
|
3 |
p. 211-233
|
artikel
|
| 5 |
A generalized distribution model for random recursive trees
|
Shapiro, Alexander
|
|
1997
|
|
3 |
p. 211-216
|
artikel
|
| 6 |
Aggregation-based minimization of finite state automata
|
Björklund, Johanna
|
|
|
|
3 |
p. 177-194
|
artikel
|
| 7 |
Applying relation algebra and RelView to solve problems on orders and lattices
|
Berghammer, Rudolf
|
|
2008
|
|
3 |
p. 211-236
|
artikel
|
| 8 |
Associative composition of components with double-sided interfaces
|
Reisig, Wolfgang
|
|
2018
|
|
3 |
p. 229-253
|
artikel
|
| 9 |
Average-case complexity for the execution of recursive definitions on relational databases
|
Fernandez de la Vega, Wenceslas
|
|
1998
|
|
3 |
p. 211-243
|
artikel
|
| 10 |
Avoiding cross-bifix-free binary words
|
Bilotta, Stefano
|
|
2013
|
|
3 |
p. 157-173
|
artikel
|
| 11 |
“Backward” coinduction, Nash equilibrium and the rationality of escalation
|
Lescanne, Pierre
|
|
2012
|
|
3 |
p. 117-137
|
artikel
|
| 12 |
Big data interpolation using functional representation
|
Daltrophe, Hadassa
|
|
2016
|
|
3 |
p. 213-225
|
artikel
|
| 13 |
Characteristic bisimulation for higher-order session processes
|
Kouzapas, Dimitrios
|
|
2017
|
|
3 |
p. 271-341
|
artikel
|
| 14 |
Classifications of Dense Languages
|
Li, Zheng-Zhu
|
|
2006
|
|
3 |
p. 173-194
|
artikel
|
| 15 |
Comparing expressibility of normed BPA and normed BPP processes
|
Černá, Ivana
|
|
1999
|
|
3 |
p. 233-256
|
artikel
|
| 16 |
Conceptual classes and system classes in object databases
|
Locuratolo, Elvira
|
|
1998
|
|
3 |
p. 181-210
|
artikel
|
| 17 |
Conjunctive grammars and alternating pushdown automata
|
Aizikowitz, Tamar
|
|
2013
|
|
3 |
p. 175-197
|
artikel
|
| 18 |
Constrained polynomial zonotopes
|
Kochdumper, Niklas
|
|
|
|
3 |
p. 279-316
|
artikel
|
| 19 |
Context-free languages over infinite alphabets
|
Cheng, Edward Y.C.
|
|
1998
|
|
3 |
p. 245-267
|
artikel
|
| 20 |
Edsger W. Dijkstra – Acta Informatica and Marktoberdorf
|
Bauer, Friedrich L.
|
|
2003
|
|
3 |
p. 141-142
|
artikel
|
| 21 |
Extracting unsatisfiable cores for LTL via temporal resolution
|
Schuppan, Viktor
|
|
2015
|
|
3 |
p. 247-299
|
artikel
|
| 22 |
Fair sticker languages
|
Hoogeboom, Hendrik Jan
|
|
2000
|
|
3 |
p. 213-225
|
artikel
|
| 23 |
Fundamentals of control flow in workflows
|
Kiepuszewski, B.
|
|
2003
|
|
3 |
p. 143-209
|
artikel
|
| 24 |
Generalized contexts for reaction systems: definition and study of dynamic causalities
|
Barbuti, Roberto
|
|
2017
|
|
3 |
p. 227-267
|
artikel
|
| 25 |
Hardness of equivalence checking for composed finite-state systems
|
Sawa, Zdeněk
|
|
2009
|
|
3 |
p. 169-191
|
artikel
|
| 26 |
Instruction sequence processing operators
|
Bergstra, J. A.
|
|
2012
|
|
3 |
p. 139-172
|
artikel
|
| 27 |
Least common container of tree pattern queries and its applications
|
Wang, Junhu
|
|
2012
|
|
3 |
p. 173-202
|
artikel
|
| 28 |
Lifting non-finite axiomatizability results to extensions of process algebras
|
Aceto, Luca
|
|
2010
|
|
3 |
p. 147-177
|
artikel
|
| 29 |
Liveness of a mutex algorithm in a fair process algebra
|
Corradini, Flavio
|
|
2009
|
|
3 |
p. 209-235
|
artikel
|
| 30 |
LR error repair using the A* algorithm
|
Kim, Ik-Soon
|
|
2010
|
|
3 |
p. 179-207
|
artikel
|
| 31 |
MAT learners for tree series: an abstract data type and two realizations
|
Drewes, Frank
|
|
2011
|
|
3 |
p. 165-189
|
artikel
|
| 32 |
Metric temporal logic revisited
|
Reynolds, Mark
|
|
2015
|
|
3 |
p. 301-324
|
artikel
|
| 33 |
Multiparty session types as coherence proofs
|
Carbone, Marco
|
|
2016
|
|
3 |
p. 243-269
|
artikel
|
| 34 |
Nested antichains for WS1S
|
Fiedor, Tomáš
|
|
2019
|
|
3 |
p. 205-228
|
artikel
|
| 35 |
On deterministic sensing 5′→3′ Watson–Crick finite automata: a full hierarchy in 2detLIN
|
Nagy, Benedek
|
|
|
|
3 |
p. 153-175
|
artikel
|
| 36 |
One-sided random context grammars
|
Meduna, Alexander
|
|
2011
|
|
3 |
p. 149-163
|
artikel
|
| 37 |
One-write algorithms for multivalued regular and atomic registers
|
Chaudhuri, Soma
|
|
2000
|
|
3 |
p. 161-192
|
artikel
|
| 38 |
On the closure of pattern expressions languages under intersection with regular languages
|
Câmpeanu, Cezar
|
|
2009
|
|
3 |
p. 193-207
|
artikel
|
| 39 |
On the hardness of analyzing probabilistic programs
|
Kaminski, Benjamin Lucien
|
|
2018
|
|
3 |
p. 255-285
|
artikel
|
| 40 |
On the system of word equations xi1xi2…xim=yi1yi2…yin (i=1, 2, …) in a free monoid
|
Hakala, Ismo
|
|
1997
|
|
3 |
p. 217-230
|
artikel
|
| 41 |
On the undecidability and descriptional complexity of synchronized regular expressions
|
Xie, Jingnan
|
|
|
|
3 |
p. 257-278
|
artikel
|
| 42 |
Parallel PROFIT/COST algorithms through fast derandomization
|
Han, Yijie
|
|
1999
|
|
3 |
p. 215-232
|
artikel
|
| 43 |
Periods in Extensions of Words
|
Harju, Tero
|
|
2006
|
|
3 |
p. 165-171
|
artikel
|
| 44 |
Preference rankings in the face of uncertainty
|
Hesselink, Wim H.
|
|
2003
|
|
3 |
p. 211-231
|
artikel
|
| 45 |
Process algebra with action dependencies
|
Rensink, Arend
|
|
2001
|
|
3 |
p. 155-234
|
artikel
|
| 46 |
Providing view synchrony for group communication services
|
Lesley, N.
|
|
2003
|
|
3 |
p. 159-210
|
artikel
|
| 47 |
Reduced constants for simple cycle graph separation
|
Djidjev, Hristo N.
|
|
1997
|
|
3 |
p. 231-243
|
artikel
|
| 48 |
Refined typing to localize the impact of forced strictness on free theorems
|
Seidel, Daniel
|
|
2011
|
|
3 |
p. 191-211
|
artikel
|
| 49 |
Refinement verification of the lazy caching algorithm
|
Hesselink, Wim H.
|
|
2006
|
|
3 |
p. 195-222
|
artikel
|
| 50 |
Relational database constraints as counterexamples
|
Orman, Levent V.
|
|
1997
|
|
3 |
p. 167-189
|
artikel
|
| 51 |
Semantic foundations of 4NF in relational database design
|
Vincent, Millist W.
|
|
1999
|
|
3 |
p. 173-213
|
artikel
|
| 52 |
Simple chain automaton random number generator for IoT devices
|
Dömösi, Pál
|
|
|
|
3 |
p. 317-329
|
artikel
|
| 53 |
The Boolean closure of linear context-free languages
|
Kutrib, Martin
|
|
2008
|
|
3 |
p. 177-191
|
artikel
|
| 54 |
The class Steiner minimal tree problem: a lower bound and test problem generation
|
Yang, Boting
|
|
2000
|
|
3 |
p. 193-211
|
artikel
|
| 55 |
The complexity of counting models of linear-time temporal logic
|
Torfah, Hazem
|
|
2016
|
|
3 |
p. 191-212
|
artikel
|
| 56 |
Throughput analysis in wireless networks with multiple users and multiple channels
|
Arora, Amrinder
|
|
2006
|
|
3 |
p. 147-164
|
artikel
|
| 57 |
Toward a theory of program repair
|
Khaireddine, Besma
|
|
|
|
3 |
p. 209-255
|
artikel
|
| 58 |
Two-dimensional packing with conflicts
|
Epstein, Leah
|
|
2007
|
|
3 |
p. 155-175
|
artikel
|
| 59 |
Two-tier relaxed heaps
|
Elmasry, Amr
|
|
2008
|
|
3 |
p. 193-210
|
artikel
|
| 60 |
Using graph coloring in an algebraic compiler
|
Rus, Teodor
|
|
1997
|
|
3 |
p. 191-209
|
artikel
|
| 61 |
Verifying a simplification of mutual exclusion by Lycklama–Hadzilacos
|
Hesselink, Wim H.
|
|
2013
|
|
3 |
p. 199-228
|
artikel
|
| 62 |
Watson–Crick quantum finite automata
|
Ganguly, Debayan
|
|
|
|
3 |
p. 231-240
|
artikel
|
Tijdschrift beschrijving