SIGN IN
SIGN UP
On placing skips optimally in expectation
Full Text:
PDF
Buy this Article
Authors:
Flavio Chierichetti
Sapienza University of Rome, Via Salaria, Rome
Silvio Lattanzi
Sapienza University of Rome, Via Salaria, Rome
Federico Mari
Sapienza University of Rome, Via Salaria, Rome
Alessandro Panconesi
Sapienza University of Rome, Via Salaria, Rome
2008 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 18
· Downloads (cumulative): 336
· Citation Count: 7
Published in:
· Proceeding
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Pages 15-24
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-59593-927-2
doi>
10.1145/1341531.1341537
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
WSDM 2014
Share:
|
Tags:
algorithms
information search and retrieval
inverted index
lists, stacks, and queues
probabilistic analysis
skips
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder