Since 2014
Tables should be sorted (on random access machines)
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Tables should be sorted (on random access machines)
|
|
| Creator |
Fich, Faith
Miltersen, Peter Bro |
|
| Description |
We consider the problem of storing an n element subset S of a universeof size m, so that membership queries (is x in S?) can be answeredefficiently. The model of computation is a random access machine withthe standard instruction set (direct and indirect addressing, conditionalbranching, addition, subtraction, and multiplication). We show that if smemory registers are used to store S, where n
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-01-26
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19928
10.7146/brics.v2i26.19928 |
|
| Source |
BRICS Report Series; No 26 (1995): RS-26 Tables should be sorted (on random access machines)
BRICS Report Series; No 26 (1995): RS-26 Tables should be sorted (on random access machines) 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19928/17582
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|