The matrix as in-situ data structure

A. Kaldewaij; Laurens de Vries

doi:10.1016/0167-6423(94)00032-A

The matrix as in-situ data structure

A. Kaldewaij
, Laurens de Vries

Mathematics and Computer Science

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

2 Downloads (Pure)

Abstract

It is shown how a matrix can be used to implement a class of dictionaries. Instead of the strong requirement of ascendingness of a linear array, the weaker requirement of ascendingness of a matrix is used. This results in implementations that are efficient in both computation time and storage usage.

Original language	English
Pages (from-to)	149-158
Journal	Science of Computer Programming
Volume	24
Issue number	2
DOIs	https://doi.org/10.1016/0167-6423(94)00032-A
Publication status	Published - 1995

Access to Document

10.1016/0167-6423(94)00032-A

Cite this

@article{08b67da91fac4c3787468bdc721b89a9,

title = "The matrix as in-situ data structure",

abstract = "It is shown how a matrix can be used to implement a class of dictionaries. Instead of the strong requirement of ascendingness of a linear array, the weaker requirement of ascendingness of a matrix is used. This results in implementations that are efficient in both computation time and storage usage.",

author = "A. Kaldewaij and \{de Vries\}, Laurens",

year = "1995",

doi = "10.1016/0167-6423(94)00032-A",

language = "English",

volume = "24",

pages = "149--158",

journal = "Science of Computer Programming",

issn = "0167-6423",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - The matrix as in-situ data structure

AU - Kaldewaij, A.

AU - de Vries, Laurens

PY - 1995

Y1 - 1995

N2 - It is shown how a matrix can be used to implement a class of dictionaries. Instead of the strong requirement of ascendingness of a linear array, the weaker requirement of ascendingness of a matrix is used. This results in implementations that are efficient in both computation time and storage usage.

AB - It is shown how a matrix can be used to implement a class of dictionaries. Instead of the strong requirement of ascendingness of a linear array, the weaker requirement of ascendingness of a matrix is used. This results in implementations that are efficient in both computation time and storage usage.

U2 - 10.1016/0167-6423(94)00032-A

DO - 10.1016/0167-6423(94)00032-A

M3 - Article

SN - 0167-6423

VL - 24

SP - 149

EP - 158

JO - Science of Computer Programming

JF - Science of Computer Programming

IS - 2

ER -

The matrix as in-situ data structure

Abstract

Access to Document

Fingerprint

Cite this