Adventures Between Lower Bounds and Higher Altitudes

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Determinism and Nondeterminism in Finite Automata with Advice
3. Altmetric Badge
   Chapter 2 A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity
4. Altmetric Badge
   Chapter 3 Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols
5. Altmetric Badge
   Chapter 4 Regularity of k-Abelian Equivalence Classes of Fixed Cardinality
6. Altmetric Badge
   Chapter 5 Reaction Systems, Transition Systems, and Equivalences
7. Altmetric Badge
   Chapter 6 On Usefulness of Information: Framework and NFA Case
8. Altmetric Badge
   Chapter 7 Parikh Matrices: Subword Indicators and Degrees of Ambiguity
9. Altmetric Badge
   Chapter 8 Probabilism versus Alternation for Automata
10. Altmetric Badge
    Chapter 9 Classical and Quantum Computations with Restricted Memory
11. Altmetric Badge
    Chapter 10 Stability of Reapproximation Algorithms for the $$\beta $$β-Metric Traveling Salesman (Path) Problem
12. Altmetric Badge
    Chapter 11 Fully Online Matching with Advice on General Bipartite Graphs and Paths
13. Altmetric Badge
    Chapter 12 Sequence Hypergraphs: Paths, Flows, and Cuts
14. Altmetric Badge
    Chapter 13 Relative Worst-Order Analysis: A Survey
15. Altmetric Badge
    Chapter 14 Length-Weighted Disjoint Path Allocation
16. Altmetric Badge
    Chapter 15 Universal Hashing via Integer Arithmetic Without Primes, Revisited
17. Altmetric Badge
    Chapter 16 Small Complexity Gaps for Comparison-Based Sorting
18. Altmetric Badge
    Chapter 17 Online Matching in Regular Bipartite Graphs with Randomized Adversary
19. Altmetric Badge
    Chapter 18 A Dynamic Distributed Data Structure for Top-k and k-Select Queries
20. Altmetric Badge
    Chapter 19 What Is Known About Vertex Cover Kernelization?
21. Altmetric Badge
    Chapter 20 A Survey on the Complexity of Flood-Filling Games
22. Altmetric Badge
    Chapter 21 Infinity and Finite Arithmetic
23. Altmetric Badge
    Chapter 22 A Modern View on Stability of Approximation
24. Altmetric Badge
    Chapter 23 $$\mathcal {NP}$$NP-Hardness of Equilibria in Case of Risk-Averse Players
25. Altmetric Badge
    Chapter 24 Firefly-Inspired Algorithm for Job Shop Scheduling
26. Altmetric Badge
    Chapter 25 Rendezvous of Asynchronous Mobile Robots with Lights
27. Altmetric Badge
    Chapter 26 On the Advice Complexity of Online Edge- and Node-Deletion Problems
28. Altmetric Badge
    Chapter 27 Second Thoughts on the Second Law
29. Altmetric Badge
    Chapter 28 Reoptimization of NP-Hard Problems
30. Altmetric Badge
    Chapter 29 CS Unplugged—How Is It Used, and Does It Work?
31. Altmetric Badge
    Chapter 30 Resurgence of Informatics Education in Schools
32. Altmetric Badge
    Chapter 31 The Adventure of Computer Science
33. Altmetric Badge
    Chapter 32 Toward Scenario-Based Algorithmics
34. Altmetric Badge
    Chapter 33 That Most Important Intersection
35. Altmetric Badge
    Chapter 34 Paving the Way for Computer Science in German Schools
36. Altmetric Badge
    Chapter 35 A Master Class on Recursion
37. Altmetric Badge
    Chapter 36 About Place Cells and Grid Cells