Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Walter Cunto
2000 – 2009
- 2003
[j9]Jayme Luiz Szwarcfiter, Gonzalo Navarro, Ricardo A. Baeza-Yates, Joísa de S. Oliveira, Walter Cunto, Nivio Ziviani: Optimal binary search trees with costs depending on the access paths. Theor. Comput. Sci. 290(3): 1799-1814 (2003)- 2000
- [j8]Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F. Barbosa, Nivio Ziviani, Walter Cunto: Binary Searching with Nonuniform Costs and Its Application to Text Retrieval. Algorithmica 27(2): 145-169 (2000)
1990 – 1999
- 1999
- [c10]Ricardo A. Baeza-Yates, Walter Cunto: The ADT Proximity and Text Proximity Problems. SPIRE/CRIWG 1999: 24-30
- 1994
- [c9]Walter Cunto: New Parallel Newton-Raphson Methods and Their Implementations with Accumulate Instructions. Applications in Parallel and Distributed Computing 1994: 53-62
- [c8]Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu: Proximity Matching Using Fixed-Queries Trees. CPM 1994: 198-212
- 1992
- [j7]Ricardo A. Baeza-Yates, Walter Cunto: Unbalanced Multiway Trees Improved by Partial Expansions. Acta Inf. 29(5): 443-460 (1992)
- [j6]Walter Cunto, J. Ian Munro, Manuel Rey: Selecting the Median and Two Quartiles in a Set of Numbers. Softw., Pract. Exper. 22(6): 439-454 (1992)
- [c7]Walter Cunto, S. Kashima, Manuel Rey: A New Algorithm for Selecting the Median, Two Quartiles, Minimum and Maximum of a Set of Numbers. IFIP Congress (1) 1992: 443-448
- [c6]Walter Cunto, Vicente Yriarte: GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization. SWAT 1992: 192-211
- 1991
- [j5]Walter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete: Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm. Inf. Comput. 92(2): 141-160 (1991)
- [j4]Walter Cunto, Jorge Araujo, Federico Giovannetti, Juan Rivero: Fplus: A Programming Environment for Scientific Applications. IEEE Software 8(5): 81-92 (1991)
- [c5]Walter Cunto, J. Ian Munro, Patricio V. Poblete: A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). WADS 1991: 1-12
1980 – 1989
- 1989
- [j3]
- [c4]Sudhir Aggarwal, Daniel Barbará, Walter Cunto, M. R. Garey: The Complexity of Collapsing Reachability Graphs. Automatic Verification Methods for Finite State Systems 1989: 264-274
- [c3]Walter Cunto, Gustavo Lau, Philippe Flajolet: Analysis of KDT-Trees: KD-Trees Improved by Local Reogranisations. WADS 1989: 24-38
- 1988
- [j2]Walter Cunto, Patricio V. Poblete: Transforming Unbalanced Multiway Trees into a Practical External Data Structure. Acta Inf. 26(3): 193-211 (1988)
- [c2]Walter Cunto, Patricio V. Poblete: Two Hybrid Methods for Collision Resolution in Open Addressing Hashing. SWAT 1988: 113-119
- 1987
- [j1]Walter Cunto, Jose Luis Gascon: Improving Time and Space Efficiency in Generalized Binary Search Trees. Acta Inf. 24(5): 583-594 (1987)
- 1984
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 16:05 CEST by the dblp team