Skip to main content
SpringerLink
Log in

On simultaneous realizations of boolean functions, with applications

  • Invited Papers
  • Conference paper
  • First Online:
Parcella '88 (Parcella 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 342))

  • 133 Accesses

Abstract

Simultaneous realizations are defined as the evaluation of a boolean function on several input tuples at the same time. For the corresponding Shannon functions one can show that a relatively large number of simultaneous inputs is compatible with a small enhancement of size and depth. These realizations can be applied to various computational tasks, e.g. to the design of fault-tolerant systems, the point-inclusion problem of binary images, and the simultaneous memory access.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. Literature

  1. Ajtai, M., J. Komlos, and E. Szemeredi: Sorting in c-log(n) Parallel Steps. Combinatorica 3(1983)1, 1–19.

    Google Scholar 

  2. Albrecht, A.: On Hardware Algorithms for Geometrical Computation Problems. — In: Proc. 10th IFIP Computer Congress, Dublin 1986, 989–994.

    Google Scholar 

  3. Edelsbrunner, H.: On Key Problems and Key Methods in Computational Geometry. Proc. STACS, Paris 1984.

    Google Scholar 

  4. Fischer, M.J., and F. Galbiati: On the Complexity of 2-output Boolean Networks. Theor. Comp. Science (1981), 177–185.

    Google Scholar 

  5. Haverlik, I.: On the Synthesis of Circuits for Matrices with a Defined Number of Corner Elements. Banach Centre Publ. 7(1982), 177–195 (in Russian).

    Google Scholar 

  6. Leighton, F.T.: New Lower Bound Techniques for VLSI. — In: Proc. 22nd FOCS, 1981, 1–9.

    Google Scholar 

  7. Lupanov, O.B.: On the Synthesis of some Classes of Control Systems. Probl. of Cybernetics 10(1963), 63–97 (in Russian).

    Google Scholar 

  8. Paul, W.: Realizing Boolean Functions on Disjoint Sets of Variables. Theor. Comp. Science (1976), 383–396.

    Google Scholar 

  9. Uhlig, D.: On the Synthesis of Self-Correcting Circuits with a Small Number of Reliable Elements. Mathem. Notes 15(1974)6, 937–944 (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, Humboldt University, P.O.Box 1297, 1086, Berlin, GDR

    Andreas Albrecht

Authors
  1. Andreas Albrecht
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gottfried Wolf Tamáas Legendi Udo Schendel

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albrecht, A. (1989). On simultaneous realizations of boolean functions, with applications. In: Wolf, G., Legendi, T., Schendel, U. (eds) Parcella '88. Parcella 1988. Lecture Notes in Computer Science, vol 342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50647-0_102

Download citation

  • DOI: https://doi.org/10.1007/3-540-50647-0_102

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50647-8

  • Online ISBN: 978-3-540-46062-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation