↓ 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 Multi-party Pseudo-Telepathy
  3. Altmetric Badge
    Chapter 2 Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips
  4. Altmetric Badge
    Chapter 3 Shape Segmentation and Matching with Flow Discretization
  5. Altmetric Badge
    Chapter 4 Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content
  6. Altmetric Badge
    Chapter 5 Toward Optimal Motif Enumeration
  7. Altmetric Badge
    Chapter 6 Common-Deadline Lazy Bureaucrat Scheduling Problems
  8. Altmetric Badge
    Chapter 7 Bandwidth-Constrained Allocation in Grid Computing
  9. Altmetric Badge
    Chapter 8 Algorithms and Approximation Schemes for Minimum Lateness/Tardiness Scheduling with Rejection
  10. Altmetric Badge
    Chapter 9 Fast Algorithms for a Class of Temporal Range Queries
  11. Altmetric Badge
    Chapter 10 Distribution-Sensitive Binomial Queues
  12. Altmetric Badge
    Chapter 11 Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees
  13. Altmetric Badge
    Chapter 12 Extremal Configurations and Levels in Pseudoline Arrangements
  14. Altmetric Badge
    Chapter 13 Fast Relative Approximation of Potential Fields
  15. Altmetric Badge
    Chapter 14 The One-Round Voronoi Game Replayed
  16. Altmetric Badge
    Chapter 15 Integrated Prefetching and Caching with Read and Write Requests
  17. Altmetric Badge
    Chapter 16 Online Seat Reservations via Offline Seating Arrangements
  18. Altmetric Badge
    Chapter 17 Routing and Call Control Algorithms for Ring Networks
  19. Altmetric Badge
    Chapter 18 Algorithms and Models for Railway Optimization
  20. Altmetric Badge
    Chapter 19 Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles
  21. Altmetric Badge
    Chapter 20 Multi-way Space Partitioning Trees
  22. Altmetric Badge
    Chapter 21 Cropping-Resilient Segmented Multiple Watermarking
  23. Altmetric Badge
    Chapter 22 On Simultaneous Planar Graph Embeddings
  24. Altmetric Badge
    Chapter 23 Smoothed Analysis
  25. Altmetric Badge
    Chapter 24 Approximation Algorithm for Hotlink Assignments in Web Directories
  26. Altmetric Badge
    Chapter 25 Drawing Graphs with Large Vertices and Thick Edges
  27. Altmetric Badge
    Chapter 26 Semi-matchings for Bipartite Graphs and Load Balancing
  28. Altmetric Badge
    Chapter 27 The Traveling Salesman Problem for Cubic Graphs
  29. Altmetric Badge
    Chapter 28 Sorting Circular Permutations by Reversal
  30. Altmetric Badge
    Chapter 29 An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data
  31. Altmetric Badge
    Chapter 30 Dynamic Text and Static Pattern Matching
  32. Altmetric Badge
    Chapter 31 Real Two Dimensional Scaled Matching
  33. Altmetric Badge
    Chapter 32 Proximity Structures for Geometric Graphs
  34. Altmetric Badge
    Chapter 33 The Zigzag Path of a Pseudo-Triangulation
  35. Altmetric Badge
    Chapter 34 Alternating Paths along Orthogonal Segments
  36. Altmetric Badge
    Chapter 35 Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem
  37. Altmetric Badge
    Chapter 36 Chips on Wafers
  38. Altmetric Badge
    Chapter 37 A Model for Analyzing Black-Box Optimization
  39. Altmetric Badge
    Chapter 38 On the Hausdorff Voronoi Diagram of Point Clusters in the Plane
  40. Altmetric Badge
    Chapter 39 Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries
  41. Altmetric Badge
    Chapter 40 Significant-Presence Range Queries in Categorical Data
  42. Altmetric Badge
    Chapter 41 Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree
  43. Altmetric Badge
    Chapter 42 Parameterized Complexity of Directed Feedback Set Problems in Tournaments
  44. Altmetric Badge
    Chapter 43 Compact Visibility Representation and Straight-Line Grid Embedding of Plane Graphs
  45. Altmetric Badge
    Chapter 44 New Directions and New Challenges in Algorithm Design and Complexity, Parameterized
Attention for Chapter 1: Multi-party Pseudo-Telepathy
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

wikipedia
3 Wikipedia pages

Citations

dimensions_citation
3 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.
Chapter title
Multi-party Pseudo-Telepathy
Chapter number 1
Book title
Algorithms and Data Structures
Published in
arXiv, July 2003
DOI 10.1007/978-3-540-45078-8_1
Book ISBNs
978-3-54-040545-0, 978-3-54-045078-8
Authors

Gilles Brassard, Anne Broadbent, Alain Tapp, Brassard, Gilles, Broadbent, Anne, Tapp, Alain

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 %
Student > Ph. D. Student 3 21%
Researcher 3 21%
Student > Bachelor 2 14%
Student > Postgraduate 2 14%
Lecturer 1 7%
Other 0 0%
Unknown 3 21%
Readers by discipline Count As %
Computer Science 5 36%
Physics and Astronomy 3 21%
Arts and Humanities 2 14%
Psychology 1 7%
Design 1 7%
Other 0 0%
Unknown 2 14%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 26 March 2024.
All research outputs
#7,689,410
of 23,394,907 outputs
Outputs from arXiv
#171,743
of 964,928 outputs
Outputs of similar age
#16,974
of 49,568 outputs
Outputs of similar age from arXiv
#67
of 205 outputs
Altmetric has tracked 23,394,907 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 964,928 research outputs from this source. They receive a mean Attention Score of 3.9. This one has done well, scoring higher than 80% 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 49,568 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 205 others from the same source and published within six weeks on either side of this one. This one is in the 32nd percentile – i.e., 32% of its contemporaries scored the same or lower than it.