Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
28
click to vote
COCOON
2010
Springer
favorite
Email
discuss
report
175
views
Combinatorics
»
more
COCOON 2010
»
The Cover Time of Deterministic Random Walks
14 years 1 months ago
Download
www.mpi-inf.mpg.de
Tobias Friedrich, Thomas Sauerwald
Real-time Traffic
COCOON 2010
|
Combinatorics
|
claim paper
Related Content
»
Stationary distribution and cover time of random walks on random digraphs
»
The Cover Time of Random Digraphs
»
Tight Bounds for the Cover Time of Multiple Random Walks
»
The cover time of sparse random graphs
»
The cover time of the giant component of a random graph
»
Improving partial cover of Random Walks in largescale Wireless Sensor Networks
»
CoverageAdaptive Random Walks for Fast Sensory Data Collection
»
Deterministic random walks on regular trees
»
Deterministic random walks on the integers
more »
Post Info
More Details (n/a)
Added
29 Sep 2010
Updated
29 Sep 2010
Type
Conference
Year
2010
Where
COCOON
Authors
Tobias Friedrich, Thomas Sauerwald
Comments
(0)
Researcher Info
Combinatorics Study Group
Computer Vision