Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

ICALP
2005
Springer

favoriteEmaildiscussreport

95views Programming Languages» more ICALP 2005»

Optimal Cover Time for a Graph-Based Coupon Collector Process

13 years 10 months ago

Optimal Cover Time for a Graph-Based Coupon Collector Process

Download www.cs.utexas.edu

Nedialko B. Dimitrov, C. Greg Plaxton

Real-time Traffic

ICALP 2005 | Theoretical Computer Science |

claim paper

Related Content

» Solving the Coupon Collectors Problem for the Safety Beaconing in the IEEE 80211p WAVE

» When Random Play is Optimal Against an Adversary

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	ICALP
Authors	Nedialko B. Dimitrov, C. Greg Plaxton

Comments (0)