James Abello and K. Kumar, Visibility Graphs of 2-Spiral Polygons. [Bibtex]

L. Alonso and R. Schott, Random Generation of Colored Trees. [Bibtex]

T. Asano, Desh Ranjan, T. Roos, E. Welzl and P. Widmayer, Space Filling Curves and Their Use in the Design of Geometric Data Structures. [Bibtex]

R. Balasubramanian, V. Raman and G. Srinivasaraghavan, Tight Bounds for Finding Degrees from the Adjacency Matrix. [Bibtex]

David A. M. Barrington and Howard Straubing, Lower Bounds for Modular Counting by Circuits with Modular Gates. [Bibtex]

B. Becker, R. Drechsler and R. Werchner, On the Relation Between BDDs and FDDs. [Bibtex]

F. Blanchard and A. Maass, On Dynamical Properties of Generalized Toggle Automata. [Bibtex]

Stephen L. Bloom and Zoltán Ésik, Free Shuffle Algebras in Language Varieties. [Bibtex]

P. G. Bradford, V. Choppella and G. J. E. Rawlins, Lower Bounds for the Matrix Chain Ordering Problem. [Bibtex]

S. Brands, Off-Line Electronic Cash Based on Secret-Key Certificates. [Bibtex]

Véronique Brùyere and G. Hansel, Recognizable Sets of Numbers in Nonstandard Bases. [Bibtex]

G. Buntrock and G. Niemann, On Weak Growing Context-Sensitive Grammars. [Bibtex]

B. R. Callejas Bedregal and B. M. Acioly, Logic of {P}lotkin Continuous Domain. [Bibtex]

S. Chaudhuri and D. Dubhashi, (Probabilistic) Recurrence Relations Revisited. [Bibtex]

Maxime Crochemore and Wojciech Rytter, On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. [Bibtex]

J. O. Durand-Lose, Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata. [Bibtex]

P. Eades and S. Whitesides, Nearest Neighbor Graph Realizability is NP-hard. [Bibtex]

David Fernandez-Baca and G. Slutzki, Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. [Bibtex]

Esteban Feuerstein, Paging More Than one Page. [Bibtex]

C. M. H. de Figueiredo, J. Meidanis and C. P. de Mello, On Edge-Colouring Indifference Graphs. [Bibtex]

G. Galbiati, A. Morzenti and F. Maffioli, On the Approximability of Some Maximum Spanning Tree Problems. [Bibtex]

S. Gao, Joachim von zur Gathen and Daniel Panario, Gauss Periods and Fast Exponentiation in Finite Fields. [Bibtex]

Williams I. Gasarch and Katia. S. Guimarães, Unbounded Search and Recursive Graph Problems. [Bibtex]

L. Gonzalez-Vega, On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials. [Bibtex]

J. Gruska, A. Monti, M. Napoli and D. Parente, State Complexity of SBTA Languages. [Bibtex]

C. Herzog, Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity. [Bibtex]

I. I. Macarie, Multihead Two-Way Probabilistic Finite Automata. [Bibtex]

M. Margenstern, Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. [Bibtex]

Martín Matamala and Eric Goles, Cyclic Automata Networks on Finite Graphs. [Bibtex]

Joao Meidanis and J. C. Setubal, Multiple Alignment of Biological Sequences with Gap Flexibility. [Bibtex]

C. Meinel and S. Waack, Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. [Bibtex]

M. Mundhenk, On Monotonous Oracle Machines. [Bibtex]

B. J. Oommen and E. V. de St. Croix, On Using Learning Automata for Fast Graph Partitioning. [Bibtex]

Helmut Prodinger, Solution of a Problem of Yekutieli and Mandelbrot. [Bibtex]

G. Richard and F. Saubion, A Rewrite Approach for Constraint Logic Programming. [Bibtex]

Z. Roka, Simulations Between Cellular Automata on Cayley Graphs. [Bibtex]

F. Wang, A Temporal Logic for Real-Time Partial-Ordering with Named Transactions. [Bibtex]

P. M. Yamakawa, H. Ebara and H. Nakano, A New Approach for Routing in Arrangement Graphs and Its Performance Evaluation. [Bibtex]


[Home] [All LATIN Papers] [LATIN 1995]