↓ Skip to main content

Algorithms and Data Structures

Overview of attention for book
Cover of 'Algorithms and Data Structures'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Approximation of Multiobjective Optimization Problems
  3. Altmetric Badge
    Chapter 2 Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs
  4. Altmetric Badge
    Chapter 3 Optimal Möbius Transformations for Information Visualization and Meshing
  5. Altmetric Badge
    Chapter 4 Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
  6. Altmetric Badge
    Chapter 5 On the Complexity of Scheduling Conditional Real-Time Code
  7. Altmetric Badge
    Chapter 6 Time Responsive External Data Structures for Moving Points
  8. Altmetric Badge
    Chapter 7 Voronoi Diagrams for Moving Disks and Applications
  9. Altmetric Badge
    Chapter 8 Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
  10. Altmetric Badge
    Chapter 9 Deciding Clique-Width for Graphs of Bounded Tree-Width
  11. Altmetric Badge
    Chapter 10 Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions
  12. Altmetric Badge
    Chapter 11 Optimization over Zonotopes and Training Support Vector Machines
  13. Altmetric Badge
    Chapter 12 Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
  14. Altmetric Badge
    Chapter 13 Seller-Focused Algorithms for Online Auctioning
  15. Altmetric Badge
    Chapter 14 Competitive Analysis of the LRFU Paging Algorithm
  16. Altmetric Badge
    Chapter 15 Admission Control to Minimize Rejections
  17. Altmetric Badge
    Chapter 16 Secure Multi-party Computational Geometry
  18. Altmetric Badge
    Chapter 17 The Grid Placement Problem
  19. Altmetric Badge
    Chapter 18 On the Reflexivity of Point Sets
  20. Altmetric Badge
    Chapter 19 A 7/8-Approximation Algorithm for Metric Max TSP
  21. Altmetric Badge
    Chapter 20 Approximating Multi-objective Knapsack Problems
  22. Altmetric Badge
    Chapter 21 Visual Ranking of Link Structures
  23. Altmetric Badge
    Chapter 22 A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
  24. Altmetric Badge
    Chapter 23 Short and Simple Labels for Small Distances and Other Functions
  25. Altmetric Badge
    Chapter 24 Fast Boolean Matrix Multiplication for Highly Clustered Data
  26. Altmetric Badge
    Chapter 25 Partitioning Colored Point Sets into Monochromatic Parts
  27. Altmetric Badge
    Chapter 26 The Analysis of a Probabilistic Approach to Nearest Neighbor Searching
  28. Altmetric Badge
    Chapter 27 I/O-Efficient Shortest Path Queries in Geometric Spanners
  29. Altmetric Badge
    Chapter 28 Higher-Dimensional Packing with Order Constraints
  30. Altmetric Badge
    Chapter 29 Bin Packing with Item Fragmentation
  31. Altmetric Badge
    Chapter 30 Practical Approximation Algorithms for Separable Packing Linear Programs
  32. Altmetric Badge
    Chapter 31 The Challenges of Delivering Content on the Internet
  33. Altmetric Badge
    Chapter 32 Upward Embeddings and Orientations of Undirected Planar Graphs
  34. Altmetric Badge
    Chapter 33 An Approach for Mixed Upward Planarization
  35. Altmetric Badge
    Chapter 34 A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study
  36. Altmetric Badge
    Chapter 35 Computing Phylogenetic Roots with Bounded Degrees and Errors
  37. Altmetric Badge
    Chapter 36 A Decomposition-Based Approach to Layered Manufacturing
  38. Altmetric Badge
    Chapter 37 When Can You Fold a Map?
  39. Altmetric Badge
    Chapter 38 Search Trees with Relaxed Balance and Near-Optimal Height
  40. Altmetric Badge
    Chapter 39 Succinct Dynamic Data Structures
  41. Altmetric Badge
    Chapter 40 Optimal Algorithms for Two-Guard Walkability of Simple Polygons
  42. Altmetric Badge
    Chapter 41 Movement Planning in the Presence of Flows
  43. Altmetric Badge
    Chapter 42 Small Maximal Independent Sets and Faster Exact Graph Coloring
  44. Altmetric Badge
    Chapter 43 On External-Memory Planar Depth First Search
Attention for Chapter 5: On the Complexity of Scheduling Conditional Real-Time Code
Altmetric Badge

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
4 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
On the Complexity of Scheduling Conditional Real-Time Code
Chapter number 5
Book title
Algorithms and Data Structures
Published by
Springer, Berlin, Heidelberg, August 2001
DOI 10.1007/3-540-44634-6_5
Book ISBNs
978-3-54-042423-9, 978-3-54-044634-7
Authors

Samarjit Chakraborty, Thomas Erlebach, Lothar Thiele

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Italy 1 25%
Unknown 3 75%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 50%
Other 1 25%
Unknown 1 25%
Readers by discipline Count As %
Computer Science 2 50%
Psychology 1 25%
Unknown 1 25%