Information and Computation, Volume 205

Volume 205, Number 1, January 2007

• Jan Chomicki, David Toman:
  Special Issue: TIME 2005. 1
  
• Stéphane Demri, Ranko Lazic, David Nowak:
  On the freeze quantifier in Constraint LTL: Decidability and complexity. 2-24
  
• Andreas Schäfer:
  Axiomatisation and decidability of multi-dimensional Duration Calculus. 25-64
  
• Kiyoung Yang, Cyrus Shahabi:
  An efficient k nearest neighbor search for multivariate time series. 65-98
  
• Carsten Lutz, Dirk Walther, Frank Wolter:
  Quantitative temporal logics over the reals: PSpace and below. 99-123
  

Volume 205, Number 2, February 2007

• Arend Rensink, Walter Vogler:
  Fair testing. 125-198
  
• Ahmed Bouajjani, Anca Muscholl, Tayssir Touili:
  Permutation rewriting and algorithmic verification. 199-224
  
• Hui Gao, Wim H. Hesselink:
  A general lock-free algorithm using compare-and-swap. 225-241
  
• Alexey V. Chernov, Marcus Hutter, Jürgen Schmidhuber:
  Algorithmic complexity bounds on future prediction errors. 242-261
  

Volume 205, Number 3, March 2007

• Anuj Dawar, Philippa Gardner, Giorgio Ghelli:
  Expressiveness and complexity of graph logic. 263-310
  
• Nicole Schweikardt:
  An Ehrenfeucht-Fraïssé game approach to collapse results in database theory. 311-379
  
• Stéphane Demri, Deepak D'Souza:
  An automata-theoretic approach to constraint LTL. 380-415
  

Volume 205, Number 4, April 2007

• Jürgen Giesl:
  RTA 2005. 417-418
  
• Delia Kesner, Stéphane Lengrand:
  Resource operators for lambda-calculus. 419-473
  
• Nao Hirokawa, Aart Middeldorp:
  Tyrolean termination tool: Techniques and features. 474-511
  
• Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
  On tree automata that certify termination of left-linear term rewriting systems. 512-534
  
• Nachum Dershowitz, E. Castedo Ellerman:
  Leanest quasi-orderings. 535-556
  
• Robert Nieuwenhuis, Albert Oliveras:
  Fast congruence closure and extensions. 557-580
  
• Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
  Intruder deduction for the equational theory of Abelian groups with distributive encryption. 581-623
  
• Thierry Boy de la Tour, Mnacho Echenim:
  Permutative rewriting and unification. 624-650
  

Volume 205, Number 5, May 2007

• Andrei A. Bulatov, Víctor Dalmau:
  Towards a dichotomy theorem for the counting constraint satisfaction problem. 651-678
  
• Christian Lavault, Jean-François Marckert, Vlady Ravelomanana:
  Quasi-optimal energy-efficient leader election algorithms in radio networks. 679-693
  
• John M. Hitchcock, Aduri Pavan:
  Comparing reductions to NP-complete sets. 694-706
  
• Alexander Rabinovich:
  Temporal logics with incommensurable distances are undecidable. 707-715
  
• Andreas Klein, Markus Wessler:
  Extended visual cryptography schemes. 716-732
  
• Paolo Baldan, Andrea Corradini, Ugo Montanari, Leila Ribeiro:
  Unfolding semantics of graph transformation. 733-782
  
• Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon:
  The perfectly synchronized round-based model of distributed computing. 783-815
  

Volume 205, Number 6, June 2007

• Kumar Neeraj Verma, Jean Goubault-Larrecq:
  Alternating two-way AC-tree automata. 817-869
  
• Alexander Rabinovich:
  On decidability of monadic logic of order over the naturals extended by monadic predicates. 870-889
  
• Pekka Kilpeläinen, Rauno Tuhkanen:
  One-unambiguity of regular expressions with numeric occurrence indicators. 890-916
  
• Maribel Fernández, Murdoch Gabbay:
  Nominal rewriting. 917-965
  

Volume 205, Number 7, July 2007

• John H. Reif, Sukhendu Chakraborty:
  Efficient and exact quantum compression. 967-981
  
• Murdoch Gabbay:
  A general mathematics of names. 982-1011
  
• Alberto Apostolico:
  Fast gapped variants for Lempel-Ziv-Welch compression. 1012-1026
  
• Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, Fuzhi Wang:
  Symbolic model checking for probabilistic timed automata. 1027-1077
  
• Iiro S. Honkala, Tero Laihonen:
  On identifying codes that are robust against edge changes. 1078-1095
  
• Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro:
  Rotation and lighting invariant template matching. 1096-1113
  

• Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern:
  Addendum to "Scalable secure storage when half the system is faulty" [Inform. Comput 174 (2)(2002) 203-213]. 1114-1116
  

Volume 205, Number 8, August 2007

• Nir Ailon, Noga Alon:
  Hardness of fully dense problems. 1117-1129
  
• Orna Grumberg, Martin Lange, Martin Leucker, Sharon Shoham:
  When not losing is better than winning: Abstraction and refinement for the full mu-calculus. 1130-1148
  
• Elena Fersman, Pavel Krcál, Paul Pettersson, Wang Yi:
  Task automata: Schedulability, decidability and undecidability. 1149-1172
  
• Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini:
  Complementing two-way finite automata. 1173-1187
  
• Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema:
  Generalizing DPLL and satisfiability for equalities. 1188-1211
  
• Markus Lohrey, Nicole Ondrusch:
  Inverse monoids: Decidability and complexity of algebraic questions. 1212-1234
  
• Silvia Crafa, Sabina Rossi:
  Controlling information release in the pi-calculus. 1235-1273
  
• Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub:
  Cluster computing and the power of edge recognition. 1274-1293
  

Volume 205, Number 9, September 2007

• Jason P. Bell, Teow Lim Goh:
  Exponential lower bounds for the number of words of uniform length avoiding a pattern. 1295-1306
  
• Stavros Konstantinidis:
  Computing the edit distance of a regular language. 1307-1316
  
• Xiaoyang Gu, Jack H. Lutz, Philippe Moser:
  Dimensions of Copeland-Erdös sequences. 1317-1333
  
• Nicoletta De Francesco, Luca Martini:
  Instruction-level security analysis for information flow in stack-based assembly languages. 1334-1370
  
• Luigi Liquori, Simona Ronchi Della Rocca:
  Intersection-types à la Church. 1371-1386
  
• Tomasz Jurdzinski, Krzysztof Lorys:
  Lower bound technique for length-reducing automata. 1387-1412
  
• Guo-Qiang Zhang:
  Mediating secure information flow policies. 1413-1425
  
• Rance Cleaveland, Gerald Lüttgen, V. Natarajan:
  Priority and abstraction in process algebra. 1426-1458
  
• Wojciech Rytter:
  The number of runs in a string. 1459-1469
  
• Roberto M. Amadio:
  A synchronous pi-calculus. 1470-1490
  

Volume 205, Number 10, October 2007

• Rocco De Nicola, Daniele Gorla, Rosario Pugliese:
  Basic observables for a calculus for global computing. 1491-1525
  
• Philippa Gardner, Cosimo Laneve, Lucian Wischik:
  Linear forwarders. 1526-1550
  
• Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan:
  Results on memory-limited U-shaped learning. 1551-1573
  

Volume 205, Number 11, November 2007

• Ruggero Lanotte, Simone Tini:
  Taylor approximation for hybrid systems. 1575-1607
  
• Yuan Feng, Runyao Duan, Zheng-Feng Ji, Mingsheng Ying:
  Probabilistic bisimulations for quantum processes. 1608-1639
  
• David Doty, Jack H. Lutz, Satyadev Nandakumar:
  Finite-state dimension and real arithmetic. 1640-1651
  
• Viliam Geffert:
  Magic numbers in the state hierarchy of finite automata. 1652-1670
  
• Sanjay Jain, Steffen Lange, Sandra Zilles:
  Some natural conditions on incremental learning. 1671-1684
  

Volume 205, Number 12, December 2007

• Michael Backes, Birgit Pfitzmann, Michael Waidner:
  The reactive simulatability (RSIM) framework for asynchronous systems. 1685-1720
  
• Amos Korman, David Peleg:
  Labeling schemes for weighted dynamic trees. 1721-1740
  
• Ralf Küsters, Thomas Wilke:
  Transducer-based analysis of cryptographic protocols. 1741-1776
  
• Sanjay Jain, Efim B. Kinber:
  Iterative learning from positive data and negative counterexamples. 1777-1805
  

Last update Sat May 26 06:22:07 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page