Abstract is missing.
- Visibility Graphs of 2-Spiral Polygons (Extended Abstract)James Abello, Krishna Kumar. 1-15
- Random Generation of Colored TreesLaurent Alonso, René Schott. 16-35
- Space Filling Curves and Their Use in the Design of Geometric Data StructuresTetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer. 36-48
- Tight Bounds for Finding Degrees from the Adjacency MatrixR. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan. 49-59
- Lower Bounds for Modular Counting by Circuits with Modular GatesDavid A. Mix Barrington, Howard Straubing. 60-71
- On the Relation Betwen BDDs and FDDsBernd Becker, Rolf Drechsler, Ralph Werchner. 72-83
- On Dynamical Properties of Generalized Toggle AutomataFrançois Blanchard, Alejandro Maass. 84-98
- Free Shuffle Algebras in Language Varieties (Extended Abstract)Stephen L. Bloom, Zoltán Ésik. 99-111
- Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract)Phillip G. Bradford, Venkatesh Chopella, Gregory J. E. Rawlins. 112-130
- Off-Line Electronic Cash Based on Secret-Key CertificatesStefan Brands. 131-166
- Recognizable Sets of Numbers in Nonstandard BasesVéronique Bruyère, Georges Hansel. 167-179
- On Weak Growing Context-Sensitive GrammarsGerhard Buntrock, Gundula Niemann. 180-194
- Logic of Plotkin Continuous DomainBenjamín René Callejas Bedregal, Benedito Melo Acióly. 195-206
- (Probabilistic) Recurrence Realtions RevisitedShiva Chaudhuri, Devdatt P. Dubhashi. 207-219
- On Linear-Time Alphabet-Independent 2-Dimensional Pattern MatchingMaxime Crochemore, Wojciech Rytter. 220-229
- Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning AutomataJérôme Olivier Durand-Lose. 230-244
- Nearest Neighbour Graph Realizability is NP-hardPeter Eades, Sue Whitesides. 245-256
- Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar GraphsDavid Fernández-Baca, Giora Slutzki. 257-271
- Paging More Than One PageEsteban Feuerstein. 272-285
- On Edge-Colouring Indifference GraphsCelina M. Herrera de Figueiredo, Joao Meidanis, Célia Picinin de Mello. 286-299
- On the Approximability of some Maximum Spanning Tree ProblemsGiulia Galbiati, Angelo Morzenti, Francesco Maffioli. 300-310
- Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract)Shuhong Gao, Joachim von zur Gathen, Daniel Panario. 311-322
- Unbounded Search and Recursive Graph ProblemsWilliam I. Gasarch, Katia S. Guimarães. 323-331
- On the Complexity of Computing the Greatest Common Divisor of Several Univariate PolynomialsLaureano González-Vega. 332-345
- State Complexity of SBTA LanguagesJozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente. 346-357
- Pushdown Automata with Bounded Nondeterminism and Bounded AnbiguityChristian Herzog. 358-370
- Multihead Two-Way probabilistic Finite AutomataIoan I. Macarie. 371-385
- Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and UniversalityMaurice Margenstern. 386-397
- Cyclic Automata Networks on Finite GraphsMartín Matamala, Eric Goles Ch.. 398-410
- Multiple Alignment of Biological Sequences with Gap FlexibilityJoao Meidanis, João C. Setubal. 411-426
- Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility ProblemsChristoph Meinel, Stephan Waack. 427-435
- On Monotonous Oracle MachinesMartin Mundhenk. 436-448
- On Using Learning Automata for Fast Graph PartitioningB. John Oommen, Edward V. de St. Croix. 449-460
- Solution of a Problem of Yekutieli and MandelbrotHelmut Prodinger. 461-468
- A Rewrite Approach for Constraint Logic ProgrammingGilles Richard, Frédéric Saubion. 469-482
- Simulations Between Cellular Automata on Cayley GraphsZsuzsanna Róka. 483-493
- A Temporal Logic for Real-Time Partial-Ordering with Named TransactionsFarn Wang. 494-508
- A New Approach for Routing in Arrangement Graphs and its Performance EvaluationPeter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano. 509-524