INFORMATION BOUNDS ARE GOOD FOR SEARCH PROBLEMS ON ORDERED DATA STRUCTURES.

Nathan Linial; Michael E. Saks

doi:10.1109/sfcs.1983.27

INFORMATION BOUNDS ARE GOOD FOR SEARCH PROBLEMS ON ORDERED DATA STRUCTURES.

Nathan Linial^*
, Michael E. Saks

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

Original language	English
Title of host publication	Annual Symposium on Foundations of Computer Science (Proceedings)
Publisher	IEEE
Pages	473-475
Number of pages	3
ISBN (Print)	0818605081, 9780818605086
DOIs	https://doi.org/10.1109/sfcs.1983.27
State	Published - 1983

Publication series

Name	Annual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)	0272-5428

Access to Document

10.1109/sfcs.1983.27

Cite this

@inproceedings{7ca19a7583844c42b21e01ba6d019ede,

title = "INFORMATION BOUNDS ARE GOOD FOR SEARCH PROBLEMS ON ORDERED DATA STRUCTURES.",

author = "Nathan Linial and Saks, \{Michael E.\}",

year = "1983",

doi = "10.1109/sfcs.1983.27",

language = "אנגלית",

isbn = "0818605081",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "IEEE",

pages = "473--475",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

}

INFORMATION BOUNDS ARE GOOD FOR SEARCH PROBLEMS ON ORDERED DATA STRUCTURES. / Linial, Nathan; Saks, Michael E.
Annual Symposium on Foundations of Computer Science (Proceedings). IEEE, 1983. p. 473-475 (Annual Symposium on Foundations of Computer Science (Proceedings)).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - INFORMATION BOUNDS ARE GOOD FOR SEARCH PROBLEMS ON ORDERED DATA STRUCTURES.

AU - Linial, Nathan

AU - Saks, Michael E.

PY - 1983

Y1 - 1983

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

U2 - 10.1109/sfcs.1983.27

DO - 10.1109/sfcs.1983.27

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0020914602

SN - 0818605081

SN - 9780818605086

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 473

EP - 475

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -

INFORMATION BOUNDS ARE GOOD FOR SEARCH PROBLEMS ON ORDERED DATA STRUCTURES.

Publication series

Access to Document

Other files and links

Cite this