A lower bound for integer multiplication with read-once branching programs
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast Subsumption Checks Using Anti-Links
Journal of Automated Reasoning
Lower bounds for linearly transformed OBDDs and FBDDs
Journal of Computer and System Sciences
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Bounds on the OBDD-size of integer multiplication via universal hashing
Journal of Computer and System Sciences
Lower bounds on the OBDD size of two fundamental functions' graphs
Information Processing Letters
Representation of graphs by OBDDs
Discrete Applied Mathematics
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
On the size of randomized OBDDs and read-once branching programs for k-stable functions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
First CPIR protocol with data-dependent computation
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Representation of graphs by OBDDs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Lower bounds on the OBDD size of graphs of some popular functions
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
On the OBDD size for graphs of bounded tree- and clique-width
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
| Hi-index | 5.23 |