Prahladh Harsha

2008
21	EE	Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah: Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697
20	EE	Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan: Minimizing average latency in oblivious routing. SODA 2008: 200-207
19	EE	Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha: Complexity of Inference in Graphical Models. UAI 2008: 70-78
2007
18	EE	Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The Communication Complexity of Correlation. IEEE Conference on Computational Complexity 2007: 10-23
17	EE	Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication vs. Computation. Computational Complexity 16(1): 1-33 (2007)
16	EE	Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish: Sound 3-query PCPPs are Long. Electronic Colloquium on Computational Complexity (ECCC) 14(127): (2007)
2006
15		Kamala Krithivasan, Prahladh Harsha, Muralidhar Talupur: Communicating Distributed H systems with Simple Splicing Rules. CDES 2006: 107-111
14	EE	Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The communication complexity of correlation. Electronic Colloquium on Computational Complexity (ECCC) 13(151): (2006)
13	EE	Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. 36(4): 889-974 (2006)
2005
12	EE	Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Short PCPs Verifiable in Polylogarithmic Time. IEEE Conference on Computational Complexity 2005: 120-134
11	EE	Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF Properties Are Hard to Test. SIAM J. Comput. 35(1): 1-21 (2005)
2004
10	EE	Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh: Communication Versus Computation. ICALP 2004: 745-756
9	EE	Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Robust pcps of proximity, shorter pcps and applications to coding. STOC 2004: 1-10
8	EE	Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan: Robust PCPs of Proximity, Shorter PCPs and Applications to Coding Electronic Colloquium on Computational Complexity (ECCC)(021): (2004)
2003
7	EE	Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: Some 3CNF properties are hard to test. STOC 2003: 345-354
6	EE	Eli Ben-Sasson, Prahladh Harsha: Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games Electronic Colloquium on Computational Complexity (ECCC) 10(004): (2003)
5	EE	Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova: 3CNF Properties are Hard to Test Electronic Colloquium on Computational Complexity (ECCC) 10(006): (2003)
2001
4	EE	Prahladh Harsha, Madhu Sudan: Small PCPs with Low Query Complexity. STACS 2001: 327-338
2000
3	EE	Prahladh Harsha, Madhu Sudan: Small PCPs with low query complexity. Computational Complexity 9(3-4): 157-201 (2000)
2	EE	Prahladh Harsha, Madhu Sudan: Small PCPs with low query complexity Electronic Colloquium on Computational Complexity (ECCC) 7(61): (2000)
1999
1		Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha: Distributed Processing in Automata. Int. J. Found. Comput. Sci. 10(4): 443-464 (1999)

Coauthor Index

1	M. Sakthi Balan	[1]
2	Eli Ben-Sasson	[5] [6] [7] [8] [9] [11] [12] [13] [16] [21]
3	Venkat Chandrasekaran	[19]
4	Oded Goldreich	[8] [9] [12] [13]
5	Thomas P. Hayes	[20]
6	Yuval Ishai	[10] [17]
7	Rahul Jain	[14] [18]
8	Joe Kilian	[10] [17]
9	Kamala Krithivasan	[1] [15]
10	Oded Lachish	[16] [21]
11	Arie Matsliah	[16] [21]
12	David A. McAllester	[14] [18]
13	Hariharan Narayanan	[20]
14	Kobbi Nissim	[10] [17]
15	Harald Räcke	[20]
16	Jaikumar Radhakrishnan	[14] [18] [20]
17	Sofya Raskhodnikova	[5] [7] [11]
18	Nathan Srebro	[19]
19	Madhu Sudan	[2] [3] [4] [8] [9] [12] [13]
20	Muralidhar Talupur	[15]
21	Salil P. Vadhan	[8] [9] [12] [13]
22	Srinivasan Venkatesh	[10] [17]

Colors in the list of coauthors