New bounds on the OBDD-size of integer multiplication via universal hashing

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

Volumn 2010, Issue , 2001, Pages 563-574

  Woelfel, Philipp ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; HASH FUNCTIONS;

BIT NUMBERS; EQUALITY TESTS; INTEGER MULTIPLICATIONS; NON-TRIVIAL; ORDERED BINARY DECISION DIAGRAMS; REPRESENTATION TYPE; SATISFIABILITY; UNIVERSAL HASHING;

BINARY DECISION DIAGRAMS;

EID: 84957088950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_49     Document Type: Conference Paper

References (24)

1. S. B. Akers. Binary decision diagrams. IEEE Transactions on Computers, C- 27:509-516, 1978.
2. M. Atici and D. R. Stinson. Universal hashing and multiple authentication. In Advances in Cryptology - CRYPTO '96, pp. 16-30. 1996.
3. P. Beame, M. Tompa, and P. Yan. Communication-space tradeoffs for unrestricted protocols. SIAM Journal on Computing, 23:652-661, 1994.
4. B. Bollig and I. Wegener. Improving the variable ordering of OBDDs is NP- complete. IEEE Transactions on Computers, 45:993-1002, 1996.
5. B. Bollig and I. Wegener. Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems. In Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, pp. 187-198. 2000.
6. Y. Breibart, H. B. Hunt III, and D. Rosenkrantz. On the size of binary decision diagrams representing Boolean functions. Theoretical Computer Science, 145:45-69, 1995.
7. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
8. R. E. Bryant. On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication. IEEE Transactions on Computers, 40:205-213, 1991.
9. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143-154, 1979.
10. M. Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science, pp. 569-580. 1996.
11. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. Journal of Algorithms, 25:19-51, 1997.
12. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, 23:738-761, 1994.
13. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the Association for Computing Machinery, 31:538-544, 1984.
14. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proceedings of the 30th Annual IEEE Symposium on Fountations of Computer Science, pp. 248-253. 1989.
15. C. Y. Lee. Representation of switching circuits by binary-decision programs. The Bell Systems Technical Journal, 38:985-999, 1959.
16. Y. Mansour, N. Nisan, and P. Tiwari. The computational complexity of universal hashing. Theoretical Computer Science, 107:121-133, 1993.
17. P. Rogaway. Bucket hashing and its application to fast message authentication. In Advances in Cryptology - CRYPTO '95, pp. 29-42. 1995.
18. D. Sieling. On the existence of polynomial time approximation schemes for OBDD minimization. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pp. 205-215. 1998.
19. D. Sieling and I. Wegener. NC-algorithms for operations on binary decision dia- grams. Parallel Processing Letters, 48:139-144, 1993.
20. M. Sipser. A complexity theoretic approach to randomness. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 330-335. 1983.
21. I. Wegener. Branching Programs and Binary Decision Diagrams - Theory and Applications. Siam, first edition, 2000.
22. M. N. Wegman and J. L. Carter. New classes and applications of hash functions. In Proceedings of the 20th Annual IEEE Symposium on Fountations of Computer Science, pp. 175-182. 1979.
23. P. Woelfel. Efficient strongly universal and optimally universal hashing. In Mathematical Foundations of Computer Science: 24th International Symposium, pp. 262-272. 1999.
24. P. Woelfel. Klassen universeller Hashfunktionen mit ganzzahliger Arithmetik. Diploma thesis, Univ. Dortmund, 2000.