The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patricio V. Poblete: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
    The Binomial Transform and its Application to the Analysis of Skip Lists. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:554-569 [Conf]
  2. Patricio V. Poblete, Alfredo Viola, J. Ian Munro
    The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:94-105 [Conf]
  3. Alfredo Viola, Patricio V. Poblete
    The Analysis of Linear Probing Hashing with Buckets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:221-233 [Conf]
  4. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:372-379 [Conf]
  5. J. Ian Munro, Patricio V. Poblete
    Searchability in Merging and Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:527-535 [Conf]
  6. J. Ian Munro, Patricio V. Poblete
    A Discipline for Robustness or Storage Reduction in Binary Search Trees. [Citation Graph (0, 3)][DBLP]
    PODS, 1983, pp:70-75 [Conf]
  7. Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
    A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:296-308 [Conf]
  8. Svante Carlsson, J. Ian Munro, Patricio V. Poblete
    An Implicit Binomial Queue with Constant Insertion Time. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:1-13 [Conf]
  9. Walter Cunto, Patricio V. Poblete
    Two Hybrid Methods for Collision Resolution in Open Addressing Hashing. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:113-119 [Conf]
  10. Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
    Analysis of the Expected Search Cost in Skip Lists. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:160-172 [Conf]
  11. Walter Cunto, J. Ian Munro, Patricio V. Poblete
    A Case Study in Comparison Based Complexity: Finding the Nearest Value(s). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:1-12 [Conf]
  12. Walter Cunto, Patricio V. Poblete
    Transforming Unbalanced Multiway Trees into a Practical External Data Structure. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:26, n:3, pp:193-211 [Journal]
  13. Patricio V. Poblete
    The Analysis of Heuristics for Search Trees. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1993, v:30, n:3, pp:233-248 [Journal]
  14. Philippe Flajolet, Patricio V. Poblete, Alfredo Viola
    On the Analysis of Linear Probing Hashing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:4, pp:490-515 [Journal]
  15. Patricio V. Poblete
    Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:1, pp:227-237 [Journal]
  16. Alfredo Viola, Patricio V. Poblete
    The Analysis of Linear Probing Hashing with Buckets. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:37-71 [Journal]
  17. J. Ian Munro, Patricio V. Poblete
    Searchability in Merging and Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:3, pp:324-329 [Journal]
  18. Thomas Papadakis, J. Ian Munro, Patricio V. Poblete
    Average Search and Update Costs in Skip Lists. [Citation Graph (0, 0)][DBLP]
    BIT, 1992, v:32, n:2, pp:316-332 [Journal]
  19. Patricio V. Poblete
    A Note on the Height of The kthe Element in a Heap. [Citation Graph (0, 0)][DBLP]
    BIT, 1993, v:33, n:3, pp:411-412 [Journal]
  20. Walter Cunto, Gaston H. Gonnet, J. Ian Munro, Patricio V. Poblete
    Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:92, n:2, pp:141-160 [Journal]
  21. J. Ian Munro, Patricio V. Poblete
    Fault Tolerance and Storage Reduction in Binary Search Trees [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:62, n:2/3, pp:210-218 [Journal]
  22. Ricardo A. Baeza-Yates, Patricio V. Poblete
    Higher-Order Analysis of 2-3 Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:1, pp:1-10 [Journal]
  23. Patricio V. Poblete
    Approximating Functions by Their Poisson Transform. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:3, pp:127-130 [Journal]
  24. Patricio V. Poblete, J. Ian Munro
    The Analysis of a Fringe Heuristic for Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:3, pp:336-350 [Journal]
  25. Patricio V. Poblete, J. Ian Munro
    Last-Come-First-Served Hashing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:2, pp:228-248 [Journal]
  26. Patricio V. Poblete, Alfredo Viola, J. Ian Munro
    The Diagonal Poisson Transform and its application to the analysis of a hashing scheme. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:1-2, pp:221-255 [Journal]
  27. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting in Place. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:2, pp:266-278 [Journal]
  28. Patricio V. Poblete, J. Ian Munro, Thomas Papadakis
    The binomial transform and the analysis of skip lists. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:352, n:1-3, pp:136-158 [Journal]

Search in 0.052secs, Finished in 0.054secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002