1. J.I. Munro, P.V. Poblete, "Probabilistic Issues in Data Structures," Computer Science and Statistics - 14th Symposium on the Interface, Troy, July 1982.

2. J.I. Munro, P.V. Poblete, "A Discipline for Robustness and Storage Reduction in Binary Search Trees," 2nd ACM Conference on Principles of Database Systems, Atlanta (USA), March 1983.

3. J.I. Munro, P.V. Poblete, "Searchability in Merging and Implicit Data Structures," 10th ICALP Conference, Barcelona (Spain), July 1983, Lecture Notes in Computer Science 154, Springer-Verlag.

4. J.I. Munro, P.V. Poblete, "Implicit Structuring of Data," Congressus Numerantium 37, Winnipeg (Canada), July 1983.

5. R. Baeza, P.V. Poblete, "Reduccion de la Matriz de Transicion de un Analisis del Borde y su Aplicacion al Analisis de Arboles 2-3," V Conferencia Internacional en Ciencia de la Computacion, Santiago (Chile), Julio 1985.

6. S. Carlsson, J.I. Munro, and P.V. Poblete, "An Implicit Binomial Queue with Constant Insertion Time," in Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 318, Springer-Verlag, 1988, 1-13.

7. W. Cunto and P.V. Poblete, "Two Hybrid Methods for Collision Resolution in Open Addressing Hashing," in Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 318, Springer-Verlag, 1988, 113-119.

8. T. Papadakis, J.I. Munro, and P.V. Poblete, "Analysis of the Expected Search Cost in Skip Lists", 2nd Scandinavian Workshop on Algorithm Theory, SWAT 90, Bergen (Norway), Lectures Notes in Computer Science 447, Springer-Verlag, July 1990, 160-172.

9. F.E. Fich, J.I. Munro, and P.V. Poblete, "Permuting", 31st Annual Symposium on Foundations of Computer Science, FOCS 90, St. Louis, Missouri (USA), October 1990, 372-381.

10. S. Carlsson, C. Mattsson, P.V. Poblete, and M. Bengtsson, "A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance", in STACS 91-Symposium on Theoretical Aspects of Computer Science, Hamburg, February 1991, Lecture Notes in Computer Science 480, Springer-Verlag, 296-308.

11. W. Cunto, J.I. Munro, and P.V. Poblete, "A Case Study in Comparison Based Complexity: Finding the Nearest Value(s)", invited paper in WADS 91-2nd Workshop on Algorithms and Data Structures, Ottawa, August 1991, Lecture Notes in Computer Science 519, Springer-Verlag, 1-12.

12. R. Baeza-Yates, J.M. Piquer, P.V. Poblete, "The Chilean Internet Connection, or I Never Promised You a Rose Garden", INET'93 International Networking Conference, San Francisco, August 1993.

13. P.V. Poblete, A. Viola, J.I. Munro, "The Analysis of a Hashing Scheme by the Diagonal Poisson Transform", Proceedings of the Second Annual European Symposium on Algorithms ESA94, Lecture Notes in Computer Science 855, Utrecht, The Netherlands, September 1994, 94-105.

14. P.V. Poblete, J.I.Munro, T. Papadakis, "The Binomial Transform and its Application to the Analysis of Skip Lists", Proceedings of the Third Annual European Symposium on Algorithms ESA95, Lecture Notes in Computer Science 979, Corfu, Greece, September 1995.

15. A. Viola, P.V. Poblete, "The Analysis of Linear Probing Hashing with Buckets", Proceedings of the Fourth Annual European Symposium on Algorithms - ESA'96", Lecture Notes in Computer Science 1136, Barcelona, Spain, September 1996.

16. J. Piquer, P.V. Poblete, "Domain Name Conflict Resolution under the .CL Top-Level Domain", Proceedings INET'99, San Jose, USA, 1999.

17. P.V. Poblete, A. Viola, "The effect of deletions on different insertion disciplines for hash tables", Brazilian Symposium on Graphs, Algorithms and Combinatorics, Fortaleza, Brazil, March, 2001.