Abstract is missing.
- Global Development via Local Observational Construction StepsMichel Bidoit, Donald Sannella, Andrzej Tarlecki. 1-24 [doi]
- Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar MapsAlan Gibbons, Paul Sant. 25-39 [doi]
- Applications of Finite AutomataJuhani Karhumäki. 40-58 [doi]
- Approximability of the Minimum Bisection Problem: An Algorithmic ChallengeMarek Karpinski. 59-67 [doi]
- Low Stretch Spanning TreesDavid Peleg. 68-80 [doi]
- On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and ApproximationsMaria I. Andreou, Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis. 81-92 [doi]
- Finite Domain Constraint Satisfaction Using Quantum ComputationOla Angelsmark, Vilhelm Dahllöf, Peter Jonsson. 93-103 [doi]
- Fast Algorithms with Algebraic Monge PropertiesWolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park. 104-117 [doi]
- Packing Edges in Random Regular GraphsMihalis Beis, William Duckworth, Michele Zito. 118-130 [doi]
- A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its ApplicationsBeate Bollig, Philipp Woelfel. 131-142 [doi]
- Matroid Intersections, Polymatroid Inequalities, and Related ProblemsEndre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan. 143-154 [doi]
- Accessibility in Automata on Scattered Linear OrderingsOlivier Carton. 155-164 [doi]
- On Infinite Terms Having a Decidable Monadic TheoryDidier Caucal. 165-176 [doi]
- A Chomsky-Like Hierarchy of Infinite GraphsDidier Caucal, Teodor Knapik. 177-187 [doi]
- Competitive Analysis of On-line Stream Merging AlgorithmsWun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong. 188-200 [doi]
- Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite ProgrammingAmin Coja-Oghlan. 201-211 [doi]
- On Word Equations in One VariableRobert Dabrowski, Wojciech Plandowski. 212-220 [doi]
- Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed BitsTodd Ebert, Wolfgang Merkle. 221-233 [doi]
- Two-Way Finite State Transducers with Nested PebblesJoost Engelfriet, Sebastian Maneth. 234-244 [doi]
- Optimal Non-preemptive Semi-online Scheduling on Two Related MachinesLeah Epstein, Lene M. Favrholdt. 245-256 [doi]
- More on Weighted Servers or FIFO is Better than LRULeah Epstein, Csanád Imreh, Rob van Stee. 257-268 [doi]
- On Maximizing the Throughput of Multiprocessor TasksAleksei V. Fishkin, Guochuan Zhang. 269-279 [doi]
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random StructuresAndreas Goerdt, Tomasz Jurdzinski. 280-291 [doi]
- Evolutive Tandem Repeats Using Hamming DistanceRichard Groult, Martine Léonard, Laurent Mouchard. 292-304 [doi]
- Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded TreewidthMohammad Taghi Hajiaghayi, Naomi Nishimura. 305-318 [doi]
- Computing Partial Information out of Intractable One - The First Digit of 2::: n ::: at Base 3 as an ExampleMika Hirvensalo, Juhani Karhumäki. 319-327 [doi]
- Algorithms for Computing Small NFAsLucian Ilie, Sheng Yu. 328-340 [doi]
- Space-Economical Construction of Index Structures for All Suffixes of a StringShunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa. 341-352 [doi]
- An Explicit Lower Bound of 5n - o(n) for Boolean CircuitsKazuo Iwama, Hiroki Morizumi. 353-364 [doi]
- Computational Complexity in the Hyperbolic PlaneChuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai. 365-374 [doi]
- On a Mereological System for Relational Software SpecificationsRyszard Janicki. 375-386 [doi]
- An Optimal Lower Bound for Resolution with 2-ConjunctionsJan Johannsen, N. S. Narayanaswamy. 387-398 [doi]
- Improved Parameterized Algorithms for Planar Dominating SetIyad A. Kanj, Ljubomir Perkovic. 399-410 [doi]
- Optimal Free Binary Decision Diagrams for Computation of EAR::n::Jan Kára, Daniel Král. 411-422 [doi]
- Unification Modulo Associativity and Idempotency Is NP-completeOndrej Klíma. 423-432 [doi]
- On the Complexity of Semantic Equivalences for Pushdown Automata and BPAAntonín Kucera, Richard Mayr. 433-445 [doi]
- An Improved Algorithm for the Membership Problem for Extended Regular ExpressionsOrna Kupferman, Sharon Zuhovitzky. 446-458 [doi]
- Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence AnalysisYaw-Ling Lin, Tao Jiang, Kun-Mao Chao. 459-470 [doi]
- Derivation of Rational Expressions with MultiplicitySylvain Lombardy, Jacques Sakarovitch. 471-482 [doi]
- Hypothesis-Founded Semantics for Datalog Programs with NegationYann Loyer, Nicolas Spyratos. 483-494 [doi]
- On the Problem of Scheduling Flows on Distributed NetworksThomas Lücking, Burkhard Monien, Manuel Rode. 495-505 [doi]
- Unit Testing for C88 ASL Architectural SpecificationsPatrícia D. L. Machado, Donald Sannella. 506-518 [doi]
- Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference SystemsFabio Martinelli. 519-531 [doi]
- The Complexity of Tree MulticoloringsDániel Marx. 532-542 [doi]
- On Verifying Fair Lossy Channel SystemsBenoît Masson, Ph. Schnoebelen. 543-555 [doi]
- Parameterized Counting ProblemsCatherine McCartin. 556-567 [doi]
- On the Construction of Effective Random SetsWolfgang Merkle, Nenad Mihailovic. 568-580 [doi]
- On the Structure of the Simulation Order of Proof SystemsJochen Messner. 581-592 [doi]
- Comorphism-Based Grothendieck LogicsTill Mossakowski. 593-604 [doi]
- Finite Test-Sets for Overlap-Free MorphismsGwénaël Richomme, Francis Wlazinski. 605-614 [doi]
- Characterizing Simpler Recognizable Sets of IntegersMichel Rigo. 615-624 [doi]
- Towards a Cardinality Theorem for Finite AutomataTill Tantau. 625-636 [doi]
- An Approximation Semantics for the Propositional Mu-CalculusRoger Villemaire. 637-650 [doi]