On the public citation graph

Bootstrapping a Hop-Optimal Network in the Weak Sensor Model

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-1784-8openalex-snapshot
Stochastic Analysis, Control, Optimization and Applications
inferredcites →https://doi.org/10.1007/978-1-4612-1784-8_33openalex-snapshot
Critical Power for Asymptotic Connectivity in Wireless Networks
inferredcites →https://doi.org/10.1016/0022-0000(92)90042-hopenalex-snapshot
On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
inferredcites →https://doi.org/10.1109/98.878532openalex-snapshot
Protocols for self-organization of a wireless sensor network
inferredcites →https://doi.org/10.1109/glocom.2001.965952openalex-snapshot
A Bluetooth scatternet formation algorithm
inferredcites →https://doi.org/10.1109/hicss.2002.993971openalex-snapshot
Bluenet - a new scatternet formation scheme
inferredcites →https://doi.org/10.1109/icc.2001.936316openalex-snapshot
Bluetrees-scatternet formation to enable Bluetooth-based ad hoc networks
inferredcites →https://doi.org/10.1109/icpp.2000.876141openalex-snapshot
Energy-efficient initialization protocols for radio networks with no collision detection
inferredcites →https://doi.org/10.1109/ipdps.2004.1303259openalex-snapshot
A new approach to device discovery and scatternet formation in bluetooth networks
inferredcites →https://doi.org/10.1145/1007352.1007441openalex-snapshot
Sharp thresholds For monotone properties in random geometric graphs
inferredcites →https://doi.org/10.1145/1024916.1024920openalex-snapshot
ALOHA packet system with and without slots and capture
inferredcites →https://doi.org/10.1145/1073814.1073842openalex-snapshot
Maximal independent sets in radio networks
inferredcites →https://doi.org/10.1145/778415.778433openalex-snapshot
The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
inferredcites →https://doi.org/10.1145/989459.989473openalex-snapshot
Localized algorithms for energy efficient topology in wireless ad hoc networks
inferredcites →https://doi.org/10.5555/1070432.1070575openalex-snapshot
The bin-covering technique for thresholding random geometric graph properties

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11682462_42openalex-snapshot
Lower Bounds for Clear Transmissions in Radio Networks
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_210openalex-snapshot
Local Computation in Unstructured Radio Networks
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_210openalex-snapshot
Local Computation in Unstructured Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_49openalex-snapshot
Initializing Sensor Networks of Non-uniform Density in the Weak Sensor Model
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_9openalex-snapshot
Deterministic Communication in the Weak Sensor Model
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_22openalex-snapshot
Sensor Network Gossiping or How to Break the Broadcast Lower Bound
inferred← citeshttps://doi.org/10.1007/s00446-008-0070-4openalex-snapshot
Coloring unstructured radio networks
inferred← citeshttps://doi.org/10.1109/prdc.2009.63openalex-snapshot
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
inferred← citeshttps://doi.org/10.1145/1073970.1073977openalex-snapshot
Coloring unstructured radio networks
inferred← citeshttps://doi.org/10.1145/1597036.1597040openalex-snapshot
Bootstrapping a hop-optimal network in the weak sensor model
inferred← citeshttps://doi.org/10.1145/2755573.2755602openalex-snapshot
Electing a Leader in Wireless Networks Quickly Despite Jamming
inferred← citeshttps://doi.org/10.3929/ethz-a-005273546openalex-snapshot
Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks
inferred← citeshttps://doi.org/10.46298/dmtcs.2121openalex-snapshot
p-box: a new graph model
inferred← citeshttps://doi.org/10.46298/dmtcs.528openalex-snapshot
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network
inferred← citeshttps://doi.org/10.7282/t35d8s8xopenalex-snapshot
Algorithms and LP-duality based lower bounds in ad-hoc radio networks
inferred← citeshttps://doi.org/10.7282/t3pz5985openalex-snapshot
Upper and lower bounds in radio networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.