| On the analysis of linear probing hashing P Flajolet, P Poblete, A Viola Algorithmica 22 (4), 490-515, 1998 | 178 | 1998 |
| 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 | 85 | 1988 |
| Average search and update costs in skip lists T Papadakis, J Ian Munro, PV Poblete BIT Numerical Mathematics 32 (2), 316-332, 1992 | 66 | 1992 |
| The analysis of a fringe heuristic for binary search trees PV Poblete, JI Munro J. Algorithms 6 (3), 336-350, 1985 | 65 | 1985 |
| Permuting in place FE Fich, JI Munro, PV Poblete SIAM Journal on Computing 24 (2), 266-278, 1995 | 51 | 1995 |
| Last-come-first-served hashing PV Poblete, JI Munro Journal of Algorithms 10 (2), 228-248, 1989 | 35 | 1989 |
| 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 | 31 | 1990 |
| The Chilean Internet connection, or, i never promised you a rose garden R Baeza-Yates, JM Piquer, PV Poblete Proc. INET 93, 1993 | 26 | 1993 |
| Approximating functions by their Poisson transform PV Poblete Information Processing Letters 23 (3), 127-130, 1986 | 25 | 1986 |
| 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 | 22 | 2015 |
| The binomial transform and its application to the analysis of skip lists PV Poblete, JI Munro, T Papadakis Algorithms—ESA'95: Third Annual European Symposium Corfu, Greece, September …, 2005 | 21 | 2005 |
| Fault tolerance and storage reduction in binary search trees JI Munro, PV Poblete Information and Control 62 (2-3), 210-218, 1984 | 17 | 1984 |
| 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 | 15 | 1997 |
| An O (mlog logD) algorithm for shortest paths RG Karlsson, PV Poblete Discrete Applied Mathematics 6 (1), 91-93, 1983 | 15 | 1983 |
| The binomial transform and the analysis of skip lists PV Poblete, JI Munro, T Papadakis Theoretical computer science 352 (1-3), 136-158, 2006 | 14 | 2006 |
| A lower bound for determining the median JI Munro, PV Poblete Faculty of Mathematics, University of Waterloo, 1982 | 14 | 1982 |
| On linear probing hashing S Carlsson, JI Munro, PV Poblete Unpublished manuscript 101, 102, 1987 | 13 | 1987 |
| Curriculum renewal at two universities in Chile using the CDIO syllabus PV Poblete, X Vargas, S Celis, P Gazmuri, J Bilbao, D Brodeur Proceedings of the 3rd. Intl. CDIO Conference, Cambridge, MA, USA, 2007 | 10 | 2007 |
| The analysis of linear probing hashing with buckets A Viola, PV Poblete Algorithmica 21, 37-71, 1998 | 10 | 1998 |
| The analysis of heuristics for search trees PV Poblete Acta Informatica 30 (3), 233-248, 1993 | 10 | 1993 |
Ian MunroUniversity Professor, University of WaterlooVerified email at uwaterloo.ca
