Follow
Patricio V. Poblete
Patricio V. Poblete
Professor of Computer Science, University of Chile
Verified email at dcc.uchile.cl
Title
Cited by
Cited by
Year
On the analysis of linear probing hashing
P Flajolet, P Poblete, A Viola
Algorithmica 22 (4), 490-515, 1998
1921998
An implicit binomial queue with constant insertion time
S Carlsson, JI Munro, PV Poblete
SWAT 88: 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden …, 1988
881988
Average search and update costs in skip lists
T Papadakis, J Ian Munro, PV Poblete
BIT Numerical Mathematics 32 (2), 316-332, 1992
681992
The analysis of a fringe heuristic for binary search trees
PV Poblete, JI Munro
J. Algorithms 6 (3), 336-350, 1985
671985
Permuting in place
FE Fich, JI Munro, PV Poblete
SIAM Journal on Computing 24 (2), 266-278, 1995
521995
Last-come-first-served hashing
PV Poblete, JI Munro
Journal of Algorithms 10 (2), 228-248, 1989
361989
Analysis of the expected search cost in skip lists
T Papadakis, JI Munro, PV Poblete
SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory Bergen, Sweden, July …, 1990
311990
The Chilean internet connection or I never promised you a rose garden
R Baeza-Yates, JM Piquer, PV Poblete
Proc. INET 93, 1993
271993
Approximating functions by their Poisson transform
PV Poblete
Information Processing Letters 23 (3), 127-130, 1986
261986
Un modelo analıtico para la predicción del rendimiento académico de estudiantes de ingenierıa
S Celis, L Moreno, P Poblete, J Villanueva, R Weber
Revista Ingenierıa de Sistemas Volumen XXIX, 2015
252015
The binomial transform and its application to the analysis of skip lists
PV Poblete, JI Munro, T Papadakis
European Symposium on Algorithms, 554-569, 1995
211995
Fault tolerance and storage reduction in binary search trees
JI Munro, PV Poblete
Information and Control 62 (2-3), 210-218, 1984
181984
The binomial transform and the analysis of skip lists
PV Poblete, JI Munro, T Papadakis
Theoretical computer science 352 (1-3), 136-158, 2006
162006
An O (mlog logD) algorithm for shortest paths
RG Karlsson, PV Poblete
Discrete Applied Mathematics 6 (1), 91-93, 1983
161983
A lower bound for determining the median
JI Munro, PV Poblete
Faculty of Mathematics, University of Waterloo, 1982
161982
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
PV Poblete, A Viola, JI Munro
Random Structures & Algorithms 10 (1‐2), 221-255, 1997
151997
The analysis of linear probing hashing with buckets
A Viola, PV Poblete
Algorithmica 21, 37-71, 1998
121998
On linear probing hashing
S Carlsson, JI Munro, PV Poblete
Unpublished manuscript 101, 102, 1987
121987
The analysis of heuristics for search trees
PV Poblete
Acta Informatica 30 (3), 233-248, 1993
101993
Searchability in merging and implicit data structures
J Ian Munro, PV Poblete
BIT Numerical Mathematics 27, 324-329, 1987
91987
The system can't perform the operation now. Try again later.
Articles 1–20