↓ Skip to main content

Mathematical Foundations of Computer Science 2007

Overview of attention for book
Cover of 'Mathematical Foundations of Computer Science 2007'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 How To Be Fickle
  3. Altmetric Badge
    Chapter 2 Finite Model Theory on Tame Classes of Structures
  4. Altmetric Badge
    Chapter 3 Minimum Cycle Bases in Graphs Algorithms and Applications
  5. Altmetric Badge
    Chapter 4 Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
  6. Altmetric Badge
    Chapter 5 Evolvability
  7. Altmetric Badge
    Chapter 6 Expander Properties and the Cover Time of Random Intersection Graphs
  8. Altmetric Badge
    Chapter 7 Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
  9. Altmetric Badge
    Chapter 8 Transition Graphs of Rewriting Systems over Unranked Trees
  10. Altmetric Badge
    Chapter 9 Rewriting Conjunctive Queries Determined by Views
  11. Altmetric Badge
    Chapter 10 Approximation Algorithms for the Maximum Internal Spanning Tree Problem
  12. Altmetric Badge
    Chapter 11 New Approximability Results for 2-Dimensional Packing Problems
  13. Altmetric Badge
    Chapter 12 On Approximation of Bookmark Assignments
  14. Altmetric Badge
    Chapter 13 Height-Deterministic Pushdown Automata
  15. Altmetric Badge
    Chapter 14 Minimizing Variants of Visibly Pushdown Automata
  16. Altmetric Badge
    Chapter 15 Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
  17. Altmetric Badge
    Chapter 16 Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
  18. Altmetric Badge
    Chapter 17 NP by Means of Lifts and Shadows
  19. Altmetric Badge
    Chapter 18 The Complexity of Solitaire
  20. Altmetric Badge
    Chapter 19 Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
  21. Altmetric Badge
    Chapter 20 Space-Conscious Compression
  22. Altmetric Badge
    Chapter 21 Small Alliances in Graphs
  23. Altmetric Badge
    Chapter 22 The Maximum Solution Problem on Graphs
  24. Altmetric Badge
    Chapter 23 What Are Iteration Theories?
  25. Altmetric Badge
    Chapter 24 Properties Complementary to Program Self-reference
  26. Altmetric Badge
    Chapter 25 Dobrushin Conditions for Systematic Scan with Block Dynamics
  27. Altmetric Badge
    Chapter 26 On the Complexity of Computing Treelength
  28. Altmetric Badge
    Chapter 27 On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
  29. Altmetric Badge
    Chapter 28 Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
  30. Altmetric Badge
    Chapter 29 Towards a Rice Theorem on Traces of Cellular Automata
  31. Altmetric Badge
    Chapter 30 Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority
  32. Altmetric Badge
    Chapter 31 Public Key Identification Based on the Equivalence of Quadratic Forms
  33. Altmetric Badge
    Chapter 32 Reachability Problems in Quaternion Matrix and Rotation Semigroups
  34. Altmetric Badge
    Chapter 33 VPSPACE and a Transfer Theorem over the Complex Field
  35. Altmetric Badge
    Chapter 34 Efficient Provably-Secure Hierarchical Key Assignment Schemes
  36. Altmetric Badge
    Chapter 35 Nearly Private Information Retrieval
  37. Altmetric Badge
    Chapter 36 Packing and Squeezing Subgraphs into Planar Graphs
  38. Altmetric Badge
    Chapter 37 Dynamic Matchings in Convex Bipartite Graphs
  39. Altmetric Badge
    Chapter 38 Communication in Networks with Random Dependent Faults
  40. Altmetric Badge
    Chapter 39 Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
  41. Altmetric Badge
    Chapter 40 A Linear Time Algorithm for the k Maximal Sums Problem
  42. Altmetric Badge
    Chapter 41 A Lower Bound of 1 +  φ for Truthful Scheduling Mechanisms
  43. Altmetric Badge
    Chapter 42 Analysis of Maximal Repetitions in Strings
  44. Altmetric Badge
    Chapter 43 Series-Parallel Languages on Scattered and Countable Posets
  45. Altmetric Badge
    Chapter 44 Traces of Term-Automatic Graphs
  46. Altmetric Badge
    Chapter 45 State Complexity of Basic Operations on Suffix-Free Regular Languages
  47. Altmetric Badge
    Chapter 46 Exact Algorithms for L (2,1)-Labeling of Graphs
  48. Altmetric Badge
    Chapter 47 On ( k ,ℓ)-Leaf Powers
  49. Altmetric Badge
    Chapter 48 An Improved Claw Finding Algorithm Using Quantum Walk
  50. Altmetric Badge
    Chapter 49 Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument
  51. Altmetric Badge
    Chapter 50 On the Complexity of Game Isomorphism
  52. Altmetric Badge
    Chapter 51 Hardness Results for Tournament Isomorphism and Automorphism
  53. Altmetric Badge
    Chapter 52 Relating Complete and Partial Solution for Problems Similar to Graph Automorphism
  54. Altmetric Badge
    Chapter 53 Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach
  55. Altmetric Badge
    Chapter 54 Selfish Load Balancing Under Partial Knowledge
  56. Altmetric Badge
    Chapter 55 Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria
  57. Altmetric Badge
    Chapter 56 Congestion Games with Player-Specific Constants
  58. Altmetric Badge
    Chapter 57 Finding Patterns in Given Intervals
  59. Altmetric Badge
    Chapter 58 The Power of Two Prices: Beyond Cross-Monotonicity
  60. Altmetric Badge
    Chapter 59 Semisimple Algebras of Almost Minimal Rank over the Reals
  61. Altmetric Badge
    Chapter 60 Structural Analysis of Gapped Motifs of a String
  62. Altmetric Badge
    Chapter 61 Online and Offline Access to Short Lists
  63. Altmetric Badge
    Chapter 62 Optimal Randomized Comparison Based Algorithms for Collision
  64. Altmetric Badge
    Chapter 63 Randomized and Approximation Algorithms for Blue-Red Matching
  65. Altmetric Badge
    Chapter 64 Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
  66. Altmetric Badge
    Chapter 65 Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
  67. Altmetric Badge
    Chapter 66 Shuffle Expressions and Words with Nested Data
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
5 Wikipedia pages

Readers on

mendeley
11 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.
Title
Mathematical Foundations of Computer Science 2007
Published by
Springer Science & Business Media, August 2007
DOI 10.1007/978-3-540-74456-6
ISBNs
978-3-54-074455-9, 978-3-54-074456-6
Editors

Kučera, Luděk, Kučera, Antonín

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 9%
Portugal 1 9%
Brazil 1 9%
Unknown 8 73%

Demographic breakdown

Readers by professional status Count As %
Professor 2 18%
Student > Ph. D. Student 2 18%
Professor > Associate Professor 2 18%
Student > Master 2 18%
Student > Doctoral Student 1 9%
Other 2 18%
Readers by discipline Count As %
Computer Science 8 73%
Engineering 2 18%
Mathematics 1 9%