↓ Skip to main content

SOFSEM 2009: Theory and Practice of Computer Science

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A New Analysis of Expected Revenue
  3. Altmetric Badge
    Chapter 2 Can Component/Service-Based Systems Be Proved Correct?
  4. Altmetric Badge
    Chapter 3 Probabilistic Acceptors for Languages over Infinite Words
  5. Altmetric Badge
    Chapter 4 Automatic Verification of Heap Manipulation Using Separation Logic
  6. Altmetric Badge
    Chapter 5 Technology Diffusion in Social Networks
  7. Altmetric Badge
    Chapter 6 Service Oriented Architecture Pitfalls
  8. Altmetric Badge
    Chapter 7 Algorithms for Solving Infinite Games
  9. Altmetric Badge
    Chapter 8 Randomness and Determination, from Physics and Computing towards Biology
  10. Altmetric Badge
    Chapter 9 When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
  11. Altmetric Badge
    Chapter 10 On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
  12. Altmetric Badge
    Chapter 11 Framed Versus Unframed Two-Dimensional Languages
  13. Altmetric Badge
    Chapter 12 Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
  14. Altmetric Badge
    Chapter 13 The Shortcut Problem – Complexity and Approximation
  15. Altmetric Badge
    Chapter 14 Green Computing: Energy Consumption Optimized Service Hosting
  16. Altmetric Badge
    Chapter 15 On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
  17. Altmetric Badge
    Chapter 16 Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
  18. Altmetric Badge
    Chapter 17 Epistemic Strategies and Games on Concurrent Processes
  19. Altmetric Badge
    Chapter 18 On Finite Bases for Weak Semantics: Failures Versus Impossible Futures
  20. Altmetric Badge
    Chapter 19 On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
  21. Altmetric Badge
    Chapter 20 Time and Fairness in a Process Algebra with Non-blocking Reading
  22. Altmetric Badge
    Chapter 21 Expressiveness of Multiple Heads in CHR
  23. Altmetric Badge
    Chapter 22 Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
  24. Altmetric Badge
    Chapter 23 A Framework for Mutant Genetic Generation for WS-BPEL
  25. Altmetric Badge
    Chapter 24 Implementing Services by Partial State Machines
  26. Altmetric Badge
    Chapter 25 Pattern Matching with Swaps for Short Patterns in Linear Time
  27. Altmetric Badge
    Chapter 26 Automatic Bug Detection in Microcontroller Software by Static Program Analysis
  28. Altmetric Badge
    Chapter 27 On the Unification of Process Semantics: Observational Semantics
  29. Altmetric Badge
    Chapter 28 Factoring and Testing Primes in Small Space
  30. Altmetric Badge
    Chapter 29 Adaptive Incentive-Compatible Sponsored Search Auction
  31. Altmetric Badge
    Chapter 30 Semantically-Aided Data-Aware Service Workflow Composition
  32. Altmetric Badge
    Chapter 31 Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time
  33. Altmetric Badge
    Chapter 32 Abstract Storage Devices
  34. Altmetric Badge
    Chapter 33 On Stateless Deterministic Restarting Automata
  35. Altmetric Badge
    Chapter 34 User Care Preference-Based Semantic Service Discovery in a Ubiquitous Environment
  36. Altmetric Badge
    Chapter 35 Safe Reasoning with Logic LTS
  37. Altmetric Badge
    Chapter 36 Partial Order Semantics of Types of Nets
  38. Altmetric Badge
    Chapter 37 A Problem Kernelization for Graph Packing
  39. Altmetric Badge
    Chapter 38 $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
  40. Altmetric Badge
    Chapter 39 Conjunctive Grammars with Restricted Disjunction
  41. Altmetric Badge
    Chapter 40 Modelling and Verifying Mobile Systems Using π-Graphs
  42. Altmetric Badge
    Chapter 41 On Some SAT-Variants over Linear Formulas
  43. Altmetric Badge
    Chapter 42 The Simple Reachability Problem in Switch Graphs
  44. Altmetric Badge
    Chapter 43 Unambiguous Erasing Morphisms in Free Monoids
  45. Altmetric Badge
    Chapter 44 An Efficient Symbolic Elimination Algorithm for the Stochastic Process Algebra Tool CASPA
  46. Altmetric Badge
    Chapter 45 Asynchronous Deterministic Rendezvous on the Line
  47. Altmetric Badge
    Chapter 46 Design Validation by Symbolic Simulation and Equivalence Checking: A Case Study in Memory Optimization for Image Manipulation
  48. Altmetric Badge
    Chapter 47 Group Input Machine
  49. Altmetric Badge
    Chapter 48 From Outermost Termination to Innermost Termination
  50. Altmetric Badge
    Chapter 49 Improved Algorithms for the 2-Vertex Disjoint Paths Problem
  51. Altmetric Badge
    Chapter 50 Event-Clock Visibly Pushdown Automata
  52. Altmetric Badge
    Chapter 51 A Machine Checked Soundness Proof for an Intermediate Verification Language
  53. Altmetric Badge
    Chapter 52 Symbolic State-Space Generation of Asynchronous Systems Using Extensible Decision Diagrams
  54. Altmetric Badge
    Chapter 53 Symbolic Reachability Analysis of Integer Timed Petri Nets
  55. Altmetric Badge
    Chapter 54 On Toda’s Theorem in Structural Communication Complexity
  56. Altmetric Badge
    Chapter 55 The Minimum Reload s-t Path/Trail/Walk Problems
  57. Altmetric Badge
    Chapter 56 Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression
  58. Altmetric Badge
    Chapter 57 A New Family of Regular Operators Fitting with the Position Automaton Computation
  59. Altmetric Badge
    Chapter 58 A Formal Model of Business Application Integration from Web Services (Position Paper)
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (71st percentile)
  • Good Attention Score compared to outputs of the same age and source (67th percentile)

Mentioned by

twitter
2 X users
q&a
1 Q&A thread

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
14 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
SOFSEM 2009: Theory and Practice of Computer Science
Published by
ADS, January 2009
DOI 10.1007/978-3-540-95891-8
ISBNs
978-3-54-095890-1, 978-3-54-095891-8
Editors

Mogens Nielsen, Antonín Kučera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tůma, Frank Valencia

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

Geographical breakdown

Country Count As %
Unknown 14 100%

Demographic breakdown

Readers by professional status Count As %
Other 1 7%
Student > Master 1 7%
Unknown 12 86%
Readers by discipline Count As %
Mathematics 1 7%
Economics, Econometrics and Finance 1 7%
Unknown 12 86%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 4. 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 01 February 2015.
All research outputs
#7,034,523
of 23,023,224 outputs
Outputs from ADS
#8,728
of 37,450 outputs
Outputs of similar age
#46,397
of 170,111 outputs
Outputs of similar age from ADS
#277
of 902 outputs
Altmetric has tracked 23,023,224 research outputs across all sources so far. This one has received more attention than most of these and is in the 68th percentile.
So far Altmetric has tracked 37,450 research outputs from this source. They receive a mean Attention Score of 4.6. This one has done well, scoring higher than 75% 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 170,111 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 71% of its contemporaries.
We're also able to compare this research output to 902 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 67% of its contemporaries.