Patricio V. Poblete
Patricio V. Poblete
Professor of Computer Science, University of Chile
Bestätigte E-Mail-Adresse bei dcc.uchile.cl
Titel
Zitiert von
Zitiert von
Jahr
Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton
CRC press, 2009
6152009
On the analysis of linear probing hashing
P Flajolet, P Poblete, A Viola
Algorithmica 22 (4), 490-515, 1998
1631998
An implicit binomial queue with constant insertion time
S Carlsson, JI Munro, PV Poblete
Scandinavian Workshop on Algorithm Theory, 1-13, 1988
791988
The analysis of a fringe heuristic for binary search trees
PV Poblete, JI Munro
J. Algorithms 6 (3), 336-350, 1985
631985
Average search and update costs in skip lists
T Papadakis, JI Munro, PV Poblete
BIT Numerical Mathematics 32 (2), 316-332, 1992
611992
Permuting in place
FE Fich, JI Munro, PV Poblete
SIAM Journal on Computing 24 (2), 266-278, 1995
501995
Engineering Education Quality Assurance
AS Patil, PJ Gray
Springer US, 2009
422009
Last-come-first-served hashing
PV Poblete, JI Munro
Journal of Algorithms 10 (2), 228-248, 1989
311989
The Chilean Internet connection, or, i never promised you a rose garden
R Baeza-Yates, JM Piquer, PV Poblete
Proc. INET 93, 1993
271993
Analysis of the expected search cost in skip lists
T Papadakis, JI Munro, PV Poblete
Scandinavian Workshop on Algorithm Theory, 160-172, 1990
271990
Approximating functions by their Poisson transform
PV Poblete
Information Processing Letters 23 (3), 127-130, 1986
241986
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
191995
A lower bound for determining the median
JI Munro, PV Poblete
Faculty of Mathematics, University of Waterloo, 1982
171982
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
162015
Fault tolerance and storage reduction in binary search trees
JI Munro, PV Poblete
Information and Control 62 (2-3), 210-218, 1984
151984
An O (mlog logD) algorithm for shortest paths
RG Karlsson, PV Poblete
Discrete Applied Mathematics 6 (1), 91-93, 1983
151983
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
141997
The binomial transform and the analysis of skip lists
PV Poblete, JI Munro, T Papadakis
Theoretical computer science 352 (1-3), 136-158, 2006
132006
On linear probing hashing
S Carlsson, JI Munro, PV Poblete
Unpublished manuscript 101, 102, 1987
111987
The analysis of heuristics for search trees
PV Poblete
Acta Informatica 30 (3), 233-248, 1993
101993
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20