Automata, Languages, and Programming

40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I

ISBN: 978-3-642-39205-4 (Print) 978-3-642-39206-1 (Online)

Table of contents (71 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Track A – Algorithms, Complexity and Games

    1. No Access

      Book Chapter

      Pages 1-12

      Exact Weight Subgraphs and the k-Sum Conjecture

    2. No Access

      Book Chapter

      Pages 13-24

      Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines

    3. No Access

      Book Chapter

      Pages 25-32

      Tight Lower Bound for Linear Sketches of Moments

    4. No Access

      Book Chapter

      Pages 33-44

      Optimal Partitioning for Dual Pivot Quicksort

    5. No Access

      Book Chapter

      Pages 45-56

      Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm

    6. No Access

      Book Chapter

      Pages 57-68

      On the Extension Complexity of Combinatorial Polytopes

    7. No Access

      Book Chapter

      Pages 69-80

      Algorithms for Hub Label Optimization

    8. No Access

      Book Chapter

      Pages 81-92

      Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems

    9. No Access

      Book Chapter

      Pages 93-104

      Search-Space Size in Contraction Hierarchies

    10. No Access

      Book Chapter

      Pages 105-122

      Time-Efficient Quantum Walks for 3-Distinctness

    11. No Access

      Book Chapter

      Pages 123-134

      An Algebraic Characterization of Testable Boolean CSPs

    12. No Access

      Book Chapter

      Pages 135-147

      Approximation Algorithms for the Joint Replenishment Problem with Deadlines

    13. No Access

      Book Chapter

      Pages 148-159

      Sparse Suffix Tree Construction in Small Space

    14. No Access

      Book Chapter

      Pages 160-171

      Tree Compression with Top Trees

    15. No Access

      Book Chapter

      Pages 172-183

      Noncommutativity Makes Determinants Hard

    16. No Access

      Book Chapter

      Pages 184-195

      Optimal Orthogonal Graph Drawing with Convex Bend Costs

    17. No Access

      Book Chapter

      Pages 196-207

      Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth

    18. No Access

      Book Chapter

      Pages 208-219

      On the Complexity of Higher Order Abstract Voronoi Diagrams

    19. No Access

      Book Chapter

      Pages 220-231

      A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions

    20. No Access

      Book Chapter

      Pages 232-243

      Direct Product via Round-Preserving Compression

previous Page of 4