The finalists of the SIGMOD 2016 Programming Contest were selected after review and additional testing of the top submissions from the leaderboard. Testing involved test cases from the leaderboard as well as additional test cases that have similar characteristics.
The contest organizers would like to thank all of the teams that participated this year. We would also like to congratulate the finalists, including the overall winning team and the runners-up, who are listed here in alphabetical (not ranking) order:
akgroup (University of Engineering and Technology - Vietnam National University)
- Pham Hai Dang
- DU Phuong Hanh
- Vu Ba Duy
H_minor_free (The University of Tokyo) Overall Winner (1st prize)
- Takuto Ikuta
- Takanori Hayashi
- Yosuke Yano
- Yoichi Iwata
uoa_team (National and Kapodistrian University of Athens) Runners Up (2nd prize)
- Athanasios-Michail Karampatsis
- Nikolaos Dimakopoulos
- Georgios Alexandropoulos
- Nikolaos Tzamos
- Yannis Foufoulas
while1 (Technische Universität München)
- Stefan Marcik
One member of each of these five teams will receive a travel award to attend the SIGMOD conference in San Francisco, where we will announce the runner up and overall winner of the contest.
Leaderboard as of 23:59 UTC, April 7, 2016
The leaderboard ranks the best submission of each team based on their performance in the small, medium and large tests. Only submissions that pass all three tests are considered for the leaderboard. Progress bars indicate how each submission fares in comparison with the other submissions on the leaderboard: the longest total runtime has an empty progress bar, while the fastest submission receives a full bar.
The test sizes refer to the size of the test input graphs. However, tests with larger graphs may not have longer runtimes, because the workload sizes vary from test to test.
|Rank||Team||Time in the Lead||Small