STORING A SPARSE TABLE WITH O(1) WORST CASE ACCESS TIME.

Michael L. Fredman, Janos Komlos, Endre Szemeredi

Research output: Contribution to journalConference article

35 Citations (Scopus)
Original languageEnglish (US)
Pages (from-to)165-169
Number of pages5
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - Dec 1 1982
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

@article{57ccab1fc3894644967e164d1379fba6,
title = "STORING A SPARSE TABLE WITH O(1) WORST CASE ACCESS TIME.",
author = "Fredman, {Michael L.} and Janos Komlos and Endre Szemeredi",
year = "1982",
month = "12",
day = "1",
language = "English (US)",
pages = "165--169",
journal = "Annual Symposium on Foundations of Computer Science - Proceedings",
issn = "0272-5428",

}

STORING A SPARSE TABLE WITH O(1) WORST CASE ACCESS TIME. / Fredman, Michael L.; Komlos, Janos; Szemeredi, Endre.

In: Annual Symposium on Foundations of Computer Science - Proceedings, 01.12.1982, p. 165-169.

Research output: Contribution to journalConference article

TY - JOUR

T1 - STORING A SPARSE TABLE WITH O(1) WORST CASE ACCESS TIME.

AU - Fredman, Michael L.

AU - Komlos, Janos

AU - Szemeredi, Endre

PY - 1982/12/1

Y1 - 1982/12/1

UR - http://www.scopus.com/inward/record.url?scp=0020288190&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020288190&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0020288190

SP - 165

EP - 169

JO - Annual Symposium on Foundations of Computer Science - Proceedings

JF - Annual Symposium on Foundations of Computer Science - Proceedings

SN - 0272-5428

ER -