Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Peter Sanders, Rudolf Fleischer. Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms. In Stefan Näher, Dorothea Wagner, editors, Algorithm Engineering, 4th International Workshop, WAE 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Volume 1982 of Lecture Notes in Computer Science, pages 135-146, Springer, 2000. [doi]

This author has not been identified. Look up 'Peter Sanders' in GoogleThis author has not been identified. Look up 'Rudolf Fleischer' in Google

runs on WebDSL