Skip to main content
SpringerLink
Log in

Zur Komplexität von Sortierproblemen

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We consider a problem of regrouping data collected in blocks of up to r elements by steps involving the data of not more than k blocks each.

The problem consists in giving a lower estimate for the minimum number of steps involved. The estimates are derived from the entropies of certain probability distributions pertinent to the given collections of blocks.

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

Literatur

  1. Feinstein, A.: Foundations of Information Theory. New York: McGraw-Hill 1958

    Google Scholar 

  2. Floyd, R. W.: Permuting information in idealized two-level storage. In: Miller, R. E., Thatcher, J. W. (ed.): Complexity of computer computations. New York-London: Plenum Press 1972, pp. 105–109

    Google Scholar 

  3. Hopcroft, J.: Vorlesung. Cornell University, Ithaka (N.Y.), 1971

    Google Scholar 

  4. Paul, W. J.: Über die Zeit, die benötigt wird, um endliche Mengen umzuordnen. Gesellschaft für Informatik, 1. Fachtagung über Automatentheorie und Formale Sprachen. Bonn, 9.–12. Juli 1972. Lecture Notes in Computer Science 2. Berlin-Heidelberg-New York: Springer 1973, S. 249–253

    Google Scholar 

  5. Paul, W. J.: Optimales Transponieren quadratischer Matrizen. Gesellschaft für Informatik, 3. Jahrestagung. Hamburg, 8.–10. Oktober 1973. Lecture Notes in Computer Science 1. Berlin-Heidelberg-New York: Springer 1973. S. 72–80

    Google Scholar 

  6. Stoss, H. J.: Rangierkomplexität von Permutationen. Acta Informatica 2, 80–96 (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Angewandte Mathematik und 6Informatik 6der Universität des Saarlandes, D-6600, Saarbrücken, Bundesrepublik Deutschland

    W. J. Paul

  2. Universität Konstanz Fachbereich Mathematik, Universitätsstr. 10, D-7750, Konstanz, Bundesrepublik Deutschland

    H. -J. Stoß

Authors
  1. W. J. Paul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. -J. Stoß
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Paul, W.J., Stoß, H.J. Zur Komplexität von Sortierproblemen. Acta Informatica 3, 217–225 (1974). https://doi.org/10.1007/BF00288635

Download citation

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288635

Search

Navigation