| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Accepting splicing systems with permitting and forbidding words
|
Arroyo, Fernando
|
|
2012
|
|
1 |
p. 1-14
|
artikel
|
| 2 |
Accepting Zeno words: a way toward timed refinements
|
Bérard, Béatrice
|
|
2000
|
|
1 |
p. 45-81
|
artikel
|
| 3 |
A characterization of rational D0L power series
|
Honkala, Juha
|
|
2010
|
|
1 |
p. 19-24
|
artikel
|
| 4 |
A complexity tradeoff in ranking-function termination proofs
|
Ben-Amram, Amir M.
|
|
2008
|
|
1 |
p. 57-72
|
artikel
|
| 5 |
Adaptive sorting: an information theoretic perspective
|
Elmasry, Amr
|
|
2007
|
|
1 |
p. 33-42
|
artikel
|
| 6 |
A decision procedure for propositional projection temporal logic with infinite models
|
Duan, Zhenhua
|
|
2007
|
|
1 |
p. 43-78
|
artikel
|
| 7 |
A decision procedure for string constraints with string/integer conversion and flat regular constraints
|
Wu, Hao
|
|
|
|
1 |
p. 23-52
|
artikel
|
| 8 |
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information
|
Indermark, Klaus
|
|
2006
|
|
1 |
p. 1-43
|
artikel
|
| 9 |
Alternating complexity of counting first-order logic for the subword order
|
Kuske, Dietrich
|
|
|
|
1 |
p. 79-100
|
artikel
|
| 10 |
Analysis of dual-hop and multiple relays cooperative truncated ARQ with relay selection in WSNs
|
Li, Suoping
|
|
2015
|
|
1 |
p. 1-22
|
artikel
|
| 11 |
An axiomatization of graphs
|
Bozapalidis, Symeon
|
|
2004
|
|
1 |
p. 19-61
|
artikel
|
| 12 |
An efficient algorithm for finding ideal schedules
|
Coffman, Edward G.
|
|
2011
|
|
1 |
p. 1-14
|
artikel
|
| 13 |
A new bound for the D0L language equivalence problem
|
Honkala, Juha
|
|
2016
|
|
1 |
p. 81-88
|
artikel
|
| 14 |
An exact subexponential-time lattice algorithm for Asian options
|
Dai, Tian-Shyr
|
|
2006
|
|
1 |
p. 23-39
|
artikel
|
| 15 |
A queue based mutual exclusion algorithm
|
Aravind, Alex A.
|
|
2008
|
|
1 |
p. 73-86
|
artikel
|
| 16 |
Assume-admissible synthesis
|
Brenguier, Romain
|
|
2016
|
|
1 |
p. 41-83
|
artikel
|
| 17 |
A top-down proof procedure for generalized data dependencies
|
Coulondre, Stéphane
|
|
2003
|
|
1 |
p. 1-29
|
artikel
|
| 18 |
Automata-based verification of programs with tree updates
|
Habermehl, Peter
|
|
2009
|
|
1 |
p. 1-31
|
artikel
|
| 19 |
Avoidable binary patterns in partial words
|
Blanchet-Sadri, F.
|
|
2010
|
|
1 |
p. 25-41
|
artikel
|
| 20 |
Balancing m-ary search trees with compressions on the fringe
|
Gao, Shuyang
|
|
|
|
1 |
p. 53-66
|
artikel
|
| 21 |
Category-theoretic fibration as an abstraction mechanism in information systems
|
Colomb, Robert M.
|
|
2001
|
|
1 |
p. 1-44
|
artikel
|
| 22 |
Characterizations of $$k$$k-comma codes and $$k$$k-comma intercodes
|
Cao, Chunhua
|
|
2015
|
|
1 |
p. 23-33
|
artikel
|
| 23 |
Compositional Analysis of C/C++ Programs with VeriSoft
|
Dingel, Juergen
|
|
2006
|
|
1 |
p. 45-71
|
artikel
|
| 24 |
Configurable verification of timed automata with discrete variables
|
Tóth, Tamás
|
|
|
|
1 |
p. 1-35
|
artikel
|
| 25 |
Conjunctive query containment over trees using schema information
|
Björklund, Henrik
|
|
2016
|
|
1 |
p. 17-56
|
artikel
|
| 26 |
Correctness of dataflow and systolic algorithms using algebras of streams
|
Meinke, K.
|
|
2001
|
|
1 |
p. 45-88
|
artikel
|
| 27 |
Data structures for order-sensitive predicates in parallel nondeterministic systems
|
Ranjan, Desh
|
|
2000
|
|
1 |
p. 21-43
|
artikel
|
| 28 |
Delay and energy efficiency analysis of multicast cooperative ARQ over wireless networks
|
Li, Suo Ping
|
|
2014
|
|
1 |
p. 51-60
|
artikel
|
| 29 |
Discovering workflow nets of concurrent iterative processes
|
Tapia-Flores, Tonatiuh
|
|
|
|
1 |
p. 1-21
|
artikel
|
| 30 |
Efficient systematic clustering method for k-anonymization
|
Kabir, Md. Enamul
|
|
2011
|
|
1 |
p. 51-66
|
artikel
|
| 31 |
Enhanced prefetching and caching strategies for single- and multi-disk systems
|
Büttner, Markus
|
|
2005
|
|
1 |
p. 21-42
|
artikel
|
| 32 |
Equational weighted tree transformations
|
Bozapalidis, Symeon
|
|
2011
|
|
1 |
p. 29-52
|
artikel
|
| 33 |
Erratum to: Avoidable binary patterns in partial words
|
Blanchet-Sadri, F.
|
|
2011
|
|
1 |
p. 53-54
|
artikel
|
| 34 |
Exploiting colored Petri nets to decide on permutation admissibility
|
Bashirov, Rza
|
|
2008
|
|
1 |
p. 43-55
|
artikel
|
| 35 |
Exponentially decreasing number of operations in balanced trees
|
Jacobsen, Lars
|
|
2005
|
|
1 |
p. 57-78
|
artikel
|
| 36 |
Extending the accommodating function
|
Boyar, Joan
|
|
2003
|
|
1 |
p. 3-35
|
artikel
|
| 37 |
Finite automata with undirected state graphs
|
Kutrib, Martin
|
|
|
|
1 |
p. 163-181
|
artikel
|
| 38 |
Generating words lexicographically: An average-case analysis
|
Kemp, Rainer
|
|
1998
|
|
1 |
p. 17-89
|
artikel
|
| 39 |
Letter from the Managing Editor
|
Olderog, Ernst-Rüdiger
|
|
2014
|
|
1 |
p. 1-2
|
artikel
|
| 40 |
Minimal equational representations of recognizable tree languages
|
Fülöp, Zoltán
|
|
1997
|
|
1 |
p. 59-84
|
artikel
|
| 41 |
Minimum status of trees with a given degree sequence
|
Guo, Haiyan
|
|
|
|
1 |
p. 1-10
|
artikel
|
| 42 |
M/M/1 retrial queue with working vacations
|
Do, Tien Van
|
|
2009
|
|
1 |
p. 67-75
|
artikel
|
| 43 |
N-dimensional versus (N–1)-dimensional connectivity testing of first-order queries to semi-algebraic sets
|
Geerts, Floris
|
|
2005
|
|
1 |
p. 43-56
|
artikel
|
| 44 |
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications
|
Dolev, Shlomi
|
|
|
|
1 |
p. 83-100
|
artikel
|
| 45 |
Net-based control versus rational control The relation between ITNC vector languages and rational relations
|
Keesmaat, N. W.
|
|
1997
|
|
1 |
p. 23-57
|
artikel
|
| 46 |
Networks of evolutionary processors: the power of subregular filters
|
Dassow, Jürgen
|
|
2012
|
|
1 |
p. 41-75
|
artikel
|
| 47 |
New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries
|
Mitrana, Victor
|
|
2010
|
|
1 |
p. 43-50
|
artikel
|
| 48 |
n-PS-codes, 2-infix-outfix codes and some related classes of codes
|
Liu, Haiyan
|
|
|
|
1 |
p. 67-81
|
artikel
|
| 49 |
On decidability of LTL model checking for process rewrite systems
|
Bozzelli, Laura
|
|
2008
|
|
1 |
p. 1-28
|
artikel
|
| 50 |
On-line coloring and cliques covering for KKs,t-free graphs
|
Cieślik, Iwona
|
|
2005
|
|
1 |
p. 1-20
|
artikel
|
| 51 |
Online edge coloring of paths and trees with a fixed number of colors
|
Favrholdt, Lene M.
|
|
2016
|
|
1 |
p. 57-80
|
artikel
|
| 52 |
On path-controlled insertion–deletion systems
|
Fernau, Henning
|
|
2018
|
|
1 |
p. 35-59
|
artikel
|
| 53 |
On using data abstractions for model checking refinements
|
Derrick, John
|
|
2007
|
|
1 |
p. 41-71
|
artikel
|
| 54 |
Parallel LL parsing
|
Vagner, Ladislav
|
|
2007
|
|
1 |
p. 73
|
artikel
|
| 55 |
Parallel LL parsing
|
Vagner, Ladislav
|
|
2006
|
|
1 |
p. 1-21
|
artikel
|
| 56 |
Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
|
Baldan, Paolo
|
|
2018
|
|
1 |
p. 61-92
|
artikel
|
| 57 |
Picture deformation
|
Bozapalidis, Symeon
|
|
2007
|
|
1 |
p. 1-31
|
artikel
|
| 58 |
Pipelines: Modelling a software architecture through relations
|
Doberkat, Ernst-Erich
|
|
2003
|
|
1 |
p. 37-79
|
artikel
|
| 59 |
Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
|
Brihaye, Thomas
|
|
2016
|
|
1 |
p. 85-125
|
artikel
|
| 60 |
Publication in the Online First Directory
|
Springer-Verlag,
|
|
2003
|
|
1 |
p. 1
|
artikel
|
| 61 |
Random sprouts as internet models, and Pólya processes
|
Mahmoud, Hosam M.
|
|
2004
|
|
1 |
p. 1-18
|
artikel
|
| 62 |
Reactive bisimulation semantics for a process algebra with timeouts
|
van Glabbeek, Rob
|
|
|
|
1 |
p. 11-57
|
artikel
|
| 63 |
Reactive synthesis without regret
|
Hunter, Paul
|
|
2016
|
|
1 |
p. 3-39
|
artikel
|
| 64 |
Reactive synthesis without regret
|
Hunter, Paul
|
|
|
|
1 |
p. 3-39
|
artikel
|
| 65 |
Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
|
Bernardo, Marco
|
|
2014
|
|
1 |
p. 61-106
|
artikel
|
| 66 |
Revisiting causality, coalgebraically
|
Bruni, Roberto
|
|
2014
|
|
1 |
p. 5-33
|
artikel
|
| 67 |
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
|
Dolev, Shlomi
|
|
|
|
1 |
p. 59-78
|
artikel
|
| 68 |
Semantics analysis through elementary meanings
|
Kobuchi, Youichi
|
|
2000
|
|
1 |
p. 1-19
|
artikel
|
| 69 |
Semi-synchronous transductions
|
Bárány, Vince
|
|
2008
|
|
1 |
p. 29-42
|
artikel
|
| 70 |
Session-based concurrency, declaratively
|
Cano, Mauricio
|
|
|
|
1 |
p. 1-87
|
artikel
|
| 71 |
Some properties of the disjunctive languages contained in Q
|
Li, Zheng-Zhu
|
|
2010
|
|
1 |
p. 1-18
|
artikel
|
| 72 |
Sound reasoning in tock-CSP
|
Baxter, James
|
|
|
|
1 |
p. 125-162
|
artikel
|
| 73 |
Sparsification and subexponential approximation
|
Bonnet, Édouard
|
|
2016
|
|
1 |
p. 1-15
|
artikel
|
| 74 |
Special issue on “Combining Compositionality and Concurrency”: part 1
|
Glabbeek, Rob J. van
|
|
2014
|
|
1 |
p. 3-4
|
artikel
|
| 75 |
Special issue: Selected papers from the 26th International Conference on Concurrency Theory (CONCUR 2015)
|
Aceto, Luca
|
|
2017
|
|
1 |
p. 1-2
|
artikel
|
| 76 |
State complexity of deletion and bipolar deletion
|
Han, Yo-Sub
|
|
2015
|
|
1 |
p. 67-85
|
artikel
|
| 77 |
Step semantics of boolean nets
|
Kleijn, Jetty
|
|
2012
|
|
1 |
p. 15-39
|
artikel
|
| 78 |
Step traces
|
Janicki, Ryszard
|
|
2015
|
|
1 |
p. 35-65
|
artikel
|
| 79 |
Structured numbers
|
Blondel, Vincent D.
|
|
1998
|
|
1 |
p. 1-15
|
artikel
|
| 80 |
Symbolic checking of Fuzzy CTL on Fuzzy Program Graph
|
Ebrahimi, Masoud
|
|
2018
|
|
1 |
p. 1-33
|
artikel
|
| 81 |
Symmetry and partial order reduction techniques in model checking Rebeca
|
Jaghoori, Mohammad Mahdi
|
|
2009
|
|
1 |
p. 33-66
|
artikel
|
| 82 |
Synchronized regular expressions
|
Della Penna, Giuseppe
|
|
2003
|
|
1 |
p. 31-70
|
artikel
|
| 83 |
Synthesis and reengineering of persistent systems
|
Best, Eike
|
|
2014
|
|
1 |
p. 35-60
|
artikel
|
| 84 |
Termination of nondeterministic quantum programs
|
Li, Yangjia
|
|
2013
|
|
1 |
p. 1-24
|
artikel
|
| 85 |
The size of random bucket trees via urn models
|
Mahmoud, Hosam M.
|
|
2004
|
|
1 |
p. 63
|
artikel
|
| 86 |
Transformational design of real-time systems Part I: From requirements to program specifications
|
Schenke, Michael
|
|
1999
|
|
1 |
p. 1-65
|
artikel
|
| 87 |
Transformational design of real-time systems. Part II: From program specifications to programs
|
Schenke, Michael
|
|
1999
|
|
1 |
p. 67-96
|
artikel
|
| 88 |
Using transition set sequences to partition behaviors of petri nets
|
Wang, Yunhe
|
|
2011
|
|
1 |
p. 15-28
|
artikel
|
| 89 |
Visibly rational expressions
|
Bozzelli, Laura
|
|
2013
|
|
1 |
p. 25-49
|
artikel
|
| 90 |
Weakly independent database schemes
|
Wang, Ke
|
|
1997
|
|
1 |
p. 1-22
|
artikel
|
Tijdschrift beschrijving