Cycle detection using a stack

Information Processing Letters

Volumn 90, Issue 3, 2004, Pages 135-140

  Nivasch, Gabriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Algorithms; Analysis of algorithms; Cycle detection; Random function; Stack; Time memory tradeoff

Indexed keywords

ALGORITHMS; INFORMATION ANALYSIS; PROBABILITY;

ANALYSIS OF ALGORITHMS; CYCLE DETECTION; RANDOM FUNCTION; STACK; TIME/MEMORY TRADEOFF;

DATA PROCESSING;

EID: 1842610602     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.01.016     Document Type: Article

References (11)

1. Beeler M., Gosper R.W., Schroeppel R. HAKMEM. MIT Artificial Intelligence Lab Memo 239. 1972;MIT, Cambridge, MA. Item 132.
2. Berlekamp E.R., Conway J.H., Guy R.K. What is life? Winning Ways for your Mathematical Plays, II: Games in Particular. 1982;817-850 Academic Press, New York.
3. Brent R.P. An improved Monte Carlo factorization algorithm. BIT. 20:1980;176-184.
4. Knuth D.E. The Art of Computer Programming, vol. 1. third edition: 1997;Addison-Wesley, Reading, MA.
5. Knuth D.E. The Art of Computer Programming, vol. 2. third edition: 1997;Addison-Wesley, Reading, MA.
6. van Oorschot P.C., Wiener M.J. Parallel collision search with cryptanalytic applications. J. Cryptology. 12:1999;1-28.
7. Pollard J.M. A Monte Carlo method for factorization. BIT. 15:1975;331-334.
8. Pollard J.M. Monte Carlo methods for index computation (mod p). Math. Comp. 32:(143):1978;918-924.
9. J.-J. Quisquater, J.-P. Delescaille, How easy is collision search? Application to DES, in: Advances in Cryptology - Eurocrypt '89 Proceedings, in: Lecture Notes in Computer Science, vol. 434, Springer-Verlag, Berlin, pp. 429-434.
10. Sedgewick R., Szymanski T.G., Yao A.C. The complexity of finding cycles in periodic functions. SIAM J. Comput. 11:(2):1982;376-390.
11. D.P. Woodruff, Personal communication.