( en | de | ru )

 

Disambiguation of "Cunto, Walter"

Author of the publication

copydeleteadd this publication to your clipboard
Average Case Selection

, and . STOC, page 369-375. ACM, (1984)

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. You can also use the button next to the name to display some publications already assigned to the person.

Johanna-Julia Walter

Der Einfluss von IL-10 auf die allergeninduzierte IL-4- und IL-13-Freisetzung aus basophilen Granulozyten von Patienten mit Wespengiftallergie. Uni München, (2009)

Walter Eisenbach

Walter Ellerkamp

Walter Elting

Walter Enders

 

Other publications of authors with the same name

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