Search results

0318535 - MÚ 2009 RIV DE eng C - Conference Paper (international conference)
Alon, N. - Avin, Ch. - Koucký, Michal - Kozma, G. - Lotker, Z. - Tuttle, M.R.
Many random walks are faster than one.
[Mnoho náhodných procházek je rychlejších než jedna.]
Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2008. Mnichov: ACM, 2008 - (Meyer, F.; Shavit, N.), s. 119-128. ISBN 978-1-59593-973-9.
[Annual ACM Symposium on Parallel Algorithms and Architectures SPAA 2008/20./. Mnichov (DE), 14.06.2008-16.06.2008]
R&D Projects: GA ČR GP201/07/P276
Institutional research plan: CEZ:AV0Z10190503
Keywords : random walks * cover time * speed-up
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0004967