↓ Skip to main content

Mathematical Foundations of Computer Science 1995

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 109 Scheduling parallel communication: The h -relation problem
  3. Altmetric Badge
    Chapter 110 Decomposable structures, Boolean function representations, and optimization
  4. Altmetric Badge
    Chapter 111 The complexity of interval routing on random graphs
  5. Altmetric Badge
    Chapter 112 Bridging across the log(n) space frontier
  6. Altmetric Badge
    Chapter 113 Second order logic and the weak exponential hierarchies
  7. Altmetric Badge
    Chapter 114 On the computing paradigm and computational complexity
  8. Altmetric Badge
    Chapter 115 Ranked structures in nonmonotonic reasoning and belief revision: Abstract
  9. Altmetric Badge
    Chapter 116 Symbolic dynamics and finite automata
  10. Altmetric Badge
    Chapter 117 Lower bounds for propositional proofs and independence results in bounded arithmetic (abstract)
  11. Altmetric Badge
    Chapter 118 Physics and the new computation
  12. Altmetric Badge
    Chapter 119 Measure on P: Robustness of the notion
  13. Altmetric Badge
    Chapter 120 Comparing counting classes for logspace, one-way logspace, and first-order
  14. Altmetric Badge
    Chapter 121 Automata that take advice
  15. Altmetric Badge
    Chapter 122 Nonuniform lower bounds for exponential time classes
  16. Altmetric Badge
    Chapter 123 On a quantitative notion of uniformity
  17. Altmetric Badge
    Chapter 124 Separations by random oracles and “Almost” classes for generalized reducibilities
  18. Altmetric Badge
    Chapter 125 On the complexity of finite memory policies for Markov decision processes
  19. Altmetric Badge
    Chapter 126 Derandomization for sparse approximations and independent sets
  20. Altmetric Badge
    Chapter 127 Asymptotically efficient in-place merging
  21. Altmetric Badge
    Chapter 128 The complexity of the falsifiability problem for pure implicational formulas
  22. Altmetric Badge
    Chapter 129 Strong lower bounds on the approximability of some NPO PB-complete maximization problems
  23. Altmetric Badge
    Chapter 130 Some typical properties of large AND/OR Boolean formulas
  24. Altmetric Badge
    Chapter 131 The hedge: An efficient storage device for Turing machines with one head
  25. Altmetric Badge
    Chapter 132 Graph inference from a walk for trees of bounded degree 3 is NP-complete
  26. Altmetric Badge
    Chapter 133 Honeycomb networks
  27. Altmetric Badge
    Chapter 134 Witness-isomorphic reductions and the local search problem (extended abstract)
  28. Altmetric Badge
    Chapter 135 Multiple product modulo arbitrary numbers
  29. Altmetric Badge
    Chapter 136 Lower bounds for the majority communication complexity of various graph accessibility problems
  30. Altmetric Badge
    Chapter 137 Strong optimal lower bounds for Turing machines that accept nonregular languages
  31. Altmetric Badge
    Chapter 138 A superpolynomial lower bound for (1,+ k(n) )-branching programs
  32. Altmetric Badge
    Chapter 139 Deterministic parsing for augmented context-free grammars
  33. Altmetric Badge
    Chapter 140 A periodicity theorem on words and applications
  34. Altmetric Badge
    Chapter 141 A new approach to analyse Coupled-Context-Free languages
  35. Altmetric Badge
    Chapter 142 Computational complexity of simultaneous elementary matching problems
  36. Altmetric Badge
    Chapter 143 Graph reducibility of term rewriting systems
  37. Altmetric Badge
    Chapter 144 Positive recursive type assignment
  38. Altmetric Badge
    Chapter 145 String recognition on anonymous rings
  39. Altmetric Badge
    Chapter 146 The firing squad synchronization problem on Cayley graphs
  40. Altmetric Badge
    Chapter 147 Solving cheap graph problems on Meshes
  41. Altmetric Badge
    Chapter 148 An elementary bisimulation decision procedure for arbitrary context-free processes
  42. Altmetric Badge
    Chapter 149 On congruences and partial orders
  43. Altmetric Badge
    Chapter 150 Performance preorder: Ordering processes with respect to speed
  44. Altmetric Badge
    Chapter 151 Towards a semantic theory of CML
  45. Altmetric Badge
    Chapter 152 Modular constructions of distributing automata
  46. Altmetric Badge
    Chapter 153 On the proof method for bisimulation
  47. Altmetric Badge
    Chapter 154 Towards a calculus of predicate transformers
  48. Altmetric Badge
    Chapter 155 An abstract account of composition
  49. Altmetric Badge
    Chapter 156 Syntax and semantics of Procol
  50. Altmetric Badge
    Chapter 157 Synthesizing distinguishing formulae for real time systems -extended abstract
  51. Altmetric Badge
    Chapter 158 From timed automata to logic — and back
  52. Altmetric Badge
    Chapter 159 Incremental model checking for decomposable structures
  53. Altmetric Badge
    Chapter 160 Automata for the modal μ-calculus and related results
  54. Altmetric Badge
    Chapter 161 A ν-calculus with local views for systems of sequential agents
  55. Altmetric Badge
    Chapter 162 An operator calculus approach to the evolution of dynamic data structures
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 tweeter

Readers on

mendeley
2 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 1995
Published by
Springer Science & Business Media, August 1995
DOI 10.1007/3-540-60246-1
ISBNs
978-3-54-060246-0, 978-3-54-044768-9
Editors

Wiedermann, Jiri, Hajek, Petr

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 50%
Unknown 1 50%
Readers by discipline Count As %
Computer Science 1 50%
Unknown 1 50%