Searchability in Merging and Implicit Data Structures. - J. Ian Munro; Patricio V. Poblete (ICALP, 1983)

A Discipline for Robustness or Storage Reduction in Binary Search Trees. - J. Ian Munro; Patricio V. Poblete (PODS, 1983)

An O(mlog logD) algorithm for shortest paths. - Rolf G. Karlsson; Patricio V. Poblete (Discret. Appl. Math., 1983)

Fault Tolerance and Storage Reduction in Binary Search Trees - J. Ian Munro; Patricio V. Poblete (Inf. Control., 1984)

The Analysis of a Fringe Heuristic for Binary Search Trees. - Patricio V. Poblete; J. Ian Munro (J. Algorithms, 1985)

Approximating Functions by Their Poisson Transform. - Patricio V. Poblete (Inf. Process. Lett., 1986)

An Implicit Binomial Queue with Constant Insertion Time. - Svante Carlsson; J. Ian Munro; Patricio V. Poblete (SWAT, 1988)

Two Hybrid Methods for Collision Resolution in Open Addressing Hashing. - Walter Cunto; Patricio V. Poblete (SWAT, 1988)

Transforming Unbalanced Multiway Trees into a Practical External Data Structure. - Walter Cunto; Patricio V. Poblete (Acta Informatica, 1988)

Last-Come-First-Served Hashing. - Patricio V. Poblete; J. Ian Munro (J. Algorithms, 1989)

Permuting - Faith E. Fich; J. Ian Munro; Patricio V. Poblete (FOCS, 1990)

Analysis of the Expected Search Cost in Skip Lists. - Thomas Papadakis; J. Ian Munro; Patricio V. Poblete (SWAT, 1990)

A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. - Svante Carlsson; Christer Mattsson; Patricio V. Poblete; Mats Bengtsson (STACS, 1991)

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). - Walter Cunto; J. Ian Munro; Patricio V. Poblete (WADS, 1991)

Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm - Walter Cunto; Gaston H. Gonnet; J. Ian Munro; Patricio V. Poblete (Inf. Comput., 1991)

Average Search and Update Costs in Skip Lists. - Thomas Papadakis; J. Ian Munro; Patricio V. Poblete (BIT, 1992)

The Analysis of Heuristics for Search Trees. - Patricio V. Poblete (Acta Informatica, 1993)

A Note on the Height of The kthe Element in a Heap. - Patricio V. Poblete (BIT, 1993)

The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). - Patricio V. Poblete; Alfredo Viola; J. Ian Munro (ESA, 1994)

The Binomial Transform and its Application to the Analysis of Skip Lists. - Patricio V. Poblete; J. Ian Munro; Thomas Papadakis (ESA, 1995)

Higher-Order Analysis of 2-3 Trees. - Ricardo A. Baeza-Yates; Patricio V. Poblete (Int. J. Found. Comput. Sci., 1995)

Permuting in Place. - Faith E. Fich; J. Ian Munro; Patricio V. Poblete (SIAM J. Comput., 1995)

The Analysis of Linear Probing Hashing with Buckets (Extended Abstract). - Alfredo Viola; Patricio V. Poblete (ESA, 1996)

The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. - Patricio V. Poblete; Alfredo Viola; J. Ian Munro (Random Struct. Algorithms, 1997)

On the Analysis of Linear Probing Hashing. - Philippe Flajolet; Patricio V. Poblete; Alfredo Viola (Algorithmica, 1998)

The Analysis of Linear Probing Hashing with Buckets. - Alfredo Viola; Patricio V. Poblete (Algorithmica, 1998)

Searching. - Ricardo Baeza-Yates; Patricio V. Poblete (Algorithms and Theory of Computation Handbook, 1999)

Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors. - Patricio V. Poblete (Algorithmica, 2001)

The effect of deletions on different insertion disciplines for hash tables (Extended Abstract). - Patricio V. Poblete; Alfredo Viola (Electron. Notes Discret. Math., 2001)

The binomial transform and the analysis of skip lists. - Patricio V. Poblete; J. Ian Munro; Thomas Papadakis (Theor. Comput. Sci., 2006)

Stronger Quickheaps. - Gonzalo Navarro 001; Rodrigo Paredes; Patricio V. Poblete; Peter Sanders 001 (Int. J. Found. Comput. Sci., 2011)

Robin Hood Hashing really has constant average search cost and variance in full tables. - Patricio V. Poblete; Alfredo Viola (CoRR, 2016)

Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions. - Patricio V. Poblete; Alfredo Viola (Comb. Probab. Comput., 2019)