Theoretical Computer Science, Volume 270
Volume 270, Number 1-2, January 2002
Oliver Matz: Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures. 1-70- Andrzej Pelc: Searching games with errors - fifty years of coping with liars. 71-109
- Frank K. Hwang, Y. C. Yao, Bhaskar DasGupta: Some permutation routing algorithms for low-dimensional hypercubes. 111-124
- Wil M. P. van der Aalst, Twan Basten: Inheritance of workflows: an approach to tackling problems related to change. 125-203
- Ménard Bourgade: Calculs sur les structures de langage dénombrable. 205-222
- William Lenhart, Giuseppe Liotta: The drawability problem for minimum weight triangulations. 261-286
- John Case, Sanjay Jain, Mandayam Suraj: Control structures in hypothesis spaces: the influence on learning. 287-308
- Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Deterministic parallel backtrack search. 309-324
- Tak Wah Lam, Hing-Fung Ting, Kar-Keung To, Prudence W. H. Wong: On-line load balancing of temporary tasks revisited. 325-340
- Luca Becchetti, Paola Bertolazzi, Carlo Gaibisso, Giorgio Gambosi: On the design of efficient ATM routing schemes. 341-359
- Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano: Edge coloring of bipartite graphs with constraints. 361-399
- Francine Blanchet-Sadri, Robert A. Hegstrom: Partial words and a theorem of Fine and Wilf revisited. 401-419
- Kikuo Fujimura: Time-minimal paths amidst moving obstacles in three dimensions. 421-440
- Markus E. Nebel: The stack-size of tries: a combinatorial study. 441-461
- Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro: Associative language descriptions. 463-491
- Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino: Decision lists and related Boolean functions. 493-524
- Cécile Murat, Vangelis Th. Paschos: A priori optimization for the probabilistic maximum independent set problem. 561-590
- Clifford Bergman, Giora Slutzki: Computational complexity of some problems involving congruences on algebras. 591-608
- Arnaud Durand, Miki Hermann, Laurent Juban: On the complexity of recognizing the Hilbert basis of a linear diophantine system. 625-642
- Elisa Pergola, Renzo Pinzani, Simone Rinaldi: Approximating algebraic functions by means of rational ones. 643-657
- Antonín Kucera, Richard Mayr: Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. 677-700
- Jürgen Dassow, Victor Mitrana, Arto Salomaa: Operations and language generating devices suggested by the genome evolution. 701-738
- Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai: Constructible functions in cellular automata and their applications to hierarchy results. 797-809
- Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas: Threshold counters with increments and decrements. 811-826
- Eric Goles Ch., Michel Morvan, Ha Duong Phan: The structure of a linear chip firing game and related models. 827-841
- Jens Stoye, Dan Gusfield: Simple and flexible detection of contiguous repeats using a suffix tree. 843-856
- J. W. Sander, Robert Tijdeman: The rectangle complexity of functions on two-dimensional lattices. 857-863
- András Pluhár: The accelerated k-in-a-row game. 865-875
- Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro: Least adaptive optimal search with unreliable tests. 877-893
- Gary William Flake, Eric B. Baum: Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants". 895-911
- Michael Drmota: The Variance of the height of binary search trees. 913-919
- Sigrid Ewert, Andries P. J. van der Walt: A pumping lemma for random permitting context languages. 959-967
- Changwook Kim: Two undecidability results for chain code picture languages. 969-976
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team