Efficient maxima-finding algorithms for random planar samples

Wei-Mei Chen, Hsien-Kuei Hwang, Tsung-Hsi Tsai

Open source

DOI
10.46298/dmtcs.337
Published
2003-01-01
Container
Discrete Mathematics & Theoretical Computer Science
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
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.46298/dmtcs.337,
  title = {Efficient maxima-finding algorithms for random planar samples},
  author = {Wei-Mei Chen and Hsien-Kuei Hwang and Tsung-Hsi Tsai},
  year = {2003},
  journal = {Discrete Mathematics \& Theoretical Computer Science},
  doi = {10.46298/dmtcs.337},
  url = {https://doi.org/10.46298/dmtcs.337}
}

RIS

TY  - JOUR
TI  - Efficient maxima-finding algorithms for random planar samples
AU  - Wei-Mei Chen
AU  - Hsien-Kuei Hwang
AU  - Tsung-Hsi Tsai
PY  - 2003
JO  - Discrete Mathematics & Theoretical Computer Science
DO  - 10.46298/dmtcs.337
UR  - https://doi.org/10.46298/dmtcs.337
ER  - 

APA

Chen, W., Hwang, H., & Tsai, T. (2003). Efficient maxima-finding algorithms for random planar samples. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.46298/dmtcs.337

Source records