Hierarchy theorems for kOBDDs and kIBDDs

Graph-Based Algorithms for Boolean Function Manipulation

Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text

Computing, Computer Science, Algorithms +16

Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

László Babai, Noam Nisant, Márió Szegedy · Journal of Computer and System Sciences · 1992 · 257 citations

Computing, Computer Engineering, Computer Science +15

Rounds in Communication Complexity Revisited

Noam Nisan, Avi Wigderson · SIAM Journal on Computing · 1993 · 169 citations

Computing, Computer Science, Mathematics +17

On lower bounds for read-k-times branching programs

Allan Borodin, Alexander Razborov, Roman Smolensky · Computational Complexity · 1993 · 129 citations

Computing, Computer Science, Mathematics +10

On the complexity of branching programs and decision trees for clique functions

Ingo Wegener · Journal of the ACM · 1988 · 93 citations · Full text

Computing, Computer Science, Mathematics +17