LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 3-7, 1995 Proceedings /

Saved in:
Bibliographic Details
Author / Creator:Baeza-Yates, R. (Ricardo)
Imprint:Berlin, Heidelberg : Springer Berlin Heidelberg, 1995.
Description:1 online resource (IX, 525 pages).
Language:English
Series:Lecture Notes in Computer Science, 0302-9743 ; 911
Lecture notes in computer science ; 911.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11080464
Hidden Bibliographic Details
Other authors / contributors:Golès, E.
Poblete, Patricio V.
ISBN:9783540492207
3540492208
3540492208
9783540591757
Summary: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.
Other form:Print version: 9783540591757
Standard no.:10.1007/3-540-59175-3

MARC

LEADER 00000cam a2200000Mi 4500
001 11080464
005 20170630045328.7
006 m o d
007 cr nn|008mamaa
008 121227s1995 gw o 000 0 eng
003 ICU
040 |a Nz  |b eng  |e pn  |c UV0  |d OCLCO  |d GW5XE  |d ITD  |d OCLCF  |d UA@  |d KIJ  |d VT2  |d DKDLA  |d NUI  |d OCLCQ 
019 |a 827360273 
020 |a 9783540492207  |q (electronic bk.) 
020 |a 3540492208  |q (electronic bk.) 
020 |z 3540492208 
020 |z 9783540591757 
024 7 |a 10.1007/3-540-59175-3  |2 doi 
035 |a (OCoLC)858926382  |z (OCoLC)827360273 
050 4 |a QA75.5-76.95 
072 7 |a UYZG  |2 bicssc 
072 7 |a COM037000  |2 bisacsh 
049 |a MAIN 
100 1 |a Baeza-Yates, R.  |q (Ricardo)  |0 http://id.loc.gov/authorities/names/n90721732  |1 http://viaf.org/viaf/44468294 
245 1 0 |a LATIN '95: Theoretical Informatics :  |b 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, Heidelberg :  |b Springer Berlin Heidelberg,  |c 1995. 
300 |a 1 online resource (IX, 525 pages). 
336 |a text  |b txt  |2 rdacontent  |0 http://id.loc.gov/vocabulary/contentTypes/txt 
337 |a computer  |b c  |2 rdamedia  |0 http://id.loc.gov/vocabulary/mediaTypes/c 
338 |a online resource  |b cr  |2 rdacarrier  |0 http://id.loc.gov/vocabulary/carriers/cr 
490 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 911 
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. 
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 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. 
650 0 |a Computer science.  |0 http://id.loc.gov/authorities/subjects/sh89003285 
650 0 |a Computer software.  |0 http://id.loc.gov/authorities/subjects/sh85029534 
650 0 |a Logic design.  |0 http://id.loc.gov/authorities/subjects/sh85078117 
650 0 |a Combinatorial analysis.  |0 http://id.loc.gov/authorities/subjects/sh85028802 
650 1 4 |a Computer Science. 
650 2 4 |a Computation by Abstract Devices. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Logics and Meanings of Programs. 
650 7 |a Combinatorial analysis.  |2 fast  |0 (OCoLC)fst00868961 
650 7 |a Computer science.  |2 fast  |0 (OCoLC)fst00872451 
650 7 |a Computer software.  |2 fast  |0 (OCoLC)fst00872527 
650 7 |a Logic design.  |2 fast  |0 (OCoLC)fst01002045 
655 4 |a Electronic books. 
700 1 |a Golès, E.  |0 http://id.loc.gov/authorities/names/n84135218  |1 http://viaf.org/viaf/92926403 
700 1 |a Poblete, Patricio V.  |0 http://id.loc.gov/authorities/names/n95024847  |1 http://viaf.org/viaf/166975872 
776 0 8 |i Print version:  |z 9783540591757 
830 0 |a Lecture notes in computer science ;  |v 911.  |x 0302-9743 
856 4 0 |u http://link.springer.com/10.1007/3-540-59175-3  |y SpringerLink 
903 |a HeVa 
929 |a eresource 
999 f f |i 0eb428f1-314d-5406-8bbb-43c81e438175  |s cfbe9a9c-bf88-54f0-a336-2eefa449c8f5 
928 |t Library of Congress classification  |a QA75.5-76.95  |l Online  |c UC-FullText  |u http://link.springer.com/10.1007/3-540-59175-3  |z SpringerLink  |g ebooks  |i 9890690