Theory and Applications of Models of Computation

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 On Learning Families of Ideals in Lattices and Boolean Algebras
3. Altmetric Badge
   Chapter 2 Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
4. Altmetric Badge
   Chapter 3 A Gray Code of Ordered Trees
5. Altmetric Badge
   Chapter 4 Mechanism Design with Predictions for Facility Location Games with Candidate Locations
6. Altmetric Badge
   Chapter 5 An Improved Approximation Algorithm for Metric Triangle Packing
7. Altmetric Badge
   Chapter 6 An Optimal and Practical Algorithm for the Planar 2-Center Problem
8. Altmetric Badge
   Chapter 7 Endogenous Threshold Selection with Two-Interval Restricted Tests
9. Altmetric Badge
   Chapter 8 An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
10. Altmetric Badge
    Chapter 9 A Tight Threshold Bound for Search Trees with 2-Way Comparisons
11. Altmetric Badge
    Chapter 10 Kleene Theorems for Lasso Languages and  $$\omega $$ ω -Languages
12. Altmetric Badge
    Chapter 11 Tight Double Exponential Lower Bounds
13. Altmetric Badge
    Chapter 12 Source-Oblivious Broadcast
14. Altmetric Badge
    Chapter 13 On the 3-Tree Core of Plane Graphs
15. Altmetric Badge
    Chapter 14 A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation
16. Altmetric Badge
    Chapter 15 A Local Search Algorithm for Radius-Constrained k -Median
17. Altmetric Badge
    Chapter 16 Energy and Output Patterns in Boolean Circuits
18. Altmetric Badge
    Chapter 17 Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques
19. Altmetric Badge
    Chapter 18 On the Power of Counting the Total Number of Computation Paths of NPTMs
20. Altmetric Badge
    Chapter 19 The Parameterized Complexity of Maximum Betweenness Centrality
21. Altmetric Badge
    Chapter 20 Offensive Alliances in Signed Graphs
22. Altmetric Badge
    Chapter 21 Quantum Path Parallelism: A Circuit-Based Approach to Text Searching
23. Altmetric Badge
    Chapter 22 Space-Efficient Graph Kernelizations
24. Altmetric Badge
    Chapter 23 Counting on Rainbow k -Connections
25. Altmetric Badge
    Chapter 24 Some Combinatorial Algorithms on the Edge Cover Number of  k -Regular Connected Hypergraphs
26. Altmetric Badge
    Chapter 25 Time Efficient Implementation for Online K -Server Problem on Trees
27. Altmetric Badge
    Chapter 26 Improved Approximation Algorithm for the Distributed Lower-Bounded k -Center Problem
28. Altmetric Badge
    Chapter 27 Parameterized Complexity of Weighted Target Set Selection
29. Altmetric Badge
    Chapter 28 Mechanism Design for Building Optimal Bridges Between Regions
30. Altmetric Badge
    Chapter 29 Joint Bidding in Ad Auctions
31. Altmetric Badge
    Chapter 30 Lower Bounds for the Sum of Small-Size Algebraic Branching Programs