LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Esk, Uruguay, April 10-14, 2000 Proceedings

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Algorithmic Aspects of Regularity
3. Altmetric Badge
   Chapter 2 Small Maximal Matchings in Random Graphs
4. Altmetric Badge
   Chapter 3 Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs
5. Altmetric Badge
   Chapter 4 Analysis of Edge Deletion Processes on Faulty Random Regular Graphs
6. Altmetric Badge
   Chapter 5 Equivalent Conditions for Regularity  (Extended Abstract)
7. Altmetric Badge
   Chapter 6 Cube Packing
8. Altmetric Badge
   Chapter 7 Approximation Algorithms for Flexible Job Shop Problems
9. Altmetric Badge
   Chapter 8 Emerging Behavior as Binary Search Trees Are Symmetrically Updated
10. Altmetric Badge
    Chapter 9 The LCA Problem Revisited
11. Altmetric Badge
    Chapter 10 Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays
12. Altmetric Badge
    Chapter 11 Rank Inequalities for Packing Designs and Sparse Triple Systems
13. Altmetric Badge
    Chapter 12 The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs
14. Altmetric Badge
    Chapter 13 Graph Structure of the Web: A Survey
15. Altmetric Badge
    Chapter 14 Polynomial Time Recognition of Clique-Width ≤  3 Graphs
16. Altmetric Badge
    Chapter 15 On Dart-Free Perfectly Contractile Graphs Extended Abstract
17. Altmetric Badge
    Chapter 16 Edge Colouring Reduced Indifference Graphs
18. Altmetric Badge
    Chapter 17 Two Conjectures on the Chromatic Polynomial
19. Altmetric Badge
    Chapter 18 Finding Skew Partitions Efficiently
20. Altmetric Badge
    Chapter 19 On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract)
21. Altmetric Badge
    Chapter 20 Almost k-Wise Independence and Hard Boolean Functions
22. Altmetric Badge
    Chapter 21 Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function
23. Altmetric Badge
    Chapter 22 Multi-parameter Minimum Spanning Trees
24. Altmetric Badge
    Chapter 23 Linear Time Recognition of Optimal L-Restricted Prefix Codes
25. Altmetric Badge
    Chapter 24 Uniform Multi-hop All-to-All Optical Routings in Rings
26. Altmetric Badge
    Chapter 25 A Fully Dynamic Algorithm for Distributed Shortest Paths
27. Altmetric Badge
    Chapter 26 Integer Factorization and Discrete Logarithms
28. Altmetric Badge
    Chapter 27 Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key
29. Altmetric Badge
    Chapter 28 Quintic Reciprocity and Primality Test for Numbers of the Form $M~=~A5^{n} \pm ~\omega_{n}$
30. Altmetric Badge
    Chapter 29 Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
31. Altmetric Badge
    Chapter 30 Average-Case Analysis of Rectangle Packings
32. Altmetric Badge
    Chapter 31 Heights in Generalized Tries and PATRICIA Tries
33. Altmetric Badge
    Chapter 32 On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract
34. Altmetric Badge
    Chapter 33 Subresultants Revisited
35. Altmetric Badge
    Chapter 34 A Unifying Framework for the Analysis of a Class of Euclidean Algorithms
36. Altmetric Badge
    Chapter 35 Worst-Case Complexity of the Optimal LLL Algorithm
37. Altmetric Badge
    Chapter 36 Iteration Algebras Are Not Finitely Axiomatizable
38. Altmetric Badge
    Chapter 37 Undecidable Problems in Unreliable Computations
39. Altmetric Badge
    Chapter 38 Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups
40. Altmetric Badge
    Chapter 39 Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers
41. Altmetric Badge
    Chapter 40 Unambiguous Büchi Automata
42. Altmetric Badge
    Chapter 41 Linear Time Language Recognition on Cellular Automata with Restricted Communication
43. Altmetric Badge
    Chapter 42 From Semantics to Spatial Distribution
44. Altmetric Badge
    Chapter 43 On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics
45. Altmetric Badge
    Chapter 44 A Theory of Operational Equivalence for Interaction Nets
46. Altmetric Badge
    Chapter 45 Run Statistics for Geometrically Distributed Random Variables
47. Altmetric Badge
    Chapter 46 Generalized Covariances of Multi-dimensional Brownian Excursion Local Times
48. Altmetric Badge
    Chapter 47 Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs