Walter Cunto - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2003

Optimal binary search trees with costs depending on the access pathsJayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani. TCS, 290(3):1799-1814, 2003.

2000

Binary Searching with Nonuniform Costs and Its Application to Text RetrievalGonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto. algorithmica, 27(2):145-169, 2000. [doi]

1999

The ADT Proximity and Text Proximity ProblemsRicardo A. Baeza-Yates, Walter Cunto. spire 1999: 24-30 [doi]

1994

Proximity Matching Using Fixed-Queries TreesRicardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu. cpm 1994: 198-212

New Parallel Newton-Raphson Methods and Their Implementations with Accumulate InstructionsWalter Cunto. apdc 1994: 53-62

1992

Unbalanced Multiway Trees Improved by Partial ExpansionsRicardo A. Baeza-Yates, Walter Cunto. ACTA, 29(5):443-460, 1992.

A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of NumbersWalter Cunto, S. Kashima, Manuel Rey. ifip 1992: 443-448

GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe ReorganizationWalter Cunto, Vicente Yriarte. swat 1992: 192-211

Selecting the Median and Two Quartiles in a Set of NumbersWalter Cunto, J. Ian Munro, Manuel Rey. SPE, 22(6):439-454, 1992.

1991

Fplus: A Programming Environment for Scientific ApplicationsWalter Cunto, Jorge Araujo, Federico Giovannetti, Juan Rivero. IEEE Software, 8(5):81-92, 1991.

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s)Walter Cunto, J. Ian Munro, Patricio V. Poblete. wads 1991: 1-12

Fringe Analysis for Extquick: An in Situ Distributive External Sorting AlgorithmWalter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete. iandc, 92(2):141-160, June 1991.

1989

The Complexity of Collapsing Reachability GraphsSudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey. avmfss 1990: 264-274

Analysis of KDT-Trees: KD-Trees Improved by Local ReogranisationsWalter Cunto, Gustavo Lau, Philippe Flajolet. wads 1989: 24-38

Average case selectionWalter Cunto, J. Ian Munro. JACM, 36(2):270-279, 1989. [doi]

1988

Two Hybrid Methods for Collision Resolution in Open Addressing HashingWalter Cunto, Patricio V. Poblete. swat 1988: 113-119

Transforming Unbalanced Multiway Trees into a Practical External Data StructureWalter Cunto, Patricio V. Poblete. ACTA, 26(3):193-211, 1988.

1987

Improving Time and Space Efficiency in Generalized Binary Search TreesWalter Cunto, Jose Luis Gascon. ACTA, 24(5):583-594, 1987.

1984

Average Case SelectionWalter Cunto, J. Ian Munro. stoc 1984: 369-375

Sign in or sign up to see more results.

runs on WebDSL