↓ Skip to main content

LATIN 2006: Theoretical Informatics

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Algorithmic Challenges in Web Search Engines
  3. Altmetric Badge
    Chapter 2 RNA Molecules: Glimpses Through an Algorithmic Lens
  4. Altmetric Badge
    Chapter 3 Squares
  5. Altmetric Badge
    Chapter 4 Matching Based Augmentations for Approximating Connectivity Problems
  6. Altmetric Badge
    Chapter 5 Modelling Errors and Recovery for Communication
  7. Altmetric Badge
    Chapter 6 Lossless Data Compression Via Error Correction
  8. Altmetric Badge
    Chapter 7 The Power and Weakness of Randomness in Computation
  9. Altmetric Badge
    Chapter 8 A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
  10. Altmetric Badge
    Chapter 9 On Clusters in Markov Chains
  11. Altmetric Badge
    Chapter 10 An Architecture for Provably Secure Computation
  12. Altmetric Badge
    Chapter 11 Scoring Matrices That Induce Metrics on Sequences
  13. Altmetric Badge
    Chapter 12 Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
  14. Altmetric Badge
    Chapter 13 The Complexity of Diffuse Reflections in a Simple Polygon
  15. Altmetric Badge
    Chapter 14 Counting Proportions of Sets: Expressive Power with Almost Order
  16. Altmetric Badge
    Chapter 15 Efficient Approximate Dictionary Look-Up for Long Words over Small Alphabets
  17. Altmetric Badge
    Chapter 16 Relations Among Notions of Security for Identity Based Encryption Schemes
  18. Altmetric Badge
    Chapter 17 Optimally Adaptive Integration of Univariate Lipschitz Functions
  19. Altmetric Badge
    Chapter 18 Classical Computability and Fuzzy Turing Machines
  20. Altmetric Badge
    Chapter 19 An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
  21. Altmetric Badge
    Chapter 20 An Algorithm for a Generalized Maximum Subsequence Problem
  22. Altmetric Badge
    Chapter 21 Random Bichromatic Matchings
  23. Altmetric Badge
    Chapter 22 Eliminating Cycles in the Discrete Torus
  24. Altmetric Badge
    Chapter 23 On Behalf of the Seller and Society: Bicriteria Mechanisms for Unit-Demand Auctions
  25. Altmetric Badge
    Chapter 24 Pattern Matching Statistics on Correlated Sources
  26. Altmetric Badge
    Chapter 25 Robust Model-Checking of Linear-Time Properties in Timed Automata
  27. Altmetric Badge
    Chapter 26 The Computational Complexity of the Parallel Knock-Out Problem
  28. Altmetric Badge
    Chapter 27 Reconfigurations in Graphs and Grids
  29. Altmetric Badge
    Chapter 28 ${\mathcal C}$ -Varieties, Actions and Wreath Product
  30. Altmetric Badge
    Chapter 29 Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges
  31. Altmetric Badge
    Chapter 30 An Efficient Approximation Algorithm for Point Pattern Matching Under Noise
  32. Altmetric Badge
    Chapter 31 Oblivious Medians Via Online Bidding
  33. Altmetric Badge
    Chapter 32 Efficient Computation of the Relative Entropy of Probabilistic Automata
  34. Altmetric Badge
    Chapter 33 A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
  35. Altmetric Badge
    Chapter 34 De Dictionariis Dynamicis Pauco Spatio Utentibus
  36. Altmetric Badge
    Chapter 35 Customized Newspaper Broadcast: Data Broadcast with Dependencies
  37. Altmetric Badge
    Chapter 36 On Minimum k -Modal Partitions of Permutations
  38. Altmetric Badge
    Chapter 37 Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
  39. Altmetric Badge
    Chapter 38 Maximizing Throughput in Queueing Networks with Limited Flexibility
  40. Altmetric Badge
    Chapter 39 Network Flow Spanners
  41. Altmetric Badge
    Chapter 40 Finding All Minimal Infrequent Multi-dimensional Intervals
  42. Altmetric Badge
    Chapter 41 Cut Problems in Graphs with a Budget Constraint
  43. Altmetric Badge
    Chapter 42 Lower Bounds for Clear Transmissions in Radio Networks
  44. Altmetric Badge
    Chapter 43 Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata
  45. Altmetric Badge
    Chapter 44 Lower Bounds for Geometric Diameter Problems
  46. Altmetric Badge
    Chapter 45 Connected Treewidth and Connected Graph Searching
  47. Altmetric Badge
    Chapter 46 A Faster Algorithm for Finding Maximum Independent Sets in Sparse Graphs
  48. Altmetric Badge
    Chapter 47 The Committee Decision Problem
  49. Altmetric Badge
    Chapter 48 Common Deadline Lazy Bureaucrat Scheduling Revisited
  50. Altmetric Badge
    Chapter 49 Approximate Sorting
  51. Altmetric Badge
    Chapter 50 Stochastic Covering and Adaptivity
  52. Altmetric Badge
    Chapter 51 LATIN 2006: Theoretical Informatics
  53. Altmetric Badge
    Chapter 52 LATIN 2006: Theoretical Informatics
  54. Altmetric Badge
    Chapter 53 The Online Freeze-Tag Problem
  55. Altmetric Badge
    Chapter 54 I/O-Efficient Algorithms on Near-Planar Graphs
  56. Altmetric Badge
    Chapter 55 Minimal Split Completions of Graphs
  57. Altmetric Badge
    Chapter 56 Design and Analysis of Online Batching Systems
  58. Altmetric Badge
    Chapter 57 Competitive Analysis of Scheduling Algorithms for Aggregated Links
  59. Altmetric Badge
    Chapter 58 A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
  60. Altmetric Badge
    Chapter 59 On Sampling in Higher-Dimensional Peer-to-Peer Systems
  61. Altmetric Badge
    Chapter 60 Mobile Agent Rendezvous in a Synchronous Torus
  62. Altmetric Badge
    Chapter 61 Randomly Colouring Graphs with Girth Five and Large Maximum Degree
  63. Altmetric Badge
    Chapter 62 Packing Dicycle Covers in Planar Graphs with No K 5 – e Minor
  64. Altmetric Badge
    Chapter 63 Sharp Estimates for the Main Parameters of the Euclid Algorithm
  65. Altmetric Badge
    Chapter 64 Position-Restricted Substring Searching
  66. Altmetric Badge
    Chapter 65 Rectilinear Approximation of a Set of Points in the Plane
  67. Altmetric Badge
    Chapter 66 The Branch-Width of Circular-Arc Graphs
  68. Altmetric Badge
    Chapter 67 Minimal Eulerian Circuit in a Labeled Digraph
  69. Altmetric Badge
    Chapter 68 Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization
  70. Altmetric Badge
    Chapter 69 RISOTTO : Fast Extraction of Motifs with Mismatches
  71. Altmetric Badge
    Chapter 70 Minimum Cost Source Location Problems with Flow Requirements
  72. Altmetric Badge
    Chapter 71 Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms
  73. Altmetric Badge
    Chapter 72 LATIN 2006: Theoretical Informatics
  74. Altmetric Badge
    Chapter 73 Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
Attention for Chapter 49: Approximate Sorting
Altmetric Badge

Readers on

mendeley
2 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.
Chapter title
Approximate Sorting
Chapter number 49
Book title
LATIN 2006: Theoretical Informatics
Published by
Springer, Berlin, Heidelberg, March 2006
DOI 10.1007/11682462_49
Book ISBNs
978-3-54-032755-4, 978-3-54-032756-1
Authors

Joachim Giesen, Eva Schuberth, Miloš Stojaković

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 50%
Unknown 1 50%

Demographic breakdown

Readers by professional status Count As %
Professor 1 50%
Unknown 1 50%
Readers by discipline Count As %
Engineering 1 50%
Unknown 1 50%