J. de Bakker/J. van Leeuwen (ed.): Automata, languages and programming. Springer 1980. C. Bennett: Logical reversibility of computation. IBM J. Res. Dev. 17/6 (1973), 525-532. 15329 Jochen Bern/Jordan Gergov/Christoph Meinel/Anna Slobodova: Boolean manipulation with free BDDs - first experimental results. Proc. Europ. Design Test Conf. 1994 (1994), 200-207. 15373 Klaus Beuth: Digitaltechnik. Vogel 2001, 560p. Eur 36. 15354 Luciano Biasini: Gli elaboratori di dati. Patron 1977, 190p. N. Biswas: Introduction to logic and switching theory. Gordon and Breach 1975. 15299 Karl Brace/Richard Rudell/Randal Bryant: Efficient implementation of a BDD package. 27th ACM/IEEE Design Automation Conf. 1990, 40-45. 16929 Frank Brown: Boolean reasoning. Dover 2003, 290p. $12. Randal Bryant: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comp. C-35/8 (1986), 677-691. 15291 Randal Bryant: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comp. Surveys 24/3 (1992), 293-318. H. Bu''rger/Dietmar Dorninger/Wilfried No''bauer: Boolesche Algebra und Anwendungen. O''st. Bundesvlg. 1979. J. Burch a.o.: Symbolic model checking - 10^20 states and beyond. 5th LICS (1990), ... 16894 Peter Clote/Evangelos Kranakis: Boolean functions and computation models. Springer 2002, 600p. Eur 44. M. Davio/J. Deschamps/A. Thayse: Disrete and switching functions. McGraw-Hill 1978. 15380 Rolf Drechsler/Bernd Becker: Graphenbasierte Funktionsdarstellung. Teubner 1998, 200p. Eur 20. E. Fredkin/T. Toffoli: Conservative logic. Int. J. Theor. Phys. 21 (1982), 219-253. 15322 Jordan Gergov/Christoph Meinel: Mod-2 OBBDs - a generalization of OBBDs and EXOR sum-of-products. Proc. IFIP-Workshop 1993, TR WSI-93-2, 170-175. 15324 Jordan Gergov/Christoph Meinel: Analysis and manipulation of boolean functions in terms of decision graphs. Springer LN CS 657 (1993), 310-320. 15321 Jordan Gergov/Christoph Meinel: Boolean manipulation with free BDDs. An application in combinational logic verification. Proc. 13th IFIP World Computer Congress 1994, 309-314. 21344 Peter Hammer/Sergiu Rudeanu: Boolean methods in operations research. Springer 1968, 330p. M. Harrison: Introduction to switching and automata theory. McGraw-Hill 1965. 15328 Andreas Hett/Rolf Drechsler/Bernd Becker: MORE - an alternative implementation of BDD packages by multi-operand synthesis. EURODAC'96 (1996), 6p. Stasys Jukna: Boolean function complexity. Springer 2012, 640p. Eur 62. 7959 Joerg Keller/Wolfgang Paul: Hardwaredesign. Teubner 1995, 420p. 3-8154-2065-2. DM 60. 19726 Donald Knuth: The art of computer programming 7.1.3 - draft. Bitwise tricks and techniques. Internet 2007, 122p. 20829 Donald Knuth: The art of computer programming 4/0. Introduction to combinatorial algorithms and boolean functions. Addison-Wesley 2008, 220p. Eur 16. 21878 Donald Knuth: The art of computer programming 4/1. Bitwise tricks and techniques. Binary decision diagrams. Addison-Wesley 2009, 260p. Eur 16. 16998 Zvi Kohavi: Switching and finite automata theory. McGraw-Hill 20003, 660p. $52. 17636 Yves Lafont: Towards an algebraic theory of boolean circuits. J. pure appl. Algebra 184/2-3 (2003), 257-310. 15940 N. Lester/J. Saul: Technology mapping of mixed polarity Reed-Muller representations. ... (1999), 305-309. 15245 Subhamoy Maitra/Palash Sarkar: Cryptographically significant Boolean functions with five valued Walsh spectra. Theor. Comp. Sci. 276 (2002), 133-146. 15319 Christian Matuszewski/Robby Scho''nfeld/Paul Molitor: Using sifting for k-layer straightline crossing minimization. Internet 1999, 10p. 15318 Patrick McGeer a.o.: Fast discrete function evaluation using decision diagrams. Internet ca. 1996, 6p. Christoph Meinel: Modified branching programs and their computational power. Springer LN CS 370 (1989). 15317 Christoph Meinel: Die Entwicklung der Informatik braucht Theorie und Praxis. Ein Fallbeispiel aus dem CAD-Schaltkreisentwurf. Proc. GISI'95 (1995), 339-346. 15326 Christoph Meinel: Schaltkreiskomplexita''tstheorie. Vorlesung WS 1992/93, Univ. Trier 1995, 100p. 15325 Christoph Meinel/Harald Sack: Algorithmic considerations for sum-OBBD reordering. Proc. 4th Int. Workshop Reed-Muller Exp. 1999, 179-184. 15327 Christoph Meinel/Anna Slobodova: An adequate reducibility concept for problems defined in terms of ordered binary decision diagrams. ECCC TR 96-010 (1996), 20p. 15331 Christoph Meinel/Fabio Somenzi/Thorsten Theobald: Linear sifting of decision diagrams. Internet ca. 1997, 6p. 15320 Christoph Meinel/Fabio Somenzi/Thorsten Theobald: Function decomposition and synthesis using linear sifting. Internet ca. 1998, 6p. Christoph Meinel/Thorsten Theobald: Algorithms and data structures in VLSI design. OBDD - foundations and algorithms. Springer 1998, 270p. Eur 49. 15316 Christoph Meinel/Thorsten Theobald: Ordered binary decision diagrams and their significance in computer-aided design of VLSI circuits - a survey. Electronic Coll. Comp. Complexity Rep. 39 (1998), 17p. 15293 Paul Molitor: Darstellungen von Schaltfunktionen. Vorlesung Halle WS 2001/02. 15347 Paul Molitor/Christoph Scholl: Datenstrukturen und effiziente Algorithmen für die Logiksynthese kombinatorischer Schaltungen. Teubner 1999, 300p. Eur 28. 15290 Bernard Moret: Decision trees and diagrams. Comp. Surv. ACM 14/4 (1982), 593-623. S. Muroga: Threshold logic and its applications. Wiley 1971. 29090 Ryan O'Donnell: Analysis of boolean functions. Cambridge UP 2014, 420p. Available from the author. Montgomery Phister: Logical design of digital computers. Wiley 1958. 16970 Klaus Pommerening: Boolesche Funktionen. Internet ca. 2003, 22p. Contained in 16951 Pommerening. 16951 Klaus Pommerening: Linearitätsmaße für Boolesche Funktionen. Internet 2003, 143p. 23134 Marc Riedel/Jehoshua Bruck: Cyclic boolean circuits. Discrete Appl. Math. 160 (2012), 1877-1900. J. Roth: Algebraic topological methods for the synthesis of switching systems I-II. Trans. AMS 88 (1958), 301-328, Annals Harvard Comp. Lab. 29 (1959), 57-73. J. Roth: Minimization over Boolean trees. IBM J. Res. Dev. 4 (1960), 543-558. J. Roth/E. Wagner: Algebraic topological methods for the synthesis of switching systems III. Minimization of nonsingular Boolean trees. IBM J. Res. Dev. 4 (1959), 1-19. 23137 Sergiu Rudeanu: Boolean sets and most general solutions of boolean equations. Inform. Sci. 180 (2010), 2440-2447. 15330 Richard Rudell: Dynamic variable ordering for ordered binary decision diagrams. Proc. ACM/IEEE Int. Conf. CAD (1993), 42-47. 21782 Tsutomu Sasao/Jon Butler (ed.): Progress in applications of Boolean functions. Morgan & Claypool 2010, 140p. Eur 33. 15304 Martin Sauerhoff/Ingo Wegener/Ralph Werchner: Optimal ordered binary decision diagrams for read-once formulas. Discrete Appl. Math. 103 (2000), 237-258. 15323 Christoph Scholl/Stephan Melchior/Gu''nter Hotz/Paul Molitor: Minimizing ROBBD sizes of incompletely specified boolean functions by exploiting strong symmetries. Internet ca. 1997, 6p. 15315 Detlef Sieling: Theorie des Logikentwurfs. Begleitmaterial zur Vorlesung SS 2000, Univ. Dortmund, 90p. Otto Spaniol: Arithmetik in Rechenanlagen. Teubner 1976, 210p. 3-519-02332-6. DM 30. 15297 Iwaro Takahashi: Switching functions constructed by Galois extension fields. Inf. Control 48 (1981), 95-108. T. Toffoli: Reversible computing. In de Bakker/van Leeuwen 1980, ... 15296 Yuke Wang/Carl McCrosky/Xiaoyu Song: Single-faced boolean functions and their minimization. Comp. J. 44/4 (2001), 280-291. 15225 Ingo Wegener: The complexity of Boolean functions. Wiley 1987. 6498 Ingo Wegener: Effiziente Algorithmen fuer grundlegende Funktionen. Teubner 1989. 15302 Ingo Wegener: Efficient data structures for boolean functions. Discrete Math. 136 (1994), 347-372. Ingo Wegener: Branching programs and binary decision diagrams. Theory and applications. SIAM 2000, 410p. $93. 15232 Ingo Wegener: BDDs - design, analysis, complexity, and applications. Discrete Appl. Math. ... (ca. 2002), ... 15346 John Eldon Whitesitt: Boolean algebra and its applications. Dover 1995, 180p. Eur 11. 15957 Heinz-Dietrich Wuttke/Karsten Henke: Schaltsysteme. Pearson Education 2003, 350p. Eur 35.