↓ Skip to main content

Mathematical Foundations of Computer Science 2004

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Case Study of Genome Evolution: From Continuous to Discrete Time Model
  3. Altmetric Badge
    Chapter 2 Multicoloring: Problems and Techniques
  4. Altmetric Badge
    Chapter 3 Some Recent Progress in Algorithmic Randomness
  5. Altmetric Badge
    Chapter 4 Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms
  6. Altmetric Badge
    Chapter 5 PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness
  7. Altmetric Badge
    Chapter 6 Theory and Applied Computing: Observations and Anecdotes
  8. Altmetric Badge
    Chapter 7 Boxed Ambients with Communication Interfaces
  9. Altmetric Badge
    Chapter 8 Algebraic Recognizability of Languages
  10. Altmetric Badge
    Chapter 9 Geometric Optimization and Unique Sink Orientations of Cubes
  11. Altmetric Badge
    Chapter 10 Congestion Games and Coordination Mechanisms
  12. Altmetric Badge
    Chapter 11 Equitable Colorings of Bounded Treewidth Graphs
  13. Altmetric Badge
    Chapter 12 The Bidimensional Theory of Bounded-Genus Graphs
  14. Altmetric Badge
    Chapter 13 Parallel Knock-Out Schemes in Networks
  15. Altmetric Badge
    Chapter 14 Online Algorithms for Disk Graphs
  16. Altmetric Badge
    Chapter 15 Protein Folding in the HP Model on Grid Lattices with Diagonals
  17. Altmetric Badge
    Chapter 16 Optimization, Games, and Quantified Constraint Satisfaction
  18. Altmetric Badge
    Chapter 17 Approximating Boolean Functions by OBDDs
  19. Altmetric Badge
    Chapter 18 On Approximation Hardness of the Minimum 2SAT-DELETION Problem
  20. Altmetric Badge
    Chapter 19 Group Coloring and List Group Coloring Are Π2 P -Complete
  21. Altmetric Badge
    Chapter 20 Complexity Results in Graph Reconstruction
  22. Altmetric Badge
    Chapter 21 Generating Paths and Cuts in Multi-pole (Di)graphs
  23. Altmetric Badge
    Chapter 22 Packing Directed Cycles Efficiently
  24. Altmetric Badge
    Chapter 23 The Complexity of Membership Problems for Circuits over Sets of Integers
  25. Altmetric Badge
    Chapter 24 Some Meet-in-the-Middle Circuit Lower Bounds
  26. Altmetric Badge
    Chapter 25 The Enumerability of P Collapses P to NC
  27. Altmetric Badge
    Chapter 26 On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge
  28. Altmetric Badge
    Chapter 27 All Superlinear Inverse Schemes Are coNP-Hard
  29. Altmetric Badge
    Chapter 28 The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups
  30. Altmetric Badge
    Chapter 29 Generation Problems
  31. Altmetric Badge
    Chapter 30 One Query Reducibilities Between Partial Information Classes
  32. Altmetric Badge
    Chapter 31 A New Dimension Sensitive Property for Cellular Automata
  33. Altmetric Badge
    Chapter 32 Captive Cellular Automata
  34. Altmetric Badge
    Chapter 33 Simulating 3D Cellular Automata with 2D Cellular Automata
  35. Altmetric Badge
    Chapter 34 Graph Exploration by a Finite Automaton
  36. Altmetric Badge
    Chapter 35 On Polynomially Time Bounded Symmetry of Information
  37. Altmetric Badge
    Chapter 36 Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
  38. Altmetric Badge
    Chapter 37 A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs
  39. Altmetric Badge
    Chapter 38 Polynomial Time Approximation Schemes and Parameterized Complexity
  40. Altmetric Badge
    Chapter 39 Epistemic Foundation of the Well-Founded Semantics over Bilattices
  41. Altmetric Badge
    Chapter 40 Structural Model Checking for Communicating Hierarchical Machines
  42. Altmetric Badge
    Chapter 41 Compositional Verification: Decidability Issues Using Graph Substitutions
  43. Altmetric Badge
    Chapter 42 Event Structures for Resolvable Conflict
  44. Altmetric Badge
    Chapter 43 Optimal Preemptive Scheduling for General Target Functions
  45. Altmetric Badge
    Chapter 44 Mathematical Foundations of Computer Science 2004
  46. Altmetric Badge
    Chapter 45 Agent-Based Information Handling in Large Networks
  47. Altmetric Badge
    Chapter 46 Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
  48. Altmetric Badge
    Chapter 47 A Hierarchy of Irreducible Sofic Shifts
  49. Altmetric Badge
    Chapter 48 Membership and Reachability Problems for Row-Monomial Transformations
  50. Altmetric Badge
    Chapter 49 On Pseudovarieties of Semiring Homomorphisms
  51. Altmetric Badge
    Chapter 50 An Algebraic Generalization of ω-Regular Languages
  52. Altmetric Badge
    Chapter 51 A Protocol for Serializing Unique Strategies
  53. Altmetric Badge
    Chapter 52 A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games
  54. Altmetric Badge
    Chapter 53 When Can You Play Positionally?
  55. Altmetric Badge
    Chapter 54 The Dual of Concatenation
  56. Altmetric Badge
    Chapter 55 Computational Aspects of Disjunctive Sequences
  57. Altmetric Badge
    Chapter 56 Decidability of Trajectory-Based Equations
  58. Altmetric Badge
    Chapter 57 Efficient View Point Selection for Silhouettes of Convex Polyhedra
  59. Altmetric Badge
    Chapter 58 Angles and Lengths in Reconfigurations of Polygons and Polyhedra
  60. Altmetric Badge
    Chapter 59 Improved Bounds and Schemes for the Declustering Problem
  61. Altmetric Badge
    Chapter 60 Crossing Number Is Hard for Cubic Graphs
  62. Altmetric Badge
    Chapter 61 A Reducibility for the Dot-Depth Hierarchy
  63. Altmetric Badge
    Chapter 62 Sublogarithmic Ambiguity
  64. Altmetric Badge
    Chapter 63 An Elementary Proof for the Non-parametrizability of the Equation xyz=zvx
  65. Altmetric Badge
    Chapter 64 A Generalization of Repetition Threshold
  66. Altmetric Badge
    Chapter 65 An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
  67. Altmetric Badge
    Chapter 66 Universal Test for Quantum One-Way Permutations
  68. Altmetric Badge
    Chapter 67 A Common Algebraic Description for Probabilistic and Quantum Computations
  69. Altmetric Badge
    Chapter 68 Extraction and Implication of Path Constraints
  70. Altmetric Badge
    Chapter 69 Schema Evolution for XML: A Consistency-Preserving Approach
  71. Altmetric Badge
    Chapter 70 Complexity of Decision Problems for Simple Regular Expressions
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter

