Volume 270,
Number 1-2,
January 2002
- Oliver Matz:
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures.
1-70
Electronic Edition (link) BibTeX
- Andrzej Pelc:
Searching games with errors - fifty years of coping with liars.
71-109
Electronic Edition (link) BibTeX
- Frank K. Hwang, Y. C. Yao, B. DasGupta:
Some permutation routing algorithms for low-dimensional hypercubes.
111-124
Electronic Edition (link) BibTeX
- Wil M. P. van der Aalst, Twan Basten:
Inheritance of workflows: an approach to tackling problems related to change.
125-203
Electronic Edition (link) BibTeX
- Ménard Bourgade:
Calculs sur les structures de langage dénombrable.
205-222
Electronic Edition (link) BibTeX
- J. Robin B. Cockett, Stephen Lack:
Restriction categories I: categories of partial maps.
223-259
Electronic Edition (link) BibTeX
- William Lenhart, Giuseppe Liotta:
The drawability problem for minimum weight triangulations.
261-286
Electronic Edition (link) BibTeX
- John Case, Sanjay Jain, Mandayam Suraj:
Control structures in hypothesis spaces: the influence on learning.
287-308
Electronic Edition (link) BibTeX
- Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Deterministic parallel backtrack search.
309-324
Electronic Edition (link) BibTeX
- Tak Wah Lam, Hing-Fung Ting, Kar-Keung To, Prudence W. H. Wong:
On-line load balancing of temporary tasks revisited.
325-340
Electronic Edition (link) BibTeX
- Luca Becchetti, Paola Bertolazzi, Carlo Gaibisso, Giorgio Gambosi:
On the design of efficient ATM routing schemes.
341-359
Electronic Edition (link) BibTeX
- Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Edge coloring of bipartite graphs with constraints.
361-399
Electronic Edition (link) BibTeX
- Francine Blanchet-Sadri, Robert A. Hegstrom:
Partial words and a theorem of Fine and Wilf revisited.
401-419
Electronic Edition (link) BibTeX
- Kikuo Fujimura:
Time-minimal paths amidst moving obstacles in three dimensions.
421-440
Electronic Edition (link) BibTeX
- Markus E. Nebel:
The stack-size of tries: a combinatorial study.
441-461
Electronic Edition (link) BibTeX
- Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Associative language descriptions.
463-491
Electronic Edition (link) BibTeX
- Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
Decision lists and related Boolean functions.
493-524
Electronic Edition (link) BibTeX
- Jean Mairesse, Laurent Vuillon:
Asymptotic behavior in a heap model with two pieces.
525-560
Electronic Edition (link) BibTeX
- Cécile Murat, Vangelis Th. Paschos:
A priori optimization for the probabilistic maximum independent set problem.
561-590
Electronic Edition (link) BibTeX
- Clifford Bergman, Giora Slutzki:
Computational complexity of some problems involving congruences on algebras.
591-608
Electronic Edition (link) BibTeX
- Dinesh P. Mehta, Vijay Raghavan:
Decision tree approximations of Boolean functions.
609-623
Electronic Edition (link) BibTeX
- Arnaud Durand, Miki Hermann, Laurent Juban:
On the complexity of recognizing the Hilbert basis of a linear diophantine system.
625-642
Electronic Edition (link) BibTeX
- Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
Approximating algebraic functions by means of rational ones.
643-657
Electronic Edition (link) BibTeX
- Jeffrey Shallit, Ming-wei Wang:
On two-sided infinite fixed points of morphisms.
659-675
Electronic Edition (link) BibTeX
- Antonín Kucera, Richard Mayr:
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time.
677-700
Electronic Edition (link) BibTeX
- Jürgen Dassow, Victor Mitrana, Arto Salomaa:
Operations and language generating devices suggested by the genome evolution.
701-738
Electronic Edition (link) BibTeX
- Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang:
Probabilistic rebound Turing machines.
739-760
Electronic Edition (link) BibTeX
- Georg Gottlob, Nicola Leone, Francesco Scarcello:
Computing LOGCFL certificates.
761-777
Electronic Edition (link) BibTeX
- Carlos Martín-Vide, Gheorghe Paun, Grzegorz Rozenberg:
Membrane systems with carriers.
779-796
Electronic Edition (link) BibTeX
- Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai:
Constructible functions in cellular automata and their applications to hierarchy results.
797-809
Electronic Edition (link) BibTeX
- Costas Busch, Neophytos Demetriou, Maurice Herlihy, Marios Mavronicolas:
Threshold counters with increments and decrements.
811-826
Electronic Edition (link) BibTeX
- Eric Goles Ch., Michel Morvan, Ha Duong Phan:
The structure of a linear chip firing game and related models.
827-841
Electronic Edition (link) BibTeX
- Jens Stoye, Dan Gusfield:
Simple and flexible detection of contiguous repeats using a suffix tree.
843-856
Electronic Edition (link) BibTeX
- J. W. Sander, Robert Tijdeman:
The rectangle complexity of functions on two-dimensional lattices.
857-863
Electronic Edition (link) BibTeX
- András Pluhár:
The accelerated k-in-a-row game.
865-875
Electronic Edition (link) BibTeX
- Ferdinando Cicalese, Daniele Mundici, Ugo Vaccaro:
Least adaptive optimal search with unreliable tests.
877-893
Electronic Edition (link) BibTeX
- Gary William Flake, Eric B. Baum:
Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants".
895-911
Electronic Edition (link) BibTeX
- Michael Drmota:
The Variance of the height of binary search trees.
913-919
Electronic Edition (link) BibTeX
- Shigeki Akiyama, Attila Pethö:
On canonical number systems.
921-933
Electronic Edition (link) BibTeX
- Doris Fiebig, Ulf-Rainer Fiebig:
Compact factors of countable state Markov shifts.
935-946
Electronic Edition (link) BibTeX
- Verónica Becher, Santiago Figueira:
An example of a computable absolutely normal number.
947-958
Electronic Edition (link) BibTeX
- Sigrid Ewert, Andries P. J. van der Walt:
A pumping lemma for random permitting context languages.
959-967
Electronic Edition (link) BibTeX
- Changwook Kim:
Two undecidability results for chain code picture languages.
969-976
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:24:42 2009
by Michael Ley (ley@uni-trier.de)
