| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A bi-criterion single-machine scheduling problem with learning considerations
|
Lee, Wen-Chiung
|
|
2004
|
|
4 |
p. 303-315
|
artikel
|
| 2 |
A core calculus for dynamic delta-oriented programming
|
Damiani, Ferruccio
|
|
2017
|
|
4 |
p. 269-307
|
artikel
|
| 3 |
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds
|
Worsch, Thomas
|
|
|
|
4 |
p. 451-462
|
artikel
|
| 4 |
A generalised theory of Interface Automata, component compatibility and error
|
Fendrich, Sascha
|
|
2018
|
|
4 |
p. 287-319
|
artikel
|
| 5 |
Algorithms for monitoring real-time properties
|
Basin, David
|
|
2017
|
|
4 |
p. 309-338
|
artikel
|
| 6 |
A Markovian queue with varying number of servers and applications to the performance comparison of HSDPA user equipment
|
Do, Tien Van
|
|
2011
|
|
4 |
p. 243-269
|
artikel
|
| 7 |
A new class of the smallest FSSP partial solutions for 1D rings of length n=2k-1
|
Umeo, Hiroshi
|
|
|
|
4 |
p. 427-450
|
artikel
|
| 8 |
An instruction set for reversible Turing machines
|
Morita, Kenichi
|
|
|
|
4 |
p. 377-396
|
artikel
|
| 9 |
An optimal algorithm for decomposing a window into maximal quadtree blocks
|
Proietti, Guido
|
|
1999
|
|
4 |
p. 257-266
|
artikel
|
| 10 |
A note on autodense related languages
|
Fan, Chen-Ming
|
|
2010
|
|
4 |
p. 209-219
|
artikel
|
| 11 |
Axiomatising timed automata
|
Lin, Huimin
|
|
2002
|
|
4 |
p. 277-305
|
artikel
|
| 12 |
Careful synchronization of partial deterministic finite automata
|
Shabana, Hanan
|
|
|
|
4 |
p. 479-504
|
artikel
|
| 13 |
Compositional schedulability analysis of real-time actor-based systems
|
Jaghoori, Mohammad Mahdi
|
|
2016
|
|
4 |
p. 343-378
|
artikel
|
| 14 |
Connectivity of workflow nets: the foundations of stepwise verification
|
Polyvyanyy, Artem
|
|
2011
|
|
4 |
p. 213-242
|
artikel
|
| 15 |
Correctness proof of a database replication protocol under the perspective of the I/O automaton model
|
Armendáriz-Iñigo, José Enrique
|
|
2009
|
|
4 |
p. 297-330
|
artikel
|
| 16 |
Depth-first search in directed planar graphs, revisited
|
Allender, Eric
|
|
|
|
4 |
p. 289-319
|
artikel
|
| 17 |
Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata
|
Nagy, Benedek
|
|
2013
|
|
4 |
p. 229-255
|
artikel
|
| 18 |
Disjunctivity and other properties of sets of pseudo-bordered words
|
Kari, Lila
|
|
2016
|
|
4 |
p. 379-398
|
artikel
|
| 19 |
Distances in random digital search trees
|
Aguech, Rafik
|
|
2006
|
|
4 |
p. 243-264
|
artikel
|
| 20 |
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms
|
Sheikhi, Farnaz
|
|
|
|
4 |
p. 335-359
|
artikel
|
| 21 |
Dynamic LL($k$) parsing
|
Rußmann, Arnd
|
|
1997
|
|
4 |
p. 267-289
|
artikel
|
| 22 |
Editorial 2023: changes and invariants
|
Fernau, Henning
|
|
|
|
4 |
p. 331-333
|
artikel
|
| 23 |
Efficient algorithms for the transformation between different types of binary decision diagrams
|
Savický, Petr
|
|
1997
|
|
4 |
p. 245-256
|
artikel
|
| 24 |
Efficiently solving the Bin Packing problem through bio-inspired mobility
|
Aman, Bogdan
|
|
2016
|
|
4 |
p. 435-445
|
artikel
|
| 25 |
Equivalence checking of Petri net models of programs using static and dynamic cut-points
|
Bandyopadhyay, Soumyadip
|
|
2018
|
|
4 |
p. 321-383
|
artikel
|
| 26 |
Exploration of k-edge-deficient temporal graphs
|
Erlebach, Thomas
|
|
|
|
4 |
p. 387-407
|
artikel
|
| 27 |
Factorisation of transition systems
|
Devillers, Raymond
|
|
2017
|
|
4 |
p. 339-362
|
artikel
|
| 28 |
First-order logics: some characterizations and closure properties
|
Choffrut, Christian
|
|
2012
|
|
4 |
p. 225-248
|
artikel
|
| 29 |
Guiding Craig interpolation with domain-specific abstractions
|
Leroux, Jérôme
|
|
2015
|
|
4 |
p. 387-424
|
artikel
|
| 30 |
Lamplighter groups and automata
|
Jain, Sanjay
|
|
|
|
4 |
p. 451-478
|
artikel
|
| 31 |
Lattices in machine learning: Complexity issues
|
Kourie, Derrick G.
|
|
1998
|
|
4 |
p. 269-292
|
artikel
|
| 32 |
Linearly bounded infinite graphs
|
Carayol, Arnaud
|
|
2006
|
|
4 |
p. 265-292
|
artikel
|
| 33 |
Locality based semantics for process algebras
|
Corradini, Flavio
|
|
1997
|
|
4 |
p. 291-324
|
artikel
|
| 34 |
L-reduction computation revisited
|
Fujioka, Kaoru
|
|
|
|
4 |
p. 409-426
|
artikel
|
| 35 |
Minimally adequate teacher synthesizes statechart diagrams
|
Mäkinen, Erkki
|
|
2002
|
|
4 |
p. 235-259
|
artikel
|
| 36 |
Modularity and expressibility for nets of relations
|
Rabinovich, Alexander
|
|
1998
|
|
4 |
p. 293-327
|
artikel
|
| 37 |
Natural language guided object retrieval in images
|
Ostovar, Ahmad
|
|
|
|
4 |
p. 243-261
|
artikel
|
| 38 |
Nilpotency and periodic points in non-uniform cellular automata
|
Kamilya, Supreeti
|
|
|
|
4 |
p. 319-333
|
artikel
|
| 39 |
On first-order runtime enforcement of branching-time properties
|
Aceto, Luca
|
|
|
|
4 |
p. 385-451
|
artikel
|
| 40 |
On Gurevich's theorem on sequential algorithms
|
Reisig, W.
|
|
2003
|
|
4 |
p. 273-305
|
artikel
|
| 41 |
On-line scheduling on a single machine: minimizing the total completion time
|
Fiat, Amos
|
|
1999
|
|
4 |
p. 287-293
|
artikel
|
| 42 |
On regular temporal logics with past
|
Dax, Christian
|
|
2010
|
|
4 |
p. 251-277
|
artikel
|
| 43 |
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances
|
Wolf, Petra
|
|
|
|
4 |
p. 505-519
|
artikel
|
| 44 |
On the decidability of the existence of polyhedral invariants in transition systems
|
Monniaux, David
|
|
2018
|
|
4 |
p. 385-389
|
artikel
|
| 45 |
On the hierarchy of distribution-sensitive properties for data structures
|
Elmasry, Amr
|
|
2013
|
|
4 |
p. 289-295
|
artikel
|
| 46 |
On the interdependence between shuffle and crossing-over operations
|
Mitrana, Victor
|
|
1997
|
|
4 |
p. 257-266
|
artikel
|
| 47 |
On the number of active states in finite automata
|
Bordihn, Henning
|
|
|
|
4 |
p. 301-318
|
artikel
|
| 48 |
On the size of partial derivatives and the word membership problem
|
Konstantinidis, Stavros
|
|
|
|
4 |
p. 357-375
|
artikel
|
| 49 |
On time computability of functions in one-way cellular automata
|
Buchholz, Thomas
|
|
1998
|
|
4 |
p. 329-252
|
artikel
|
| 50 |
On timed alternating simulation for concurrent timed games
|
Bozzelli, Laura
|
|
2012
|
|
4 |
p. 249-279
|
artikel
|
| 51 |
Operational complexity and pumping lemmas
|
Dassow, Jürgen
|
|
|
|
4 |
p. 337-355
|
artikel
|
| 52 |
Operational complexity and right linear grammars
|
Dassow, Jürgen
|
|
|
|
4 |
p. 281-299
|
artikel
|
| 53 |
Preface to Klaus-Jörn Lange Festschrift
|
Fernau, Henning
|
|
|
|
4 |
p. 285-287
|
artikel
|
| 54 |
Preface to Martin Kutrib Festschrift
|
Fernau, Henning
|
|
|
|
4 |
p. 241-242
|
artikel
|
| 55 |
Programmed grammars and their relation to the LBA problem
|
Bordihn, Henning
|
|
2006
|
|
4 |
p. 223-242
|
artikel
|
| 56 |
Program reversals for evolutions with non-uniform step costs
|
Walther, Andrea
|
|
2004
|
|
4 |
p. 235-263
|
artikel
|
| 57 |
Properties of graphs specified by a regular language
|
Diekert, Volker
|
|
|
|
4 |
p. 357-385
|
artikel
|
| 58 |
Quantum loop programs
|
Ying, Mingsheng
|
|
2010
|
|
4 |
p. 221-250
|
artikel
|
| 59 |
Query optimization in information integration
|
Chen, Dongfeng
|
|
2013
|
|
4 |
p. 257-287
|
artikel
|
| 60 |
Reasoning algebraically about loops
|
Back, R.J.R.
|
|
1999
|
|
4 |
p. 295-334
|
artikel
|
| 61 |
Reasoning with examples: propositional formulae and database dependencies
|
Khardon, Roni
|
|
1999
|
|
4 |
p. 267-286
|
artikel
|
| 62 |
Regular and context-free nominal traces
|
Degano, Pierpaolo
|
|
2016
|
|
4 |
p. 399-433
|
artikel
|
| 63 |
Relational structures model of concurrency
|
Janicki, Ryszard
|
|
2008
|
|
4 |
p. 279-320
|
artikel
|
| 64 |
Reoptimization of parameterized problems
|
Böckenhauer, Hans-Joachim
|
|
|
|
4 |
p. 427-450
|
artikel
|
| 65 |
Reversibility for stateless ordered RRWW-automata
|
Otto, Friedrich
|
|
|
|
4 |
p. 397-425
|
artikel
|
| 66 |
Reversible parallel communicating finite automata systems
|
Bordihn, Henning
|
|
|
|
4 |
p. 263-279
|
artikel
|
| 67 |
Semantics, calculi, and analysis for object-oriented specifications
|
Brucker, Achim D.
|
|
2009
|
|
4 |
p. 255-284
|
artikel
|
| 68 |
Special issue on Rich Models, EU-COST Action IC0901 Rich-Model Toolkit
|
Finkbeiner, Bernd
|
|
2016
|
|
4 |
p. 325-326
|
artikel
|
| 69 |
Specification transformers: a predicate transformer approach to composition
|
Charpentier, Michel
|
|
2004
|
|
4 |
p. 265-301
|
artikel
|
| 70 |
Stepwise development of fair distributed systems
|
Wabenhorst, Axel
|
|
2003
|
|
4 |
p. 233-271
|
artikel
|
| 71 |
Stochastic game logic
|
Baier, Christel
|
|
2012
|
|
4 |
p. 203-224
|
artikel
|
| 72 |
Symbolic automata for representing big code
|
Peleg, Hila
|
|
2015
|
|
4 |
p. 327-356
|
artikel
|
| 73 |
Synthesizing efficient systems in probabilistic environments
|
Essen, Christian von
|
|
2015
|
|
4 |
p. 425-457
|
artikel
|
| 74 |
Testing membership for timed automata
|
Lassaigne, Richard
|
|
|
|
4 |
p. 361-384
|
artikel
|
| 75 |
The descriptional power of queue automata of constant length
|
Jakobi, Sebastian
|
|
|
|
4 |
p. 335-356
|
artikel
|
| 76 |
The maximum gain of increasing the number of preemptions in multiprocessor scheduling
|
Klonowska, Kamilla
|
|
2009
|
|
4 |
p. 285-295
|
artikel
|
| 77 |
The regular languages of wire linear AC0
|
Cadilhac, Michaël
|
|
|
|
4 |
p. 321-336
|
artikel
|
| 78 |
The second step in characterizing a three-word code
|
Cao, Chunhua
|
|
|
|
4 |
p. 453-465
|
artikel
|
| 79 |
The variance of the height of digital search trees
|
Drmota, Michael
|
|
2002
|
|
4 |
p. 261-276
|
artikel
|
| 80 |
Verification of heap manipulating programs with ordered data by extended forest automata
|
Abdulla, Parosh Aziz
|
|
2015
|
|
4 |
p. 357-385
|
artikel
|
| 81 |
Weighted height of random trees
|
Broutin, N.
|
|
2008
|
|
4 |
p. 237-277
|
artikel
|
Tijdschrift beschrijving