## LATIN'98: Theoretical Informatics: Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, ProceedingsThis 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.

### Contents

Algorithms Complexity | 1 |

Uniform Service Systems with fc Servers | 23 |

Parallel Algorithms | 40 |

Copyright | |

20 other sections not shown

### Other editions - View all

LATIN '92: 1st Latin American Symposium on Theoretical Informatics, Sao ... Imre Simon No preview available - 1992 |

### Common terms and phrases

algebraic algorithm analysis approximate arithmetic assume automata automaton axis weight batch instance batch verifiers bipartite graph bound Burnside group checking circuit cover clique clustered colour classes combinatorial Computer Science consider contains corresponding cycle defined definition Delaunay complex denote dense set directed graph edges eigenvalues encryption enumerative sequence factor finite free Burnside function given graph G Hamming weight IEEE induced subgraph input integer intersection intersection graph key schedule Lecture Notes Lemma length linear maximum minimum minimum cut mixed graph modular exponentiation nodes Notes in Computer obtained optimal ordered semigroup packets pair parallel parameter parity graph path Petri nets planar graph points polygon polynomial problem Proc processor proof properties prove random rational tree result routing satisfies Sect series-parallel space splitting number step subgraph subset super-state syntactic techniques Theorem Theory transition vertex vertices Voronoi cells w-semigroups WSTS's