Walter Cunto

19 papers A* 1B 3Journal 9Unranked 6
YearRankTypeTitle / Venue / Authors
2003 J jnl
Optimal binary search trees with costs depending on the access paths.
Theor. Comput. Sci.
Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani
2000 J jnl
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval.
Algorithmica
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto
1999 — conf
The ADT Proximity and Text Proximity Problems.
SPIRE/CRIWG
Ricardo A. Baeza-Yates, Walter Cunto
1994 — conf
New Parallel Newton-Raphson Methods and Their Implementations with Accumulate Instructions.
Applications in Parallel and Distributed Computing
Walter Cunto
1994 B conf
Proximity Matching Using Fixed-Queries Trees.
CPM
Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu
1992 — conf
A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of Numbers.
IFIP Congress (1)
Walter Cunto, S. Kashima, Manuel Rey
1992 — conf
GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization.
SWAT
Walter Cunto, Vicente Yriarte
1992 J jnl
Selecting the Median and Two Quartiles in a Set of Numbers.
Softw. Pract. Exp.
Walter Cunto, J. Ian Munro, Manuel Rey
1992 J jnl
Unbalanced Multiway Trees Improved by Partial Expansions.
Acta Informatica
Ricardo A. Baeza-Yates, Walter Cunto
1991 B conf
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).
WADS
Walter Cunto, J. Ian Munro, Patricio V. Poblete
1991 J jnl
Fplus: A Programming Environment for Scientific Applications.
IEEE Softw.
Walter Cunto, Jorge Araujo, Federico Giovannetti, Juan Rivero
1991 J jnl
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Inf. Comput.
Walter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete
1989 B conf
Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations.
WADS
Walter Cunto, Gustavo Lau, Philippe Flajolet
1989 J jnl
Average case selection.
J. ACM
Walter Cunto, J. Ian Munro
1989 — conf
The Complexity of Collapsing Reachability Graphs.
Automatic Verification Methods for Finite State Systems
Sudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey
1988 J jnl
Transforming Unbalanced Multiway Trees into a Practical External Data Structure.
Acta Informatica
Walter Cunto, Patricio V. Poblete
1988 — conf
Two Hybrid Methods for Collision Resolution in Open Addressing Hashing.
SWAT
Walter Cunto, Patricio V. Poblete
1987 J jnl
Improving Time and Space Efficiency in Generalized Binary Search Trees.
Acta Informatica
Walter Cunto, Jose Luis Gascon
1984 A* conf
Average Case Selection
STOC
Walter Cunto, J. Ian Munro