BOOKS

1. Davio,
2. Hurst,
3. Karpovsky,
4. Miller/Muzio.
5. Mukhopahyay
6. Tsutomu Sasao (ed), Logic Synthesis and Optimization. Kluwer Academic Publishers, Jan. 1993.
   
   
7. Tsutomu Sasao and Masahiro Fujita (e.d.) Representations of Discrete Functions Kluwer Academic Publishers, May 1996.
   
   

Reed-Muller'95 IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansions in Circuit Design, Fujitsu Makuhari Systems Laboratory, Chiba City, Chiba 261, Japan. 27th -29th August, 1995.

1. Shin-Ichi Minato,
   Graph-based representations of discrete functions.
   
   
2. Tsutomu Sasao,
   Representation of logic functions using EXOR operators.
   
   
3. E. M. Clarke, Z. Xudong and M. Fujita,
   Application of MTBDD to spectral transformations.
   
   
4. Hiroyuki Ochi,
   A zero-suppressed BDD package with pruning and its application to GRM minimization.
   
   
5. Martin Lobbing, Olaf Schroer and Ingo Wegener,
   The theory of zero-suppressed BDDs and the number of knight's tours.
   
   
6. Radomir S. Stankovic, Tsutomu Sasao and Claudio Moraga,
   Spectral transforms decision diagrams.
   
   
7. Fabio Somenzi,
   Applications of graph based representations.
   
   
8. Mario Escobar and Fabio Somenzi,
   Synthesis of AND-EXOR expressions via satisfiability.
   
   
9. Takashi Hirayama and Yasuaki Nishitani,
   A simplification algorithm of AND-EXOR expressions for multiple-output functions.
   
   
10. Norio Koda and Tsutomu Sasao,
    An upper bound on the number of products in minimum ESOPs.
    
    
11. Marek A. Perkowski, Timothy Ross, Dave Gadd, Jeffrey A. Goldman and Ning Song,
    Application of ESOP minimization in machine learning and knowledge discovery.
    
    
12. Samuel E. Aborhey,
    ACEM: A minimization method for exclusive-OR sum of products expressions.
    
    
13. Jonathan Saul,
    An efficient data structure for the minimization of EXOR sums.
    
    
14. Sarma B. K. Vrudhula, Yung-Te Lai and Massoud Pedram,
    Efficient computation of the probability and Reed-Muller spectra of Boolean functions using edge-valued binary decision diagrams.
    
    
15. Jawahar Jain,
    On an arithmetic transform of Boolean functions.
    
    
16. Koichi Yasuoka,
    Ternary decision diagrams to represent ringsum-of-products forms.
    
    
17. Rolf Drechsler, Bernd Becker, and Andrea Jahnke,
    On variable ordering and decomposition type choice in OKFDDs.
    
    
18. Rolf Drechsler and Bernd Becker,
    Dynamic minimization of OKFDDs.
    
    
19. Marek A. Perkowski,
    A new representation of strongly unspecified switching functions and its application to multi-level AND/OR/EXOR synthesis.
    
    
20. Tsutomu Sasao, Hiraku Hamachi, Seiji Wada and Munehiro Matsuura,
    Multi-level logic synthesis based on pseudo-Kronecker decision diagrams and logical transformation.
    
    
21. B. Steinbach and A. Wereszczynski,
    Synthesis of multi-level circuits using EXOR-gates.
    
    
22. U. Kebschull, J. Bullmann, E. Schubert and W. Rosenstiel,
    Multiple domain logic synthesis.
    
    
23. Tomasz Kozlowski, Erik L. Dagless and Jonathan M. Saul,
    Unified decision diagrams: a representation for mixed AND-OR/EXOR combinational networks.
    
    
24. Gopal Lakhani,
    Minimization of switching functions for a multiple-level EXOR realization.
    
    
25. Reinhard Enders,
    Note on the complexity of binary moment diagram representations.
    
    
26. Beate Bolling, Martin Lobbing, Martin Sauerhoff and Ingo Wegener,
    Complexity theoretical aspects of OFDDs.
    
    
27. Ralph Werchner, Thilo Harich, Rolf Drechsler and Bernd Becker,
    Satisfiability problems for ordered functional decision diagrams.
    
    
28. Tsutomu Sasao and Fumitaka Izuhara,
    Exact minimization of fixed polarity Reed-Muller expressions using multi-terminal EXOR ternary decision diagram.
    
    
29. Arkadij Zakrevskij,
    Minimum polynominal implementation of systems of incompletely specified Boolean functions.
    
    
30. Xiaoqiang Zeng, Marek A. Perkowski and Andisheh Sarabi,
    Approximate minimization of generalized Reed-Muller forms.
    
    
31. Xiaoqiang Zeng, Haomin Wu, Marek A. Perkowski and Andisheh Sarabi,
    A new efficient algorithm for finding exact minimal generalized partially-mixed-polarity Reed-Muller expansion.
    
    
32. Bernd Becker and Rolf Drechsler,
    Exact minimization of Kronecker expressions for symmetric functions.
    
    
33. Debatosh Debnath and Tsutomu Sasao,
    GRMIN: A heuristic minimization algorithm for generalized Reed-Muller expression.
    
    
34. Valery P. Suprun,
    Fixed polarity Reed-Muller expressions of symmetric Boolean functions.
    
    
35. Bogdan J. Falkowski and Susanto Rahardja,
    Quasi-arithmetic polynomial expansions for quaternary functions.
    
    
36. Bogdan J. Falkowski and Susanto Rahardja,
    Family of fast transforms for GF(2) orthogonal logic.
    
    
37. Marek A. Perkowski, Andisheh Sarabi, and F. Rudolf Beyl,
    New families of universal additive canonical forms of switching functions.
    
    
38. S. N. Yanushkevich,
    Arithmetical canonical expansion of Boolean functions as generalized Reed-Muller series.
    
    
39. M. A. Thornton and V. S. Nair,
    Fast Reed-Muller spectrum computation using output probabilities.
    
    
40. Masami Nakajima, Michitaka Kameyama,
    Design of highly parallel circuits using EXOR gates for symmetrical logic operations.
    
    
41. Poh Yong Koh and Kiyoshi Furuya,
    State diagrams of elementary cellular automata with arbitrary boundary conditions.
    
    
42. Roustam Kh. Latypov,
    Self-testable circuits with single fault detection.
    
    
43. M. Riege and W. Anheier,
    Online self-checking FPGA structures based on Reed-Muller networks.
    
    

3rd International Workshop on Applications of the Reed-Muller Expansion in Circuit Design (Reed-Muller 97) In Cooperation with IFIP WG 10.5. Oxford University, Oxford, UK. September 19-20, 1997.

1. Masahiro Fujita,
   Hybrid Spectral Transform Diagrams. Invited talk.
   
   
2. Andreas Hett, Rolf Drechsler and Bernd Becker,
   Reordering Based Synthesis.
   
   
3. Gueesang Lee,
   ETDD-based Generation of Complex Terms for Incompletely Specified Boolean Functions.
   
   
4. M Marek-Sadowska, G Guner, T Krishnamurthy, S Gargeshwari and Ch Sharma,
   Minimized Generalized Partially Mixed Polarity Reed-Muller Expansion.
   
   
5. Debatosh Debnath and Tsutomu Sasao,
   Exclusive-OR of Two Sum-of Products Expressions: Simplification and an Upper Bound on the Number of Products.
   
   
6. N. Song and M.A. Perkowski,
   ``New Fast Approach to Approximate ESOP Minimization for Incompletely Specified Multi-Output Boolean Functions,'' pp. 61- 72.
   postscript.
   
   
7. Yibin Ye, Kaushik Roy and Rolf Drechsler,
   Low Power Aspects of XOR based Circuit Design.
   
   
8. Marek Perkowski, Malgorzata Chrzanowska-Jeske and Yang Xu,
   ``Lattice Diagrams Using Reed-Muller Logic,'' pp. 85 - 102.
   postscript of this paper
   
   
