LATIN'98: Theoretical Informatics: Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings
Springer Science & Business Media, Mar 25, 1998 - Computers - 390 pages
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
algebraic algorithm analysis approximate automata automaton batch verifiers Boolean Burnside group circuit cover clause clique combinatorial Computer Science consider corresponding cost defined definition Delaunay complex denote dense set directed graph dynamic edges eigenvalues encryption enumerative sequence equation factor finite finite fields free Burnside function given graph G Hamming weight infinite input integer intersection interval irreducible key schedule 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 series-parallel solved space splitting number step subgraph subset suffix tree super-state techniques Theorem vertex vertices Voronoi cells w-semigroups weight words WSTS's