Special Events
Awards
Best Student Paper Award
A prize of $500 USD will be awarded to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). A paper is eligible if all authors are full-time students at the time of submission. This must be indicated in the submission process.
Papers eligible for the Best Student Paper award should indicate their eligibility at the time of submission. There is a box provided for this purpose on the submission server. Note that any paper whose authors are all full-time students at the time of submission is eligible for the award.
The Best Student Paper Award will be shared by the following two papers:
Tight Streaming Lower Bounds for Deterministic Approximate Counting
Yichuan Wang
Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava
Best Paper Award
The program committee may designate up to three papers accepted to the conference as SODA Best Papers. Submissions authored by PC members are not eligible for this award. Every other submission is automatically eligible for this award.
The Best Paper Award will be shared by the following two papers:
Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava
Quasi-Monte Carlo Beyond Hardy-Krause
Nikhil Bansal and Haotian Jiang
Jane Street Estimathon Event
Join Jane Street the evening of Tuesday, January 14th for an Estimathon®! The Estimathon is a mind-bending mixture of math and trivia. In teams, you'll attempt 13 Fermi problems in 30 minutes, ranging from totally trivial to positively Putnamesque. Be prepared to come up with the best set of confidence intervals!
A link to sign up for this event will be included with the conference registration form. The deadline by which to register for this event is December 27. Be sure to register for the conference and complete the additional Jane Street registration form prior to this date to confirm your spot.
Stay Up-to-Date with Email Alerts
Sign up for our monthly newsletter and emails about other topics of your choosing.