Ingo Wegener  Home/Search
Context
Related
| ls2www.cs.unidortmund....BDDdesign.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: ls2www.cs.unidortmun...schriftv (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: BDDs (binary decision diagrams) and their variants are the most frequently used representation types or data structures for boolean functions. Research on BDD variants has turned out to be one of the areas where the symbiosis between theoretical investigations in algorithm design and analysis, complexity theory, and applications has led to progress in theory and in applications. Here the different roots of the interest in BDDs are described, the main BDD variants and their algorithmic... (Update)
Active bibliography (related documents): More All
1.7: Binary Decision Diagrams - Bollig, Sauerhoff, Sieling, Wegener (Correct)
0.7: A Lower Bound For Integer Multiplication With Read-Once Branching .. - Ponzio (1998) (Correct)
0.7: A Hierarchy Result for Read-Once Branching Programs with.. - Savicky, Sieling (Correct)
Similar documents based on text: More All
0.1: Asymptotically Optimal Bounds For OBDDs And The Solution Of.. - Bollig, Wegener (2000) (Correct)
0.1: On the Non-Approximability of Boolean Functions by.. - Bollig, Sauerhoff.. (Correct)
0.1: Approximability and Non-Approximability by Binary.. - Bollig, Sauerhoff.. (Correct)
BibTeX entry: (Update)
@misc{ wegener-bdds,
author = "Ingo Wegener",
title = "{BDDs} --- Design, Analysis, Complexity, and Applications",
url = "citeseer.ist.psu.edu/446842.html" }
Citations (may not include all citations):1726 Graph-based algorithms for Boolean function manipulation - Bryant - 1986
275 Dynamic variable ordering for ordered binary decision diagra.. (context) - Rudell - 1993
173 the complexity of VLSI implementations and graph representat.. - Bryant - 1991
90 Improving the variable ordering of OBDDs is NP -complete (context) - Bollig, Wegener - 1996
69 Representation of switching circuits by binary-decision prog.. (context) - Lee - 1959
68 On lower bounds for read-k-times branching programs (context) - Borodin, Razborov et al. - 1993
68 Communication Complexity (context) - Kushilevitz, Nisan - 1997
41 the complexity of branching programs and decision trees for .. (context) - Wegener - 1988
41 Branching Programs and Binary Decision Diagrams -- Theory an.. (context) - Wegener - 2000
36 Higher-radix division using estimates of divisor and remaind.. (context) - Atkins - 1968
35 Graph driven BDDs -- a new data structure for Boolean functi.. (context) - Sieling, Wegener - 1995
29 A lower bound for integer multiplication with readonce branc.. - Ponzio - 1998
23 A new lower bound theorem for read-only-once branching progr.. (context) - Simon, Szegedy - 1993
21 The recognition problem for the set of perfect squares (context) - Cobham - 1966
18 Communication Complexity and Parallel Computing (context) - Hromkovic - 1997
16 An exponential lower bound for one-time-only branching progr.. (context) - Zak - 1984
13 the existence of polynomial time approximation schemes for O.. (context) - Sieling - 1998
10 Optimal lower bounds on the depth of polynomialsize threshol.. (context) - Wegener - 1993
9 On lower bounds for branching programs (context) - Okol'nishikova - 1993
8 algorithm for finding maximum flows in networks (context) - Malhotra, Pramodh et al. - 1978
7 Reduction of OBDDs in linear time (context) - Sieling, Wegener - 1993
6 Complexity theoretical results on partitioned (context) - Bollig, Wegener - 1999
5 ect of local changes in the variable ordering of ordered dec.. (context) - Bollig, Lobbing et al. - 1996
5 Cu decision diagram package release (context) - Somenzi - 1998
4 A symbolic algorithm for maximum flow in 0-1 networks (context) - Hachtel, Somenzi - 1997
4 Hierarchy theorems for k-OBDDs and k-IBDDs - Bollig, Sauerho et al. - 1998
4 Partitioned ROBDDs -- a compact (context) - Narayan, Jain et al. - 1996
4 A Boolean function (context) - Nechiporuk - 1966
2 Time-space tradeo#s for integer multiplication on various ty.. (context) - Gergov - 1994
2 Analysis of composition (context) - Jain, Mohanram et al. - 2000
2 Optimal ordered binary decision diagrams for read-once formu.. (context) - Wegener, Werchner - 2000
2 Minimization of BDDs by evolutionary algorithms - Drechsler, Gockel - 1997
2 Super-linear timespace tradeo# lower bounds for randomized c.. (context) - Beame, Saks et al. - 2000
1 Bit-level analysis of an SRT divider (context) - Bryant - 1996
1 Complexity of graphs represented as OBDDs (context) - Feigenbaum, Kannan et al. - 1998
1 Personal communication (context) - Bollig, Woelfel - 2000
1 New bounds on the OBDD size of integer multiplication via un.. (context) - Woelfel - 2000
1 Asymptotically optimal lower bounds for OBDDs and the soluti.. (context) - Bollig, Wegener - 2000
Documents on the same site (http://ls2-www.cs.uni-dortmund.de/~wegener/schriftv.html): More
Optimization with Randomized Search Heuristics - The.. - Droste, Jansen, Wegener (1997) (Correct)
Evolutionary Algorithms - How to Cope With Plateaus of.. - Jansen, Wegener (1999) (Correct)
On the Analysis of the (1+1) Evolutionary Algorithm - Droste, Jansen, Wegener (2000) (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