LATIN'98: Theoretical Informatics

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Analysis of Rabin's polynomial irreducibility test
3. Altmetric Badge
   Chapter 2 A chip search problem on binary numbers
4. Altmetric Badge
   Chapter 3 Uniform service systems with k servers
5. Altmetric Badge
   Chapter 4 Faster non-linear parametric search with applications to optimization and dynamic geometry
6. Altmetric Badge
   Chapter 5 Super-state automata and rational trees
7. Altmetric Badge
   Chapter 6 An Eilenberg theorem for words on countable ordinals
8. Altmetric Badge
   Chapter 7 Maximal groups in free Burnside semigroups
9. Altmetric Badge
   Chapter 8 Positive varieties and infinite words
10. Altmetric Badge
    Chapter 9 Unfolding parametric automata
11. Altmetric Badge
    Chapter 10 Fundamental structures in Well-Structured infinite Transition Systems
12. Altmetric Badge
    Chapter 11 Shape reconstruction with Delaunay complex
13. Altmetric Badge
    Chapter 12 Bases for non-homogeneous polynomial C k splines on the sphere
14. Altmetric Badge
    Chapter 13 The splitting number of the 4-cube
15. Altmetric Badge
    Chapter 14 Short and smooth polygonal paths
16. Altmetric Badge
    Chapter 15 Quantum Algorithm for the Collision Problem
17. Altmetric Badge
    Chapter 16 Batch verification with applications to cryptography and checking
18. Altmetric Badge
    Chapter 17 Strength of two Data Encryption Standard implementations under timing attacks
19. Altmetric Badge
    Chapter 18 Spectral techniques in graph algorithms
20. Altmetric Badge
    Chapter 19 Colouring graphs whose chromatic number is almost their maximum degree
21. Altmetric Badge
    Chapter 20 Circuit covers in series-parallel mixed graphs
22. Altmetric Badge
    Chapter 21 A linear time algorithm to recognize clustered planar graphs and its parallelization
23. Altmetric Badge
    Chapter 22 A new characterization for parity graphs and a coloring problem with costs
24. Altmetric Badge
    Chapter 23 On the clique operator
25. Altmetric Badge
    Chapter 24 Dynamic packet routing on arrays with bounded buffers
26. Altmetric Badge
    Chapter 25 On-Line matching routing on trees
27. Altmetric Badge
    Chapter 26 Analyzing Glauber dynamics by comparison of Markov chains
28. Altmetric Badge
    Chapter 27 The CREW PRAM complexity of modular inversion
29. Altmetric Badge
    Chapter 28 Communication-efficient parallel multiway and approximate minimum cut computation
30. Altmetric Badge
    Chapter 29 The geometry of browsing
31. Altmetric Badge
    Chapter 30 Fast two-dimensional approximate pattern matching
32. Altmetric Badge
    Chapter 31 Improved approximate pattern matching on hypertext
33. Altmetric Badge
    Chapter 32 Solving equations in strings: On Makanin's algorithm
34. Altmetric Badge
    Chapter 33 Spelling approximate repeated or common motifs using a suffix tree