2. LATIN 1995:
Valparaíso, Chile
Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete (Eds.):
LATIN '95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings.
Lecture Notes in Computer Science 911 Springer 1995, ISBN 3-540-59175-3 BibTeX
@proceedings{DBLP:conf/latin/1995,
editor = {Ricardo A. Baeza-Yates and
Eric Goles Ch. and
Patricio V. Poblete},
title = {LATIN '95: Theoretical Informatics, Second Latin American Symposium,
Valpara\'{\i}so, Chile, April 3-7, 1995, Proceedings},
booktitle = {LATIN},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {911},
year = {1995},
isbn = {3-540-59175-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- James Abello, Krishna Kumar:
Visibility Graphs of 2-Spiral Polygons (Extended Abstract).
1-15 BibTeX
- Laurent Alonso, René Schott:
Random Generation of Colored Trees.
16-35 BibTeX
- Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer:
Space Filling Curves and Their Use in the Design of Geometric Data Structures.
36-48 BibTeX
- R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan:
Tight Bounds for Finding Degrees from the Adjacency Matrix.
49-59 BibTeX
- David A. Mix Barrington, Howard Straubing:
Lower Bounds for Modular Counting by Circuits with Modular Gates.
60-71 BibTeX
- Bernd Becker, Rolf Drechsler, Ralph Werchner:
On the Relation Betwen BDDs and FDDs.
72-83 BibTeX
- François Blanchard, Alejandro Maass:
On Dynamical Properties of Generalized Toggle Automata.
84-98 BibTeX
- Stephen L. Bloom, Zoltán Ésik:
Free Shuffle Algebras in Language Varieties (Extended Abstract).
99-111 BibTeX
- Phillip G. Bradford, Venkatesh Chopella, Gregory J. E. Rawlins:
Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract).
112-130 BibTeX
- Stefan Brands:
Off-Line Electronic Cash Based on Secret-Key Certificates.
131-166 BibTeX
- Véronique Bruyère, Georges Hansel:
Recognizable Sets of Numbers in Nonstandard Bases.
167-179 BibTeX
- Gerhard Buntrock, Gundula Niemann:
On Weak Growing Context-Sensitive Grammars.
180-194 BibTeX
- Benjamín René Callejas Bedregal, Benedito Melo Acióly:
Logic of Plotkin Continuous Domain.
195-206 BibTeX
- Shiva Chaudhuri, Devdatt P. Dubhashi:
(Probabilistic) Recurrence Realtions Revisited.
207-219 BibTeX
- Maxime Crochemore, Wojciech Rytter:
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.
220-229 BibTeX
- Jérôme Olivier Durand-Lose:
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata.
230-244 BibTeX
- Peter Eades, Sue Whitesides:
Nearest Neighbour Graph Realizability is NP-hard.
245-256 BibTeX
- David Fernández-Baca, Giora Slutzki:
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.
257-271 BibTeX
- Esteban Feuerstein:
Paging More Than One Page.
272-285 BibTeX
- Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello:
On Edge-Colouring Indifference Graphs.
286-299 BibTeX
- Giulia Galbiati, Angelo Morzenti, Francesco Maffioli:
On the Approximability of some Maximum Spanning Tree Problems.
300-310 BibTeX
- Shuhong Gao, Joachim von zur Gathen, Daniel Panario:
Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).
311-322 BibTeX
- William I. Gasarch, Katia S. Guimarães:
Unbounded Search and Recursive Graph Problems.
323-331 BibTeX
- Laureano González-Vega:
On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials.
332-345 BibTeX
- Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
State Complexity of SBTA Languages.
346-357 BibTeX
- Christian Herzog:
Pushdown Automata with Bounded Nondeterminism and Bounded Anbiguity.
358-370 BibTeX
- Ioan I. Macarie:
Multihead Two-Way probabilistic Finite Automata.
371-385 BibTeX
- Maurice Margenstern:
Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality.
386-397 BibTeX
- Martín Matamala, Eric Goles Ch.:
Cyclic Automata Networks on Finite Graphs.
398-410 BibTeX
- Joao Meidanis, João C. Setubal:
Multiple Alignment of Biological Sequences with Gap Flexibility.
411-426 BibTeX
- Christoph Meinel, Stephan Waack:
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.
427-435 BibTeX
- Martin Mundhenk:
On Monotonous Oracle Machines.
436-448 BibTeX
- B. John Oommen, Edward V. de St. Croix:
On Using Learning Automata for Fast Graph Partitioning.
449-460 BibTeX
- Helmut Prodinger:
Solution of a Problem of Yekutieli and Mandelbrot.
461-468 BibTeX
- Gilles Richard, Frédéric Saubion:
A Rewrite Approach for Constraint Logic Programming.
469-482 BibTeX
- Zsuzsanna Róka:
Simulations Between Cellular Automata on Cayley Graphs.
483-493 BibTeX
- Farn Wang:
A Temporal Logic for Real-Time Partial-Ordering with Named Transactions.
494-508 BibTeX
- Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano:
A New Approach for Routing in Arrangement Graphs and its Performance Evaluation.
509-524 BibTeX
Copyright © Sat May 16 23:28:32 2009
by Michael Ley (ley@uni-trier.de)
