Patricio V. Poblete

Publication Activity (10 Years)

Years Active: 1983-2019
Publications (10 Years): 2

Top Topics

Approximate Nearest Neighbor Search

Top Venues

Comb. Probab. Comput.

Publications

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) (2019)
Patricio V. Poblete, Alfredo Viola
Robin Hood Hashing really has constant average search cost and variance in full tables. CoRR (2016)
Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders
Stronger Quickheaps. Int. J. Found. Comput. Sci. 22 (4) (2011)
Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
The binomial transform and the analysis of skip lists. Theor. Comput. Sci. 352 (1-3) (2006)
Patricio V. Poblete, Alfredo Viola
The effect of deletions on different insertion disciplines for hash tables (Extended Abstract). Electron. Notes Discret. Math. 7 (2001)
Patricio V. Poblete
Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors. Algorithmica 29 (1) (2001)
Alfredo Viola, Patricio V. Poblete
The Analysis of Linear Probing Hashing with Buckets. Algorithmica 21 (1) (1998)
Philippe Flajolet, Patricio V. Poblete, Alfredo Viola
On the Analysis of Linear Probing Hashing. Algorithmica 22 (4) (1998)
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) (1997)
Alfredo Viola, Patricio V. Poblete
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract). ESA (1996)
Faith E. Fich, J. Ian Munro, Patricio V. Poblete
Permuting in Place. SIAM J. Comput. 24 (2) (1995)
Ricardo A. Baeza-Yates, Patricio V. Poblete
Higher-Order Analysis of 2-3 Trees. Int. J. Found. Comput. Sci. 6 (1) (1995)
Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
The Binomial Transform and its Application to the Analysis of Skip Lists. ESA (1995)
Patricio V. Poblete, Alfredo Viola, J. Ian Munro
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). ESA (1994)
Patricio V. Poblete
The Analysis of Heuristics for Search Trees. Acta Informatica 30 (3) (1993)
Patricio V. Poblete
the Element in a Heap. BIT 33 (3) (1993)
Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
Average Search and Update Costs in Skip Lists. BIT 32 (2) (1992)
Walter Cunto, J. Ian Munro, Patricio V. Poblete
A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). WADS (1991)
Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. STACS (1991)
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) (1991)
Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
Analysis of the Expected Search Cost in Skip Lists. SWAT (1990)
Faith E. Fich, J. Ian Munro, Patricio V. Poblete
Permuting FOCS (1990)
Patricio V. Poblete, J. Ian Munro
Last-Come-First-Served Hashing. J. Algorithms 10 (2) (1989)
Walter Cunto, Patricio V. Poblete
Two Hybrid Methods for Collision Resolution in Open Addressing Hashing. SWAT (1988)
Svante Carlsson, J. Ian Munro, Patricio V. Poblete
An Implicit Binomial Queue with Constant Insertion Time. SWAT (1988)
Walter Cunto, Patricio V. Poblete
Transforming Unbalanced Multiway Trees into a Practical External Data Structure. Acta Informatica 26 (3) (1988)
J. Ian Munro, Patricio V. Poblete
Searchability in Merging and Implicit Data Structures. BIT 27 (3) (1987)
Patricio V. Poblete
Approximating Functions by Their Poisson Transform. Inf. Process. Lett. 23 (3) (1986)
Patricio V. Poblete, J. Ian Munro
The Analysis of a Fringe Heuristic for Binary Search Trees. J. Algorithms 6 (3) (1985)
J. Ian Munro, Patricio V. Poblete
Fault Tolerance and Storage Reduction in Binary Search Trees Inf. Control. 62 (2/3) (1984)
J. Ian Munro, Patricio V. Poblete
Searchability in Merging and Implicit Data Structures. ICALP (1983)
Rolf G. Karlsson, Patricio V. Poblete
An O(mlog logD) algorithm for shortest paths. Discret. Appl. Math. 6 (1) (1983)
J. Ian Munro, Patricio V. Poblete
A Discipline for Robustness or Storage Reduction in Binary Search Trees. PODS (1983)