Trans-dichotomous algorithms without multiplication — Some upper and lower bounds

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1272, Issue , 1997, Pages 426-439

  Brodnik, Andrej ^a,b   Miltersen, Peter Bro ^c   Munro, J Ian ^d  

^a INSTITUTE OF MATHEMATICS   (Slovenia)

^b LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

^c AARHUS UNIVERSITY   (Denmark)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BOOLEAN OPERATIONS; LINEAR SPACES; QUERY TIME; UPPER AND LOWER BOUNDS; W-BIT WORDS;

DATA STRUCTURES;

EID: 84947938418     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63307-3_80     Document Type: Conference Paper

References (21)

1. rd ACM-SIAM Symposium on Discrete Algorithms, pages 463-472, Orlando, Florida, 1992.
2. th IEEE Symposium on Foundations of Computer Science, pages 655-663, 1995.
3. th ACM Symposium on Theory of Computing, pages 427-436, Las Vegas, Nevada, 1995.
4. th IEEE Symposium on Foundations of Computer Science, pages 538-546, Burlington, Vermont, 1996.
5. th IEEE Symposium on Foundations of Computer Science, pages 538-546, Palo Alto, California, 1993.
6. th Symposium on Theoretical Aspects of Computer Science. Springer-Verlag, 1997 (To appear).
7. A. Brodnik. Computation of the least significant set bit. In Proceedings Electrotechnical and Computer Science Conference, volume B, pages 7-10, Portorož, Slovenia, 1993.
8. nd European Symposium on Algorithms, volume 855 of Lecture Notes in Computer Science, pages 72-81. Springer-Verlag, 1994.
9. th Scandinavian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 307-320. Springer-Verlag, 1996.
10. J.L. Carter and M.N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, April 1979.
11. M. Dietzfelbinger, T. Hagerap, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. Technical Report 513, Fachbereich Informatik, Universität Dortmund, Dortmund, Germany, 1993.
12. M.L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, July 1984.
13. M.L. Fredman and D.E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47:424-436, 1993.
14. M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3):533-551, June 1994.
15. M. Furst, J.B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1): 13-27, April 1984.
16. J. Håstad. Almost optimal lower bounds for small depth circuits. In ACM Symposium on Theory of Computing, pages 6-20, Berkeley, California, 1986.
17. rd International Colloquium on Automata, Languages and Programming, volume 1099 of Lecture Notes in Computer Science, pages 442-451. Springer-Verlag, 1996.
18. th European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 121-137. Springer-Verlag, 1996.
19. A. Schönhage and V. Strassen. Schnelle Multiplikation grofier Zahlen. Computing, 7:281-292, 1971.
20. th ACM-SIAM Symposium on Discrete Algorithms, pages 59-67, Atlanta, Georgia, 1996.
21. th ACM-SIAM Symposium on Discrete Algorithms, pages 352-359, New Orleans, Louisiana, 1997.