Abstract
We show that on a RAM with addition, subtraction, bitwise Boolean operations and shifts, but no multiplication, there is a transdichotomous solution to the static dictionary problem using linear space and with query time √log n(log log n)1+0(1). On the way, we show that two w-bit words can be multiplied in time (log w)1+0(1) and that time μ(log w) is necessary, and that θ(log log w) time is necessary and sufficient for identifying the least significant set bit of a word.
Some of the results of this paper appeared in the PhD thesis of this author
Supported by the ESPRIT Long Term Research Programme of the EU under project number 20244 (ALCOM-IT). Part of this work was done while the author was at the University of Toronto.
This research was supported by a grant from the Natural Science and Engineering Council of Canada.
Preview
Unable to display preview. Download preview PDF.
References
S. Albers and T. Hagerup. Improved parallel integer sorting without concurrent writting. In 34 rd ACM-SIAM Symposium on Discrete Algorithms, pages 463–472, Orlando, Florida, 1992.
A. Andersson. Sublogarithmic searching without multiplications. In 36 th IEEE Symposium on Foundations of Computer Science, pages 655–663, 1995.
A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? In 27 th ACM Symposium on Theory of Computing, pages 427–436, Las Vegas, Nevada, 1995.
A. Andersson, P.B. Miltersen, S. Riis, and M. Thorup. Static dictionaries on AC0 RAMs: Query time θ(√log n log log n) is necessary and sufficient. In 37 th IEEE Symposium on Foundations of Computer Science, pages 538–546, Burlington, Ver-mont, 1996.
A.M. Ben-Amram and Z. Galil. When can we sort in o(n log n) time? In 34 th IEEE Symposium on Foundations of Computer Science, pages 538–546, Palo Alto, California, 1993.
G.S. Brodal. Predecessor queries in dynamic integer sets. In Proceedings 10 th Symposium on Theoretical Aspects of Computer Science. Springer-Verlag, 1997 (To appear).
A. Brodnik. Computation of the least significant set bit. In Proceedings Elec-trotechnical and Computer Science Conference, volume B, pages 7–10, Portoroz, Slovenia, 1993.
A. Brodnik and J.I. Munro. Membership in a constant time and a minimum space. In Proceedings 2 nd European Symposium on Algorithms, volume 855 of Lecture Notes in Computer Science, pages 72–81. Springer-Verlag, 1994.
A. Brodnik and J.I. Munro. Neighbours on a grid. In Proceedings 5 th Scandina-vian Workshop on Algorithm Theory, volume 1097 of Lecture Notes in Computer Science, pages 307–320. Springer-Verlag, 1996.
J.L. Carter and M.N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143–154, April 1979.
M. Dietzfelbinger, T. Hagerup, 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.
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.
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.
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.
M. Furst, J.B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13–27, April 1984.
J. Almost optimal lower bounds for small depth circuits. In 18 th ACM Symposium on Theory of Computing, pages 6–20, Berkeley, California, 1986.
P.B. Miltersen. Lower bounds for static dictionaries on RAMS with bit operations but no multiplication. In Proceedings 23 rd International Colloquium on Automata, Languages and Programming, volume 1099 of Lecture Notes in Computer Science, pages 442–451. Springer-Verlag, 1996.
R. Raman. Priority queues: Small, monotone, and Tans-dichotomus. In Proceed-ings 4 th European Symposium on Algorithms, volume 1136 of Lecture Notes in Computer Science, pages 121–137. Springer-Verlag, 1996.
A. Schönhage and V. Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7:281–292, 1971.
M. Thorup. On RAM priority queues. In 7 th CM-SIAM Symposium on Discrete Algorithms, pages 59–67, Atlanta, Georgia, 1996.
M. Thorup. Randomized sorting in O (n log log n) time and linear space using addition, shift, and bit-wise booleaan operations. In 8 th ACM-SIAM Symposium on Discrete Algorithms, pages 352–359, New Orleans, Louisiana, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brodnik, A., Miltersen, P.B., Munro, J.I. (1997). Trans-dichotomous algorithms without multiplication — some upper and lower bounds. In: Dehne, F., Rau-Chaplin, A., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1997. Lecture Notes in Computer Science, vol 1272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63307-3_80
Download citation
DOI: https://doi.org/10.1007/3-540-63307-3_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63307-5
Online ISBN: 978-3-540-69422-9
eBook Packages: Springer Book Archive