## LATIN 2000: Theoretical Informatics: 4th Latin American Symposium Punta Del Esk, Uruguay, April 10-14, 2000 ProceedingsThis volume contains the proceedings of the LATIN 2000 International Conference (LatinAmerican Theoretical INformatics), to be held in Punta del Este, Uruguay,April 10-14, 2000. This is the fourth event in the series following Sao ˜ Paulo, Brazil (1992),Valparaíso, Chile (1995), and Campinas, Brazil (1998). LATIN has established itself as a fully refereed conference for theoretical computer science research in Latin America. It has also strengthened the ties between local and international scientific communities. We believe that this volume reflects the breadth and depth of this interaction. We received 87 submissions, from 178 different authors in 26 different countries. Eachpaperwasassignedtothreeprogramcommitteemembers.TheProgramCommittee selected 42 papers based on approximately 260 referee reports. In addition to these contributed presentations, the conference included six invited talks. The assistance of many organizations and individuals was essential for the success ofthismeeting.Wewouldliketothankallofoursponsorsandsupportingorganizations. Ricardo Baeza-Yates, Claudio Lucchesi, Arnaldo Moura, and Imre Simon provided - sightful advice and shared with us their experiences as organizers of previous LATIN meetings. Joaquín Goyoaga and Patricia Corbo helped in the earliest stages of the - ganization in various ways, including finding Uruguayan sources of financial support. SeCIU(ServicioCentraldeInformatica ´ Universitario,UniversidaddelaRepublica) ´ p- vided us with the necessary communication infrastructure. The meeting of the program committee was hosted by the Instituto de Matematica ´ e Estat stica, í Universidade de Sao ˜ Paulo, which also provided us with the Intranet site for discussions among PC members. |

### What people are saying - Write a review

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

### Contents

I | 1 |

II | 18 |

III | 28 |

IV | 38 |

V | 48 |

VI | 58 |

VII | 68 |

VIII | 78 |

XXIX | 258 |

XXX | 259 |

XXXI | 269 |

XXXII | 280 |

XXXIII | 292 |

XXXIV | 298 |

XXXVI | 308 |

XXXVII | 318 |

### Other editions - View all

### Common terms and phrases

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