출판 Fast Algorithms for Finding Matchings in Lopsided Bipartite Graphs with Applications to Display Ads Denis Charles, Max Chickering, Nikhil Devanur, Kamal Jain, Manan Sanghi Proceedings of the ACM Conference on Electronic Commerence (EC10) | June 2010
출판 Market Design & Analysis for a P2P Backup System Sven Seuken, Denis Charles, Max Chickering, Sidd Puri Proceedings of the ACM Conference on Electronic Commerence (EC10) | June 2010
출판 On the round complexity of covert computation Vipul Goyal, Abhishek Jain STOC ’10 Proceedings of the forty-second ACM symposium on Theory of computing | June 2010
출판 Efficiently Learning Mixtures of Two Gaussians Adam Tauman Kalai, Ankur Moitra, Gregory Valiant Proceedings of the forty-first annual ACM symposium on the Theory of Computing (STOC), 2010 | June 2010 ISBN: 978-1-4503-0050-6
출판 Fooling Functions of Halfspaces under Product Disributions Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zuckerman CCC’10 | June 2010 CCC'10
출판 Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback Alekh Agarwal, Ofer Dekel, Lin Xiao Proceedings of the 23rd Annual Conference on Learning Theory (COLT) | June 2010
출판 Differential Privacy Under Continual Observation Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy Rothblum STOC ’10: Proceedings of the 42nd ACM symposium on Theory of computing | June 2010 프로젝트
출판 Large Scale Max-Margin Multi-Label Classification with Priors B. Hariharan, L. Zelnik-Manor, S. V. N. Vishwanathan, M. Varma, Manik Varma Proceedings of the International Conference on Machine Learning | June 2010
출판 Truthful Mechanisms with Implicit Payment Computation Moshe Babaioff, Robert Kleinberg, Aleksandrs Slivkins ACM Conference on Electronic Commerce (EC’10) | June 2010 Best Paper Award (ACM EC 2010). The full version can be found on arxiv.org (http://arxiv.org/abs/1004.3630). 프로젝트 프로젝트 프로젝트
출판 Asymptotically Optimal Strategy-Proof Mechanisms for Two-Facility Games Pinyan Lu, Xiaorui Sun, Yajun Wang, Zeyuan Allen Zhu ACM EC 2010 | June 2010 ACM EC 2010