LATIN B

39 papers

YearTitle / Authors
1995(Probabilistic) Recurrence Realtions Revisited.
Shiva Chaudhuri, Devdatt P. Dubhashi
1995A New Approach for Routing in Arrangement Graphs and its Performance Evaluation.
Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano
1995A Rewrite Approach for Constraint Logic Programming.
Gilles Richard, Frédéric Saubion
1995A Temporal Logic for Real-Time Partial-Ordering with Named Transactions.
Farn Wang
1995Cyclic Automata Networks on Finite Graphs.
Martín Matamala, Eric Goles Ch.
1995Free Shuffle Algebras in Language Varieties (Extended Abstract).
Stephen L. Bloom, Zoltán Ésik
1995Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).
Shuhong Gao, Joachim von zur Gathen, Daniel Panario
1995LATIN '95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings
Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete
1995Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs.
David Fernández-Baca, Giora Slutzki
1995Logic of Plotkin Continuous Domain.
Benjamín René Callejas Bedregal, Benedito Melo Acióly
1995Lower Bounds for Modular Counting by Circuits with Modular Gates.
David A. Mix Barrington, Howard Straubing
1995Lower Bounds for the Matrix Chain Ordering Problem (Extended bstract).
Phillip G. Bradford, Venkatesh Choppella, Gregory J. E. Rawlins
1995Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems.
Christoph Meinel, Stephan Waack
1995Multihead Two-Way probabilistic Finite Automata.
Ioan I. Macarie
1995Multiple Alignment of Biological Sequences with Gap Flexibility.
Joao Meidanis, João C. Setubal
1995Nearest Neighbour Graph Realizability is NP-hard.
Peter Eades, Sue Whitesides
1995Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality.
Maurice Margenstern
1995Off-Line Electronic Cash Based on Secret-Key Certificates.
Stefan Brands
1995On Dynamical Properties of Generalized Toggle Automata.
François Blanchard, Alejandro Maass
1995On Edge-Colouring Indifference Graphs.
Celina M. H. de Figueiredo, João Meidanis, Célia Picinin de Mello
1995On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching.
Maxime Crochemore, Wojciech Rytter
1995On Monotonous Oracle Machines.
Martin Mundhenk
1995On Using Learning Automata for Fast Graph Partitioning.
B. John Oommen, Edward V. de St. Croix
1995On Weak Growing Context-Sensitive Grammars.
Gerhard Buntrock, Gundula Niemann
1995On the Approximability of some Maximum Spanning Tree Problems.
Giulia Galbiati, Angelo Morzenti, Francesco Maffioli
1995On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials.
Laureano González-Vega
1995On the Relation Betwen BDDs and FDDs.
Bernd Becker, Rolf Drechsler, Ralph Werchner
1995Paging More Than One Page.
Esteban Feuerstein
1995Pushdown Automata with Bounded Nondeterminism and Bounded Anbiguity.
Christian Herzog
1995Random Generation of Colored Trees.
Laurent Alonso, René Schott
1995Recognizable Sets of Numbers in Nonstandard Bases.
Véronique Bruyère, Georges Hansel
1995Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata.
Jérôme Olivier Durand-Lose
1995Simulations Between Cellular Automata on Cayley Graphs.
Zsuzsanna Róka
1995Solution of a Problem of Yekutieli and Mandelbrot.
Helmut Prodinger
1995Space Filling Curves and Their Use in the Design of Geometric Data Structures.
Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
1995State Complexity of SBTA Languages.
Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente
1995Tight Bounds for Finding Degrees from the Adjacency Matrix.
R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
1995Unbounded Search and Recursive Graph Problems.
William I. Gasarch, Katia S. Guimarães
1995Visibility Graphs of 2-Spiral Polygons (Extended Abstract).
James Abello, Krishna Kumar