I am a third year PhD student in the Computer & Information Science department, University of Pennsylvania. My advisor is Prof. Michael Kearns.

My research interest is in algorithms and theory of computation in general, I am especially interested in their connections and interactions with game theory and social networks. I am also interested in the algorithmic aspects of bioinformatics.

Teaching:

Courses of which I have been a TA:

CSE 262: Automata, Computers and Complexity, Fall 2006 (Prof. Guha)
CSE 112: Networked Life, Spring 2007 (Prof. Kearns)
CIS 520: Machine Learning, Fall 2007 (Prof. Ungar)
CSE 112: Networked Life, Spring 2008 (Prof. Kearns)

Publications:

Preprints

1. Michael Kearns, J. Tan, and Jennifer Wortman, Network-Faithful Secure Computation, preprint.

Journal Papers

1. J. Tan, A Note on the Inapproximability of Correlation Clustering, to appear in Information Processing Letters.
2. J. Tan, and Louxin Zhang, The Consecutive Ones Submatrix Problem for Sparse Matrices, Algorithmica, 48(3): 287-299, 2007. Preliminary version appeared at ISAAC'04.
3. J. Tan, Kok Seng Chua, Louxin Zhang, and Song Zhu, Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis, Algorithmica, 48(2): 203-219, 2007. Extended abstract appeared at COCOON'05.

Conference Papers

1. Michael Kearns and J. Tan, Biased Voting and the Democratic Primary Problem, to appear in the proceedings of the 4th International Workshop on Internet and Network Economics (WINE'08), Shanghai, China.
2. J. Tan, Inapproximability of Maximum Weighted Edge Biclique and Its Applications, in the proceedings of the 5th Annual Conference on Theory and Applications of Models of Computation (TAMC'08), Xi'an, China.
3. Michael Kearns, J. Tan, and Jennifer Wortman, Privacy Preserving Belief Propagation and Sampling, in the proceedings of Advances in Neural Information Processing Systems (NIPS'07),  Vancouver, Canada.
4. Kuzman Ganchev, Alex Kulesza, J. Tan, Ryan Gabbard, Qian Liu, and Michael Kearns, Empirical Price Modeling for Sponsored Search, in the proceedings of the 3rd International Workshop On Internet And Network Economics (WINE'07), San Diego, USA. (Longer version appeared in the 3rd Workshop on Sponsored Search Auctions, WWW'07, Banff, Canada.)
5. J. Tan, Kok Seng Chua, and Louxin Zhang, Algorithmic and Complexity Issues of Three Clustering Methods in Microarray Data Analysis (Extended Abstract), in the proceedings of the 11th International Computing and Combinatorics Conference (COCOON'05), Kunming, China.
6. J. Tan, and Louxin Zhang, Approximation Algorithms for the Consecutive Ones Submatrix Problem on Sparse Matrices, in the proceedings of the 15th Annual International Symposium on Algorithms and Computation (ISAAC'04), Hong Kong, China.
7. J. Tan and Hon Wai Leong, Least-Cost Path in Public Transportation Systems with Fare Rebates That Are Path and Time-Dependent, in the proceedings of the 7th International IEEE Conference on Intelligent Transportation Systems (ITSC'04), Washington D.C., USA. (also presented at OptDays-2004, Montreal, Canada)