↓ Skip to main content
What is this page? Embed badge

Algorithm Engineering

Overview of attention for book
Cover of 'Algorithm Engineering'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Selecting Problems for Algorithm Evaluation
  3. Altmetric Badge
    Chapter 2 BSP Algorithms — “Write Once, Run Anywhere”
  4. Altmetric Badge
    Chapter 3 Ten Years of LEDA: Some Thoughts
  5. Altmetric Badge
    Chapter 4 Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison
  6. Altmetric Badge
    Chapter 5 Efficient Implementation of Lazy Suffix Trees
  7. Altmetric Badge
    Chapter 6 Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism
  8. Altmetric Badge
    Chapter 7 Finding Minimum Congestion Spanning Trees
  9. Altmetric Badge
    Chapter 8 Evaluation of an Algorithm for the Transversal Hypergraph Problem
  10. Altmetric Badge
    Chapter 9 Construction Heuristics and Domination Analysis for the Asymmetric TSP
  11. Altmetric Badge
    Chapter 10 Counting in Mobile Networks: Theory and Experimentation
  12. Altmetric Badge
    Chapter 11 Dijkstra’s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
  13. Altmetric Badge
    Chapter 12 Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
  14. Altmetric Badge
    Chapter 13 On-Line Zone Construction in Arrangements of Lines in the Plane
  15. Altmetric Badge
    Chapter 14 The Design and Implementation of Planar Maps in CGAL
  16. Altmetric Badge
    Chapter 15 An Easy to Use Implementation of Linear Perturbations within C upgal
  17. Altmetric Badge
    Chapter 16 Analysing Cache Effects in Distribution Sorting
  18. Altmetric Badge
    Chapter 17 Fast Regular Expression Search
  19. Altmetric Badge
    Chapter 18 An Experimental Evaluation of Hybrid Data Structures for Searching
  20. Altmetric Badge
    Chapter 19 LEDA-SM: Extending LEDA to Secondary Memory
  21. Altmetric Badge
    Chapter 20 A Priority Queue Transform
  22. Altmetric Badge
    Chapter 21 Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks
  23. Altmetric Badge
    Chapter 22 Estimating Large Distances in Phylogenetic Reconstruction
  24. Altmetric Badge
    Chapter 23 The Performance of Concurrent Red-Black Tree Algorithms
  25. Altmetric Badge
    Chapter 24 Performance Engineering Case Study: Heap Construction
  26. Altmetric Badge
    Chapter 25 A Fast and Simple Local Search for Graph Coloring
  27. Altmetric Badge
    Chapter 26 BALL: Biochemical Algorithms Library
  28. Altmetric Badge
    Chapter 27 An Experimental Study of Priority Queues in External Memory
Attention for Chapter 10: Counting in Mobile Networks: Theory and Experimentation
Altmetric Badge

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
1 Mendeley
Summary Dimensions citations
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
Counting in Mobile Networks: Theory and Experimentation
Chapter number 10
Book title
Algorithm Engineering
Published by
Springer, Berlin, Heidelberg, July 1999
DOI 10.1007/3-540-48318-7_10
Book ISBNs
978-3-54-066427-7, 978-3-54-048318-2
Authors

K. Hatzis, G. Pentaris, P. Spirakis, B. Tampakas, Hatzis, K., Pentaris, G., Spirakis, P., Tampakas, B.

View on publisher site
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 %
Student > Ph. D. Student 2 200%
Readers by discipline Count As %
Computer Science 1 100%
Psychology 1 100%

This page is provided by Altmetric.