Skip to main content
SpringerLink
Log in

On the hierarchy of distribution-sensitive properties for data structures

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

In this paper new dependencies are added to the hierarchy of the distribution-sensitive properties for data structures. Most remarkably, we prove that the working-set property is equivalent to the unified-bound property; a fact that had gone unnoticed since the introduction of such bounds in the Eighties by Sleator and Tarjan.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Brodal, G.S., Fagerberg, R.: Funnel heap—a cache oblivious priority queue. In: Proceedings of the 13th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 2518, pp. 219–228. Springer, Berlin (2002)

  • Bǎdoiu, M., Cole, R., Demaine, E.D., Iacono, J.: A unified access bound on comparison-based dynamic dictionaries. Theor. Comput. Sci. 382(2), 86–96 (2007)

    Article  Google Scholar 

  • Cole, R.: On the dynamic finger conjecture for splay trees. Part II: finger searching. SIAM J. Comput. 30, 44–85 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  • Elmasry, A.: On the sequential access theorem and dequeue conjecture for splay trees. Theor. Comput. Sci. 314(3), 459–466 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  • Elmasry, A.: A priority queue with the working-set property. Int. J. Found. Comput. Sci. 17(6), 1455–1466 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Elmasry, A., Iacono, J., Farzan, A.: A unifying property for distribution-sensitive priority queues. In: Proceedings of the 22nd International Workshop on Combinatorial Algorithms. Lecture Notes in Computer Science, vol. 7056, pp. 209–222. Springer, Berlin (2011)

  • Fischer, M.J., Paterson, M.: Fishspear: a priority queue algorithm. J. ACM 41(1), 3–30 (1994)

    Article  MATH  Google Scholar 

  • Iacono, J.: Improved upper bounds for pairing heaps. In: Proceedings of the 7th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 1851, pp. 32–45. Springer, Berlin (2000)

  • Iacono, J.: Distribution-sensitive data structures. Ph.D. Thesis, Rutgers, The state University of New Jersey, New Brunswick (2001)

  • Iacono, J., Langerman, S.: Queaps. Algorithmica 42(1), 49–56 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Shannon, C., Weaver, W.: The Mathematical Theory of Communication. University of Illinois Press, Urbana (1949)

    MATH  Google Scholar 

  • Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  • Steele, J.M.: The Cauchy–Schwarz Master Class: An Introduction to the Art of Mathematical Inequalities. Cambridge University Press, New York (2004)

    Book  Google Scholar 

  • Tarjan, R.E.: Sequential access in splay trees takes linear time. Combinatorica 5(4), 367–378 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Systems, Alexandria University, Alexandria, Egypt

    Amr Elmasry

  2. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Arash Farzan

  3. Polytechnic Institute of New York Univerity, Brooklyn, NY, USA

    John Iacono

Authors
  1. Amr Elmasry
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arash Farzan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John Iacono
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amr Elmasry.

Additional information

Amr Elmasry: Supported by fellowships from Alexander von Humboldt and VELUX foundations.

John Iacono: Research partially supported by NSF grants CCF-0430849, CCF-1018370, and an Alfred P. Sloan fellowship, and by MADALGO—Center for Massive Data Algorithmics, a Center of the Danish National Research Foundation, Aarhus University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elmasry, A., Farzan, A. & Iacono, J. On the hierarchy of distribution-sensitive properties for data structures. Acta Informatica 50, 289–295 (2013). https://doi.org/10.1007/s00236-013-0180-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-013-0180-8

Keywords

Search

Navigation