×

Found 28 Documents (Results 1–28)

Networks of random cycles. (English) Zbl 1376.68017

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 933-944 (2011).
PDFBibTeX XMLCite
Full Text: Link

Cover time of a random graph with given degree sequence. (English) Zbl 1355.05230

Drmota, Michael (ed.) et al., Proceeding of the 21st international meeting on probabilistic, combinatorial, and asymptotic methods in the analysis of algorithms (AofA’10), Vienna, Austria, June 28 – July 2, 2010. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 1-20 (2010).
PDFBibTeX XMLCite
Full Text: Link

Martingales on trees and the empire chromatic number of random trees. (English) Zbl 1251.05055

Kutyłowski, Mirosław (ed.) et al., Fundamentals of computation theory. 17th international symposium, FCT 2009, Wrocław, Poland, September 2–4, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03408-4/pbk). Lecture Notes in Computer Science 5699, 74-83 (2009).
PDFBibTeX XMLCite
Full Text: DOI

Multiple random walks and interacting particle systems. (English) Zbl 1247.05222

Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-02929-5/pbk). Lecture Notes in Computer Science 5556, 399-410 (2009).
MSC:  05C81 60K35
PDFBibTeX XMLCite
Full Text: DOI

The cover time of random digraphs. (English) Zbl 1171.05417

Charikar, Moses (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 10th international workshop, APPROX 2007, and 11th international workshop, RANDOM 2007, Princeton, NJ, USA, August 20–22, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74207-4/pbk). Lecture Notes in Computer Science 4627, 422-435 (2007).
MSC:  05C80 60G50
PDFBibTeX XMLCite
Full Text: DOI

Sampling regular graphs and a peer-to-peer network. (English) Zbl 1297.05214

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 980-988 (2005).
MSC:  05C80 60J10 68R10
PDFBibTeX XMLCite

The cover time of sparse random graphs. (English) Zbl 1094.68607

Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 140-147 (2003).
MSC:  68R10 05C80 60G50
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field