Patricio V. Poblete

According to our database1, Patricio V. Poblete
  • authored at least 32 papers between 1983 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Robin Hood Hashing really has constant average search cost and variance in full tables.
CoRR, 2016

2011
Stronger Quickheaps.
Int. J. Found. Comput. Sci., 2011

2006
The binomial transform and the analysis of skip lists.
Theor. Comput. Sci., 2006

2001
The effect of deletions on different insertion disciplines for hash tables (Extended Abstract).
Electronic Notes in Discrete Mathematics, 2001

Analysis of an Adaptive Algorithm to Find the Two Nearest Neighbors.
Algorithmica, 2001

1998
The Analysis of Linear Probing Hashing with Buckets.
Algorithmica, 1998

On the Analysis of Linear Probing Hashing.
Algorithmica, 1998

1997
The Diagonal Poisson Transform and its application to the analysis of a hashing scheme.
Random Struct. Algorithms, 1997

1996
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract).
Proceedings of the Algorithms, 1996

1995
Permuting in Place.
SIAM J. Comput., 1995

Higher-Order Analysis of 2-3 Trees.
Int. J. Found. Comput. Sci., 1995

The Binomial Transform and its Application to the Analysis of Skip Lists.
Proceedings of the Algorithms, 1995

1994
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract).
Proceedings of the Algorithms, 1994

1993
A Note on the Height of The kthe Element in a Heap.
BIT, 1993

The Analysis of Heuristics for Search Trees.
Acta Inf., 1993

1992
Average Search and Update Costs in Skip Lists.
BIT, 1992

1991
Fringe Analysis for Extquick: An in Situ Distributive External Sorting Algorithm
Inf. Comput., June, 1991

A Case Study in Comparison Based Complexity: Finding the Nearest Value(s).
Proceedings of the Algorithms and Data Structures, 1991

A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance.
Proceedings of the STACS 91, 1991

1990
Analysis of the Expected Search Cost in Skip Lists.
Proceedings of the SWAT 90, 1990

Permuting
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Last-Come-First-Served Hashing.
J. Algorithms, 1989

1988
Transforming Unbalanced Multiway Trees into a Practical External Data Structure.
Acta Inf., 1988

Two Hybrid Methods for Collision Resolution in Open Addressing Hashing.
Proceedings of the SWAT 88, 1988

An Implicit Binomial Queue with Constant Insertion Time.
Proceedings of the SWAT 88, 1988

1987
Searchability in Merging and Implicit Data Structures.
BIT, 1987

1986
Approximating Functions by Their Poisson Transform.
Inf. Process. Lett., 1986

1985
The Analysis of a Fringe Heuristic for Binary Search Trees.
J. Algorithms, 1985

1984
Fault Tolerance and Storage Reduction in Binary Search Trees
Information and Control, 1984

1983
An O(mlog logD) algorithm for shortest paths.
Discrete Applied Mathematics, 1983

A Discipline for Robustness or Storage Reduction in Binary Search Trees.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

Searchability in Merging and Implicit Data Structures.
Proceedings of the Automata, 1983


  Loading...