Elimination Trees and the Construction of Pools and Stacks

N. Shavit, D. Touitou

Open source

DOI
10.1007/s002240000072
Published
1997-12
Container
Theory of Computing Systems
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/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.1007/s002240000072,
  title = {Elimination Trees and the Construction of Pools and Stacks},
  author = {N. Shavit and D. Touitou},
  year = {1997},
  journal = {Theory of Computing Systems},
  doi = {10.1007/s002240000072},
  url = {https://doi.org/10.1007/s002240000072}
}

RIS

TY  - JOUR
TI  - Elimination Trees and the Construction of Pools and Stacks
AU  - N. Shavit
AU  - D. Touitou
PY  - 1997
JO  - Theory of Computing Systems
DO  - 10.1007/s002240000072
UR  - https://doi.org/10.1007/s002240000072
ER  - 

APA

Shavit, N., & Touitou, D. (1997). Elimination Trees and the Construction of Pools and Stacks. Theory of Computing Systems. https://doi.org/10.1007/s002240000072

Source records