SIGN IN
SIGN UP
Query strategies for priced information (extended abstract)
Full Text:
PDF
Buy this Article
Authors:
Moses Charikar
Computer Science Department, Stanford University, CA
Ronald Fagin
IBM Almaden Reseach Center, 650 Harry Road, San Jose, CA
Venkatesan Guruswami
Laboratory for Computer Science, MIT, Cambridge, MA
Jon Kleinberg
Department of Computer Science, Cornell University, Ithaca, NY
Prabhakar Raghavan
IBM Almaden Reseach Center, 650 Harry Road, San Jose, CA
Amit Sahai
Laboratory for Computer Science, MIT, Cambridge, MA
2000 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 13
· Downloads (cumulative): 246
· Citation Count: 7
Published in:
· Proceeding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pages 582-591
ACM
New York, NY
, USA
©2000
table of contents
ISBN:1-58113-184-4
doi>
10.1145/335305.335382
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
design
graph and tree search strategies
management
performance
pricing and resource allocation
query processing
sorting and searching
theory
trees
verification
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