Readers on

mendeley
19 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 2004
Published by
Lecture notes in computer science, January 2004
DOI 10.1007/b99679
ISBNs
978-3-54-022823-3, 978-3-54-028629-5
Authors

Jiří Fiala, Václav Koubek, Jan Kratochvíl

Editors

Jiří Fiala, Václav Koubek, Jan Kratochvíl

Twitter Demographics

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

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 19 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 11%
Unknown 17 89%
Readers by discipline Count As %
Computer Science 2 11%
Unknown 17 89%

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 28 January 2015.
All research outputs
#6,142,103
of 8,090,960 outputs
Outputs from Lecture notes in computer science
#4,980
of 6,630 outputs
Outputs of similar age
#182,449
of 259,042 outputs
Outputs of similar age from Lecture notes in computer science
#58
of 95 outputs
Altmetric has tracked 8,090,960 research outputs across all sources so far. This one is in the 13th percentile – i.e., 13% of other outputs scored the same or lower than it.
So far Altmetric has tracked 6,630 research outputs from this source. They receive a mean Attention Score of 3.8. This one is in the 15th percentile – i.e., 15% of its peers scored the same or lower than it.
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 259,042 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 15th percentile – i.e., 15% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 95 others from the same source and published within six weeks on either side of this one. This one is in the 27th percentile – i.e., 27% of its contemporaries scored the same or lower than it.