Behavioral experiments on biased voting in networks M Kearns, S Judd, J Tan, J Wortman Proceedings of the National Academy of Sciences 106 (5), 1347-1352, 2009 | 200 | 2009 |
A behavioral study of bargaining in social networks T Chakraborty, S Judd, M Kearns, J Tan Proceedings of the 11th ACM conference on Electronic commerce, 243-252, 2010 | 40 | 2010 |
Inapproximability of maximum weighted edge biclique and its applications J Tan International Conference on Theory and Applications of Models of Computation …, 2008 | 38 | 2008 |
Inapproximability of maximum weighted edge biclique and its applications J Tan International Conference on Theory and Applications of Models of Computation …, 2008 | 38 | 2008 |
Empirical price modeling for sponsored search K Ganchev, A Kulesza, J Tan, R Gabbard, Q Liu, M Kearns Internet and Network Economics: Third International Workshop, WINE 2007, San …, 2007 | 36 | 2007 |
The consecutive ones submatrix problem for sparse matrices J Tan, L Zhang Algorithmica 48, 287-299, 2007 | 29 | 2007 |
Biased voting and the democratic primary problem M Kearns, J Tan Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008 | 26 | 2008 |
Privacy-preserving belief propagation and sampling M Kearns, J Tan, J Wortman Advances in Neural Information Processing Systems 20, 2007 | 23 | 2007 |
Least-cost path in public transportation systems with fare rebates that are path-and time-dependent J Tan, HW Leong Proceedings. The 7th International IEEE Conference on Intelligent …, 2004 | 14 | 2004 |
A note on the inapproximability of correlation clustering J Tan Information Processing Letters 108 (5), 331-335, 2008 | 12 | 2008 |
Algorithmic and complexity issues of three clustering methods in microarray data analysis J Tan, KS Chua, L Zhang, S Zhu Algorithmica 48, 203-219, 2007 | 11 | 2007 |
Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices J Tan, L Zhang Algorithms and Computation: 15th International Symposium, ISAAC 2004, Hong …, 2005 | 4 | 2005 |
Network-faithful secure computation M Kearns, J Tan, J Wortman preprint, 2007 | 2 | 2007 |
Bioinformatics-Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis J Tan, KS Chua, L Zhang Lecture Notes in Computer Science 3595, 74-83, 2005 | 2 | 2005 |
Strategic and secure interactions in networks J Tan University of Pennsylvania, 2010 | 1 | 2010 |
The networked common goods game J Tan Combinatorial Optimization and Applications: 4th International Conference …, 2010 | | 2010 |
VCG Redistribution Mechanisms J Tan | | 2009 |