On the public citation graph
Locally Self-Adjusting Tree Networks
0 signed · 50 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-54233-7_180openalex-snapshot
Ordering problems approximated: single-processor scheduling and interval graph completion
inferredcites →https://doi.org/10.1007/978-3-642-02930-1_47openalex-snapshot
A Distributed and Oblivious Heap
inferredcites →https://doi.org/10.1007/bf00264563openalex-snapshot
Nearly optimal binary search trees
inferredcites →https://doi.org/10.1007/s00446-010-0099-zopenalex-snapshot
Towards worst-case churn resistant peer-to-peer systems
inferredcites →https://doi.org/10.1016/0890-5401(89)90067-9openalex-snapshot
Approximate counting, uniform generation and rapidly mixing Markov chains
inferredcites →https://doi.org/10.1016/j.ipl.2006.07.009openalex-snapshot
An improved approximation ratio for the minimum linear arrangement problem
inferredcites →https://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
inferredcites →https://doi.org/10.1093/oxfordjournals.molbev.a040454openalex-snapshot
The neighbor-joining method: a new method for reconstructing phylogenetic trees.
inferredcites →https://doi.org/10.1103/physreve.80.026114openalex-snapshot
Self-adjusting routing schemes for time-varying traffic in scale-free networks
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/tpds.2012.29openalex-snapshot
X-BOT: A Protocol for Resilient Optimization of Unstructured Overlay Networks
inferredcites →https://doi.org/10.1109/ucc.2012.7openalex-snapshot
Optimizing Long-Lived CloudNets with Migrations
inferredcites →https://doi.org/10.1137/0112012openalex-snapshot
Optimal Assignments of Numbers to Vertices
inferredcites →https://doi.org/10.1137/0607063openalex-snapshot
Optimal Numberings of an $N \times N$ Array
inferredcites →https://doi.org/10.1145/1109557.1109600openalex-snapshot
O (log log n )-competitive dynamic binary search trees
inferredcites →https://doi.org/10.1145/1582716.1582741openalex-snapshot
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
inferredcites →https://doi.org/10.1145/1592665.1592675openalex-snapshot
On the evolution of user interaction in Facebook
inferredcites →https://doi.org/10.1145/1851290.1851292openalex-snapshot
Energy-aware routing in data center network
inferredcites →https://doi.org/10.1145/2124436.2124449openalex-snapshot
Online strategies for intra and inter provider service migration in virtual networks
inferredcites →https://doi.org/10.1145/322092.322094openalex-snapshot
Self-Organizing Binary Search Trees
inferredcites →https://doi.org/10.1145/568522.568523openalex-snapshot
A survey of graph layout problems
inferredcites →https://doi.org/10.5555/1109557.1109600openalex-snapshot
O(log log n)-competitive dynamic binary search trees
inferredcites →https://doi.org/10.5555/1855711.1855728openalex-snapshot
ElasticTree: saving energy in data center networks
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_23openalex-snapshot
Self-adjusting Linear Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-34992-9_29openalex-snapshot
Self-adjusting Linear Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-03578-9_4openalex-snapshot
Self-adjusting Grid Networks to Minimize Expected Path Length
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_16openalex-snapshot
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2021.107623openalex-snapshot
An efficient node placement scheme to mitigate routing attacks in Internet of Battlefield Things
inferred← citeshttps://doi.org/10.1016/j.jvlc.2016.10.003openalex-snapshot
A systematic approach to constructing incremental topology control algorithms using graph transformation
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.036openalex-snapshot
Self-adjusting grid networks to minimize expected path length
inferred← citeshttps://doi.org/10.1109/icdcs.2017.249openalex-snapshot
Locally Self-Adjusting Skip Graphs
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10228883openalex-snapshot
OpticNet: Self-Adjusting Networks for ToR-Matching-ToR Optical Switching Architectures
inferred← citeshttps://doi.org/10.1109/p2p.2013.6688721openalex-snapshot
OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs
inferred← citeshttps://doi.org/10.1109/tnet.2015.2410313openalex-snapshot
SplayNet: Towards Locally Self-Adjusting Networks
inferred← citeshttps://doi.org/10.1109/ucc.2013.64openalex-snapshot
Strategies for Traffic-Aware VM Migration
inferred← citeshttps://doi.org/10.1145/3351452.3351464openalex-snapshot
Survey of Reconfigurable Data Center Networks
inferred← citeshttps://doi.org/10.1145/3498851.3499002openalex-snapshot
VHCN : A Hybrid Data Center Network Based on VLC Link
inferred← citeshttps://doi.org/10.35940/ijeat.b2005.1210220openalex-snapshot
Recommended System for Enhancing Tag Popularity in a Question Answering Community through Splay-net Techniques
inferred← citeshttps://doi.org/10.48550/arxiv.1309.5826openalex-snapshot
Simple Destination-Swap Strategies for Adaptive Intra- and Inter-Tenant VM Migration
inferred← citeshttps://doi.org/10.48550/arxiv.1704.00830openalex-snapshot
Locally Self-Adjusting Skip Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.07699openalex-snapshot
Locally Self-Adjusting Hypercubic 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.