↓ Skip to main content

Mathematical Foundations of Computer Science 1994

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 55 Models, languages, and compiler technology for high performance computers
  3. Altmetric Badge
    Chapter 56 On NC-real complexity classes for additive circuits and their relations with NC
  4. Altmetric Badge
    Chapter 57 E-complete sets do not have optimal polynomial time approximations
  5. Altmetric Badge
    Chapter 58 Solving polynomial fixed point equations
  6. Altmetric Badge
    Chapter 59 Capturing complexity classes with Lindström quantifiers
  7. Altmetric Badge
    Chapter 60 Communication throughput of interconnection networks
  8. Altmetric Badge
    Chapter 61 Intuitive counterexamples for constructive fallacies
  9. Altmetric Badge
    Chapter 62 Algebraic methods in the compositional analysis of logic programs
  10. Altmetric Badge
    Chapter 63 Longest common subsequences
  11. Altmetric Badge
    Chapter 64 Towards DNA sequencing chips
  12. Altmetric Badge
    Chapter 65 On-line scheduling of parallel jobs
  13. Altmetric Badge
    Chapter 66 Mathematical Foundations of Computer Science 1994
  14. Altmetric Badge
    Chapter 67 A Competitive analysis of the list update problem with lookahead
  15. Altmetric Badge
    Chapter 68 May and must convergency in concurrent λ-calculus
  16. Altmetric Badge
    Chapter 69 Genericity and measure for exponential time
  17. Altmetric Badge
    Chapter 70 Analysis of bounded disorder
  18. Altmetric Badge
    Chapter 71 On languages accepted with simultaneous complexity bounds and their ranking problem
  19. Altmetric Badge
    Chapter 72 A proof system for asynchronously communicating deterministic processes
  20. Altmetric Badge
    Chapter 73 Embedding complete binary trees into star networks
  21. Altmetric Badge
    Chapter 74 Inductive counting below logspace
  22. Altmetric Badge
    Chapter 75 Decision problems for edge grammars
  23. Altmetric Badge
    Chapter 76 “The big sweep”: On the power of the wavefront approach to Voronoi diagrams
  24. Altmetric Badge
    Chapter 77 Reliable minimum finding comparator networks
  25. Altmetric Badge
    Chapter 78 On parallel complexity of maximum f -matching and the degree sequence problem
  26. Altmetric Badge
    Chapter 79 A comparison of two lower bound methods for communication complexity
  27. Altmetric Badge
    Chapter 80 Efficient solving of the word equations in one variable
  28. Altmetric Badge
    Chapter 81 A π-calculus with explicit substitutions: The late semantics
  29. Altmetric Badge
    Chapter 82 Processes and hyperuniverses
  30. Altmetric Badge
    Chapter 83 The combinatorial complexity of a finite string
  31. Altmetric Badge
    Chapter 84 A fully abstract semantics for termination in Petri nets
  32. Altmetric Badge
    Chapter 85 Passive and active rules in deductive databases
  33. Altmetric Badge
    Chapter 86 Combinatorial results on the complexity of teaching and learning
  34. Altmetric Badge
    Chapter 87 Degrees and reducibilities of easy tally sets
  35. Altmetric Badge
    Chapter 88 MSO definable text languages
  36. Altmetric Badge
    Chapter 89 Two lower bounds on distributive generation of languages
  37. Altmetric Badge
    Chapter 90 Rational rewriting
  38. Altmetric Badge
    Chapter 91 On the size of independent systems of equations in semigroups
  39. Altmetric Badge
    Chapter 92 On a sublinear time parallel construction of optimal binary search trees
  40. Altmetric Badge
    Chapter 93 Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
  41. Altmetric Badge
    Chapter 94 The relationship between gossiping in vertex-disjoint paths mode and bisection width
  42. Altmetric Badge
    Chapter 95 A comparison of finite and cellular automata
  43. Altmetric Badge
    Chapter 96 Empty alternation
  44. Altmetric Badge
    Chapter 97 On the minimization problem for ω-automata
  45. Altmetric Badge
    Chapter 98 On the complexity of constructing optimal ordered binary decision diagrams
  46. Altmetric Badge
    Chapter 99 Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach
  47. Altmetric Badge
    Chapter 100 A completeness theorem for nondeterministic Kleene algebras
  48. Altmetric Badge
    Chapter 101 How a rainbow coloring function can simulate wait-free handshaking
  49. Altmetric Badge
    Chapter 102 Critical pairs in term graph rewriting
  50. Altmetric Badge
    Chapter 103 Read-write causality
  51. Altmetric Badge
    Chapter 104 Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable
  52. Altmetric Badge
    Chapter 105 Complexity of EOL structural equivalence
  53. Altmetric Badge
    Chapter 106 Shorter queues for permutation routing on meshes
  54. Altmetric Badge
    Chapter 107 Full abstraction for the second order subset of an ALGOL-like language
  55. Altmetric Badge
    Chapter 108 The finest homophonic partition and related code concepts
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 (84th percentile)
  • Good Attention Score compared to outputs of the same age and source (71st percentile)

Mentioned by

wikipedia
1 Wikipedia page
q&a
1 Q&A thread
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 1994
Published by
Lecture notes in computer science, January 1994
DOI 10.1007/3-540-58338-6
ISBNs
978-3-54-058338-7, 978-3-54-048663-3
Editors

Prívara, Igor, Rovan, Branislav, Ruzička, Peter

Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 6. 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 29 December 2020.
All research outputs
#5,951,748
of 24,038,559 outputs
Outputs from Lecture notes in computer science
#1,759
of 8,177 outputs
Outputs of similar age
#10,999
of 73,645 outputs
Outputs of similar age from Lecture notes in computer science
#5
of 14 outputs
Altmetric has tracked 24,038,559 research outputs across all sources so far. Compared to these this one has done well and is in the 75th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,177 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has done well, scoring higher than 78% 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 73,645 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 84% of its contemporaries.
We're also able to compare this research output to 14 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 71% of its contemporaries.