Skip to main content
SpringerLink
Log in

The Strongest Model of Computation Obeying 0-1 Principles

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

The 0-1 Principle of Knuth and its many variants are well-known in the context of comparator networks. However, the comparator model is not the strongest model of computation obeying such principles. This paper studies another natural model of computation, the Min-Max model, that obeys all known 0-1 Principles. More important, it is the strongest model obeying certain variants of the 0-1 Principle.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Batcher, K.E.: Sorting networks and their applications. In: Proc. AFIPS Spring Joint Computer Conference, vol. 32, pp. 307–314 (1968)

  2. Even, G., Levy, T., Litman, A.: Optimal conclusive sets for comparators networks. Theor. Comput. Sci. (in press)

  3. Kleitman, D.: On Dedekind’s problem: the number of monotone Boolean functions. Proc. Am. Math. Soc. 21, 677–682

  4. Knuth, D.E.: The Art of Computer Programming, 2nd edn. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1998)

    Google Scholar 

  5. Lee, D.L., Batcher, K.E.: A multiway merge sorting network. IEEE Trans. Parallel Distrib. Syst. 6, 211–215 (1995)

    Article  Google Scholar 

  6. Levy, T., Litman, A.: Lower bounds on bitonic sorters. Technical Report CS-2009-07. Technion, Department of Computer Science (2009)

  7. Levy, T., Litman, A.: On merging networks. Technical Report CS-2007-16. Technion, Department of Computer Science (2007)

  8. Levy, T., Litman, A.: On fast bitonic sorters. Technical Report CS-2009-01. Technion, Department of Computer Science (2009)

  9. Nakatani, T., Huang, S.T., Arden, B.W., Tripathi, S.K.: k-way bitonic sort. IEEE Trans. Comput. 38, 283–288 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  10. Miltersen, P.B., Paterson, M., Tarui, J.: The asymptotic complexity of merging networks. J. ACM 43(1), 147–165 (1996)

    MATH  MathSciNet  Google Scholar 

  11. Boppana, R.B., Sipser, M.: The complexity of finite functions. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science: Volume A, Algorithms and Complexity, pp. 757–803. Elsevier, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Technion, Haifa, 32000, Israel

    Tamir Levi & Ami Litman

Authors
  1. Tamir Levi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ami Litman
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tamir Levi.

Additional information

Dedicated to the memory of Professor Shimon Even.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levi, T., Litman, A. The Strongest Model of Computation Obeying 0-1 Principles. Theory Comput Syst 48, 374–388 (2011). https://doi.org/10.1007/s00224-010-9257-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-010-9257-8

Keywords

Search

Navigation