LATIN '95: Theoretical Informatics : Second Latin American Symposium, Valparaiso, Chile, April 3 - 7, 1995. Proceedings. 1st ed. 1995

種類:

電子ブック

責任表示:

edited by Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1995

著者名:

• Baeza-Yates, Ricardo.
• Goles, Eric.
• Poblete, Patricio V.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 911

ISBN:

9783540492207 [3540492208]    

注記:

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

ローカル注記:

学内専用E-BOOKS (local access only)