Randal E. Bryant  Home/Search
Context Related
| cmu.edu/~bryant/pubdir/ieeetc91.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cmu.edu/~bryant/vitaefull (more) Homepages: R.Bryant |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents lower bound results on Boolean function complexity under two different models. The first is an abstraction of tradeoffs between chip area and speed in very large scale integrated (VLSI) circuits. The second is the ordered binary decision diagram (OBDD) representation used as a data structure for symbolically representing and manipulating Boolean functions. These lower bounds demonstrate the fundamental limitations of VLSI as an implementation medium, and OBDDs as a data... (Update)
Cited by: More
Ordered Binary Decision Diagrams - And Minimal Trellises (Correct)
Model Checking - Clarke, Schlingloff (2000) (Correct)
Counterexample-Guided Abstraction Refinement - For Symbolic Model (Correct)
Active bibliography (related documents): More All
0.8: Special Purpose Parallel Computing - McColl (1993) (Correct)
0.2: A Time Domain Approach for Avoiding Crosstalk in.. - Qiao, Melhem.. (1994) (Correct)
0.2: Graph-Based Algorithms for Boolean Function Manipulation - Bryant (1986) (Correct)
Similar documents based on text: More All
0.2: Cv - Lahiri (Correct)
0.2: Processor Verification Using Efficient Reductions of the.. - Bryant, German, Velev (2001) (Correct)
0.2: Resume - Chen (Correct)
Related documents from co-citation: More All
73: Graph-based algorithms for boolean function manipulation - Bryant - 1986
37: Dynamic Variable Ordering for Ordered Binary Decision Diagrams (context) - Rudell - 1993
35: Symbolic boolean manipulation with ordered binary decision diagrams - Bryant - 1992
BibTeX entry: (Update)
R. E. Bryant. On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication. IEEE Trans. Comput., 40(2):205--213, Feb. 1991. http://citeseer.ist.psu.edu/bryant98complexity.html More
@article{ bryant91complexity,
author = "Randal E. Bryant",
title = "On the Complexity of {VLSI} Implementations and Graph Representations
of {B}oolean Functions with Application to Integer Multiplication",
journal = "IEEE Transactions on Computers",
volume = "40",
number = "2",
pages = "205--213",
year = "1991",
url = "citeseer.ist.psu.edu/bryant98complexity.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
1726 Graph-Based Algorithms for Boolean Function Manipulation - Bryant - 1986
166 Some Complexity Questions Related to Distributive Computing (context) - Yao - 1979
134 Computational Aspects of VLSI (context) - Ullman - 1983
126 Binary Decision Diagrams (context) - Akers - 1978
113 Logic Verification Using Binary Decision Diagrams in a Logic.. (context) - Malik, Wang et al. - 1988
67 The Synthesis of Two-Terminal Switching Circuits (context) - Shannon - 1949
64 Area-Time Complexity for VLSI (context) - Thompson - 1979
62 Evaluations and Improvements of a Boolean Comparison Program.. (context) - Fujita, Fujisawa et al. - 1988
41 the Complexity of Branching Programs and Decision Trees for .. (context) - Wegener - 1988
22 Lower Bounds for VLSI (context) - Lipton, Sedgewick - 1981
13 The Area-Time Complexity of Binary Multiplication (context) - Brent, Kung - 1981
5 Information Transfer and Area-Time Trade-offs for VLSI Multi.. (context) - Abelson, Andreae - 1980
2 Planar Circuit Complexity and the Performance of VLSI Algori.. (context) - Savage - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-2.cs.cmu.edu/~bryant/vitae-full.html): More
ACV: An Arithmetic Circuit Verifier - Chen, Bryant (1996) (Correct)
Symbolic Simulation-Techniques and Applications - Bryant (1990) (Correct)
Microprocessor Verification Using Efficient Decision.. - Bryant, German, Velev (1999) (Correct)
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