On the public citation graph
Quantized consensus in Hamiltonian graphs
0 signed · 60 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.1006/jcss.1996.0075openalex-snapshot
Dynamic Load Balancing by Random Matchings
inferredcites →https://doi.org/10.1007/11527954openalex-snapshot
Combinatorial and Algorithmic Aspects of Networking
inferredcites →https://doi.org/10.1007/11527954_7openalex-snapshot
A Distributed Algorithm to Find Hamiltonian Cycles in $\mathcal{G}(n, p)$ Random Graphs
inferredcites →https://doi.org/10.1007/3-540-56939-1_89openalex-snapshot
Strongly adaptive token distribution
inferredcites →https://doi.org/10.1007/978-3-540-70701-1_2openalex-snapshot
Efficient Quantization in the Average Consensus Problem
inferredcites →https://doi.org/10.1007/978-3-540-77294-1openalex-snapshot
Combinatorial and algorithmic aspects of networking : 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007 : revised papers
inferredcites →https://doi.org/10.1007/bf02579321openalex-snapshot
An algorithm for finding hamilton paths and cycles in random graphs
inferredcites →https://doi.org/10.1007/s00446-005-0130-yopenalex-snapshot
Self-stabilizing smoothing and balancing networks
inferredcites →https://doi.org/10.1016/0012-365x(83)90021-3openalex-snapshot
Limit distribution for the existence of hamiltonian cycles in a random graph
inferredcites →https://doi.org/10.1016/0012-365x(83)90046-8openalex-snapshot
On the existence of Hamiltonian cycles in a class of random graphs
inferredcites →https://doi.org/10.1016/0743-7315(89)90021-xopenalex-snapshot
Dynamic load balancing for distributed memory multiprocessors
inferredcites →https://doi.org/10.1016/j.automatica.2007.07.009openalex-snapshot
Communication constraints in the average consensus problem
inferredcites →https://doi.org/10.1016/j.automatica.2009.10.032openalex-snapshot
Gossip consensus algorithms via quantized communication
inferredcites →https://doi.org/10.1016/j.jpdc.2004.03.011openalex-snapshot
Dimension-exchange algorithms for token distribution on tree-connected architectures
inferredcites →https://doi.org/10.1016/j.sysconle.2004.02.022openalex-snapshot
Fast linear iterations for distributed averaging
inferredcites →https://doi.org/10.1016/j.sysconle.2006.06.005openalex-snapshot
Non-linear protocols for optimal distributed consensus in networks of dynamic agents
inferredcites →https://doi.org/10.1016/s0020-0190(99)00017-4openalex-snapshot
Meeting times of random walks on graphs
inferredcites →https://doi.org/10.1016/s0304-3975(99)00007-9openalex-snapshot
Optimal dimension-exchange token distribution on complete binary trees
inferredcites →https://doi.org/10.1109/12.238494openalex-snapshot
Embedding of cycles in arrangement graphs
inferredcites →https://doi.org/10.1109/acc.2009.5160485openalex-snapshot
On quantized consensus by means of gossip algorithm - Part I: Convergence proof
inferredcites →https://doi.org/10.1109/acc.2009.5160568openalex-snapshot
On quantized consensus by means of gossip algorithm - Part II: Convergence time
inferredcites →https://doi.org/10.1109/cca.2009.5281154openalex-snapshot
Hamiltonian quantized gossip
inferredcites →https://doi.org/10.1109/cdc.2007.4434904openalex-snapshot
Load balancing on networks with gossip-based distributed ]algorithms
inferredcites →https://doi.org/10.1109/cdc.2008.4738749openalex-snapshot
On the convergence time of distributed quantized averaging algorithms
inferredcites →https://doi.org/10.1109/empdp.1999.746661openalex-snapshot
On the performance of nearest-neighbors load balancing algorithms in parallel systems
inferredcites →https://doi.org/10.1109/icapp.1995.472203openalex-snapshot
Token distribution on reconfigurable d-dimensional meshes
inferredcites →https://doi.org/10.1109/mcs.1987.1105260openalex-snapshot
1987 american control conference
inferredcites →https://doi.org/10.1109/ssp.2007.4301337openalex-snapshot
Distributed Average Consensus using Probabilistic Quantization
inferredcites →https://doi.org/10.1109/tac.2003.812781openalex-snapshot
Coordination of groups of mobile autonomous agents using nearest neighbor rules
inferredcites →https://doi.org/10.1109/tac.2004.834113openalex-snapshot
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
inferredcites →https://doi.org/10.1109/tac.2005.864190openalex-snapshot
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
inferredcites →https://doi.org/10.1109/tac.2010.2042360openalex-snapshot
A Gossip-Based Algorithm for Discrete Consensus Over Heterogeneous Networks
inferredcites →https://doi.org/10.1109/tsp.2008.927071openalex-snapshot
Distributed Average Consensus With Dithered Quantization
inferredcites →https://doi.org/10.1137/s0097539795292208openalex-snapshot
Tight Analyses of Two Local Load Balancing Algorithms
inferredcites →https://doi.org/10.1145/112600.112623openalex-snapshot
On a random walk problem arising in self-stabilizing token management
inferredcites →https://doi.org/10.1147/sj.221.0047openalex-snapshot
A token-ring network for local data communications
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-01325-7_11openalex-snapshot
A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in $$O(\log n)$$ Time
inferred← citeshttps://doi.org/10.1016/j.automatica.2015.02.040openalex-snapshot
Fast discrete consensus based on gossip for makespan minimization in networked systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.110027openalex-snapshot
Quantized-output feedback model reference control of discrete-time linear systems
inferred← citeshttps://doi.org/10.1016/j.ifacol.2015.11.178openalex-snapshot
Distributed Task Assignment Based on Gossip with Guaranteed Performance on Heterogeneous Networks
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2017.08.003openalex-snapshot
Consensus analysis for multi-agent systems via periodic event-triggered algorithms with quantized information
inferred← citeshttps://doi.org/10.1016/j.nahs.2013.03.001openalex-snapshot
Gossip algorithms for heterogeneous multi-vehicle routing problems
inferred← citeshttps://doi.org/10.1016/j.nahs.2017.06.008openalex-snapshot
Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks
inferred← citeshttps://doi.org/10.1016/j.nahs.2021.101018openalex-snapshot
HMM-based quantized dissipative control for 2-D Markov jump systems
inferred← citeshttps://doi.org/10.1016/j.sysconle.2013.11.013openalex-snapshot
Quantized consensus over directed networks with switching topologies
inferred← citeshttps://doi.org/10.1016/j.sysconle.2017.03.012openalex-snapshot
Consensus in time-delayed multi-agent systems with quantized dwell times
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.09.020openalex-snapshot
A distributed algorithm for finding Hamiltonian cycles in random graphs in O ( log n ) time
inferred← citeshttps://doi.org/10.1049/iet-cta.2016.0425openalex-snapshot
Distributed event‐triggered consensus of general linear multi‐agent systems with quantised measurements
inferred← citeshttps://doi.org/10.1109/ascc.2013.6606094openalex-snapshot
Quantized-data consensus of second-order multi-agent systems with directed topology
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426703openalex-snapshot
A quantized consensus algorithm for distributed task assignment
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760177openalex-snapshot
Discrete consensus in networks with constrained capacity
inferred← citeshttps://doi.org/10.1109/med61351.2024.10566245openalex-snapshot
A MILP Scheduling Problem for Multi-Robot Logistics Systems in a Precision Farming Application and a Polynomial Time Optimal Algorithm
inferred← citeshttps://doi.org/10.1109/smc.2013.185openalex-snapshot
A Quantized Consensus Algorithm for a Multi-agent Assignment Problem
inferred← citeshttps://doi.org/10.1109/tac.2015.2440568openalex-snapshot
Convergence Time for Unbiased Quantized Consensus Over Static and Dynamic Networks
inferred← citeshttps://doi.org/10.1561/2600000019openalex-snapshot
On the Control of Multi-Agent Systems: A Survey
inferred← citeshttps://doi.org/10.3182/20120523-3-ro-2023.00085openalex-snapshot
A Distributed Consensus Algorithm for Task Allocation in Supply Chain Management
inferred← citeshttps://doi.org/10.3182/20120606-3-nl-3011.00071openalex-snapshot
A Gossip Algorithm for Heterogeneous Multi-Vehicle Routing Problems
inferred← citeshttps://doi.org/10.3182/20140824-6-za-1003.00902openalex-snapshot
Fast Discrete Consensus Based on Gossip for Makespan Optimization in Networked Systems
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.