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. Springer 1995 Lecture Notes in Computer Science ISBN 3-540-59175-3- 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
- R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan: Tight Bounds for Finding Degrees from the Adjacency Matrix. 49-59
- David A. Mix Barrington, Howard Straubing: Lower Bounds for Modular Counting by Circuits with Modular Gates. 60-71
- Stephen L. Bloom, Zoltán Ésik: Free Shuffle Algebras in Language Varieties (Extended Abstract). 99-111
- Phillip G. Bradford, Venkatesh Chopella, Gregory J. E. Rawlins: Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract). 112-130
- Stefan Brands: Off-Line Electronic Cash Based on Secret-Key Certificates. 131-166
- Maxime Crochemore, Wojciech Rytter: On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching. 220-229
- Jérôme Olivier Durand-Lose: Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata. 230-244
- David Fernández-Baca, Giora Slutzki: Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs. 257-271
- Esteban Feuerstein: Paging More Than One Page. 272-285
- Celina M. Herrera de Figueiredo, João Meidanis, Célia Picinin de Mello: On Edge-Colouring Indifference Graphs. 286-299
- Giulia Galbiati, Angelo Morzenti, Francesco Maffioli: On the Approximability of some Maximum Spanning Tree Problems. 300-310
- Shuhong Gao, Joachim von zur Gathen, Daniel Panario: Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). 311-322
- Laureano González-Vega: On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials. 332-345
- Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente: State Complexity of SBTA Languages. 346-357
- Christian Herzog: Pushdown Automata with Bounded Nondeterminism and Bounded Anbiguity. 358-370
- Ioan I. Macarie: Multihead Two-Way probabilistic Finite Automata. 371-385
- Maurice Margenstern: Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. 386-397
- Joao Meidanis, João C. Setubal: Multiple Alignment of Biological Sequences with Gap Flexibility. 411-426
- Christoph Meinel, Stephan Waack: Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems. 427-435
- Martin Mundhenk: On Monotonous Oracle Machines. 436-448
- B. John Oommen, Edward V. de St. Croix: On Using Learning Automata for Fast Graph Partitioning. 449-460
- Helmut Prodinger: Solution of a Problem of Yekutieli and Mandelbrot. 461-468
- Zsuzsanna Róka: Simulations Between Cellular Automata on Cayley Graphs. 483-493
- Farn Wang: A Temporal Logic for Real-Time Partial-Ordering with Named Transactions. 494-508
- Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano: A New Approach for Routing in Arrangement Graphs and its Performance Evaluation. 509-524
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team