| On a network creation game A Fabrikant, A Luthra, E Maneva, CH Papadimitriou, S Shenker Proceedings of the twenty-second annual symposium on Principles of …, 2003 | 669 | 2003 |
| Parity violation in elastic electron-proton scattering and the proton's strange magnetic form factor DT Spayde, T Averett, D Barkhuff, DH Beck, EJ Beise, C Benson, ... Physical Review Letters 84 (6), 1106-1109, 2000 | 252 | 2000 |
| Power-aware base station positioning for sensor networks A Bogdanov, E Maneva, S Riesenfeld INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and …, 2004 | 226 | 2004 |
| A new look at survey propagation and its generalizations E Maneva, E Mossel, MJ Wainwright Journal of the ACM (JACM) 54 (4), 17, 2007 | 208 | 2007 |
| The connectivity of Boolean satisfiability: computational and structural dichotomies P Gopalan, PG Kolaitis, EN Maneva, CH Papadimitriou SIAM J. Comput 38 (6), 2330-2355, 2009 | 193 | 2009 |
| Measurement of the vector analyzing power in elastic electron-proton scattering as a probe of the double virtual Compton amplitude SP Wells, T Averett, D Barkhuff, DH Beck, EJ Beise, C Benson, H Breuer, ... Physical Review C 63 (6), 064001, 2001 | 149 | 2001 |
| Sherali--Adams Relaxations and Indistinguishability in Counting Logics A Atserias, E Maneva SIAM Journal on Computing 42 (1), 112-137, 2013 | 125 | 2013 |
| Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes MJ Wainwright, E Maneva Proceedings. International Symposium on Information Theory, 2005. ISIT 2005 …, 2005 | 121 | 2005 |
| Lossy source compression using low-density generator matrix codes: Analysis and algorithms MJ Wainwright, E Maneva, E Martinian IEEE Transactions on Information Theory 56 (3), 1351-1368, 2010 | 88 | 2010 |
| New model for rigorous analysis of LT-codes E Maneva, A Shokrollahi 2006 IEEE International Symposium on Information Theory, 2677-2679, 2006 | 65 | 2006 |
| Improved two-party and multi-party purification protocols EN Maneva, JA Smolin CONTEMPORARY MATHEMATICS 305, 203-212, 2002 | 52 | 2002 |
| On the satisfiability threshold and clustering of solutions of random 3-SAT formulas E Maneva, A Sinclair Theoretical Computer Science 407 (1-3), 359-369, 2008 | 29 | 2008 |
| Mean-payoff games and propositional proofs A Atserias, E Maneva Information and Computation 209 (4), 664-691, 2011 | 17* | 2011 |
| Pruning processes and a new characterization of convex geometries F Ardila, E Maneva Discrete Mathematics 309 (10), 3083-3091, 2009 | 16 | 2009 |
| Belief propagation algorithms for constraint satisfaction problems EN Maneva University of California, Berkeley, 2006 | 9 | 2006 |
| A computational method for bounding the probability of reconstruction on trees N Bhatnagar, E Maneva SIAM Journal on Discrete Mathematics 25 (2), 854-871, 2011 | 5 | 2011 |
| Course 15 A hike in the phases of the 1-in-3 satisfiability E Maneva, T Meltzer, J Raymond, A Sportiello, L Zdeborová Les Houches 85, 491-498, 2007 | 5 | 2007 |
| Interactive communication on noisy channels E Maneva BS Thesis, California Institute of Technology, Pasadena, CA, USA, 2001 | 3 | 2001 |
| WEBRC Receiver Coordination K Chaudhuri, M Luby, E Maneva, S Riesenfeld | 1 | 2003 |
| Analysis of the use of automatic judges in computer programming classes in vocational education EN Maneva Universitat Politècnica de Catalunya, 2022 | | 2022 |
Christos H PAPADIMITRIOUColumbia UniversityVerified email at columbia.edu
