↓ Skip to main content

SOFSEM 2014: Theory and Practice of Computer Science

Overview of attention for book
Cover of 'SOFSEM 2014: Theory and Practice of Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Open Services for Software Process Compliance Engineering
  3. Altmetric Badge
    Chapter 2 Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems
  4. Altmetric Badge
    Chapter 3 Advice Complexity: Quantitative Approach to A-Priori Information
  5. Altmetric Badge
    Chapter 4 Matching of Images of Non-planar Objects with View Synthesis
  6. Altmetric Badge
    Chapter 5 Agile Requirements Engineering: A Research Perspective
  7. Altmetric Badge
    Chapter 6 Fitting Planar Graphs on Planar Maps
  8. Altmetric Badge
    Chapter 7 Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth
  9. Altmetric Badge
    Chapter 8 Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem
  10. Altmetric Badge
    Chapter 9 On the Power of Advice and Randomization for the Disjoint Path Allocation Problem
  11. Altmetric Badge
    Chapter 10 Goal-Based Establishment of an Information Security Management System Compliant to ISO 27001
  12. Altmetric Badge
    Chapter 11 ProofBook: An Online Social Network Based on Proof-of-Work and Friend-Propagation
  13. Altmetric Badge
    Chapter 12 Platform Independent Software Development Monitoring: Design of an Architecture
  14. Altmetric Badge
    Chapter 13 Towards Unlocking the Full Potential of Multileaf Collimators
  15. Altmetric Badge
    Chapter 14 Parameterized Complexity of the Sparsest k -Subgraph Problem in Chordal Graphs
  16. Altmetric Badge
    Chapter 15 Error-Pruning in Interface Automata
  17. Altmetric Badge
    Chapter 16 Aspect-Driven Design of Information Systems
  18. Altmetric Badge
    Chapter 17 Exact Algorithms to Clique-Colour Graphs
  19. Altmetric Badge
    Chapter 18 Supporting Non-functional Requirements in Services Software Development Process: An MDD Approach
  20. Altmetric Badge
    Chapter 19 Safety Contracts for Timed Reactive Components in SysML
  21. Altmetric Badge
    Chapter 20 Graph Clustering with Surprise: Complexity and Exact Solutions
  22. Altmetric Badge
    Chapter 21 On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms
  23. Altmetric Badge
    Chapter 22 Active Learning of Recursive Functions by Ultrametric Algorithms
  24. Altmetric Badge
    Chapter 23 Efficient Error-Correcting Codes for Sliding Windows
  25. Altmetric Badge
    Chapter 24 Integrating UML Composite Structures and fUML
  26. Altmetric Badge
    Chapter 25 Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes
  27. Altmetric Badge
    Chapter 26 Bidimensionality of Geometric Intersection Graphs
  28. Altmetric Badge
    Chapter 27 Attack against a Pairing Based Anonymous Authentication Protocol
  29. Altmetric Badge
    Chapter 28 Finding Disjoint Paths in Split Graphs
  30. Altmetric Badge
    Chapter 29 A New Asymptotic Approximation Algorithm for 3-Dimensional Strip Packing
  31. Altmetric Badge
    Chapter 30 A Stronger Square Conjecture on Binary Words
  32. Altmetric Badge
    Chapter 31 DSL Based Platform for Business Process Management
  33. Altmetric Badge
    Chapter 32 Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints
  34. Altmetric Badge
    Chapter 33 Deterministic Verification of Integer Matrix Multiplication in Quadratic Time
  35. Altmetric Badge
    Chapter 34 Comparison of Genetic Algorithms for Trading Strategies
  36. Altmetric Badge
    Chapter 35 Probabilistic Admissible Encoding on Elliptic Curves - Towards PACE with Generalized Integrated Mapping
  37. Altmetric Badge
    Chapter 36 An Algebraic Framework for Modeling of Reactive Rule-Based Intelligent Agents
  38. Altmetric Badge
    Chapter 37 Parameterized Prefix Distance between Regular Languages
  39. Altmetric Badge
    Chapter 38 Ordered Restarting Automata for Picture Languages
  40. Altmetric Badge
    Chapter 39 Unary NFAs with Limited Nondeterminism
  41. Altmetric Badge
    Chapter 40 Recommending for Disloyal Customers with Low Consumption Rate
  42. Altmetric Badge
    Chapter 41 Security Constraints in Modeling of Access Control Rules for Dynamic Information Systems
  43. Altmetric Badge
    Chapter 42 A New Plane-Sweep Algorithm for the K -Closest-Pairs Query
  44. Altmetric Badge
    Chapter 43 Mastering Erosion of Software Architecture in Automotive Software Product Lines
  45. Altmetric Badge
    Chapter 44 Shortest Unique Substrings Queries in Optimal Time
  46. Altmetric Badge
    Chapter 45 Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages
Attention for Chapter 8: Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem
Altmetric Badge

Readers on

mendeley
1 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
Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem
Chapter number 8
Book title
SOFSEM 2014: Theory and Practice of Computer Science
Published by
Springer, Cham, January 2014
DOI 10.1007/978-3-319-04298-5_8
Book ISBNs
978-3-31-904297-8, 978-3-31-904298-5
Authors

Kfir Barhum

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%