Closest-point problems simplified on the RAM

Timothy Moon-Yew Chan

Closest-point problems simplified on the RAM

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
Publisher	Association for Computing Machinery
Pages	472-473
Number of pages	2
ISBN (Electronic)	089871513X
State	Published - Jan 1 2002
Externally published	Yes
Event	13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 - San Francisco, United States Duration: Jan 6 2002 → Jan 8 2002

Publication series

Name	Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Volume	06-08-January-2002

Other

Other	13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002
Country	United States
City	San Francisco
Period	1/6/02 → 1/8/02

ASJC Scopus subject areas

Software
Mathematics(all)

Access to Document

Cite this

Chan, T. M-Y. (2002). Closest-point problems simplified on the RAM. In Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 (pp. 472-473). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 06-08-January-2002). Association for Computing Machinery.

Closest-point problems simplified on the RAM. / Chan, Timothy Moon-Yew.

Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, 2002. p. 472-473 (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; Vol. 06-08-January-2002).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chan, TM-Y 2002, Closest-point problems simplified on the RAM. in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 06-08-January-2002, Association for Computing Machinery, pp. 472-473, 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, San Francisco, United States, 1/6/02.

@inproceedings{fc4de0fea4eb4bf7bc77a9a0dd20f124,

title = "Closest-point problems simplified on the RAM",

author = "Chan, {Timothy Moon-Yew}",

year = "2002",

month = jan,

day = "1",

language = "English (US)",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "472--473",

booktitle = "Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002",

note = "13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002 ; Conference date: 06-01-2002 Through 08-01-2002",

}

TY - GEN

T1 - Closest-point problems simplified on the RAM

AU - Chan, Timothy Moon-Yew

PY - 2002/1/1

Y1 - 2002/1/1

UR - http://www.scopus.com/inward/record.url?scp=84968911263&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84968911263&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84968911263

T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

SP - 472

EP - 473

BT - Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002

PB - Association for Computing Machinery

T2 - 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002

Y2 - 6 January 2002 through 8 January 2002

ER -