↓ Skip to main content

Mathematical Foundations of Computer Science 2013

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Alternation Trading Proofs and Their Limitations
  3. Altmetric Badge
    Chapter 2 Bin Packing Games with Selfish Items
  4. Altmetric Badge
    Chapter 3 A Constructive Proof of the Topological Kruskal Theorem
  5. Altmetric Badge
    Chapter 4 Logical and Structural Approaches to the Graph Isomorphism Problem
  6. Altmetric Badge
    Chapter 5 Prior-Free Auctions of Digital Goods
  7. Altmetric Badge
    Chapter 6 Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development
  8. Altmetric Badge
    Chapter 7 Clustering on k-Edge-Colored Graphs
  9. Altmetric Badge
    Chapter 8 How to Pack Your Items When You Have to Buy Your Knapsack
  10. Altmetric Badge
    Chapter 9 Computing Behavioral Distances, Compositionally
  11. Altmetric Badge
    Chapter 10 Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions?
  12. Altmetric Badge
    Chapter 11 Rewriting Guarded Negation Queries
  13. Altmetric Badge
    Chapter 12 Parity Games and Propositional Proofs
  14. Altmetric Badge
    Chapter 13 Logic and Branching Automata
  15. Altmetric Badge
    Chapter 14 A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items
  16. Altmetric Badge
    Chapter 15 Determinacy and Rewriting of Top-Down and MSO Tree Transformations
  17. Altmetric Badge
    Chapter 16 On the Speed of Constraint Propagation and the Time Complexity of Arc Consistency Testing
  18. Altmetric Badge
    Chapter 17 Validity of Tree Pattern Queries with Respect to Schema Information
  19. Altmetric Badge
    Chapter 18 Auctions for Partial Heterogeneous Preferences
  20. Altmetric Badge
    Chapter 19 New Polynomial Cases of the Weighted Efficient Domination Problem
  21. Altmetric Badge
    Chapter 20 Bringing Order to Special Cases of Klee’s Measure Problem
  22. Altmetric Badge
    Chapter 21 Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems
  23. Altmetric Badge
    Chapter 22 Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
  24. Altmetric Badge
    Chapter 23 Learning Reductions to Sparse Sets
  25. Altmetric Badge
    Chapter 24 Probabilistic Automata with Isolated Cut-Points
  26. Altmetric Badge
    Chapter 25 On Stochastic Games with Multiple Objectives
  27. Altmetric Badge
    Chapter 26 Minimal Indices for Successor Search
  28. Altmetric Badge
    Chapter 27 Paradigms for Parameterized Enumeration
  29. Altmetric Badge
    Chapter 28 Complexity of Checking Bisimilarity between Sequential and Parallel Processes
  30. Altmetric Badge
    Chapter 29 Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
  31. Altmetric Badge
    Chapter 30 Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees
  32. Altmetric Badge
    Chapter 31 Noninterference with Local Policies
  33. Altmetric Badge
    Chapter 32 In-Place Binary Counters
  34. Altmetric Badge
    Chapter 33 Rent or Buy Problems with a Fixed Time Horizon
  35. Altmetric Badge
    Chapter 34 On the Recognition of Four-Directional Orthogonal Ray Graphs
  36. Altmetric Badge
    Chapter 35 Reachability Analysis of Recursive Quantum Markov Chains
  37. Altmetric Badge
    Chapter 36 Ordering Metro Lines by Block Crossings
  38. Altmetric Badge
    Chapter 37 Reachability in Register Machines with Polynomial Updates
  39. Altmetric Badge
    Chapter 38 On the Parameterized Complexity of Cutting a Few Vertices from a Graph
  40. Altmetric Badge
    Chapter 39 On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant
  41. Altmetric Badge
    Chapter 40 A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems
  42. Altmetric Badge
    Chapter 41 Meta-kernelization with Structural Parameters
  43. Altmetric Badge
    Chapter 42 Separating Hierarchical and General Hub Labelings
  44. Altmetric Badge
    Chapter 43 Solving 3-Superstring in 3 n/3 Time
  45. Altmetric Badge
    Chapter 44 On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem
  46. Altmetric Badge
    Chapter 45 A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums
  47. Altmetric Badge
    Chapter 46 Polynomial Threshold Functions and Boolean Threshold Circuits
  48. Altmetric Badge
    Chapter 47 Reachability in Higher-Order-Counters
  49. Altmetric Badge
    Chapter 48 Length-Increasing Reductions for PSPACE-Completeness
  50. Altmetric Badge
    Chapter 49 Improved Complexity Results on k-Coloring P t -Free Graphs
  51. Altmetric Badge
    Chapter 50 A Polychromatic Ramsey Theory for Ordinals
  52. Altmetric Badge
    Chapter 51 Detecting Regularities on Grammar-Compressed Strings
  53. Altmetric Badge
    Chapter 52 Small Depth Proof Systems
  54. Altmetric Badge
    Chapter 53 Reversibility of Computations in Graph-Walking Automata
  55. Altmetric Badge
    Chapter 54 Prime Languages
  56. Altmetric Badge
    Chapter 55 Logical Aspects of the Lexicographic Order on 1-Counter Languages
  57. Altmetric Badge
    Chapter 56 Helly Circular-Arc Graph Isomorphism Is in Logspace
  58. Altmetric Badge
    Chapter 57 Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian
  59. Altmetric Badge
    Chapter 58 Strong Completeness for Markovian Logics
  60. Altmetric Badge
    Chapter 59 Arithmetic Branching Programs with Memory
  61. Altmetric Badge
    Chapter 60 Subexponential Algorithm for d-Cluster Edge Deletion: Exception or Rule?
  62. Altmetric Badge
    Chapter 61 Mathematical Foundations of Computer Science 2013
  63. Altmetric Badge
    Chapter 62 Revisiting Space in Proof Complexity: Treewidth and Pathwidth
  64. Altmetric Badge
    Chapter 63 Space-Efficient Parallel Algorithms for Combinatorial Search Problems
  65. Altmetric Badge
    Chapter 64 Separating Regular Languages by Piecewise Testable and Unambiguous Languages
  66. Altmetric Badge
    Chapter 65 An Unusual Temporal Logic
  67. Altmetric Badge
    Chapter 66 A More Efficient Simulation Algorithm on Kripke Structures
  68. Altmetric Badge
    Chapter 67 A Planarity Test via Construction Sequences
  69. Altmetric Badge
    Chapter 68 Feasible Combinatorial Matrix Theory
  70. Altmetric Badge
    Chapter 69 Approximation Algorithms for Generalized Plant Location
  71. Altmetric Badge
    Chapter 70 Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates
  72. Altmetric Badge
    Chapter 71 Improved Bounds for Reduction to Depth 4 and Depth 3
  73. Altmetric Badge
    Chapter 72 Parameterized Algorithms for Module Motif
  74. Altmetric Badge
    Chapter 73 On the Quantifier-Free Dynamic Complexity of Reachability
  75. Altmetric Badge
    Chapter 74 Erratum: A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items
Attention for Chapter 2: Bin Packing Games with Selfish Items
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
2 Dimensions

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.
Chapter title
Bin Packing Games with Selfish Items
Chapter number 2
Book title
Mathematical Foundations of Computer Science 2013
Published by
Springer Berlin Heidelberg, August 2015
DOI 10.1007/978-3-642-40313-2_2
Book ISBNs
978-3-64-240312-5, 978-3-64-240313-2
Authors

Leah Epstein

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 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 > Ph. D. Student 1 50%
Other 1 50%
Readers by discipline Count As %
Unknown 2 100%