Elitza Maneva

Visiting Professor Universitat Politècnica de Catalunya (UPC) Departament de Llenguatges i Sistemes Informàtics (LSI) Jordi Girona Salgado 1-3 Edif. Omega, S111 08034 Barcelona, Spain Email: maneva AT lsi DOT upc DOT edu Tel: +34-93-413-7788 Fax: +34-93-413-7787 CV

• A. Atserias, E. Maneva.
  Mean-Payoff Games and the Max-Atom Problem
  Submitted for publication, 2009.
  pdf

• N. Bhatnagar, E. Maneva.
  A computational method for bounding the probability of reconstruction on trees
  To appear in SIAM Journal on Discrete Mathematics, 2009.
  pdf

• P. Gopalan, P. Kolaitis, E. Maneva, C. Papadimitriou.
  The connectivity of Boolean satisfiability: computational and structural dichotomies
  SIAM Journal on Computing, Volume 38, Issue 6, pages 2330-2355, 2009.
  A preliminary version appeared in the 33rd International Colloquium on Automata, Languages and Programming (ICALP), pages 346-357, 2006.
  ArXiv

• F. Ardila, E. Maneva.
  Pruning processes and a new characterization of convex geometries
  Discrete Mathematics, Volume 309, pages 3083-3091, 2009.
  Arxiv

• E. Maneva, A. Sinclair.
  On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
  Theoretical Computer Science, Volume 407, pages 359-369, 2008.
  Arxiv

• E. Maneva, E. Mossel, M. Wainwright.
  A new look at Survey Propagation and its generalizations
  Journal of the ACM, Volume 54, Issue 4, pages 2-41, 2007.
  A preliminary version appeared in the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1089-1098, 2005.
  pdf

• E. Maneva, A. Shokrollahi.
  New model for rigorous analysis of LT codes
  in IEEE International Symposium on Information Theory (ISIT), pages 2677-2679, 2006.
  ArXiv

• M. Wainwright, E. Maneva.
  Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes
  in IEEE International Symposium on Information Theory (ISIT), pages 1493-1497, 2005.
  ArXiv

• A. Bogdanov, E. Maneva, S. Riesenfeld.
  Power-aware base station positioning for sensor networks
  in the 23rd Conference of the IEEE Communications Society (INFOCOM), 2004.
  pdf

• A. Fabrikant, A. Luthra, E. Maneva, C. Papadimitriou, S. Shenker.
  On a network creation game
  in 22nd ACM Symposium on Principles of Distributed Computing (PODC), pages 347-351, 2003.
  pdf

• E. Maneva, J. Smolin.
  Improved two-party and multi-party entanglement purification protocols
  in "Quantum Computation and Quantum Information Science", AMS Contemporary Mathematics Series, Volume 305, pages 203-212, 2002.
  ArXiv

• SAMPLE collaboration: D.T. Spayde et al.
  Parity violation in elastic electron-proton scattering and the proton's strange magnetic form factor
  in Phys. Rev. Lett., Volume 84, pages 1106-1109, 2000.
  ArXiv

• E. Maneva. Belief propagation algorithms for constraint satisfaction problems
  Ph.D. Thesis, Department of Computer Science, University of California at Berkeley, August 2006. Supervised by A. Sinclair.
  pdf