1. R. Karlsson, P.V. Poblete, "An O(m log log D) Algorithm for Shortest Paths, " Discrete Applied Mathematics 6 (1983), 91-93.

2. P.V. Poblete, "Solution to Problem 83-2, " Journal of Algorithms 4 (1983), 388-393.

3. J.I. Munro, P.V. Poblete, "Fault Tolerance and Storage Reduction in Binary Search Trees", Information and Control 62 (2/3) (1984), 210-218.

4. P.V. Poblete, J.I. Munro, "The Analysis of a Fringe Heuristic for Binary Search Trees", Journal of Algorithms 6 (1985).

5. P.V. Poblete, "Approximating Functions by their Poisson Transform", Information Processing Letters 23 (1986), 127-130.

6. J.I. Munro, P.V. Poblete, "Searchability in Merging and Implicit Data Structures", BIT 27 (1987), 324-329.

7. W. Cunto, P.V. Poblete, "Transforming Unbalanced Multiway Trees into a Practical External Data Structure", Acta Informatica 26 (1988), 193-211.

8. P.V. Poblete, J.I. Munro, "Last-Come-First-Served Hashing", Journal of Algorithms 10 (1989), 228-248.

9. W. Cunto, G. H. Gonnet, J. I. Munro, P.V. Poblete, "Fringe Analysis for Extquick: an in situ distributive external sorting algorithm", Information and Computation 92, 2 (June 1991), 141-160.

10. T. Papadakis, J. Ian Munro, P.V. Poblete, "Average Search and Update Costs in Skip Lists", BIT 32, 2 (1992), 316-332.

11. P.V. Poblete, "The Analysis of Heuristics for Search Trees", Acta Informatica 30, 3 (1993), 233-248.

12. P.V. Poblete, "A Note on the Height of the kth Element in a Heap", BIT 33 (1993), 411-412.

13. R.A. Baeza-Yates, P.V. Poblete, "Higher Order Analysis of 2-3 Trees", Int. J. of Foundations of Computer Science, 6, 1 (1995), 1-10.

14. F.E. Fich, J.I. Munro, P.V. Poblete, "Permuting in Place", SIAM J. on Computing 24, 2 (April 1995), 266-278.

15. P.V. Poblete, A. Viola, J.I. Munro, "The Diagonal Poisson Transform and its Applications to the Analysis of a Hashing Scheme", Random Structures & Algorithms 10 (1997), 221-255.

16. A. Viola, P.V. Poblete, "The Analysis of Linear Probing Hashing with Buckets", Algorithmica 21 (1998), 37-71.

17. P.V. Poblete, A. Viola, J.I. Munro, "Analyzing the LCFS Linear Probing Hashing Algorithm with the Help of Maple", Maple Technical Newletter 4, 1 (Winter 1997), 8-13.

18. Ph. Flajolet, P.V. Poblete, A. Viola, "On the Analysis of Linear Probing Hashing", Algorithmica 22 (1998), 490-515.

19. P.V. Poblete, J.I. Munro, T. Papadakis, "The Binomial Transform and the Analysis of Skip Lists", Theoretical Computer Science (to appear).

20. P.V. Poblete, "Analysis of an Adaptive Algorithm to Find the Nearest Neighbors", Algorithmica 29 (2001), 227-237.

21. P.V. Poblete, A. Viola, "The effect of deletions on different insertion disciplines for hash tables", Electronic Journal in Discrete Mathematics 7 (April 2001), 1-4. (pdf).