Succinct Representation of Graphs Project report for Formal Semantics and Verification (CS388S)

Succinct Representation of Graphs Project report for Formal Semantics and Verification (CS388S)

Cached

Download Links

by Karthikeyan Sankaralingam

BibTeX

@MISC{Sankaralingam_succinctrepresentation,
    author = {Karthikeyan Sankaralingam},
    title = {Succinct Representation of Graphs Project report for Formal Semantics and Verification (CS388S)},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
224	On the complexity of VLSI implementations and graph representation of boolean functions with application to integer multiplication - BRYANT - 1991
91	Verification of Arithmetic Functions with Binary Moment Diagrams - Bryant, Chen - 1995
82	Area-time complexity for VLSI - Thompson - 1979
48	Succinct representations of graphs - Galperin, Wigderson - 1983
46	A complexity theory based on Boolean algebra - Skyum, Valiant
37	A note on succinct representations of graphs - Papadimitriou, Yannakakis - 1986
35	Efficient boolean manipulation with obdd’s can be extended to fbdd’s - Gergov, Meinel - 1994
30	The complexity of equivalence and containment for free single variable program schemes - Fortune, Hopcroft, et al. - 1978
30	Lower bounds for VLSI - Lipton, Sedgewick - 1981
12	Some Heuristics for Generating Tree-like FBDD Types - Bern, Meinel, et al. - 1996
6	Boolean manipulation with free BDD's. First experimental results - Bern, Gergov, et al. - 1994
1	Efficient solution of connecitivity problems on hierarchically defined graphs - Lengauer, Wanke - 1988