↓ Skip to main content

Structural Information and Communication Complexity

Overview of attention for book
Cover of 'Structural Information and Communication Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Space Lower Bounds for Low-Stretch Greedy Embeddings
  3. Altmetric Badge
    Chapter 2 The Fault Tolerant Capacitated k -Center Problem
  4. Altmetric Badge
    Chapter 3 Notions of Connectivity in Overlay Networks
  5. Altmetric Badge
    Chapter 4 Changing of the Guards: Strip Cover with Duty Cycling
  6. Altmetric Badge
    Chapter 5 Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring
  7. Altmetric Badge
    Chapter 6 An Algorithm for Online Facility Leasing
  8. Altmetric Badge
    Chapter 7 Structural Information and Communication Complexity
  9. Altmetric Badge
    Chapter 8 Bounding Interference in Wireless Ad Hoc Networks with Nodes in Random Position
  10. Altmetric Badge
    Chapter 9 Strong Connectivity of Sensor Networks with Double Antennae
  11. Altmetric Badge
    Chapter 10 Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks under the SINR Model
  12. Altmetric Badge
    Chapter 11 Wireless Network Stability in the SINR Model
  13. Altmetric Badge
    Chapter 12 What Can Be Computed without Communications?
  14. Altmetric Badge
    Chapter 13 On Bidimensional Congestion Games
  15. Altmetric Badge
    Chapter 14 Mobile Network Creation Games
  16. Altmetric Badge
    Chapter 15 Homonyms with Forgeable Identifiers
  17. Altmetric Badge
    Chapter 16 Asynchrony and Collusion in the N-party BAR Transfer Problem
  18. Altmetric Badge
    Chapter 17 Early Deciding Synchronous Renaming in O( logf ) Rounds or Less
  19. Altmetric Badge
    Chapter 18 On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)
  20. Altmetric Badge
    Chapter 19 Self-stabilizing (k,r)-Clustering in Clock Rate-Limited Systems
  21. Altmetric Badge
    Chapter 20 Increasing the Power of the Iterated Immediate Snapshot Model with Failure Detectors
  22. Altmetric Badge
    Chapter 21 Improved Approximation for Orienting Mixed Graphs
  23. Altmetric Badge
    Chapter 22 Analysis of Random Walks Using Tabu Lists
  24. Altmetric Badge
    Chapter 23 Online Graph Exploration with Advice
  25. Altmetric Badge
    Chapter 24 Asynchronous Exploration of an Unknown Anonymous Dangerous Graph with O (1) Pebbles
  26. Altmetric Badge
    Chapter 25 Time of Anonymous Rendezvous in Trees: Determinism vs. Randomization
  27. Altmetric Badge
    Chapter 26 Randomized Rendezvous of Mobile Agents in Anonymous Unidirectional Ring Networks
  28. Altmetric Badge
    Chapter 27 Getting Close without Touching
  29. Altmetric Badge
    Chapter 28 Gathering of Robots on Anonymous Grids without Multiplicity Detection
Attention for Chapter 23: Online Graph Exploration with Advice
Altmetric Badge

About this Attention Score

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

Mentioned by

wikipedia
1 Wikipedia page

Readers on

mendeley
20 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
Online Graph Exploration with Advice
Chapter number 23
Book title
Structural Information and Communication Complexity
Published in
Lecture notes in computer science, June 2012
DOI 10.1007/978-3-642-31104-8_23
Book ISBNs
978-3-64-231103-1, 978-3-64-231104-8
Authors

Stefan Dobrev, Rastislav Královič, Euripides Markou

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 5%
Unknown 19 95%

Demographic breakdown

Readers by professional status Count As %
Student > Master 6 30%
Student > Ph. D. Student 5 25%
Researcher 3 15%
Student > Bachelor 2 10%
Professor 2 10%
Other 0 0%
Unknown 2 10%
Readers by discipline Count As %
Computer Science 13 65%
Engineering 4 20%
Psychology 1 5%
Unknown 2 10%
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 15 May 2020.
All research outputs
#7,453,479
of 22,786,691 outputs
Outputs from Lecture notes in computer science
#2,486
of 8,125 outputs
Outputs of similar age
#54,693
of 163,848 outputs
Outputs of similar age from Lecture notes in computer science
#21
of 60 outputs
Altmetric has tracked 22,786,691 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 8,125 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 55% 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 163,848 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 47th percentile – i.e., 47% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 60 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 50% of its contemporaries.