Volume 379, Numbers 1-2, June 2007

• 
  Jan Friso Groote, Marc Voorhoeve: Operational semantics for Petri net components. 1-19
• 
  Giorgi Japaridze: From truth to computability II. 20-52
• 
  Manuel A. Martins: Closure properties for the class of behavioral models. 53-83
• 
  Max I. Kanovich, Jacqueline Vauzeilles: Strong planning under uncertainty in domains with numerous but identical elements (a generic approach). 84-119
• 
  José Raymundo Marcial-Romero, Martín Hötzel Escardó: Semantics of a sequential language for exact real-number computation. 120-141
• 
  Rohit Chadha, Luís Cruz-Filipe, Paulo Mateus, Amílcar Sernadas: Reasoning about probabilistic sequential programs. 142-165
• 
  Lionel Vaux: The differential lambdamu-calculus. 166-209
• 
  Razvan Diaconescu, Petros S. Stefaneas: Ultraproducts and possible worlds semantics in institutions. 210-230
• 
  Eugene Asarin, Gerardo Schneider, Sergio Yovine: Algorithmic analysis of polygonal hybrid systems, part I: Reachability. 231-265
• 
  Anuj Dawar, Stephan Kreutzer: Generalising automaticity to modal properties of finite structures. 266-285
• 
  Laura Bozzelli: Complexity results on branching-time pushdown model checking. 286-297
• 
  Sándor Vágvölgyi: Losing recognizability. 298-304

Volume 379, Number 3, June 2007

• 
  Jos C. M. Baeten, Jan Karel Lenstra, Gerhard J. Woeginger: Preface. 305

• 
  Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan: Degree distribution of the FKP network model. 306-316
• 
  Vipul Bansal, Aseem Agrawal, Varun S. Malhotra: Polynomial time algorithm for an optimal stable assignment with multiple partners. 317-328
• 
  Jens Jägersküpper: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. 329-347
• 
  Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung: Decoding interleaved Reed-Solomon codes over noisy channels. 348-360
• 
  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
• 
  Manuel Bodirsky, Clemens Gröpl, Mihyun Kang: Generating labeled planar graphs uniformly at random. 377-386
• 
  Alexander Hall, Steffen Hippler, Martin Skutella: Multicommodity flows over time: Efficient algorithms and complexity. 387-404
• 
  Anna Gál, Peter Bro Miltersen: The cell probe complexity of succinct data structures. 405-417
• 
  Yossi Matias, Ely Porat: Efficient pebbling for list traversal synopses with application to program rollback. 418-436

last updated on Tue May 21 03:29:29 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page