On the asymptotic complexity of sorting - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Igor Sergeev. On the asymptotic complexity of sorting. Electronic Colloquium on Computational Complexity (ECCC), 27:96, 2020. [doi]

@article{Sergeev20,
  title = {On the asymptotic complexity of sorting},
  author = {Igor Sergeev},
  year = {2020},
  url = {https://eccc.weizmann.ac.il/report/2020/096},
  researchr = {https://researchr.org/publication/Sergeev20},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {27},
  pages = {96},
}

runs on WebDSL