Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Stutzbach, Daniel
Rejaie, Reza
Duffield, Nick
Sen, Subhabrata
and
Willinger, Walter
2006.
Sampling Techniques for Large, Dynamic Graphs.
p.
1.
Bayati, Mohsen
Kim, Jeong Han
and
Saberi, Amin
2007.
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques.
Vol. 4627,
Issue. ,
p.
326.
Aspnes, James
Rustagi, Navin
and
Saia, Jared
2007.
Principles of Distributed Systems.
Vol. 4878,
Issue. ,
p.
443.
Sauerwald, Thomas
2007.
Algorithms and Computation.
Vol. 4835,
Issue. ,
p.
196.
Greenhill, Catherine
Holt, Fred B.
and
Wormald, Nicholas
2008.
Expansion properties of a random regular graph after random vertex deletions.
European Journal of Combinatorics,
Vol. 29,
Issue. 5,
p.
1139.
Wouhaybi, Rita H.
and
Campbell, Andrew T.
2008.
Building resilient low-diameter peer-to-peer topologies.
Computer Networks,
Vol. 52,
Issue. 5,
p.
1019.
Bezáková, Ivona
and
Rummler, William A.
2009.
Mathematical Foundations of Computer Science 2009.
Vol. 5734,
Issue. ,
p.
137.
Stutzbach, D.
Rejaie, R.
Duffield, N.
Sen, S.
and
Willinger, W.
2009.
On Unbiased Sampling for Unstructured Peer-to-Peer Networks.
IEEE/ACM Transactions on Networking,
Vol. 17,
Issue. 2,
p.
377.
Datta, Souptik
and
Kargupta, Hillol
2009.
A communication efficient probabilistic algorithm for mining frequent itemsets from a peer‐to‐peer network.
Statistical Analysis and Data Mining: The ASA Data Science Journal,
Vol. 2,
Issue. 1,
p.
48.
Cooper, Colin
Dyer, Martin
and
Handley, Andrew J.
2009.
The flip markov chain and a randomising P2P protocol.
p.
141.
Gao, Pu
and
Wormald, Nicholas
2009.
Short cycle distribution in random regular graphs recursively generated by pegging.
Random Structures & Algorithms,
Vol. 34,
Issue. 1,
p.
54.
Bayati, Mohsen
Kim, Jeong Han
and
Saberi, Amin
2010.
A Sequential Algorithm for Generating Random Graphs.
Algorithmica,
Vol. 58,
Issue. 4,
p.
860.
Del Genio, Charo I.
Kim, Hyunju
Toroczkai, Zoltán
Bassler, Kevin E.
and
Rapallo, Fabio
2010.
Efficient and Exact Sampling of Simple Graphs with Given Arbitrary Degree Sequence.
PLoS ONE,
Vol. 5,
Issue. 4,
p.
e10012.
Hanusse, Nicolas
Ilcinkas, David
Kosowski, Adrian
and
Nisse, Nicolas
2010.
Locating a target with an agent guided by unreliable local advice.
p.
355.
Berger, Annabell
and
Müller-Hannemann, Matthias
2010.
Graph Theoretic Concepts in Computer Science.
Vol. 6410,
Issue. ,
p.
220.
Gurevich, Maxim
and
Keidar, Idit
2010.
Correctness of Gossip-Based Membership under Message Loss.
SIAM Journal on Computing,
Vol. 39,
Issue. 8,
p.
3830.
Tabourier, Lionel
Roth, Camille
and
Cointet, Jean-Philippe
2011.
Generating constrained random graphs using multiple edge switches.
ACM Journal of Experimental Algorithmics,
Vol. 16,
Issue. ,
Blitzstein, Joseph
and
Diaconis, Persi
2011.
A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees.
Internet Mathematics,
Vol. 6,
Issue. 4,
p.
489.
Berenbrink, Petra
Cooper, Colin
and
Friedetzky, Tom
2012.
Random walks which prefer unvisited edges..
p.
29.
Beber, Moritz Emanuel
Fretter, Christoph
Jain, Shubham
Sonnenschein, Nikolaus
Müller-Hannemann, Matthias
and
Hütt, Marc-Thorsten
2012.
Artefacts in statistical analyses of network motifs: general framework and application to metabolic networks.
Journal of The Royal Society Interface,
Vol. 9,
Issue. 77,
p.
3426.