## LATIN 2000: Theoretical Informatics: 4th Latin American Symposium Punta del Esk, Uruguay, April 10-14, 2000 ProceedingsGaston H. Gonnet, Daniel Panario, Alfredo Viola This book constitutes the refereed proceedings of the 4th International Conference, Latin American Theoretical Informatics, LATIN 2000, held in Punta del Est, Uruguay, in April 2000. The 42 revised papers presented were carefully reviewed and selected from a total of 87 submissions from 26 countries. Also included are abstracts or full papers of several invited talks. The papers are organized in topical sections on random structures and algorithms, complexity, computational number theory and cryptography, algebraic algorithms, computability, automata and formal languages, and logic and programming theory. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Random Structures and Algorithms | 15 |

Some Remarks on Sparsely Connected IsomorphismFree Labeled Graphs | 28 |

Equivalent Conditions for Regularity | 48 |

Copyright | |

26 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

2-factors algebra apply asymptotic automata automaton Berlin Heidelberg 2000 binary Boolean function cbal clique clique-width coefficients coloring combinatorial competitive ratio complexity Computer Science configuration Conjecture consider constant construction Corollary counter machines cubes dart-free decomposition defined definition degree deletion denote disk distribution division rule edges Euclidean Algorithm finite formula free SGA given Gonnet graph G hypergraphs independent indifference graph induced subgraph inequalities input integer iteration labeled length LLL algorithm LNCS log2 lower bound matrix maximal model checking node nodeset obtained online algorithm operations optimal packing pair Panario parameter perfect graphs perfectly contractile permutation polynomial portfolio problem proof properties prove random graphs reduced regularity lemma result satisfies secret sharing Section sequence solution sparse substitute Springer-Verlag Berlin Heidelberg Steiner triple systems step subgraph subresultants subset TCTLS Theorem Theory transducer tree update upper bound variables vector vertex vertices Viola Eds