Moses Charikar
Ronald Fagin
Venkatesan Guruswami
Jon Kleinberg
Prabhakar Raghavan
- 1.A. Blum, P. Chalasani, D. Coppersmith, W. Pulleyblank, P. Raghavan and M. Sudan, "The minimum latency problem," Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, 163-171.]] Google Scholar
Digital Library
- 2.A. Borodin, R. E1-Yaniv, On-Line Computation and Competitive Analysis, Cambridge University Press, 1998.]] Google ScholarDigital Library
- 3.B. Bollobas, Extremal Graph Theory, Academic Press, 1978.]] Google ScholarDigital Library
- 4.Clickshare Service Corp., www.clickshare.com.]]Google Scholar
- 5.O. Etzioni, S. Hanks, T Jiang, R.M. Karp, O. Madani, O. Waarts, "Efficient information gathering on the internet," Proc. IEEE FOCS 1996.]] Google ScholarDigital Library
- 6.H. Garcia-Molina, S. Ketchpel, N. Shivakumar, "Safeguarding and Charging for Information on the Internet," Proc. Intl. Conf. on Data Engineering, 1998.]] Google ScholarDigital Library
- 7.R. Heiman, A. Wigderson, "Randomized vs. Deterministic Decision Tree Complexity for Read-Once Boolean Functions," Complexity Theory, to appear.]]Google Scholar
- 8.J. Koml6s, Y. Ma, E. SzemenSdi, "Matching nuts and bolts in O(n log n) time," Proc. ACM-SIAM SODA 1996.]] Google ScholarDigital Library
- 9.E. Koutsoupias, C. Papadimitriou, M. Yannakakis, "Searching a fixed graph," Proc. Intl. Conf. on Automata, Languages, and Programming 1996.]] Google ScholarDigital Library
- 10.D. Kreps, A Course in Micro-Economic Theory, Princeton University Press, 1990.]]Google Scholar
- 11.R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.]] Google ScholarDigital Library
- 12.Pricing Economic Access to Knowledge (PEAK) Home Page, http://www, lib. umich.edu/libhome/peak/papers.html.]]Google Scholar
- 13.S. Sairamesh, C. Nikolaou, D. F. Ferguson and Y. Yemini. Economic Framework for Pricing and Charging in Digital Libraries. D-Lib Magazine, February 1996.]]Google Scholar
- 14.M. Saks, A. Wigderson, "Probabilistic Boolean decision trees and the complexity of evaluating game trees;' Proc. IEEE FOCS, 1986.]]Google Scholar
- 15.M. Snir, "Lower bounds on probabilistic linear decision trees," Theoretical Computer Science 38(1985), pp. 69-82.]]Google ScholarCross Ref
- 16.D. Tygar, "NetBill: An Internet Commerce System Optimized for Network-Delivered Systems" IEEE Personal Communications 2(1995), pp. 20-25.]]Google Scholar
- 17."What's the Value of Digital Information?", panel at ICEE Conf. on Electronic Commerce: Foundations for the Future, 1999.]]Google Scholar
- 18.Y. Zhang, "On the optimality of randomized alpha-beta search," SIAM Journal on Computing 24(1995), pp. 138-147.]] Google ScholarDigital Library
Index Terms
- Query strategies for priced information (extended abstract)
Recommendations
Note. Optimal Promotion Strategies: A Demand-Sided Characterization
We generalize Narasimhan's Narasimhan, Chakravarthi. 1988. Competitive promotional strategies. J. Bus.614 427-449. model of retail promotion to include multiple products and general demand functions. Doing so allows us to further characterize optimal ...
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
Data Mining Using Classification Techniques in Query Processing Strategies
AICCSA '01: Proceedings of the ACS/IEEE International Conference on Computer Systems and ApplicationsAbstract: Given a query, there are many different query-processing strategies to fulfill user requirement. The selective of tuples are from 0% t o 100%. The found set of relation will determine the different of query processing strategies being ...
Comments