LATIN'98: Theoretical Informatics: Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, ProceedingsClaudio L. Lucchesi, Arnaldo V. Moura This book constitutes the refereed proceedings of the Third Latin American Symposium on Theoretical Informatics, LATIN'98, held in Campinas, Brazil, in April 1998. The 28 revised full papers presented together with five invited surveys were carefully selected from a total of 53 submissions based on 160 referees' reports. The papers are organized in sections on algorithms and complexity; automata, transition systems and combinatorics on words; computational geometry and graph drawing; cryptography; graph theory and algorithms on graphs; packet routing; parallel algorithms; and pattern matching and browsing. |
Common terms and phrases
algebraic algorithm analysis approximate automata automaton batch verifiers Boolean Büchi automaton Burnside group circuit cover clause clique combinatorial Computer Science consider corresponding cost defined Delaunay complex denote dense set directed graph dynamic edges eigenvalues enumerative sequence equation factor finite finite fields free Burnside function given graph G Hamming weight infinite input integer intersection interval Lecture Notes Lemma length linear lower bound Markov chain matching maximum minimum cut mixed graph modular exponentiation nodes Notes in Computer obtained optimal ordered semigroup packets pair parallel parameter parity graph path pattern pebbles Petri nets planar graph points polynomial problem Proc processors Proof properties prove random recursive result routing satisfies Sect semigroup series-parallel solved space splitting number step subgraph subset suffix tree super-state Theorem vertex vertices Voronoi cells w₁-semigroup weight words WSTS's