On the public citation graph

The Token Distribution Problem

0 signed · 92 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/bf02579166openalex-snapshot
Eigenvalues and expanders
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0304-3975(87)90069-7openalex-snapshot
The generalized packet routing problem
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1137/0216053openalex-snapshot
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
inferredcites →https://doi.org/10.1137/0605030openalex-snapshot
Explicit Concentrators from Generalized N -Gons
inferredcites →https://doi.org/10.1145/828.1892openalex-snapshot
Efficient Schemes for Parallel Communication
inferredcites →https://doi.org/10.1214/aoms/1177728178openalex-snapshot
On the Distribution of the Number of Successes in Independent Trials
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230220606openalex-snapshot
Scheduling file transfers in fully connected networks
inferred← citeshttps://doi.org/10.1002/rsa.3240050406openalex-snapshot
Near‐perfect token distribution
inferred← citeshttps://doi.org/10.1006/jcss.1996.0005openalex-snapshot
Self -Routing Superconcentrators
inferred← citeshttps://doi.org/10.1006/jcss.1996.0075openalex-snapshot
Dynamic Load Balancing by Random Matchings
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1007/11523468_112openalex-snapshot
Dynamic Diffusion Load Balancing
inferred← citeshttps://doi.org/10.1007/11558989_2openalex-snapshot
A Self-repairing Peer-to-Peer System Resilient to Dynamic Adversarial Churn
inferred← citeshttps://doi.org/10.1007/11602613_76openalex-snapshot
From Balls and Bins to Points and Vertices
inferred← citeshttps://doi.org/10.1007/11808107_13openalex-snapshot
Dependable Peer-to-Peer Systems Withstanding Dynamic Adversarial Churn
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_83openalex-snapshot
Near-perfect token distribution
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_27openalex-snapshot
Parallel architectures: Design and efficient use
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_89openalex-snapshot
Strongly adaptive token distribution
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_134openalex-snapshot
Implementing shared memory on multi-dimensional meshes and on the fat-tree
inferred← citeshttps://doi.org/10.1007/978-1-4757-6130-6_16openalex-snapshot
Some Strategies for Load Balancing
inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_4openalex-snapshot
Constant-Space Self-stabilizing Token Distribution in Trees
inferred← citeshttps://doi.org/10.1007/978-3-662-48653-5_36openalex-snapshot
Locally Optimal Load Balancing
inferred← citeshttps://doi.org/10.1007/bf01305311openalex-snapshot
Representing Shared Data on Distributed-Memory Parallel Computers
inferred← citeshttps://doi.org/10.1007/bf01955042openalex-snapshot
Strongly adaptive token distribution
inferred← citeshttps://doi.org/10.1007/bf02679461openalex-snapshot
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines
inferred← citeshttps://doi.org/10.1007/bfb0030677openalex-snapshot
Rapid convergence of a local load balancing algorithm for asynchronous rings
inferred← citeshttps://doi.org/10.1007/pl00009275openalex-snapshot
Efficient Algorithms for Dynamic Allocation of Distributed Memory
inferred← citeshttps://doi.org/10.1007/s00446-010-0099-zopenalex-snapshot
Towards worst-case churn resistant peer-to-peer systems
inferred← citeshttps://doi.org/10.1007/s00453-007-9081-yopenalex-snapshot
On the Stability of Dynamic Diffusion Load Balancing
inferred← citeshttps://doi.org/10.1007/s00453-019-00612-6openalex-snapshot
Local Algorithms for Sparse Spanning Graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90090-5openalex-snapshot
A note on the token distribution problem
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00208-1openalex-snapshot
Routing on trees
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90158-9openalex-snapshot
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
inferred← citeshttps://doi.org/10.1016/0743-7315(90)90074-yopenalex-snapshot
Time-optimal leader election in general networks
inferred← citeshttps://doi.org/10.1016/b978-1-4832-0772-8.50008-xopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.029openalex-snapshot
Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.03.011openalex-snapshot
Dimension-exchange algorithms for token distribution on tree-connected architectures
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.07.007openalex-snapshot
Self-stabilizing token distribution on trees with constant space
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00175-2openalex-snapshot
Balancing networks: State of the art
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00243-6openalex-snapshot
Rapid convergence of a local load balancing algorithm for asynchronous rings
inferred← citeshttps://doi.org/10.1080/01495730108941440openalex-snapshot
THE LOAD DISTRIBUTION PROBLEM IN A PROCESSOR RING
inferred← citeshttps://doi.org/10.1109/fpl.2006.311346openalex-snapshot
Placing Functionality in Fault-Tolerant Hardware/Software Reconfigurable Networks
inferred← citeshttps://doi.org/10.1109/fscs.1990.89548openalex-snapshot
Deterministic on-line routing on area-universal networks
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639292openalex-snapshot
A new analytical method for parallel, diffusion-type load balancing
inferred← citeshttps://doi.org/10.1109/ipps.1992.223050openalex-snapshot
Optimal deterministic task distribution for multiprocessors
inferred← citeshttps://doi.org/10.1109/ipps.1996.508114openalex-snapshot
Distributing tokens on a hypercube without error accumulation
inferred← citeshttps://doi.org/10.1109/ispan.1994.367149openalex-snapshot
An efficient algorithm for solving the token distribution problem on k-ary d-cube networks
inferred← citeshttps://doi.org/10.1109/iwqos.2006.250446openalex-snapshot
A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63508openalex-snapshot
Efficient simulations of small shared memories on bounded degree networks
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63509openalex-snapshot
On the network complexity of selection
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267757openalex-snapshot
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492468openalex-snapshot
Tight bounds for a distributed selection game with applications to fixed-connection machines
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238220openalex-snapshot
Stability and efficiency of a random local load balancing protocol
inferred← citeshttps://doi.org/10.1137/050639272openalex-snapshot
Stability of Load Balancing Algorithms in Dynamic Adversarial Systems
inferred← citeshttps://doi.org/10.1137/s0097539703437831openalex-snapshot
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input
inferred← citeshttps://doi.org/10.1137/s0097539789164765openalex-snapshot
Deterministic Simulations of PRAM s on Bounded Degree Networks
inferred← citeshttps://doi.org/10.1137/s0097539792232021openalex-snapshot
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
inferred← citeshttps://doi.org/10.1137/s0097539795290805openalex-snapshot
Optimal Construction of Edge-Disjoint Paths in Random Graphs
inferred← citeshttps://doi.org/10.1137/s0097539795292208openalex-snapshot
Tight Analyses of Two Local Load Balancing Algorithms
inferred← citeshttps://doi.org/10.1142/s0129054198000155openalex-snapshot
AN EXTENDED DIMENSION ORDER TOKEN DISTRIBUTION ALGORITHM ON k-Ary d-CUBES AND ITS COMPLEXITY
inferred← citeshttps://doi.org/10.1142/s0219265902000537openalex-snapshot
AN ADVERSARIAL MODEL FOR DISTRIBUTED DYNAMIC LOAD BALANCING
inferred← citeshttps://doi.org/10.1145/1150343.1150359openalex-snapshot
Dynamic task binding for hardware/software reconfigurable networks
inferred← citeshttps://doi.org/10.1145/129712.129727openalex-snapshot
Existence and construction of edge disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1145/129712.129768openalex-snapshot
Competitive distributed job scheduling (extended abstract)
inferred← citeshttps://doi.org/10.1145/167088.167195openalex-snapshot
Self-routing superconcentrators
inferred← citeshttps://doi.org/10.1145/167088.167237openalex-snapshot
How much can hardware help routing?
inferred← citeshttps://doi.org/10.1145/167088.167250openalex-snapshot
Approximate load balancing on dynamic and asynchronous networks
inferred← citeshttps://doi.org/10.1145/181014.181366openalex-snapshot
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
inferred← citeshttps://doi.org/10.1145/197917.198092openalex-snapshot
A combinatorial treatment of balancing networks
inferred← citeshttps://doi.org/10.1145/210346.210417openalex-snapshot
Deterministic on-line routing on area-universal networks
inferred← citeshttps://doi.org/10.1145/225058.225136openalex-snapshot
Many-to-one packet routing on grids
inferred← citeshttps://doi.org/10.1145/225058.225272openalex-snapshot
Tight analyses of two local load balancing algorithms
inferred← citeshttps://doi.org/10.1145/234752.234754openalex-snapshot
A combinatorial treatment of balancing networks
inferred← citeshttps://doi.org/10.1145/2503210.2503284openalex-snapshot
A distributed dynamic load balancer for iterative applications
inferred← citeshttps://doi.org/10.1145/265910.265922openalex-snapshot
How much can hardware help routing?
inferred← citeshttps://doi.org/10.1145/277651.277669openalex-snapshot
An adversarial model for distributed dynamic load balancing
inferred← citeshttps://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferred← citeshttps://doi.org/10.1145/3490148.3538561openalex-snapshot
Brief Announcement
inferred← citeshttps://doi.org/10.1145/509907.509968openalex-snapshot
Stability of load balancing algorithms in dynamic adversarial systems
inferred← citeshttps://doi.org/10.1145/97444.97708openalex-snapshot
Space-efficient representations of shared data for parallel computers
inferred← citeshttps://doi.org/10.29292/jics.v2i1.233openalex-snapshot
Communication Aware Optimization of the Task Binding in Hardware/Software Reconfigurable Networks
inferred← citeshttps://doi.org/10.3233/fi-1997-323406openalex-snapshot
Transition-optimal Token Distribution
inferred← citeshttps://doi.org/10.3390/e26040348openalex-snapshot
Bipartite Unique Neighbour Expanders via Ramanujan Graphs
inferred← citeshttps://doi.org/10.3929/ethz-a-004803263openalex-snapshot
Dynamic & fault-tolerant P2P-topologies
inferred← citeshttps://doi.org/10.4230/dagsemproc.06131.5openalex-snapshot
Taming Dynamic and Selfish Peers
inferred← citeshttps://doi.org/10.48550/arxiv.1909.06413openalex-snapshot
Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
inferred← citeshttps://doi.org/10.52396/justc-2023-0165openalex-snapshot
A new explicit construction of unique-neighbor expanders
inferred← citeshttps://doi.org/10.5555/1898953.1898988openalex-snapshot
A new analytical method for parallel, diffusion-type load balancing
inferred← citeshttps://doi.org/10.5555/314613.314726openalex-snapshot
Direct routing on trees
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.