Partially persistent search trees with transcript operations

Kim S. Larsen

Open source

DOI
10.46298/dmtcs.253
Published
1
Container
Discrete Mathematics & Theoretical Computer Science
Publisher
Not recorded
Open access
yes

Credibility signals

uncertain Score 53/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.46298/dmtcs.253,
  title = {Partially persistent search trees with transcript operations},
  author = {Kim S. Larsen},
  year = {1999},
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  doi = {10.46298/dmtcs.253},
  url = {https://doi.org/10.46298/dmtcs.253}
}

RIS

TY  - JOUR
TI  - Partially persistent search trees with transcript operations
AU  - Kim S. Larsen
PY  - 1999
JO  - Discrete Mathematics & Theoretical Computer Science
DO  - 10.46298/dmtcs.253
UR  - https://doi.org/10.46298/dmtcs.253
ER  - 

APA

Larsen, K. S. (1999). Partially persistent search trees with transcript operations. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.46298/dmtcs.253

Source records