Walter Cunto

According to our database, Walter Cunto authored at least 18 papers between 1987 and 2003.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2003

Optimal binary search trees with costs depending on the access paths.

Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani

Theor. Comput. Sci., 2003

2000

Binary Searching with Nonuniform Costs and Its Application to Text Retrieval.

Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto

Algorithmica, 2000

1999

The ADT Proximity and Text Proximity Problems.

Ricardo A. Baeza-Yates, Walter Cunto

Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

1994

Proximity Matching Using Fixed-Queries Trees.

Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

New Parallel Newton-Raphson Methods and Their Implementations with Accumulate Instructions.

Walter Cunto

Proceedings of the Applications in Parallel and Distributed Computing, 1994

1992

Selecting the Median and Two Quartiles in a Set of Numbers.

Walter Cunto, J. Ian Munro, Manuel Rey

Softw. Pract. Exp., 1992

Unbalanced Multiway Trees Improved by Partial Expansions.

Ricardo A. Baeza-Yates, Walter Cunto

Acta Informatica, 1992

GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization.

Walter Cunto, Vicente Yriarte

Proceedings of the Algorithm Theory, 1992

A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of Numbers.

Walter Cunto, S. Kashima, Manuel Rey

Proceedings of the Algorithms, Software, Architecture, 1992

1991

Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm

Walter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete

Inf. Comput., June, 1991

Fplus: A Programming Environment for Scientific Applications.

Walter Cunto, Jorge Araujo, Federico Giovannetti, Juan Rivero

IEEE Softw., 1991

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).

Walter Cunto, J. Ian Munro, Patricio V. Poblete

Proceedings of the Algorithms and Data Structures, 1991

1989

Average case selection.

Walter Cunto, J. Ian Munro

J. ACM, 1989

Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations.

Walter Cunto, Gustavo Lau, Philippe Flajolet

Proceedings of the Algorithms and Data Structures, 1989

The Complexity of Collapsing Reachability Graphs.

Sudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey

Proceedings of the Automatic Verification Methods for Finite State Systems, 1989

1988

Transforming Unbalanced Multiway Trees into a Practical External Data Structure.

Walter Cunto, Patricio V. Poblete

Acta Informatica, 1988

Two Hybrid Methods for Collision Resolution in Open Addressing Hashing.

Walter Cunto, Patricio V. Poblete

Proceedings of the SWAT 88, 1988

1987

Improving Time and Space Efficiency in Generalized Binary Search Trees.

Walter Cunto, Jose Luis Gascon

Acta Informatica, 1987