Sciweavers

112 search results - page 3 / 23
» Ordered Binary Decision Diagrams and the Davis-Putnam Proced...
Sort
View
CCS
2006
ACM
13 years 9 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 8 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
RAID
2010
Springer
13 years 3 months ago
Improving NFA-Based Signature Matching Using Ordered Binary Decision Diagrams
Network intrusion detection systems (NIDS) make extensive use of regular expressions as attack signatures. Internally, NIDS represent and operate these signatures using finite au...
Liu Yang, Rezwana Karim, Vinod Ganapathy, Randy Sm...
ICSE
2004
IEEE-ACM
14 years 5 months ago
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
JSAT
2010
158views more  JSAT 2010»
13 years 4 hour ago
Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...
Olga Tveretina, Carsten Sinz, Hans Zantema