Volume 209, Number 1, January 2011

• 
  Juha Kontinen, Hannu Niemistö: Extensions of MSO and the monadic counting hierarchy. 1-19
• 
  Ou Wei, Arie Gurfinkel, Marsha Chechik: On the consistency, expressiveness, and precision of partial modeling formalisms. 20-47
• 
  Andrew Gacek, Dale Miller, Gopalan Nadathur: Nominal abstraction. 48-73
• 
  Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc: Optimality and competitiveness of exploring polygons by mobile robots. 74-88

Volume 209, Number 2, February 2011

• 
  Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe: The shield that never was: Societies with single-peaked preferences are more open to manipulation and control. 89-107
• 
  Razvan Diaconescu: Coinduction for preordered algebra. 108-117
• 
  Patrick Baillot, Paolo Coppola, Ugo Dal Lago: Light logics and optimal reduction: Completeness and complexity. 118-142
• 
  Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen: On the complexity of some colorful problems parameterized by treewidth. 143-153
• 
  Holger Hermanns, Augusto Parma, Roberto Segala, Björn Wachter, Lijun Zhang: Probabilistic Logical Characterization. 154-172
• 
  Armin Hemmerling: Observations on complete sets between linear time and polynomial time. 173-182
• 
  Hayato Takahashi: Algorithmic randomness and monotone complexity on product space. 183-197
• 
  Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt: On the expressiveness and decidability of higher-order process calculi. 198-226
• 
  Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema: Levels of undecidability in rewriting. 227-245

Volume 209, Number 3, March 2011

• 
  Carlos Martín-Vide, Bianca Truthe: 3rd International Conference on Language and Automata Theory and Applications (LATA 2009). 247

• 
  Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin: A classification of the expressive power of well-structured transition systems. 248-279
• 
  Raphaël Bailly, François Denis: Absolute convergence of rational series is semi-decidable. 280-295
• 
  Frank J. Balbach, Thomas Zeugmann: Teaching randomized learners with feedback. 296-319
• 
  Olaf Beyersdorff, Johannes Köbler, Sebastian Müller: Proof systems that take advice. 320-332
• 
  Beate Bollig: Larger lower bounds on the OBDD complexity of integer multiplication. 333-343
• 
  Henning Bordihn, Markus Holzer, Martin Kutrib: Decidability of operation problems for T0L languages and subclasses. 344-352
• 
  Janusz A. Brzozowski, Jeffrey Shallit, Zhi Xu: Decision problems for convex languages. 353-367
• 
  Jürgen Dassow, Victor Mitrana, Bianca Truthe: The role of evolutionary operations in accepting hybrid networks of evolutionary processors. 368-382
• 
  Cédric Dégremont, Nina Gierasimczuk: Finite identification from the viewpoint of epistemic update. 383-396
• 
  Kaoru Fujioka: Morphic characterizations of languages in Chomsky hierarchy with insertion and locality. 397-408
• 
  Olivier Gauwin, Joachim Niehren, Sophie Tison: Queries on Xml streams with bounded delay and concurrency. 409-442
• 
  Christian Glaßer, Aduri Pavan, Stephen D. Travers: The fault tolerance of NP-hard problems. 443-455
• 
  Markus Holzer, Martin Kutrib: Descriptional and computational complexity of finite automata - A survey. 456-470
• 
  Masami Ito, Peter Leupold, Florin Manea, Victor Mitrana: Bounded hairpin completion. 471-485
• 
  Florent Jacquemard, Francis Klay, Camille Vacher: Rigid tree automata and applications. 486-512
• 
  Sanjay Jain: Hypothesis spaces for learning. 513-527
• 
  Galina Jirásková, Giovanni Pighizzini: Optimal simulation of self-verifying automata by deterministic automata. 528-535
• 
  Ryuichi Matoba, Makoto Nakamura, Satoshi Tojo: Efficiency of the symmetry bias in grammar acquisition. 536-547
• 
  Neil Moore: Computational complexity of the problem of tree generation under fine-grained access control policies. 548-567
• 
  Elena V. Pribavkina, Emanuele Rodaro: Synchronizing automata with finitely many minimal synchronizing words. 568-579
• 
  Kai Salomaa: Limitations of lower bound methods for deterministic nested word automata. 580-589
• 
  Celine Scornavacca, Vincent Berry, Vincent Ranwez: Building species trees from larger parts of phylogenomic databases. 590-605
• 
  Sicco Verwer, Mathijs de Weerdt, Cees Witteveen: The efficiency of identifying timed automata and the power of clocks. 606-625

Volume 209, Number 4, April 2011

• 
  Lance Fortnow, John M. Hitchcock, Aduri Pavan, N. V. Vinodchandran, Fengming Wang: Extracting Kolmogorov complexity with applications to dimension zero-one laws. 627-636
• 
  Bas Ploeger, Wieger Wesselink, Tim A. C. Willemse: Verification of reactive systems via instantiation of Parameterised Boolean Equation Systems. 637-663
• 
  Albert Atserias, Elitza N. Maneva: Mean-payoff games and propositional proofs. 664-691
• 
  Maxime Crochemore, Dov M. Gabbay: Reactive automata. 692-704
• 
  Gad M. Landau, Avivit Levy, Ilan Newman: LCS approximation via embedding into locally non-repetitive strings. 705-716
• 
  Elena Czeizler, Eugen Czeizler, Lila Kari, Shinnosuke Seki: An extension of the Lyndon-Schützenberger result to pseudoperiodic words. 717-730
• 
  Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A black box for online approximate pattern matching. 731-736
• 
  Guy Feigenblat, Ely Porat, Ariel Shiftan: Exponential time improvement for min-wise based algorithms. 737-747
• 
  Lance Fortnow, Joshua A. Grochow: Complexity classes of equivalence problems revisited. 748-763

Volume 209, Number 5, May 2011

• 
  Julian Gutierrez, Julian C. Bradfield: Model-checking games for fixpoint logics with partial order models. 766-781
• 
  Wojciech Czerwinski, Sibylle B. Fröschle, Slawomir Lasota: Partially-commutative context-free processes: Expressibility and tractability. 782-798
• 
  Matthew Hague, C.-H. Luke Ong: A saturation method for the modal μ-calculus over pushdown systems. 799-821
• 
  Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten: Quantitative Kleene coalgebras. 822-849
• 
  Josée Desharnais, François Laviolette, Amélie Turgeon: A logical duality for underspecified probabilistic systems. 850-871

Volume 209, Number 6, June 2011

• 
  Abuzer Yakaryilmaz, A. C. Cem Say: Unbounded-error quantum computation with small space bounds. 873-892
• 
  Jeroen Ketema, Jakob Grue Simonsen: Infinitary Combinatory Reduction Systems. 893-926
• 
  Paul C. Attie, Rachid Guerraoui, Petr Kuznetsov, Nancy A. Lynch, Sergio Rajsbaum: The impossibility of boosting distributed service resilience. 927-950
• 
  Markus Lohrey: Leaf languages and string compression. 951-965
• 
  Vincent Danos, Thomas Ehrhard: Probabilistic coherence spaces as a model of higher-order probabilistic computation. 966-991
• 
  Xiaoyang Gu, Jack H. Lutz, Elvira Mayordomo: Curves that must be retraced. 992-1006

Volume 209, Number 7, July 2011

• 
  Ting Yi Chang: An ID-based multi-signer universal designated multi-verifier signature scheme. 1007-1015
• 
  Viliam Geffert, Giovanni Pighizzini: Two-way unary automata versus logarithmic space. 1016-1025
• 
  Christopher Lynch, Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tran: Automatic decidability and combinability. 1026-1047
• 
  Pedro Sánchez Terraf: Unprovability of the logical characterization of bisimulation. 1048-1056
• 
  Chi-Yuan Chan, Hung-I Yu, Wing-Kai Hon, Biing-Feng Wang: Faster query algorithms for the text fingerprinting problem. 1057-1069
• 
  Diego Arroyuelo, Gonzalo Navarro: Space-efficient construction of Lempel-Ziv compressed text indexes. 1070-1102
• 
  Hans L. Bodlaender, Arie M. C. A. Koster: Treewidth computations II. Lower bounds. 1103-1119
• 
  Robert Gray, António Malheiro, Stephen J. Pride: On properties not inherited by monoids from their Schützenberger groups. 1120-1134

Volume 209, Number 8, August 2011

• 
  Manuel Lameiras Campagnolo, Kerry Ojakian: A characterization of computable analysis on unbounded domains using differential equations. 1135-1159
• 
  Tomás Brázdil, Václav Brozek, Antonín Kucera, Jan Obdrzálek: Qualitative reachability in stochastic BPA games. 1160-1183
• 
  Boris Skoric, Chibuzo Obi, Evgeny A. Verbitskiy, Berry Schoenmakers: Sharp lower bounds on the extractable randomness from non-uniform sources. 1184-1196

Volume 209, Number 9, September 2011

• 
  Razvan Diaconescu: Structural induction in institutions. 1197-1222
• 
  Boris Ryabko, Daniil Ryabko: Constructing perfect steganographic systems. 1223-1230
• 
  Gilles Dowek, Ying Jiang: On the expressive power of schemes. 1231-1245
• 
  Matteo Pradella, Alessandra Cherubini, Stefano Crespi-Reghizzi: A unifying approach to picture grammars. 1246-1267

Volume 209, Number 10, October 2011

• 
  Iddo Tzameret: Algebraic proofs over noncommutative formulas. 1269-1292
• 
  John Case, Samuel E. Moelius: Optimal language learning from positive data. 1293-1311
• 
  Giorgi Japaridze: Introduction to clarithmetic I. 1312-1354

Volume 209, Number 11, November 2011

• 
  Ryszard Janicki, Dai Tri Man Le: Modelling concurrency with comtraces and generalized comtraces. 1355-1389
• 
  Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani: Characterizing contextual equivalence in calculi with passivation. 1390-1433

Volume 209, Number 12, December 2011

• 
  Valeria de Paiva, Brigitte Pientka: Intuitionistic Modal Logic and Applications (IMLA 2008). 1435-1436

• 
  Torben Braüner: Intuitionistic hybrid logic: Introduction and survey. 1437-1446
• 
  Didier Galmiche, Yakoub Salhi: Sequent calculi and decidability for intuitionistic hybrid logic. 1447-1463
• 
  Michael Mendler, Stephan Scheele: Cut-free Gentzen calculus for multimodal CK. 1465-1490
• 
  Kensuke Kojima, Atsushi Igarashi: Constructive linear-time temporal logic: Proof systems and Kripke semantics. 1491-1503
• 
  Claudio Hermida: A categorical outlook on relational modalities and simulations. 1505-1517
• 
  Sungwoo Park, Hyeonseung Im: A modal logic internalizing normal proofs. 1519-1535

last updated on Wed May 22 05:39:11 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page