Amanote Research

Amanote Research

    RegisterSign In

Average Path Length of Binary Decision Diagrams

IEEE Transactions on Computers - United States
doi 10.1109/tc.2005.137
Full Text
Open PDF
Abstract

Available in full text

Categories
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
Date

September 1, 2005

Authors
J.T. ButlerT. SasaoM. Matsuura
Publisher

Institute of Electrical and Electronics Engineers (IEEE)


Related search

Equational Binary Decision Diagrams

English

Lattice-Valued Binary Decision Diagrams

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Binary Decision Diagrams With Edge-Specified Reductions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

NEM Relay Design With Biconditional Binary Decision Diagrams

2015English

Improving Reliability Calculation With Augmented Binary Decision Diagrams

2010English

Efficient Basic Event Orderings for Binary Decision Diagrams

English

Tight Upper and Lower Bounds on the Path Length of Binary Trees

SIAM Journal on Computing
MathematicsComputer Science
1994English

High-Speed Ip Routing With Binary Decision Diagrams Based Hardware Address Lookup Engine

IEEE Journal on Selected Areas in Communications
Computer NetworksElectronic EngineeringElectricalCommunications
2003English

Compilation of Thorium Binary Phase Diagrams.

1968English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy