On the public citation graph
A Distributed Algorithm to Find Hamiltonian Cycles in $\mathcal{G}(n, p)$ Random Graphs
0 signed · 28 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.1002/rsa.10008openalex-snapshot
Distinctness of compositions of an integer: A probabilistic analysis
inferredcites →https://doi.org/10.1007/3-540-48686-0_1openalex-snapshot
The Web as a Graph: Measurements, Models, and Methods
inferredcites →https://doi.org/10.1007/bf02579321openalex-snapshot
An algorithm for finding hamilton paths and cycles in random graphs
inferredcites →https://doi.org/10.1016/0012-365x(89)90100-3openalex-snapshot
A simple linear expected time algorithm for finding a hamilton path
inferredcites →https://doi.org/10.1016/0020-0190(87)90229-8openalex-snapshot
Parallel algorithms for finding Hamilton cycles in random graphs
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1017/cbo9781139168724openalex-snapshot
Introduction to Distributed Algorithms
inferredcites →https://doi.org/10.1109/tmc.2003.1233525openalex-snapshot
A random graph model for optical networks of sensors
inferredcites →https://doi.org/10.1137/0216034openalex-snapshot
Expected Computation Time for Hamiltonian Path problem
inferredcites →https://doi.org/10.1142/s0129626400000329openalex-snapshot
FAULTY RANDOM GEOMETRIC NETWORKS
inferredcites →https://doi.org/10.1145/165231.165260openalex-snapshot
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
inferredcites →https://doi.org/10.1145/224964.225474openalex-snapshot
Optimal distributed algorithm for minimum spanning trees revisited
inferredcites →https://doi.org/10.1145/28395.28421openalex-snapshot
Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems
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.1007/978-3-030-03232-6_5openalex-snapshot
A $$O(\log n)$$ Distributed Algorithm to Construct Routing Structures for Pub/Sub Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-01341-6_2openalex-snapshot
Distributed and Recursive Parameter Estimation
inferred← citeshttps://doi.org/10.1016/j.automatica.2011.08.032openalex-snapshot
Quantized consensus in Hamiltonian graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.037openalex-snapshot
Distributed algorithms for random graphs
inferred← citeshttps://doi.org/10.1109/jsac.2005.843546openalex-snapshot
Quantized incremental algorithms for distributed optimization
inferred← citeshttps://doi.org/10.1109/mobhoc.2006.278567openalex-snapshot
Building Ring-Like Overlays on Wireless Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1109/tpds.2008.257openalex-snapshot
Building Ring-Like Overlays on Wireless Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1214/08-ba319openalex-snapshot
Model-based analysis of concept maps
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5608openalex-snapshot
Cooperative Visual Monitoring in Energy-Constrained Wireless Sensor 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.