The Resource LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete
LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete
Resource Information
The item LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 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 highlevel 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
 Language
 eng
 Extent
 1 online resource (IX, 525 pages).
 Contents

 Visibility graphs of 2spiral 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
 Offline electronic cash based on secretkey certificates
 Recognizable sets of numbers in nonstandard bases
 On weak growing contextsensitive grammars
 Logic of plotkin continuous domain
 (Probabilistic) recurrence relations revisited
 On lineartime alphabetindependent 2dimensional pattern matching
 Reversible cellular automaton able to simulate any other reversible one using partitioning automata
 Nearest neighbour graph realizability is NPhard
 Lineartime algorithms for parametric minimum spanning tree problems on planar graphs
 Paging more than one page
 On edgecolouring 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 twoway probabilistic finite automata
 Nonerasing 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 realtime partialordering with named transactions
 A new approach for routing in arrangement graphs and its performance evaluation
 Isbn
 9783540492207
 Label
 LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings
 Title
 LATIN '95: Theoretical Informatics
 Title remainder
 Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings
 Statement of responsibility
 edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete
 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 highlevel 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
 Cataloging source
 Nz
 http://library.link/vocab/creatorName
 BaezaYates, R.
 Dewey number
 004.0151
 Image bit depth
 0
 Index
 no index present
 LC call number
 QA75.576.95
 Literary form
 non fiction
 Nature of contents
 dictionaries
 http://library.link/vocab/relatedWorkOrContributorName

 Golès, E
 Poblete, Patricio V
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 911
 http://library.link/vocab/subjectName

 Computer science
 Computer software
 Logic design
 Combinatorial analysis
 Combinatorial analysis
 Computer science
 Computer software
 Logic design
 Label
 LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete
 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 2spiral 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  Offline electronic cash based on secretkey certificates  Recognizable sets of numbers in nonstandard bases  On weak growing contextsensitive grammars  Logic of plotkin continuous domain  (Probabilistic) recurrence relations revisited  On lineartime alphabetindependent 2dimensional pattern matching  Reversible cellular automaton able to simulate any other reversible one using partitioning automata  Nearest neighbour graph realizability is NPhard  Lineartime algorithms for parametric minimum spanning tree problems on planar graphs  Paging more than one page  On edgecolouring 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 twoway probabilistic finite automata  Nonerasing 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 realtime partialordering with named transactions  A new approach for routing in arrangement graphs and its performance evaluation
 Control code
 858926382
 Dimensions
 unknown
 Extent
 1 online resource (IX, 525 pages).
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540492207
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540591753
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (OCoLC)858926382
 Label
 LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete
 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 2spiral 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  Offline electronic cash based on secretkey certificates  Recognizable sets of numbers in nonstandard bases  On weak growing contextsensitive grammars  Logic of plotkin continuous domain  (Probabilistic) recurrence relations revisited  On lineartime alphabetindependent 2dimensional pattern matching  Reversible cellular automaton able to simulate any other reversible one using partitioning automata  Nearest neighbour graph realizability is NPhard  Lineartime algorithms for parametric minimum spanning tree problems on planar graphs  Paging more than one page  On edgecolouring 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 twoway probabilistic finite automata  Nonerasing 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 realtime partialordering with named transactions  A new approach for routing in arrangement graphs and its performance evaluation
 Control code
 858926382
 Dimensions
 unknown
 Extent
 1 online resource (IX, 525 pages).
 File format
 multiple file formats
 Form of item
 online
 Isbn
 9783540492207
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/3540591753
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (OCoLC)858926382
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/LATIN95TheoreticalInformaticsSecondLatin/NE8evbCMiak/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/LATIN95TheoreticalInformaticsSecondLatin/NE8evbCMiak/">LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/LATIN95TheoreticalInformaticsSecondLatin/NE8evbCMiak/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/LATIN95TheoreticalInformaticsSecondLatin/NE8evbCMiak/">LATIN '95: Theoretical Informatics : Second Latin American Symposium Valparaíso, Chile, April 37, 1995 Proceedings, edited by Ricardo BaezaYates, Eric Goles, Patricio V. Poblete</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>