Searching ordered structures

N. Linial; M. Saks

doi:10.1016/0196-6774(85)90020-3

Searching ordered structures

N. Linial^*
, M. Saks

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

42 Scopus citations

Abstract

Suppose distinct real numbers are assigned to the elements of a finite partially ordered set P in an order preserving manner. The problem of determining the fewest numbers of comparisons required to locate a given number x in P is investigated. Some general bounds are provided for the problem and analyzed in detail for the case that P is a product of chains and that P is a rooted forest.

Original language	English
Pages (from-to)	86-103
Number of pages	18
Journal	Journal of Algorithms
Volume	6
Issue number	1
DOIs	https://doi.org/10.1016/0196-6774(85)90020-3
State	Published - Mar 1985
Externally published	Yes

Bibliographical note

Funding Information:
Rutgers University, in part by NSF under

Access to Document

10.1016/0196-6774(85)90020-3

Cite this

@article{693b228f494841df8bbd416ca37b1424,

title = "Searching ordered structures",

abstract = "Suppose distinct real numbers are assigned to the elements of a finite partially ordered set P in an order preserving manner. The problem of determining the fewest numbers of comparisons required to locate a given number x in P is investigated. Some general bounds are provided for the problem and analyzed in detail for the case that P is a product of chains and that P is a rooted forest.",

author = "N. Linial and M. Saks",

note = "Funding Information: Rutgers University, in part by NSF under",

year = "1985",

month = mar,

doi = "10.1016/0196-6774(85)90020-3",

language = "אנגלית",

volume = "6",

pages = "86--103",

journal = "Journal of Algorithms",

issn = "0196-6774",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - Searching ordered structures

AU - Linial, N.

AU - Saks, M.

N1 - Funding Information: Rutgers University, in part by NSF under

PY - 1985/3

Y1 - 1985/3

N2 - Suppose distinct real numbers are assigned to the elements of a finite partially ordered set P in an order preserving manner. The problem of determining the fewest numbers of comparisons required to locate a given number x in P is investigated. Some general bounds are provided for the problem and analyzed in detail for the case that P is a product of chains and that P is a rooted forest.

AB - Suppose distinct real numbers are assigned to the elements of a finite partially ordered set P in an order preserving manner. The problem of determining the fewest numbers of comparisons required to locate a given number x in P is investigated. Some general bounds are provided for the problem and analyzed in detail for the case that P is a product of chains and that P is a rooted forest.

UR - https://www.scopus.com/pages/publications/0002477550

U2 - 10.1016/0196-6774(85)90020-3

DO - 10.1016/0196-6774(85)90020-3

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0002477550

SN - 0196-6774

VL - 6

SP - 86

EP - 103

JO - Journal of Algorithms

JF - Journal of Algorithms

IS - 1

ER -

Searching ordered structures

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this