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...

Full description

Saved in:
Bibliographic Details
Corporate Author: Latin American Symposium on Theoretical Informatics :Valparaíso, Chili
Other Authors: Baeza-Yates, Ricardo, 1961- (Publishing director), Goles, Eric, 1951-...., informaticien (Publishing director), Poblete, Patricio V. (Publishing director)
Format: Livre numérique
Language:Anglais
Published: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Series:Lecture notes in computer science 911
Subjects:
Online Access:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: 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
LEADER 05595nam a22004097a 4500
001 945381
008 110927q2000 xxe ||| |||| 00| 0 eng d
009 PPN155225480
020 |a 9783540492207 (PDF) 
041 0 |a eng 
082 |a 004 
111 2 |a Latin American Symposium on Theoretical Informatics  |n (02  |d  :1995  |c  :Valparaíso, Chili). 
245 1 0 |a LATIN '95 :  |b theoretical informatics : second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995 : proceedings   |c [edited by] Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete. 
260 |a Berlin [etc.] :  |b Springer. 
260 |a Cham :  |b Springer Nature,  |c [20..]. 
490 0 |a Lecture notes in computer science  |v 911  |x 1611-3349 
500 |a Archives Springer e-books (Licence nationale) 
500 |a Archives Springer e-books (Licence nationale) 
505 0 |a 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. 
506 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
506 |a Accès soumis à abonnement pour tout autre établissement 
506 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
520 |a 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, networks, symbolic computation, formal languages, data structures, and pattern matching. 
650 |a Informatique 
650 |a Algorithmes 
650 |a Analyse combinatoire 
650 |a Actes de congrès 
700 1 |a Baeza-Yates, Ricardo,  |d 1961-  |4 pbd 
700 1 |a Goles, Eric,  |d 1951-....,  |c informaticien.  |4 pbd 
700 1 |a Poblete, Patricio V.  |4 pbd 
776 0 |0 023282371  |t LATIN '95  |o theoretical informatics  |o second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995  |o proceedings  |f Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete, eds  |d 1995  |c Berlin  |n Springer  |p 1 vol. (IX-523 p.)  |s Lecture notes in computer science  |z 3-540-59175-3 
776 0 |t LATIN '95: Theoretical Informatics  |b Texte imprimé  |z 9783662188057 
856 4 |q PDF  |u https://doi.org/10.1007/3-540-59175-3  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-C8123QPM-2  |z Accès sur la plateforme Istex 
856 4 |5 452349901:747910995  |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-59175-3  |z Accès Université d'Orléans 
856 4 |5 180339901:750923865  |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-59175-3  |z Accès INSA CVL 
997 |0 945381  |1 Livre numérique  |a Ressource numérique  |b INSA  |b ENSA  |c 0/Bibliothèque numérique/  |c 1/Bibliothèque numérique/Autre ressource numérique/