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