LATIN '95 : theoretical informatics : second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995 : proceedings
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 t...
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
911 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • LATIN '95, theoretical informatics, second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, proceedings, Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete, eds, 1995, Berlin, Springer, 1 vol. (IX-523 p.), Lecture notes in computer science, 3-540-59175-3 • LATIN '95: Theoretical Informatics, Texte imprimé, 9783662188057 |
Taula de continguts:
- Visibility graphs of 2-spiral polygons (Extended abstract)
- 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 extended abstract
- 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 modularcommunication 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.