From post

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Heuristics for Weighted Perfect Matching, , и . STOC, стр. 398-419. ACM, (1980)Aspects of insertion in random trees., и . Computing, 29 (1): 11-29 (1982)On Some Optimal Algorithms.. Cornell University, USA, (1971)Solution of a Divide-and-Conquer Maximin Recurrence., и . SIAM J. Comput., 18 (6): 1188-1200 (1989)Quicksort with Unreliable Comparisons: A Probabilistic Analysis., , , , , и . Comb. Probab. Comput., 13 (4-5): 419-449 (2004)On the Optimality of Some Set and Vector Algorithms. SWAT, стр. 68-71. IEEE Computer Society, (1970)Basic techniques for design and analysis of algorithms. ACM Comput. Surv., 28 (1): 19--21 (1996)The Average-Case Complexity of Determining the Majority., , и . SIAM J. Comput., 26 (1): 1-14 (1997)Combinatorial Algorithms: Theory and Practice, , и . Prentice Hall College Div, (1977)Establishing lower bounds on algorithms: a survey.. AFIPS Spring Joint Computing Conference, том 40 из AFIPS Conference Proceedings, стр. 471-481. AFIPS, (1972)