Randomized algorithms-Reference-Cited by-同舟云学术

Randomized algorithms

Published:1996-03 Issue:1 Volume:28 Page:33-37
ISSN:0360-0300
Container-title:ACM Computing Surveys
language:en
Short-container-title:ACM Comput. Surv.

Author:

Motwani Rajeev¹,Raghavan Prabhakar²

Affiliation:

1. Department of Computer Science, Stanford University, Stanford, California

2. IBM Almaden Research Center, San Jose, California

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Reference29 articles.

1. ALON N. AND SPENCER J. 1992. The Probabilistic Method. Wiley New York. ALON N. AND SPENCER J. 1992. The Probabilistic Method. Wiley New York.

2. Factoring polynomials over large finite fields;BERLEKAMP E.R.;Math. Comput.,1970

3. Universal classes of hash functions;CARTER J. L.;J. Cornput. Syst. Sci.,1979

4. Computability by probabilistic machines. In Automata Studies, C. E. Shannon and J. McCarthy, Eds., Princeton University Press, Princeton;DE LEEUW K.;NJ,1955

Cited by 85 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bounding Random Test Set Size with Computational Learning Theory;Proceedings of the ACM on Software Engineering;2024-07-12

2. Classification of Load Balancing Optimization Algorithms in Cloud Computing: A Survey Based on Methodology;Wireless Personal Communications;2024-06

3. A Meta-Learning Framework for Tuning Parameters of Protection Mechanisms in Trustworthy Federated Learning;ACM Transactions on Intelligent Systems and Technology;2024-05-17

4. Automated data-driven and stochastic imputation method;Association Rule Mining and Data Mining - Recent Advances, New Perspectives and Applications [Working Title];2024-02-06

5. Efficient Verifiable Cloud-Assisted PSI Cardinality for Privacy-Preserving Contact Tracing;IEEE Transactions on Cloud Computing;2024-01