Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
On the Difference Between Closest, Furthest, and Orthogonal Pairs: Nearly-Linear vs Barely-Subquadratic Complexity.
Ryan Williams
Venue
A*
SODA
Year
2018
Proceedings
SODA
DBLP record
conf/soda/Williams18 ↗
Browse the full
SODA paper archive
.