↓ Skip to main content

Mathematical Foundations of Computer Science 2006

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Core Calculus for Scala Type Checking
  3. Altmetric Badge
    Chapter 2 Tree Exploration with an Oracle
  4. Altmetric Badge
    Chapter 3 Distributed Data Structures: A Survey on Informative Labeling Schemes
  5. Altmetric Badge
    Chapter 4 From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions
  6. Altmetric Badge
    Chapter 5 The Structure of Tractable Constraint Satisfaction Problems
  7. Altmetric Badge
    Chapter 6 On the Representation of Kleene Algebras with Tests
  8. Altmetric Badge
    Chapter 7 From Three Ideas in TCS to Three Applications in Bioinformatics
  9. Altmetric Badge
    Chapter 8 Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
  10. Altmetric Badge
    Chapter 9 Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
  11. Altmetric Badge
    Chapter 10 Mathematical Foundations of Computer Science 2006
  12. Altmetric Badge
    Chapter 11 Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
  13. Altmetric Badge
    Chapter 12 A Polynomial Time Nilpotence Test for Galois Groups and Related Results
  14. Altmetric Badge
    Chapter 13 The Multiparty Communication Complexity of Exact- T : Improved Bounds and New Problems
  15. Altmetric Badge
    Chapter 14 Crochemore Factorization of Sturmian and Other Infinite Words
  16. Altmetric Badge
    Chapter 15 Equations on Partial Words
  17. Altmetric Badge
    Chapter 16 Concrete Multiplicative Complexity of Symmetric Functions
  18. Altmetric Badge
    Chapter 17 On the Complexity of Limit Sets of Cellular Automata Associated with Probability Measures
  19. Altmetric Badge
    Chapter 18 Coloring Random 3-Colorable Graphs with Non-uniform Edge Probabilities
  20. Altmetric Badge
    Chapter 19 The Kleene Equality for Graphs
  21. Altmetric Badge
    Chapter 20 On the Repetition Threshold for Large Alphabets
  22. Altmetric Badge
    Chapter 21 Improved Parameterized Upper Bounds for Vertex Cover
  23. Altmetric Badge
    Chapter 22 On Comparing Sums of Square Roots of Small Integers
  24. Altmetric Badge
    Chapter 23 A Combinatorial Approach to Collapsing Words
  25. Altmetric Badge
    Chapter 24 Optimal Linear Arrangement of Interval Graphs
  26. Altmetric Badge
    Chapter 25 The Lempel-Ziv Complexity of Fixed Points of Morphisms
  27. Altmetric Badge
    Chapter 26 Partially Commutative Inverse Monoids
  28. Altmetric Badge
    Chapter 27 Learning Bayesian Networks Does Not Have to Be NP-Hard
  29. Altmetric Badge
    Chapter 28 Lower Bounds for the Transition Complexity of NFAs
  30. Altmetric Badge
    Chapter 29 Smart Robot Teams Exploring Sparse Trees
  31. Altmetric Badge
    Chapter 30 k -Sets of Convex Inclusion Chains of Planar Point Sets
  32. Altmetric Badge
    Chapter 31 Toward the Eigenvalue Power Law
  33. Altmetric Badge
    Chapter 32 Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
  34. Altmetric Badge
    Chapter 33 Very Sparse Leaf Languages
  35. Altmetric Badge
    Chapter 34 On the Correlation Between Parity and Modular Polynomials
  36. Altmetric Badge
    Chapter 35 Optimally Fast Data Gathering in Sensor Networks
  37. Altmetric Badge
    Chapter 36 Magic Numbers in the State Hierarchy of Finite Automata
  38. Altmetric Badge
    Chapter 37 Online Single Machine Batch Scheduling
  39. Altmetric Badge
    Chapter 38 Machines that Can Output Empty Words
  40. Altmetric Badge
    Chapter 39 Completeness of Global Evaluation Logic
  41. Altmetric Badge
    Chapter 40 NOF-Multiparty Information Complexity Bounds for Pointer Jumping
  42. Altmetric Badge
    Chapter 41 Dimension Characterizations of Complexity Classes
  43. Altmetric Badge
    Chapter 42 Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
  44. Altmetric Badge
    Chapter 43 An Expressive Temporal Logic for Real Time
  45. Altmetric Badge
    Chapter 44 On Matroid Representability and Minor Problems
  46. Altmetric Badge
    Chapter 45 Non-cooperative Tree Creation
  47. Altmetric Badge
    Chapter 46 Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
  48. Altmetric Badge
    Chapter 47 Reductions for Monotone Boolean Circuits
  49. Altmetric Badge
    Chapter 48 Generalised Integer Programming Based on Logically Defined Relations
  50. Altmetric Badge
    Chapter 49 Probabilistic Length-Reducing Automata
  51. Altmetric Badge
    Chapter 50 Sorting Long Sequences in a Single Hop Radio Network
  52. Altmetric Badge
    Chapter 51 Systems of Equations over Finite Semigroups and the #CSP Dichotomy Conjecture
  53. Altmetric Badge
    Chapter 52 Valiant’s Model: From Exponential Sums to Exponential Products
  54. Altmetric Badge
    Chapter 53 A Reachability Algorithm for General Petri Nets Based on Transition Invariants
  55. Altmetric Badge
    Chapter 54 Approximability of Bounded Occurrence Max Ones
  56. Altmetric Badge
    Chapter 55 Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
  57. Altmetric Badge
    Chapter 56 Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
  58. Altmetric Badge
    Chapter 57 Quantum Weakly Nondeterministic Communication Complexity
  59. Altmetric Badge
    Chapter 58 Minimal Chordal Sense of Direction and Circulant Graphs
  60. Altmetric Badge
    Chapter 59 Querying and Embedding Compressed Texts
  61. Altmetric Badge
    Chapter 60 Lempel-Ziv Dimension for Lempel-Ziv Compression
  62. Altmetric Badge
    Chapter 61 Characterizing Valiant’s Algebraic Complexity Classes
  63. Altmetric Badge
    Chapter 62 The Price of Defense
  64. Altmetric Badge
    Chapter 63 The Data Complexity of MDatalog in Basic Modal Logics
  65. Altmetric Badge
    Chapter 64 The Complexity of Counting Functions with Easy Decision Version
  66. Altmetric Badge
    Chapter 65 On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
  67. Altmetric Badge
    Chapter 66 Constrained Minimum Enclosing Circle with Center on a Query Line Segment
  68. Altmetric Badge
    Chapter 67 Hierarchical Unambiguity
  69. Altmetric Badge
    Chapter 68 An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
  70. Altmetric Badge
    Chapter 69 On Genome Evolution with Innovation
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
2 X users
wikipedia
6 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
37 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 2006
Published by
Springer Science & Business Media, August 2006
DOI 10.1007/11821069
ISBNs
978-3-54-037791-7, 978-3-54-037793-1
Editors

Královič, Rastislav, Urzyczyn, Paweł

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 37 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Portugal 1 3%
France 1 3%
Brazil 1 3%
Japan 1 3%
Unknown 33 89%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 7 19%
Researcher 5 14%
Student > Master 3 8%
Student > Postgraduate 2 5%
Professor 2 5%
Other 4 11%
Unknown 14 38%
Readers by discipline Count As %
Computer Science 11 30%
Engineering 4 11%
Agricultural and Biological Sciences 3 8%
Mathematics 2 5%
Unspecified 2 5%
Other 1 3%
Unknown 14 38%