Coverart for item
The Resource LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings, edited by Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete, (electronic resource)

LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings, edited by Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete, (electronic resource)

Label
LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings
Title
LATIN '95: Theoretical Informatics
Title remainder
Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings
Statement of responsibility
edited by Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete
Creator
Contributor
Editor
Provider
Subject
Language
eng
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
Member of
http://library.link/vocab/creatorName
Baeza-Yates, Ricardo
Image bit depth
0
LC call number
QA75.5-76.95
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • Golès, E.
  • Poblete, Patricio V.
  • SpringerLink
Series statement
Lecture Notes in Computer Science,
Series volume
911
http://library.link/vocab/subjectName
  • Computer science
  • Computer software
  • Logic design
  • Combinatorics
  • Computer Science
  • Computation by Abstract Devices
  • Algorithm Analysis and Problem Complexity
  • Logics and Meanings of Programs
  • Combinatorics
Label
LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings, edited by Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete, (electronic resource)
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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
Dimensions
unknown
Extent
IX, 525 pp.
File format
multiple file formats
Form of item
electronic
Isbn
9783540492207
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-59175-3
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-49220-7
Label
LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 3–7, 1995 Proceedings, edited by Ricardo Baeza-Yates, Eric Goles, Patricio V. Poblete, (electronic resource)
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
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
Dimensions
unknown
Extent
IX, 525 pp.
File format
multiple file formats
Form of item
electronic
Isbn
9783540492207
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/3-540-59175-3
Other physical details
online resource.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(DE-He213)978-3-540-49220-7

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...