According to our database1, Walter Cunto authored at least 19 papers between 1984 and 2003.
Legend:Book In proceedings Article PhD thesis Other
Optimal binary search trees with costs depending on the access paths.
Theor. Comput. Sci., 2003
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval.
The ADT Proximity and Text Proximity Problems.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999
Proximity Matching Using Fixed-Queries Trees.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994
New Parallel Newton-Raphson Methods and Their Implementations with Accumulate Instructions.
Proceedings of the Applications in Parallel and Distributed Computing, 1994
Selecting the Median and Two Quartiles in a Set of Numbers.
Softw., Pract. Exper., 1992
Unbalanced Multiway Trees Improved by Partial Expansions.
Acta Inf., 1992
GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization.
Proceedings of the Algorithm Theory, 1992
A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of Numbers.
Proceedings of the Algorithms, Software, Architecture, 1992
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Inf. Comput., June, 1991
Fplus: A Programming Environment for Scientific Applications.
IEEE Software, 1991
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).
Proceedings of the Algorithms and Data Structures, 1991
Average case selection.
J. ACM, 1989
Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations.
Proceedings of the Algorithms and Data Structures, 1989
The Complexity of Collapsing Reachability Graphs.
Proceedings of the Automatic Verification Methods for Finite State Systems, 1989
Transforming Unbalanced Multiway Trees into a Practical External Data Structure.
Acta Inf., 1988
Two Hybrid Methods for Collision Resolution in Open Addressing Hashing.
Proceedings of the SWAT 88, 1988
Improving Time and Space Efficiency in Generalized Binary Search Trees.
Acta Inf., 1987
Average Case Selection
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984