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.

 

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

Average Case Selection, и . STOC, стр. 369-375. ACM, (1984)Two Hybrid Methods for Collision Resolution in Open Addressing Hashing., и . SWAT, том 318 из Lecture Notes in Computer Science, стр. 113-119. Springer, (1988)Binary Searching with Nonuniform Costs and Its Application to Text Retrieval., , , , и . Algorithmica, 27 (2): 145-169 (2000)A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of Numbers., , и . IFIP Congress (1), том A-12 из IFIP Transactions, стр. 443-448. North-Holland, (1992)Proximity Matching Using Fixed-Queries Trees., , , и . CPM, том 807 из Lecture Notes in Computer Science, стр. 198-212. Springer, (1994)The Complexity of Collapsing Reachability Graphs., , , и . Automatic Verification Methods for Finite State Systems, том 407 из Lecture Notes in Computer Science, стр. 264-274. Springer, (1989)A Case Study in Comparison Based Complexity: Finding the Nearest Value(s)., , и . WADS, том 519 из Lecture Notes in Computer Science, стр. 1-12. Springer, (1991)Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations., , и . WADS, том 382 из Lecture Notes in Computer Science, стр. 24-38. Springer, (1989)Optimal binary search trees with costs depending on the access paths., , , , , и . Theor. Comput. Sci., 290 (3): 1799-1814 (2003)New Parallel Newton-Raphson Methods and Their Implementations with Accumulate Instructions.. Applications in Parallel and Distributed Computing, том A-44 из IFIP Transactions, стр. 53-62. North-Holland, (1994)