1726 citations found. Only retrieving 1000 documents.
R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Fault Tolerant Planning: Toward Probabilistic Uncertainty.. - Rune Jensen It   Self-citation (Bryant)   (Correct)

No context found.

Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 8:677--691.


A Symbolic Approach to Predicate Abstraction - Shuvendu Lahiri Randal (2003)   (4 citations)  Self-citation (Bryant)   (Correct)

No context found.

R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8), August 1986.


Rune M. Jensen, Manuela M. Veloso and Randal E. Bryant - Computer Science Department   Self-citation (Bryant)   (Correct)

No context found.

Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 8:677--691.


Deterministic Dynamic Monitors for Linear-Time Assertions - Armoni, Korchemny.. (2006)   (Correct)

No context found.

R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.


Unknown - Interconnect Layout Optimization   (Correct)

No context found.

R. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Trans. on Computers, vol. C-35, no. 8, pp. 677--691, Aug. 1986.


Automata-Theoretic Model Checking Revisited - Vardi   (Correct)

No context found.

R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.


Model Checking for Context-Free Processes - Olaf Burkart And   (Correct)

No context found.

Bryant, R.E. "Graph-Based Algorithms for Boolean Function Manipulation" IEEE Transactions on Computers, Vol. C-35, No. 8, pp. 677-691, 1986


Automata-Theoretic Techniques for Temporal Reasoning - Vardi (2006)   (Correct)

No context found.

R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.


Boolean Matching for Complex PLBs in LUT-based FPGAs with.. - Cong, Hwang (1998)   (3 citations)  (Correct)

No context found.

Bryant, R. E., "Graph-based Algorithms for Boolean Function Manipulation," IEEE Trans. on Computers, Vol. C-35, pp. 677-691, Aug. 1986.


Multiagent Planning in the Presence of - Multiple Goals Michael   (Correct)

No context found.

R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 8:677--691, 1986.


Counterexample Minimization for ACTL ShengYu Shen - Ying Qin And   (Correct)

No context found.

R.E.Bryant. Graph-based algorithms for boolean function manipulation. In IEEE Transactions on Computers, pages C--35(8), 1986.


ASET: a Multi-Agent Planning Language with Nondeterministic .. - For Bdd-Based Fault   (Correct)

No context found.

Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 8:677--691.


A System for the Static Analysis of XPath - Geneves, Layaida (2006)   (Correct)

No context found.

Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35, 8, 677--691.


Automatic Generation of Assumptions for Modular Verification of .. - Riva, Tuya (2006)   (Correct)

No context found.

Bryant, R.E., 1986. Graph-based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, C-35 (8), 388-397.


Output Grouping-Based Decomposition Of Logic - Functions Petr Fiser   (Correct)

No context found.

Bryant, R., E.: Graph-Based Algorithms for Boolean Function Manipulation, IEEE Trans. on Computers, C-35(8), pp. 677-691, 1986


Low Power Architectural Design Methodologies - Landman (1994)   (22 citations)  (Correct)

No context found.

R. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Transactions 326 on Computing, vol. C-35, pp. 677-691, August 1986.


Path Queries on Compressed XML - Peter Buneman Martin (2003)   (9 citations)  (Correct)

No context found.

R. E. Bryant. "Graph-Based Algorithms for Boolean Function Manipulation". IEEE Transactions on Computers, C-35(8):677--691, Aug. 1986.


Two Formal Analyses of Attack Graphs - Jha Computer Sciences (2002)   (8 citations)  (Correct)

No context found.

R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput., C-35(8):677--691, Aug. 1986.


Formal Methods in System Design, 20, 159--186, 2002 c - Verification Of Out-Of-Order   (Correct)

No context found.

R.E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, Vol. 35, No. 8, pp. 677--691, 1986. 186 BEREZIN ET AL.


Minimization and Reliability Analyses of Attack Graphs - Somesh Jha Oleg (2002)   (1 citation)  (Correct)

No context found.

R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677--691, August 1986.


Ordered Binary Decision Diagrams - And Minimal Trellises   (Correct)

No context found.

R.E. Bryant, "Graph-based algorithms for boolean function manipulations," IEEE Trans. Computers, vol. 35, pp. 677--691, August 1986. 26


Survivability Analysis of Network Specifications - Jha Wing Linger   (Correct)

No context found.

R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput.,C- 35(8):677--691, Aug. 1986.


Planning Graph Heuristics for Belief Space Search - Bryce, Kambhampati, Smith (2006)   (Correct)

No context found.

Bryant, R. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35(8), 677--691.


Simplification of Non-Deterministic Multi-Valued Networks - Mishchenko, Brayton (2002)   (Correct)

No context found.

R. E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation", IEEE Trans. on Comp, Vol. C-35, No. 8 (August, 1986), pp. 677-691.


Restructuring Multi-Level Networks By Using Function .. - Cortadella.. (2003)   (Correct)

No context found.

R. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, vol. C-35, no. 8, pp. 677--691, Aug. 1986.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC