↓ Skip to main content

LATIN 2008: Theoretical Informatics

Overview of attention for book
Cover of 'LATIN 2008: Theoretical Informatics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Profile of Tries
  3. Altmetric Badge
    Chapter 2 Random 2-XORSAT at the Satisfiability Threshold
  4. Altmetric Badge
    Chapter 3 On Dissemination Thresholds in Regular and Irregular Graph Classes
  5. Altmetric Badge
    Chapter 4 How to Complete a Doubling Metric
  6. Altmetric Badge
    Chapter 5 Sorting and Selection with Random Costs
  7. Altmetric Badge
    Chapter 6 Guided Search and a Faster Deterministic Algorithm for 3-SAT
  8. Altmetric Badge
    Chapter 7 Comparing and Aggregating Partially Resolved Trees
  9. Altmetric Badge
    Chapter 8 Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices
  10. Altmetric Badge
    Chapter 9 On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
  11. Altmetric Badge
    Chapter 10 Myhill-Nerode Theorem for Recognizable Tree Series Revisited
  12. Altmetric Badge
    Chapter 11 The View Selection Problem for Regular Path Queries
  13. Altmetric Badge
    Chapter 12 Optimal Higher Order Delaunay Triangulations of Polygons
  14. Altmetric Badge
    Chapter 13 Coloring Geometric Range Spaces
  15. Altmetric Badge
    Chapter 14 Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
  16. Altmetric Badge
    Chapter 15 Spanners of Complete k -Partite Geometric Graphs
  17. Altmetric Badge
    Chapter 16 Minimum Cost Homomorphisms to Reflexive Digraphs
  18. Altmetric Badge
    Chapter 17 On the Complexity of Reconstructing H-free Graphs from Their Star Systems
  19. Altmetric Badge
    Chapter 18 Optimization and Recognition for K 5 -minor Free Graphs in Linear Time
  20. Altmetric Badge
    Chapter 19 Bandwidth of Bipartite Permutation Graphs in Polynomial Time
  21. Altmetric Badge
    Chapter 20 The Online Transportation Problem: On the Exponential Boost of One Extra Server
  22. Altmetric Badge
    Chapter 21 Average Rate Speed Scaling
  23. Altmetric Badge
    Chapter 22 Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers
  24. Altmetric Badge
    Chapter 23 Maximizing the Minimum Load for Selfish Agents
  25. Altmetric Badge
    Chapter 24 Approximate Polynomial gcd: Small Degree and Small Height Perturbations
  26. Altmetric Badge
    Chapter 25 Pseudorandom Graphs from Elliptic Curves
  27. Altmetric Badge
    Chapter 26 Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
  28. Altmetric Badge
    Chapter 27 Sparse Approximate Solutions to Semidefinite Programs
  29. Altmetric Badge
    Chapter 28 On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
  30. Altmetric Badge
    Chapter 29 A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant
  31. Altmetric Badge
    Chapter 30 Competitive Cost Sharing with Economies of Scale
  32. Altmetric Badge
    Chapter 31 Emergency Connectivity in Ad-Hoc Networks with Selfish Nodes
  33. Altmetric Badge
    Chapter 32 Fully-Compressed Suffix Trees
  34. Altmetric Badge
    Chapter 33 Improved Dynamic Rank-Select Entropy-Bound Structures
  35. Altmetric Badge
    Chapter 34 An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
  36. Altmetric Badge
    Chapter 35 List Update with Locality of Reference
  37. Altmetric Badge
    Chapter 36 Approximating Steiner Networks with Node Weights
  38. Altmetric Badge
    Chapter 37 Approximating Minimum-Power Degree and Connectivity Problems
  39. Altmetric Badge
    Chapter 38 Energy Efficient Monitoring in Sensor Networks
  40. Altmetric Badge
    Chapter 39 Approximation Algorithms for k -Hurdle Problems
  41. Altmetric Badge
    Chapter 40 Approximating Crossing Minimization in Radial Layouts
  42. Altmetric Badge
    Chapter 41 New Upper Bound on Vertex Folkman Numbers
  43. Altmetric Badge
    Chapter 42 Ptolemaic Graphs and Interval Graphs Are Leaf Powers
  44. Altmetric Badge
    Chapter 43 A Representation Theorem for Union-Difference Families and Application
  45. Altmetric Badge
    Chapter 44 Algorithms to Locate Errors Using Covering Arrays
  46. Altmetric Badge
    Chapter 45 On Injective Colourings of Chordal Graphs
  47. Altmetric Badge
    Chapter 46 Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
  48. Altmetric Badge
    Chapter 47 On 2-Subcolourings of Chordal Graphs
  49. Altmetric Badge
    Chapter 48 Collective Additive Tree Spanners of Homogeneously Orderable Graphs
  50. Altmetric Badge
    Chapter 49 The Generalized Median Stable Matchings: Finding Them Is Not That Easy
  51. Altmetric Badge
    Chapter 50 Stateless Near Optimal Flow Control with Poly-logarithmic Convergence
  52. Altmetric Badge
    Chapter 51 The Least-Unpopularity-Factor and Least-Unpopularity-Margin Criteria for Matching Problems with One-Sided Preferences
  53. Altmetric Badge
    Chapter 52 Randomized Rendez-Vous with Limited Memory
  54. Altmetric Badge
    Chapter 53 Origami Embedding of Piecewise-Linear Two-Manifolds
  55. Altmetric Badge
    Chapter 54 Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
  56. Altmetric Badge
    Chapter 55 Weighted Rectilinear Approximation of Points in the Plane
  57. Altmetric Badge
    Chapter 56 Paths with no Small Angles
  58. Altmetric Badge
    Chapter 57 Simpler Constant-Seed Condensers
  59. Altmetric Badge
    Chapter 58 Parallel Repetition of the Odd Cycle Game
  60. Altmetric Badge
    Chapter 59 I/O-Efficient Point Location in a Set of Rectangles
  61. Altmetric Badge
    Chapter 60 Finding Heavy Hitters over the Sliding Window of a Weighted Data Stream
  62. Altmetric Badge
    Chapter 61 Fixed-Parameter Algorithms for Cluster Vertex Deletion
  63. Altmetric Badge
    Chapter 62 Paths and Trails in Edge-Colored Graphs
  64. Altmetric Badge
    Chapter 63 Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
  65. Altmetric Badge
    Chapter 64 Domination in Geometric Intersection Graphs
  66. Altmetric Badge
    Chapter 65 An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
  67. Altmetric Badge
    Chapter 66 Quantum Property Testing of Group Solvability
  68. Altmetric Badge
    Chapter 67 Solving NP-Complete Problems with Quantum Search
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter
patent
1 patent
q&a
2 Q&A threads

Readers on

mendeley
10 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
LATIN 2008: Theoretical Informatics
Published by
Springer Berlin Heidelberg, April 2008
DOI 10.1007/978-3-540-78773-0
ISBNs
978-3-54-078772-3, 978-3-54-078773-0
Editors

Laber, Eduardo Sany, Bornstein, Claudson, Nogueira, Loana Tito, Faria, Luerbio

Twitter Demographics

The data shown below were collected from the profile of 1 tweeter who shared this research output. Click here to find out more about how the information was compiled.

Mendeley readers

The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Portugal 1 10%
Australia 1 10%
Unknown 8 80%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 50%
Student > Master 2 20%
Researcher 2 20%
Professor 1 10%
Readers by discipline Count As %
Computer Science 3 30%
Mathematics 2 20%
Agricultural and Biological Sciences 1 10%
Environmental Science 1 10%
Immunology and Microbiology 1 10%
Other 1 10%
Unknown 1 10%