↓ Skip to main content

Mathematical Foundations of Computer Science 2015

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Near-Optimal Asymmetric Binary Matrix Partitions
  3. Altmetric Badge
    Chapter 2 Dual VP Classes
  4. Altmetric Badge
    Chapter 3 On Tinhofer’s Linear Programming Approach to Isomorphism Testing
  5. Altmetric Badge
    Chapter 4 On the Complexity of Noncommutative Polynomial Factorization
  6. Altmetric Badge
    Chapter 5 An Algebraic Proof of the Real Number PCP Theorem
  7. Altmetric Badge
    Chapter 6 On the Complexity of Hub Labeling (Extended Abstract)
  8. Altmetric Badge
    Chapter 7 On the Complexity of Speed Scaling
  9. Altmetric Badge
    Chapter 8 Almost All Functions Require Exponential Energy
  10. Altmetric Badge
    Chapter 9 On Dynamic DFS Tree in Directed Graphs
  11. Altmetric Badge
    Chapter 10 Metric Dimension of Bounded Width Graphs
  12. Altmetric Badge
    Chapter 11 Equality, Revisited
  13. Altmetric Badge
    Chapter 12 Bounding the Clique-Width of H -free Chordal Graphs
  14. Altmetric Badge
    Chapter 13 New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory
  15. Altmetric Badge
    Chapter 14 QMA with Subset State Witnesses
  16. Altmetric Badge
    Chapter 15 Phase Transition for Local Search on Planted SAT
  17. Altmetric Badge
    Chapter 16 Optimal Bounds for Estimating Entropy with PMF Queries
  18. Altmetric Badge
    Chapter 17 Mutual Dimension and Random Sequences
  19. Altmetric Badge
    Chapter 18 Optimal Algorithms and a PTAS for Cost-Aware Scheduling
  20. Altmetric Badge
    Chapter 19 Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases
  21. Altmetric Badge
    Chapter 20 Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem
  22. Altmetric Badge
    Chapter 21 Network Creation Games: Think Global – Act Local
  23. Altmetric Badge
    Chapter 22 Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem
  24. Altmetric Badge
    Chapter 23 Efficient Computations over Encrypted Data Blocks
  25. Altmetric Badge
    Chapter 24 Polynomial Kernels for Weighted Problems
  26. Altmetric Badge
    Chapter 25 A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
  27. Altmetric Badge
    Chapter 26 Metastability of Asymptotically Well-Behaved Potential Games
  28. Altmetric Badge
    Chapter 27 The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
  29. Altmetric Badge
    Chapter 28 Parameterized Algorithms for Parity Games
  30. Altmetric Badge
    Chapter 29 Algorithmic Applications of Tree-Cut Width
  31. Altmetric Badge
    Chapter 30 Log-Concavity and Lower Bounds for Arithmetic Circuits
  32. Altmetric Badge
    Chapter 31 Easy Multiple-Precision Divisors and Word-RAM Constants
  33. Altmetric Badge
    Chapter 32 Visibly Counter Languages and the Structure of  $$\mathrm {NC}^{1}$$
  34. Altmetric Badge
    Chapter 33 The Price of Connectivity for Cycle Transversals
  35. Altmetric Badge
    Chapter 34 Upper and Lower Bounds on Long Dual Paths in Line Arrangements
  36. Altmetric Badge
    Chapter 35 A Numbers-on-Foreheads Game
  37. Altmetric Badge
    Chapter 36 Faster Lightweight Lempel-Ziv Parsing
  38. Altmetric Badge
    Chapter 37 Parallel Identity Testing for Skew Circuits with Big Powers and Applications
  39. Altmetric Badge
    Chapter 38 On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape
  40. Altmetric Badge
    Chapter 39 Densest Subgraph in Dynamic Graph Streams
  41. Altmetric Badge
    Chapter 40 The Offline Carpool Problem Revisited
  42. Altmetric Badge
    Chapter 41 On Sampling Simple Paths in Planar Graphs According to Their Lengths
  43. Altmetric Badge
    Chapter 42 Degree-Constrained Subgraph Reconfiguration is in P
  44. Altmetric Badge
    Chapter 43 Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
  45. Altmetric Badge
    Chapter 44 Efficient Equilibria in Polymatrix Coordination Games
  46. Altmetric Badge
    Chapter 45 Finding Consensus Strings with Small Length Difference Between Input and Solution Strings
  47. Altmetric Badge
    Chapter 46 Active Linking Attacks
  48. Altmetric Badge
    Chapter 47 On the Complexity of Master Problems
  49. Altmetric Badge
    Chapter 48 Efficient Algorithm for Computing All Low s - t Edge Connectivities in Directed Graphs
  50. Altmetric Badge
    Chapter 49 Maximum Minimal Vertex Cover Parameterized by Vertex Cover
  51. Altmetric Badge
    Chapter 50 Fast Dynamic Weight Matchings in Convex Bipartite Graphs
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 (82nd percentile)
  • Good Attention Score compared to outputs of the same age and source (75th percentile)

Mentioned by

twitter
2 X users
facebook
1 Facebook page
wikipedia
1 Wikipedia page
q&a
1 Q&A thread

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
3 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 2015
Published by
Lecture notes in computer science, January 2015
DOI 10.1007/978-3-662-48054-0
ISBNs
978-3-66-248053-3, 978-3-66-248054-0
Editors

Sannella, Donald T., Pighizzini, Giovanni, Italiano, Giuseppe F.

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 33%
Student > Master 1 33%
Unknown 1 33%
Readers by discipline Count As %
Physics and Astronomy 1 33%
Engineering 1 33%
Unknown 1 33%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 8. 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 November 2023.
All research outputs
#4,949,373
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#1,042
of 8,229 outputs
Outputs of similar age
#63,280
of 365,327 outputs
Outputs of similar age from Lecture notes in computer science
#64
of 257 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. Compared to these this one has done well and is in the 80th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,229 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has done well, scoring higher than 87% 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 365,327 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 82% of its contemporaries.
We're also able to compare this research output to 257 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 75% of its contemporaries.