Large-scale algorithms for red-black trees

Ma Yanchun

Open source

DOI
10.1109/iccsnt.2012.6526226
Published
2012-12
Container
Proceedings of 2012 2nd International Conference on Computer Science and Network Technology
Publisher
IEEE
Open access
unknown

Credibility signals

serious concern Score 29/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.1109/iccsnt.2012.6526226,
  title = {Large-scale algorithms for red-black trees},
  author = {Ma Yanchun},
  year = {2012},
  journal = {Proceedings of 2012 2nd International Conference on Computer Science and Network Technology},
  doi = {10.1109/iccsnt.2012.6526226},
  url = {https://doi.org/10.1109/iccsnt.2012.6526226}
}

RIS

TY  - JOUR
TI  - Large-scale algorithms for red-black trees
AU  - Ma Yanchun
PY  - 2012
JO  - Proceedings of 2012 2nd International Conference on Computer Science and Network Technology
DO  - 10.1109/iccsnt.2012.6526226
UR  - https://doi.org/10.1109/iccsnt.2012.6526226
ER  - 

APA

Yanchun, M. (2012). Large-scale algorithms for red-black trees. Proceedings of 2012 2nd International Conference on Computer Science and Network Technology. https://doi.org/10.1109/iccsnt.2012.6526226

Source records