Patricio V. Poblete

35 papers A* 3A 4B 2Journal 22Unranked 3
YearRankTypeTitle / Venue / Authors
2019 J jnl
Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions.
Comb. Probab. Comput.
Patricio V. Poblete, Alfredo Viola
2016 J jnl
Robin Hood Hashing really has constant average search cost and variance in full tables.
CoRR
Patricio V. Poblete, Alfredo Viola
2011 J jnl
Stronger Quickheaps.
Int. J. Found. Comput. Sci.
Gonzalo Navarro, Rodrigo Paredes, Patricio V. Poblete, Peter Sanders
2006 J jnl
The binomial transform and the analysis of skip lists.
Theor. Comput. Sci.
Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
2001 J jnl
Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors.
Algorithmica
Patricio V. Poblete
2001 J jnl
The effect of deletions on different insertion disciplines for hash tables (Extended Abstract).
Electron. Notes Discret. Math.
Patricio V. Poblete, Alfredo Viola
1999 — ch.
Searching.
Algorithms and Theory of Computation Handbook
Ricardo Baeza-Yates, Patricio V. Poblete
1998 J jnl
On the Analysis of Linear Probing Hashing.
Algorithmica
Philippe Flajolet, Patricio V. Poblete, Alfredo Viola
1998 J jnl
The Analysis of Linear Probing Hashing with Buckets.
Algorithmica
Alfredo Viola, Patricio V. Poblete
1997 J jnl
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme.
Random Struct. Algorithms
Patricio V. Poblete, Alfredo Viola, J. Ian Munro
1996 A conf
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract).
ESA
Alfredo Viola, Patricio V. Poblete
1995 J jnl
Higher-Order Analysis of 2-3 Trees.
Int. J. Found. Comput. Sci.
Ricardo A. Baeza-Yates, Patricio V. Poblete
1995 B ed.
LATIN '95: Theoretical Informatics, Second Latin American Symposium, Valparaíso, Chile, April 3-7, 1995, Proceedings
LATIN
Ricardo A. Baeza-Yates, Eric Goles Ch., Patricio V. Poblete
1995 J jnl
Permuting in Place.
SIAM J. Comput.
Faith E. Fich, J. Ian Munro, Patricio V. Poblete
1995 A conf
The Binomial Transform and its Application to the Analysis of Skip Lists.
ESA
Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
1994 A conf
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract).
ESA
Patricio V. Poblete, Alfredo Viola, J. Ian Munro
1993 J jnl
A Note on the Height of The
BIT
Patricio V. Poblete
1993 J jnl
The Analysis of Heuristics for Search Trees.
Acta Informatica
Patricio V. Poblete
1992 J jnl
Average Search and Update Costs in Skip Lists.
BIT
Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
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 A conf
A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance.
STACS
Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
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
1990 — conf
Analysis of the Expected Search Cost in Skip Lists.
SWAT
Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
1990 A* conf
Permuting
FOCS
Faith E. Fich, J. Ian Munro, Patricio V. Poblete
1989 J jnl
Last-Come-First-Served Hashing.
J. Algorithms
Patricio V. Poblete, J. Ian Munro
1988 — conf
An Implicit Binomial Queue with Constant Insertion Time.
SWAT
Svante Carlsson, J. Ian Munro, Patricio V. Poblete
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
Searchability in Merging and Implicit Data Structures.
BIT
J. Ian Munro, Patricio V. Poblete
1986 J jnl
Approximating Functions by Their Poisson Transform.
Inf. Process. Lett.
Patricio V. Poblete
1985 J jnl
The Analysis of a Fringe Heuristic for Binary Search Trees.
J. Algorithms
Patricio V. Poblete, J. Ian Munro
1984 J jnl
Fault Tolerance and Storage Reduction in Binary Search Trees
Inf. Control.
J. Ian Munro, Patricio V. Poblete
1983 A* conf
A Discipline for Robustness or Storage Reduction in Binary Search Trees.
PODS
J. Ian Munro, Patricio V. Poblete
1983 J jnl
An O(mlog logD) algorithm for shortest paths.
Discret. Appl. Math.
Rolf G. Karlsson, Patricio V. Poblete
1983 A* conf
Searchability in Merging and Implicit Data Structures.
ICALP
J. Ian Munro, Patricio V. Poblete