Volume 379,
Numbers 1-2,
June 2007
Contributions
- Jan Friso Groote, Marc Voorhoeve:
Operational semantics for Petri net components.
1-19
Electronic Edition (link) BibTeX
- Giorgi Japaridze:
From truth to computability II.
20-52
Electronic Edition (link) BibTeX
- Manuel A. Martins:
Closure properties for the class of behavioral models.
53-83
Electronic Edition (link) BibTeX
- Max I. Kanovich, Jacqueline Vauzeilles:
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach).
84-119
Electronic Edition (link) BibTeX
- J. Raymundo Marcial-Romero, Martín Hötzel Escardó:
Semantics of a sequential language for exact real-number computation.
120-141
Electronic Edition (link) BibTeX
- Rohit Chadha, Luís Cruz-Filipe, Paulo Mateus, Amílcar Sernadas:
Reasoning about probabilistic sequential programs.
142-165
Electronic Edition (link) BibTeX
- Lionel Vaux:
The differential lambdamu-calculus.
166-209
Electronic Edition (link) BibTeX
- Razvan Diaconescu, Petros S. Stefaneas:
Ultraproducts and possible worlds semantics in institutions.
210-230
Electronic Edition (link) BibTeX
- Eugene Asarin, Gerardo Schneider, Sergio Yovine:
Algorithmic analysis of polygonal hybrid systems, part I: Reachability.
231-265
Electronic Edition (link) BibTeX
- Anuj Dawar, Stephan Kreutzer:
Generalising automaticity to modal properties of finite structures.
266-285
Electronic Edition (link) BibTeX
- Laura Bozzelli:
Complexity results on branching-time pushdown model checking.
286-297
Electronic Edition (link) BibTeX
- Sándor Vágvölgyi:
Losing recognizability.
298-304
Electronic Edition (link) BibTeX
Volume 379,
Number 3,
June 2007
Automata,
Languages and Programming Preface
Contributions
- Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan:
Degree distribution of the FKP network model.
306-316
Electronic Edition (link) BibTeX
- Vipul Bansal, Aseem Agrawal, Varun S. Malhotra:
Polynomial time algorithm for an optimal stable assignment with multiple partners.
317-328
Electronic Edition (link) BibTeX
- Jens Jägersküpper:
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization.
329-347
Electronic Edition (link) BibTeX
- Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung:
Decoding interleaved Reed-Solomon codes over noisy channels.
348-360
Electronic Edition (link) BibTeX
- Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data.
361-376
Electronic Edition (link) BibTeX
- Manuel Bodirsky, Clemens Gröpl, Mihyun Kang:
Generating labeled planar graphs uniformly at random.
377-386
Electronic Edition (link) BibTeX
- Alexander Hall, Steffen Hippler, Martin Skutella:
Multicommodity flows over time: Efficient algorithms and complexity.
387-404
Electronic Edition (link) BibTeX
- Anna Gál, Peter Bro Miltersen:
The cell probe complexity of succinct data structures.
405-417
Electronic Edition (link) BibTeX
- Yossi Matias, Ely Porat:
Efficient pebbling for list traversal synopses with application to program rollback.
418-436
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:25:11 2009
by Michael Ley (ley@uni-trier.de)
