default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatricio V. Poblete
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j21]Patricio V. Poblete, Alfredo Viola:
Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions. Comb. Probab. Comput. 28(4): 600-617 (2019)- 2016
- [i1]Patricio V. Poblete, Alfredo Viola:
Robin Hood Hashing really has constant average search cost and variance in full tables. CoRR abs/1605.04031 (2016) - 2011
- [j20]Gonzalo Navarro, Rodrigo Paredes
, Patricio V. Poblete, Peter Sanders:
Stronger Quickheaps. Int. J. Found. Comput. Sci. 22(4): 945-969 (2011)
2000 – 2009
- 2006
- [j19]Patricio V. Poblete, J. Ian Munro, Thomas Papadakis:
The binomial transform and the analysis of skip lists. Theor. Comput. Sci. 352(1-3): 136-158 (2006) - 2001
- [j18]Patricio V. Poblete:
Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors. Algorithmica 29(1): 227-237 (2001) - [j17]Patricio V. Poblete, Alfredo Viola:
The effect of deletions on different insertion disciplines for hash tables (Extended Abstract). Electron. Notes Discret. Math. 7: 146-149 (2001)
1990 – 1999
- 1999
- [p1]Ricardo Baeza-Yates, Patricio V. Poblete:
Searching. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j16]Alfredo Viola, Patricio V. Poblete:
The Analysis of Linear Probing Hashing with Buckets. Algorithmica 21(1): 37-71 (1998) - [j15]Philippe Flajolet, Patricio V. Poblete, Alfredo Viola:
On the Analysis of Linear Probing Hashing. Algorithmica 22(4): 490-515 (1998) - 1997
- [j14]Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. Random Struct. Algorithms 10(1-2): 221-255 (1997) - 1996
- [c11]Alfredo Viola, Patricio V. Poblete:
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract). ESA 1996: 221-233 - 1995
- [j13]Ricardo A. Baeza-Yates, Patricio V. Poblete:
Higher-Order Analysis of 2-3 Trees. Int. J. Found. Comput. Sci. 6(1): 1-10 (1995) - [j12]Faith E. Fich, J. Ian Munro, Patricio V. Poblete:
Permuting in Place. SIAM J. Comput. 24(2): 266-278 (1995) - [c10]Patricio V. Poblete, J. Ian Munro, Thomas Papadakis:
The Binomial Transform and its Application to the Analysis of Skip Lists. ESA 1995: 554-569 - [e1]Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete:
LATIN '95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings. Lecture Notes in Computer Science 911, Springer 1995, ISBN 3-540-59175-3 [contents] - 1994
- [c9]Patricio V. Poblete, Alfredo Viola, J. Ian Munro:
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). ESA 1994: 94-105 - 1993
- [j11]Patricio V. Poblete:
The Analysis of Heuristics for Search Trees. Acta Informatica 30(3): 233-248 (1993) - [j10]Patricio V. Poblete:
A Note on the Height of The kthe Element in a Heap. BIT 33(3): 411-412 (1993) - 1992
- [j9]Thomas Papadakis, J. Ian Munro, Patricio V. Poblete:
Average Search and Update Costs in Skip Lists. BIT 32(2): 316-332 (1992) - 1991
- [j8]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) - [c8]Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson:
A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. STACS 1991: 296-308 - [c7]Walter Cunto, J. Ian Munro, Patricio V. Poblete:
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). WADS 1991: 1-12 - 1990
- [c6]Faith E. Fich, J. Ian Munro, Patricio V. Poblete:
Permuting. FOCS 1990: 372-379 - [c5]Thomas Papadakis, J. Ian Munro, Patricio V. Poblete:
Analysis of the Expected Search Cost in Skip Lists. SWAT 1990: 160-172
1980 – 1989
- 1989
- [j7]Patricio V. Poblete, J. Ian Munro:
Last-Come-First-Served Hashing. J. Algorithms 10(2): 228-248 (1989) - 1988
- [j6]Walter Cunto, Patricio V. Poblete:
Transforming Unbalanced Multiway Trees into a Practical External Data Structure. Acta Informatica 26(3): 193-211 (1988) - [c4]Svante Carlsson, J. Ian Munro, Patricio V. Poblete:
An Implicit Binomial Queue with Constant Insertion Time. SWAT 1988: 1-13 - [c3]Walter Cunto, Patricio V. Poblete:
Two Hybrid Methods for Collision Resolution in Open Addressing Hashing. SWAT 1988: 113-119 - 1987
- [j5]J. Ian Munro, Patricio V. Poblete:
Searchability in Merging and Implicit Data Structures. BIT 27(3): 324-329 (1987) - 1986
- [j4]Patricio V. Poblete:
Approximating Functions by Their Poisson Transform. Inf. Process. Lett. 23(3): 127-130 (1986) - 1985
- [j3]Patricio V. Poblete, J. Ian Munro:
The Analysis of a Fringe Heuristic for Binary Search Trees. J. Algorithms 6(3): 336-350 (1985) - 1984
- [j2]J. Ian Munro, Patricio V. Poblete:
Fault Tolerance and Storage Reduction in Binary Search Trees. Inf. Control. 62(2/3): 210-218 (1984) - 1983
- [j1]Rolf G. Karlsson, Patricio V. Poblete:
An O(mlog logD) algorithm for shortest paths. Discret. Appl. Math. 6(1): 91-93 (1983) - [c2]J. Ian Munro, Patricio V. Poblete:
Searchability in Merging and Implicit Data Structures. ICALP 1983: 527-535 - [c1]J. Ian Munro, Patricio V. Poblete:
A Discipline for Robustness or Storage Reduction in Binary Search Trees. PODS 1983: 70-75
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-25 05:45 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:
