Author:
Friedrich Tobias,Sauerwald Thomas,Vilenchik Dan
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the icp algorithm, with an application to the k-means method. In: 47th IEEE Symp. on Found. of Comp. Science (FOCS 2006), pp. 153–164 (2006)
2. Aspnes, J., Herlihy, M., Shavit, N.: Counting networks. J. of the ACM 41(5), 1020–1048 (1994)
3. Bertsekas, D., Tsitsiklis, J.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific (1997)
4. Bohman, T., Frieze, A., Martin, R.: How many random edges make a dense graph hamiltonian? Random Structures and Algorithms 22(1), 33–42 (2003)
5. Coja-Oghlan, A., Feige, U., Frieze, A., Krivelevich, M., Vilenchik, D.: On smoothed k-CNF formulas and the walksat algorithm. In: 20th ACM-SIAM Symp. on Discrete Algorithms (SODA 2009) (2009)