Skip to main content
SpringerLink
Log in
Book cover

Scandinavian Workshop on Algorithm Theory

SWAT 1994: Algorithm Theory — SWAT '94 pp 167–171Cite as

Lower bounds for dynamic algorithms

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 824))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai: A lower bound for finding predecessors in Yao's cell probe model. Combinatorica 8, 3 (1988) 235–247

    Google Scholar 

  2. Ben-Amram, A., Galil, Z: Lower bounds for data structure problems on RAMs. Proceedings of the 32nd Symposium on Foundations of Computer Science (1991), 622–631

    Google Scholar 

  3. Dietz, P.: Optimal algorithms for list indexing and subset rank. Algorithms and data structures: Workshop WADS '89, Ottawa, Canada (1989), 39–46

    Google Scholar 

  4. Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnhert, H. and Tarjan, R.: Dynamic perfect hashing: upper and lower bounds. Proceedings of the 29th Symposium on Foundations of Computer Science (1988), 524–531

    Google Scholar 

  5. Van Emde Boas, P., Kaas, R., and Zijlstra, E.: Design and implementation of an efficient priority queue. Math. Systems Theory 10 (1977), 99–127

    Article  Google Scholar 

  6. Eppstein, D., Italiano, G., Tamassia, R., Tarjan, R., Westbrook, J., and Yung, M.: Maintenance of a minimum spanning forest in a dynamic planar graph. J. Algorithms 13 (1992), 33–54

    Google Scholar 

  7. Fredman, M., Johnson, D. S., McGeoch, L. A., and Ostheimer, G.: Data structures for traveling salesmen. Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (1993), 145–154

    Google Scholar 

  8. Fredman, M., Saks, M.: The cell probe complexity of dynamic data structures. Proceedings of the 21st Annual ACM Symposium on Theory of Computing (1989), 345–354

    Google Scholar 

  9. Fredman, M., Willard, D.: Surpassing the information theoretic bound with fusion trees. J. Computer and System Sciences 47, 3 (1993), 424–436

    Google Scholar 

  10. Hampapuram, H., Fredman, M.: Optimal bi-weighted binary trees and the complexity of maintaining partial sums. Proceedings of the 34th Symposium on Foundations of Computer Science (1993), 480–485

    Google Scholar 

  11. LaPoutre, J.: Lower bounds for the union-find and the split-find problem on pointer machines. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (1990), 34–44.

    Google Scholar 

  12. Rauch, M.: Improved data structures for fully dynamic biconnectivity. Proceedings of the 26th Annual ACM Symposium on Theory of Computing (1994), to appear

    Google Scholar 

  13. Sundar, R.: A lower bound for the dictionary problem under a hashing model, Proceedings of the 32nd Symposium on Foundations of Computer Science (1991), 612–621; and personal communication

    Google Scholar 

  14. Willard, D.: Log-logarithmic worst case range queries are possible in space O(N). Information Processing Letters 17 (1983), 81–89

    Google Scholar 

  15. Xiao, B.: New bounds in cell probe model. Doctoral Dissertation, University of California, San Diego, 1992

    Google Scholar 

  16. Yao, A.: Should tables be sorted? J. Assoc. Comput. Mach. 28, 3 (1981), 615–628

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rutgers University, 08903, New Brunswick, NJ, USA

    Michael L. Fredman

Authors
  1. Michael L. Fredman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Erik M. Schmidt Sven Skyum

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fredman, M.L. (1994). Lower bounds for dynamic algorithms. In: Schmidt, E.M., Skyum, S. (eds) Algorithm Theory — SWAT '94. SWAT 1994. Lecture Notes in Computer Science, vol 824. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58218-5_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-58218-5_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58218-2

  • Online ISBN: 978-3-540-48577-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation