Author:
Janakiram Virendra K.,Gehringer Edward F.,Agrawal Dharma P.,Mehrotra Ravi
Publisher
Springer Science and Business Media LLC
Subject
Information Systems,Theoretical Computer Science,Software
Reference29 articles.
1. A. C. Yao, Probabilistic Computations: Toward a Unified Measure of Complexity, inProc. 18th Annual IEEE Symp. on Fundamentals of Computer Science, New York, pp. 222–237 (1977).
2. W. Dobosiewicz, Sorting by Distributive Partitioning,Inf. Proc. Lett., Vol. 7, No. 1, (January 1978).
3. M. O. Ruban, Probabilistic Algorithm in Finite Fields, Technical Report, Massachusetts Institute of Technology (1979).
4. P. G. Spirakis, Probabilistic Algorithms, Algorithms with Random Inputs and Random Combinatorial Structures, Ph.D. thesis, Harvard University, Department of Mathematics (December 1981).
5. G. L. Thompson and S. Singhal, A Successful Algorithm for Solving Directed Hamiltonian Path Problems,Operations Research Letters,3(12):35–42 (April 1984).
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献