Visibility Graphs of 2-Spiral Polygons /
James Abello, Krishna Kumar
Random Generation of Colored Trees /
Space Filling Curves and Their Use in the Design of Geometric
Data Structures /
Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
Tight Bounds for Finding Degrees from the Adjacency Matrix /
R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
Lower Bounds for Modular Counting by Circuits with Modalar Gates /
David Mix Barrington, Howard Straubing
On the Relation Between BDDs and FDDs /
Bernd Beeker, Rolf Drechsler, Ralph Werchner
On Dynamical Properties of Generalized Toggle Automata /
F. Blanchard, Alejandro Maass
Free Shuffle Algebras in Language Varieties /
Stephen L. Bloom, Zolts
Lower Bounds for the Matriz Chain Ordering Problem /
Phillip G. Bradford, Venkatesh Choppella, Gregory J.E. Rawlins
Off-Line Electronic Cash Based on Secret-Key Certificates /
Stefan Brands
Recognizable Sets of Numbers in Nonstandard Bases /
V6ronique Bruy6re, Georges Hansel
On Weak Growing Context-Sensitive Grammars /
Gerhard Buntrock, Gundula Niemann
Logic of Plotkin Continuous Domain /
Benjamin R. Callejas Bedregal, Benedito Melo Acióly
(Probabilistie) Recurrence Relations Revisited /
Shiva Chaudhuri, Devdatt Dubhashi
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching /
Maxime Croehemore, Wojciech Rytter
Reversible Cellular Automaton Able to Simulate Any Other Reversible
One Using Partitioning Automata /
J~r6me Durand-Lose
Nearest Neighbour Graph Realizability is NP-hard /
Peter Eades, Sue Whitesides
Linear-Time Algorithms for Parametric Minimum Spanning Tree
Problems on Planar Graphs /
David Fern~ndez-Baca, Giora Slutzki
Paging More Than One Page /
Esteban Feuerstein
On Edge-Colouring Indifference Graphs /
Celina M. Herrera de Figueiredo, Joho Meidanis, Celia Picinin de Mello
On the Approximability of Some Maximum Spanning Tree Problems /
Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
Gauss Periods and Fast Exponentialiou in Finite Fields /
Shuhong Gao, Joachim von zur Gathen, Daniel Panario
Unbounded Search and Recursive Graph Problems /
William I. Gasarch, Katia S. Guimarges
On the Complexity of Computing the Greatest Common Divisor of Several
Univariate Polynomials /
Laureano Gonzs
State Complexity of S B T A Languages /
Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
Pushdown Automata with Bounded Nondeterminism
and Bounded Ambiguity /
Christian Herzog
Multihead Two- Way Probabilistic Finite Automata /
Ioan I. Macarie
Non-Erasing Turing Machines: a New Frontier Between a Decidable Halting
Problem and Universality /
Maurice Margenstern
Cyclic Automata Networks on Finite Graphs /
Martin Matamala, Eric Goles
Multiple Alignment of Biological Sequences with Gap Flexibility /
Joao Meidanis, Joao C. Setubal
Lower Bounds for the Modular Communication Complexity of Various
Graph Accessibility Problems /
Christoph Meinel, Stephan Waack
On Monotonous Oracle Machines /
M. Mundhenk
On Using Learning Automata for Fast Graph Partitioning /
B. John Oommen, Edward V. de St. Croix
Solution of a Problem of Yekutieli and Mandelbrot /
Helmut Prodinger
A Rewrite Approach for Constraint Logic Programming /
Gilles Richard, Frederic Saubion
Simulations Between Cellular Automata on Cayley Graphs /
Zsuzsanna Róka
A Temporal Logic for Real-Time Partial-Ordering with Named Transactions /
Farn Wang
A New Approach for Routing in Arrangement Graphs and Its Performance Evaluation /
Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano
