Thomas Papadakis

According to our database, Thomas Papadakis authored at least 7 papers between 1990 and 2006.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2006

The binomial transform and the analysis of skip lists.

Patricio V. Poblete, J. Ian Munro, Thomas Papadakis

Theor. Comput. Sci., 2006

2001

Continuous Data Block Placement in and Elevation from Tertiary Storage in Hierarchical Storage Servers.

Peter Triantafillou, Thomas Papadakis

Clust. Comput., 2001

1997

On-Demand Data Elevation in Hierarchical Multimedia Storage Servers.

Peter Triantafillou, Thomas Papadakis

Proceedings of the VLDB'97, 1997

1995

The Binomial Transform and its Application to the Analysis of Skip Lists.

Patricio V. Poblete, J. Ian Munro, Thomas Papadakis

Proceedings of the Algorithms, 1995

1992

Average Search and Update Costs in Skip Lists.

Thomas Papadakis, J. Ian Munro, Patricio V. Poblete

BIT, 1992

Deterministic Skip Lists.

J. Ian Munro, Thomas Papadakis, Robert Sedgewick

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

1990

Analysis of the Expected Search Cost in Skip Lists.

Thomas Papadakis, J. Ian Munro, Patricio V. Poblete

Proceedings of the SWAT 90, 1990