Skip to content

Latin '95 Theoretical Informatics: Second Latin American Symposium, Valparaiso, Chile, April 17-21, 1995. Proceedings

Spend $50 to get a free movie!

ISBN-10: 3540591753

ISBN-13: 9783540591757

Edition: 1995

Authors: Eric Goles, R. Baeza-Yates, G. Goos, J. Hartmanis, Jan Van Leeuwen

List price: $129.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


This volume constitutes the proceedings of the Second International Symposium, Latin American Theoretical Informatics, LATIN '95, held in Valparaiso, Chile in April 1995.The LATIN symposia are intended to be comprehensive events on the theory of computing; they provide a high-level forum for theoretical computer science research in Latin America and facilitate a strong and healthy interaction with the international community. The 38 papers presented in this volume were carefully selected from 68 submissions. Despite the intended broad coverage there are quite a number of papers devoted to computational graph theory; other topics strongly represented are complexity, automata theory,…    
Customers also bought

Book details

List price: $129.00
Copyright year: 1995
Publisher: Springer Berlin / Heidelberg
Publication date: 3/20/1995
Binding: Paperback
Pages: 530
Size: 5.98" wide x 9.02" long x 1.00" tall
Weight: 3.696
Language: English

Visibility Graphs of 2-Spiral Polygons
Random Generation of Colored Trees
Space Filling Curves and Their Use in the Design of Geometric Data Structures
Tight Bounds for Finding Degrees from the Adjacency Matrix
Lower Bounds for Modular Counting by Circuits with Modular Gates
On the Relation Between BDDs and FDDs
On Dynamical Properties of Generalized Toggle Automata
Free Shuffle Algebras in Language Varieties
Lower Bounds for the Matrix Chain Ordering Problem
Off-Line Electronic Cash Based on Secret-Key Certificates
Recognizable Sets of Numbers in Nonstandard Bases
On Weak Growing Context-Sensitive Grammars
Logic of Plotkin Continuous Domain
(Probabilistic) Recurrence Relations Revisited
On Linear-Time Alphabet-Independent 2-Dimensional Pattern Matching
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
Nearest Neighbour Graph Realizability is NP-hard
Linear-Time Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs
Paging More Than One Page
On Edge-Colouring Indifference Graphs
On the Approximability of Some Maximum Spanning Tree Problems
Gauss Periods and Fast Exponentiation in Finite Fields
Unbounded Search and Recursive Graph Problems
On the Complexity of Computing the Greatest Common Divisor of Several Univariate Polynomials
State Complexity of SBTA Languages
Pushdown Automata with Bounded Nondeterminism and Bounded Ambiguity
Multihead Two-Way Probabilistic Finite Automata
Non-Erasing Turing Machines: a New Frontier Between a Decidable Halting Problem and Universality
Cyclic Automata Networks on Finite Graphs
Multiple Alignment of Biological Sequences with Gap Flexibility
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems
On Monotonous Oracle Machines
On Using Learning Automata for Fast Graph Partitioning
Solution of a Problem of Yekutieli and Mandelbrot
A Rewrite Approach for Constraint Logic Programming
Simulations Between Cellular Automata on Cayley Graphs
A Temporal Logic for Real-Time Partial-Ordering with Named Transactions
A New Approach for Routing in Arrangement Graphs and Its Performance Evaluation
Author Index