9. Jonathan Saul,
   Hardware Acceleration of Two-level ESOP Minimization Using CAMs.
   
   
10. Marek Perkowski, Lech Jozwiak and Rolf Drechsler,
    ``New Hierarchies of AND/EXOR Trees, Decision Diagrams, Lattice Diagrams, Canonical Forms, and Regular Layouts''. Proc. RM'97 Conference, Oxford Univ., U.K., Sept. 1997, pp. 115 - 132.
    postscript of the paper.
    
    slides of the presentation.
    
    
11. D. Das, S. Chakraborty and B. Bhattacharya,
    Universal and Robust Testing of Stuck-Open Faults in Reed-Muller Canonical CMOS Circuits.
    
    
12. Radomir Stankovic,
    Non-Abelian Groups in Optimization of Decision Diagrams Representations of Discrete Functions. Poster.
    
    
13. Radomir Stankovic and Yasushi Endow,
    Reed-Muller Transform and Wavelets Theory: An Alternative Look at Reed-Muller Expansions. Poster.
    
    
14. A. Bystrov and A. Almaini,
    Test Set Generation for Functional Decision Diagram Circuits using Genetic Algorithm. Poster.
    
    
15. Bernd Steinbach and Christian Lang,
    A General Data Structure for XOR-Decomposition of Sets of Switching Functions. Poster.
    
    
16. Roustam Latypov,
    Compact Testing of AND-EXOR Programmable Logic Arrays. Poster.
    
    
17. Tsutomu Sasao,
    Complexity Measures for AND-EXOR Expressions.
    
    
18. Arkadij Zakrevskij,
    Minimizing Polynomial Implementation of Weakly Specified Logic Functions and Systems.
    
    
19. Julia Manstivoda and Nikolay Peryazev,
    The Complexity of Symmetric Functions in the Polynomial Forms.
    
    
20. Christoph Meinel and Harald Sack,
    Case Study: Manipulating EXOR-OBDDs by Means of Signatures.
    
    
21. Stefan Horeth and Rolf Drechsler,
    Compilation of Fast Manipulation Algorithms for K*BMDs.
    
    
22. Henrik Hulgaard, Poul Williams and Henrik Andersen,
    Combinational Logic-Level Verification using Boolean Expression Diagrams.
    
    
23. Elena Dubrova, Michael Miller and Jon Muzio,
    A Heuristic Procedure for Finding AND-OR-XOR Expansions of Incompletely Specified Boolean Functions.
    
    
24. Marek Perkowski, Lech Jozwiak and Rolf Drechsler,
    ``A Canonical AND/EXOR Form that Includes Both the Generalized Reed-Muller Forms and Kronecker Reed-Muller Forms'', pp. 219 - 233.
    postscript.
    postscript of paper, another version.
    slides of presentation
    
    
25. Paul Metzgen and Jonathan Saul,
    A Critique of Mixed Exclusive-/Inclusive-OR Logic Synthesis for the Xilinx XC6200 FPGA.
    
    
26. Karen Dill, Konika Ganguly, Robert Safranek and Marek Perkowski,
    ``A New Zhegalkin Galois Logic,'' pp. 247 - 257.
    
    
27. Radomir Stankovic,
    Decision Diagrams for Discrete Functions Representations. Poster.
    
    
28. Ken Fok, Malgorzata Marek-Sadowska and Simone Boehringer,
    On Self-dual Complements of Fixed Polarity Reed-Muller 2-forms. Poster.
    
    
29. Karen Dill and Marek Perkowski,
    Evolutionary Minimization of Generalized Reed-Muller Forms. Poster.
    
    
30. Elena Zaitseva and D. Popel,
    Decomposition of Logical Functions in Reed-Muller Logic. Poster.
    
    
31. Svetlana Yanushkevich, Grzegorz Holowinski, Vlad Shmerko and Elena Zaitseva,
    Parallel and Distributed Algorithms for Minimization of Incompletely Specified Logic Functions in Reed-Muller Domain. Poster.
    
    
    
    
    

    Last Update of this: November 18, 1997.