default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter Cunto
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
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 Informatica 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. Exp. 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 Softw. 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]Walter Cunto, J. Ian Munro:
Average case selection. J. ACM 36(2): 270-279 (1989) - [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 Informatica 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 Informatica 24(5): 583-594 (1987) - 1984
- [c1]Walter Cunto, J. Ian Munro:
Average Case Selection. STOC 1984: 369-375
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
