Elitza N. Maneva

Publication Activity (10 Years)

Years Active: 2003-2013
Publications (10 Years): 0

Top Topics

Linear Programming Relaxation

Top Venues

SIAM J. Comput.

Publications

Albert Atserias, Elitza N. Maneva
Sherali-Adams Relaxations and Indistinguishability in Counting Logics. SIAM J. Comput. 42 (1) (2013)
Albert Atserias, Elitza N. Maneva
Sherali-Adams relaxations and indistinguishability in counting logics. ITCS (2012)
Albert Atserias, Elitza N. Maneva
Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in Counting Logics. Electron. Colloquium Comput. Complex. 18 (2011)
Albert Atserias, Elitza N. Maneva
Mean-payoff games and propositional proofs. Inf. Comput. 209 (4) (2011)
Nayantara Bhatnagar, Elitza N. Maneva
A Computational Method for Bounding the Probability of Reconstruction on Trees. SIAM J. Discret. Math. 25 (2) (2011)
Albert Atserias, Elitza N. Maneva
Mean-Payoff Games and Propositional Proofs. ICALP (1) (2010)
Martin J. Wainwright, Elitza N. Maneva, Emin Martinian
Lossy source compression using low-density generator matrix codes: analysis and algorithms. IEEE Trans. Inf. Theory 56 (3) (2010)
Albert Atserias, Elitza N. Maneva
Mean-payoff games and propositional proofs. Electron. Colloquium Comput. Complex. 17 (2010)
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. SIAM J. Comput. 38 (6) (2009)
Nayantara Bhatnagar, Elitza N. Maneva
A computational method for bounding the probability of reconstruction on trees CoRR (2009)
Federico Ardila, Elitza N. Maneva
Pruning processes and a new characterization of convex geometries. Discret. Math. 309 (10) (2009)
Elitza N. Maneva, Alistair Sinclair
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theor. Comput. Sci. 407 (1-3) (2008)
Elitza N. Maneva, Alistair Sinclair
On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas CoRR (2007)
Elitza N. Maneva, Talya Meltzer, Jack Raymond, Andrea Sportiello, Lenka Zdeborová
A Hike in the Phases of the 1-in-3 Satisfiability CoRR (2007)
Federico Ardila, Elitza N. Maneva
Shelling Processes and a New Characterization of Convex Geometries CoRR (2007)
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright
A new look at survey propagation and its generalizations. J. ACM 54 (4) (2007)
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. ICALP (1) (2006)
Elitza N. Maneva, Amin Shokrollahi
New model for rigorous analysis of LT-codes. ISIT (2006)
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies CoRR (2006)
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Electron. Colloquium Comput. Complex. 13 (094) (2006)
Martin J. Wainwright, Elitza N. Maneva
Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes. ISIT (2005)
Elitza N. Maneva, Amin Shokrollahi
New model for rigorous analysis of LT-codes CoRR (2005)
Martin J. Wainwright, Elitza N. Maneva
Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes CoRR (2005)
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright
A new look at survey propagation and its generalizations. SODA (2005)
Andrej Bogdanov, Elitza N. Maneva, Samantha J. Riesenfeld
Power-aware base station positioning for sensor networks. INFOCOM (2004)
Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright
A New Look at Survey Propagation and its Generalizations CoRR (2004)
Alex Fabrikant, Ankur Luthra, Elitza N. Maneva, Christos H. Papadimitriou, Scott Shenker
On a network creation game. PODC (2003)