Theory and Applications of Models of Computation

10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings

Editors:

ISBN: 978-3-642-38235-2 (Print) 978-3-642-38236-9 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. No Access

    Book Chapter

    Pages 1-9

    Online Scheduling on a CPU-GPU Cluster

  3. No Access

    Book Chapter

    Pages 10-19

    Throughput Maximization for Speed-Scaling with Agreeable Deadlines

  4. No Access

    Book Chapter

    Pages 20-31

    Temperature Aware Online Algorithms for Minimizing Flow Time

  5. No Access

    Book Chapter

    Pages 32-41

    Priority Queues and Sorting for Read-Only Data

  6. No Access

    Book Chapter

    Pages 42-51

    (1 + ε)-Distance Oracles for Vertex-Labeled Planar Graphs

  7. No Access

    Book Chapter

    Pages 52-61

    Group Nearest Neighbor Queries in the L 1 Plane

  8. No Access

    Book Chapter

    Pages 62-71

    Modelling the Power Supply Network – Hardness and Approximation

  9. No Access

    Book Chapter

    Pages 72-83

    Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem

  10. No Access

    Book Chapter

    Pages 84-95

    k-means++ under Approximation Stability

  11. No Access

    Book Chapter

    Pages 96-107

    An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure

  12. No Access

    Book Chapter

    Pages 108-120

    Non-crossing Connectors in the Plane

  13. No Access

    Book Chapter

    Pages 121-132

    Minimax Regret 1-Sink Location Problems in Dynamic Path Networks

  14. No Access

    Book Chapter

    Pages 133-143

    A Notion of a Computational Step for Partial Combinatory Algebras

  15. No Access

    Book Chapter

    Pages 144-155

    Selection by Recursively Enumerable Sets

  16. No Access

    Book Chapter

    Pages 156-168

    On the Boundedness Property of Semilinear Sets

  17. No Access

    Book Chapter

    Pages 169-180

    Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer

  18. No Access

    Book Chapter

    Pages 181-192

    Computing with and without Arbitrary Large Numbers

  19. No Access

    Book Chapter

    Pages 193-204

    On the Sublinear Processor Gap for Parallel Architectures

  20. No Access

    Book Chapter

    Pages 205-211

    On Efficient Constructions of Short Lists Containing Mostly Ramsey Graphs

  21. No Access

    Book Chapter

    Pages 212-223

    On Martin-Löf Convergence of Solomonoff’s Mixture

previous Page of 2