Skip to main content
Conference ProceedingsOPEN ACCESS

Zero-suppressed binary decision diagrams resilient to index faults

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8705 LNCS 1-12
DOI: 10.1007/978-3-662-44602-7_1
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper discusses the error resilience of Zero-Suppressed Binary Decision Diagrams (ZDDs), which are a particular family of Ordered Binary Decision Diagrams used for representing and manipulating combination sets. More precisely, we design a new ZDD canonical form, called index-resilient reduced ZDD, such that a faulty index can be reconstructed in time O(k), where k is the number of nodes with a corrupted index. © 2014 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Bernasconi, A., & Ciriani, V. (2014). Zero-suppressed binary decision diagrams resilient to index faults. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8705 LNCS, pp. 1–12). Springer Verlag. https://doi.org/10.1007/978-3-662-44602-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free