↓ Skip to main content

Mathematical Foundations of Computer Science 2010

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 New Developments in Quantum Algorithms
  3. Altmetric Badge
    Chapter 2 Mathematical Foundations of Computer Science 2010
  4. Altmetric Badge
    Chapter 3 Information Complexity of Online Problems
  5. Altmetric Badge
    Chapter 4 Algorithmic Lower Bounds for Problems on Decomposable Graphs
  6. Altmetric Badge
    Chapter 5 Do We Really Understand the Crossing Numbers?
  7. Altmetric Badge
    Chapter 6 Balanced Queries: Divide and Conquer
  8. Altmetric Badge
    Chapter 7 Slowly synchronizing automata and digraphs
  9. Altmetric Badge
    Chapter 8 Weights of Exact Threshold Functions
  10. Altmetric Badge
    Chapter 9 Proof Systems and Transformation Games
  11. Altmetric Badge
    Chapter 10 Scheduling Real-Time Mixed-Criticality Jobs
  12. Altmetric Badge
    Chapter 11 A dexptime -Complete Dolev-Yao Theory with Distributive Encryption
  13. Altmetric Badge
    Chapter 12 On Problem Kernels for Possible Winner Determination under the k -Approval Protocol
  14. Altmetric Badge
    Chapter 13 Counting Minimum ( s , t )-Cuts in Weighted Planar Graphs in Polynomial Time
  15. Altmetric Badge
    Chapter 14 Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree
  16. Altmetric Badge
    Chapter 15 Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems
  17. Altmetric Badge
    Chapter 16 Distance Constraint Satisfaction Problems
  18. Altmetric Badge
    Chapter 16 Distance constraint satisfaction problems
  19. Altmetric Badge
    Chapter 17 Faster Algorithms on Branch and Clique Decompositions
  20. Altmetric Badge
    Chapter 18 Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
  21. Altmetric Badge
    Chapter 19 Robust Computations with Dynamical Systems
  22. Altmetric Badge
    Chapter 20 On Factor Universality in Symbolic Spaces
  23. Altmetric Badge
    Chapter 21 Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity
  24. Altmetric Badge
    Chapter 22 Resource Combinatory Algebras
  25. Altmetric Badge
    Chapter 23 Randomness for Free
  26. Altmetric Badge
    Chapter 24 Qualitative Analysis of Partially-Observable Markov Decision Processes
  27. Altmetric Badge
    Chapter 25 All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model
  28. Altmetric Badge
    Chapter 26 Online Clustering with Variable Sized Clusters
  29. Altmetric Badge
    Chapter 27 Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
  30. Altmetric Badge
    Chapter 28 Counting Classes and the Fine Structure between NC 1 and L
  31. Altmetric Badge
    Chapter 29 The Average Complexity of Moore’s State Minimization Algorithm Is O ( n loglog n )
  32. Altmetric Badge
    Chapter 30 Connected Searching of Weighted Trees
  33. Altmetric Badge
    Chapter 31 Iterated Regret Minimization in Game Graphs
  34. Altmetric Badge
    Chapter 32 Properties of Visibly Pushdown Transducers
  35. Altmetric Badge
    Chapter 33 Mathematical Foundations of Computer Science 2010
  36. Altmetric Badge
    Chapter 34 Frame Definability for Classes of Trees in the μ -calculus
  37. Altmetric Badge
    Chapter 35 Evaluating Non-square Sparse Bilinear Forms on Multiple Vector Pairs in the I/O-Model
  38. Altmetric Badge
    Chapter 36 Finding and Counting Vertex-Colored Subtrees
  39. Altmetric Badge
    Chapter 37 Limiting Negations in Bounded Treewidth and Upward Planar Circuits
  40. Altmetric Badge
    Chapter 38 On the Topological Complexity of MSO+U and Related Automata Models
  41. Altmetric Badge
    Chapter 39 Least and Greatest Solutions of Equations over Sets of Integers
  42. Altmetric Badge
    Chapter 40 Improved Simulation of Nondeterministic Turing Machines
  43. Altmetric Badge
    Chapter 41 The Prize-Collecting Edge Dominating Set Problem in Trees
  44. Altmetric Badge
    Chapter 42 The Multivariate Resultant Is NP -hard in Any Characteristic
  45. Altmetric Badge
    Chapter 43 Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
  46. Altmetric Badge
    Chapter 44 Meta-Envy-Free Cake-Cutting Protocols
  47. Altmetric Badge
    Chapter 45 Two Variables and Two Successors
  48. Altmetric Badge
    Chapter 46 Harnessing ML F with the Power of System F
  49. Altmetric Badge
    Chapter 47 Describing Average- and Longtime-Behavior by Weighted MSO Logics
  50. Altmetric Badge
    Chapter 48 Solving minones-2-sat as Fast as vertex cover
  51. Altmetric Badge
    Chapter 49 Unambiguous Finite Automata over a Unary Alphabet
  52. Altmetric Badge
    Chapter 50 The Complexity of Finding Reset Words in Finite Automata
  53. Altmetric Badge
    Chapter 51 Does Treewidth Help in Modal Satisfiability?
  54. Altmetric Badge
    Chapter 52 Asynchronous Omega-Regular Games with Partial Information
  55. Altmetric Badge
    Chapter 53 Parity Games with Partial Information Played on Graphs of Bounded Complexity
  56. Altmetric Badge
    Chapter 54 Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
  57. Altmetric Badge
    Chapter 55 Enumeration of the Monomials of a Polynomial and Related Complexity Classes
  58. Altmetric Badge
    Chapter 56 Faster Approximation Schemes and Parameterized Algorithms on H -Minor-Free and Odd-Minor-Free Graphs
  59. Altmetric Badge
    Chapter 57 Semi-linear Parikh Images of Regular Expressions via Reduction
  60. Altmetric Badge
    Chapter 58 Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
  61. Altmetric Badge
    Chapter 59 Mesh Deformation of Dynamic Smooth Manifolds with Surface Correspondences
  62. Altmetric Badge
    Chapter 60 Counting Dependent and Independent Strings
  63. Altmetric Badge
    Chapter 61 Impossibility of Independence Amplification in Kolmogorov Complexity Theory
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (88th percentile)
  • High Attention Score compared to outputs of the same age and source (95th percentile)

Mentioned by

twitter
2 X users
wikipedia
2 Wikipedia pages
q&a
3 Q&A threads

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 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 2010
Published by
ADS, August 2010
DOI 10.1007/978-3-642-15155-2
ISBNs
978-3-64-215154-5, 978-3-64-215155-2
Editors

Hliněný, Petr, Kučera, Antonín

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users 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 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Engineering 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 12. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 11 April 2023.
All research outputs
#2,768,776
of 23,565,002 outputs
Outputs from ADS
#1,790
of 38,203 outputs
Outputs of similar age
#10,687
of 95,883 outputs
Outputs of similar age from ADS
#16
of 389 outputs
Altmetric has tracked 23,565,002 research outputs across all sources so far. Compared to these this one has done well and is in the 88th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 38,203 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done particularly well, scoring higher than 95% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 95,883 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 88% of its contemporaries.
We're also able to compare this research output to 389 others from the same source and published within six weeks on either side of this one. This one has done particularly well, scoring higher than 95% of its contemporaries.