Skip to main content
SpringerLink
Log in

Sorting and recognition problems for ordered sets

  • Conference paper
  • First Online:
STACS 85 (STACS 1985)

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

Included in the following conference series:

Abstract

How many questions are needed to identify an unknown ordered set which, however, is known to be isomorphic to a given "pattern" ordered set Po? This generalization of sorting is discussed together with related computational problems.

(on leave from: Automata Theory Research Group, Academy of Ściences, Szeged, Hungary)

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.

References

  • B. Bollobás [1978]: Extremal Graph Theory, Academic Press.

    Google Scholar 

  • G. Hetyei [1964]: unpublished.

    Google Scholar 

  • D. Kelly [1981]: On the dimension of partially ordered sets, Discr. Math. 35, 135–156.

    Google Scholar 

  • D.E. Knuth [1973]: The Art of Computer Programming, Vol. 3, Addison Wesley, Reading MA.

    Google Scholar 

  • N. Linial and M.E. Saks [1983]: Information bounds are good for search problems on ordered structures, 24th IEEE FOCS, 473–475.

    Google Scholar 

  • L. Lovász [1979]: Combinatorial Problems and Exercises, Akadémiai Kiadó.

    Google Scholar 

  • I. Rabinovitch and I. Rival [1979]: The rank of a distributive lattice, Discr. Math. 25, 275–279.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. f. Operations Research, Univ. Bonn, Germany

    Ulrich Faigle & György Turán

Authors
  1. Ulrich Faigle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. György Turán
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Faigle, U., Turán, G. (1984). Sorting and recognition problems for ordered sets. In: Mehlhorn, K. (eds) STACS 85. STACS 1985. Lecture Notes in Computer Science, vol 182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024000

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13912-6

  • Online ISBN: 978-3-540-39136-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation