Publication Details
Title: Tight Bounds for the Cover Time of Multiple Random Walks
Author: R. Elsässer and T. Sauerwald
Group: Algorithms
Date: July 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/tightbounds09.pdf
Overview:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426
Bibliographic Reference:
R. Elsässer and T. Sauerwald. Tight Bounds for the Cover Time of Multiple Random Walks. Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426, July 2009
Author: R. Elsässer and T. Sauerwald
Group: Algorithms
Date: July 2009
PDF: http://www.icsi.berkeley.edu/pubs/algorithms/tightbounds09.pdf
Overview:
This work was partially funded by the Deutscher Akademischer Austausch Diesnst (DAAD) through a postdoctoral fellowship.
Bibliographic Information:
Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426
Bibliographic Reference:
R. Elsässer and T. Sauerwald. Tight Bounds for the Cover Time of Multiple Random Walks. Proceedings of the 36th International Colloquium on Automata, Languages, and Programming (ICALP 2009), Rhodes, Greece, pp. 415-426, July 2009