Bureaucrats, editor, Administrators
373
edits
Changes
From Theory
→Best Paper Awards:
Line 115:
Line 115:
</ul>
−== '''''Best Paper Awards''''': ==
−<ul>
−<li>'''Improved Distributed Algorithms for Coloring and Network Decomposition Problems'''<br>
−Aravind Srinivasan<br>
−Best Student Paper Award in STOC 1992
−<br><br>
−<li>'''Algorithms for Data Migration with Cloning'''<br>
−Samir Khuller, Yoo Ah Kim and Justin Wan<br>
−Best Newcomer Award Paper in PODS 2003
−<br><br>
−<li>'''Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction'''<br>
−MohammadTaghi Hajiaghayi (joint work with Erik D. Demaine and Kenichi Kawarabayashi)<br>
−Best Paper Award in ISAAC 2006
−<br><br>
−<li>'''Distributed Ranked Search'''<br>
−Bobby Bhattacharjee and Pete Keleher and Aravind Srinivsan (joint work with Vijay Goplakrishnan and Ruggero Morselli)<br>
−Best Paper Award in Annual International Conference on High Performance Computing (HiPC) 2007
−<br><br>
−<li>'''Adaptive Local Ratio'''<br>
−Julian Mestre<br>
−Best Student Paper Award in SODA 2008
−<br><br>
−<li>'''TrInc: Small Trusted Hardware for Large Distributed Systems'''<br>
−Dave Levin (joint work with John R. Douceur, Jacob R. Lorch and Thomas Moscibroda)<br>
−Best Paper Award in USENIX Symposium on Networked Systems Design and Implementation (NSDI) 2009
−<br><br>
−<li>'''Analysis of Troubled Assets Reverse Auction'''<br>
−Saeed Alaei and Azaraksh Malekian<br>
−Best Student Paper Award in WINE 2009
−<br><br>
−<li>'''A Unified Approach to Ranking in Probabilistic Databases'''<br>
−Jian Li, Barna Saha and Amol Deshpande<br>
−Best Paper Award in VLDB 2009
−<br><br>
−<li>'''Codes in Permutations and Error Correction for Rank Modulation'''<br>
−Arya Mazumdar and Alexander Barg<br>
−Best Student Paper AWard in ISIT 2010
−<br><br>
−<li>'''Basic Network Creation Games'''<br>
−MohammadTaghi Hajiaghayi (joint work with Noga Alon, Erik D. Demaine and Tom Leighton)<br>
−Best Paper Award in SPAA 2010
−<br><br>
−<li>'''When LP Is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings'''<br>
−Jian Li and Julian Mestre (joint work with Nikhil Bansal, Anupam Gupta, Vishwanathan Nagarajan and Atri Rudra)<br>
−Best Paper Award in ESA 2010
−<br><br>
−<li>'''Predicting Trust and Distrust in Social Networks'''<br>
−Tom DuBois, Jennifer Golbeck and Aravind Srinivasan<br>
−Best Paper Award in IEEE International Conference on Social Computing (SocialCom) 2011
−<br><br>
−<li>'''Examining the Evolution of Ties in Social Networks: A Longitudinal Multi-Method Study'''<br>
−Tom DuBois and Aravind Srinivasan (joint work with Sridevi Shivarajan)<br>
−Adjudged One of the Best Papers at Proc. Academy of Management Annual Meeting, 2012. (Appeared in Best Paper Proceedings)
−<br><br>
−<li>'''List H-Coloring a Graph By Removing Few Vertices'''<br>
−Rajesh Chitnis (joint work with Laszlo Egri and Daniel Marx)<br>
−Best Paper Award in ESA 2013
can be useful in computation.
can be useful in computation.
−</ul>
</ul>
