Elitza Maneva

Research lab: Almaden Research Center

I am a postdoctoral researcher at the Computer Science Principles and Methodologies Group.

Contact information:
IBM Almaden Research Center
650 Harry Road
San Jose, CA 95120-6099
Phone: (510) 847-0171
Email: elitza DOT maneva AT gmail DOT com

CV


Papers

• Preprints
• Publications
• Thesis

---

Preprints

• F. Ardila, E. Maneva.
  Shelling processes and a new characterization of convex geometries
  Submitted for journal publication, 2007.
  Arxiv

Publications

• E. Maneva, A. Sinclair.
  On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
  To appear in Theoretical Computer Science, 2008.
  Arxiv

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

• P. Gopalan, P. Kolaitis, E. Maneva, C. Papadimitriou.
  The connectivity of Boolean satisfiability: computational and structural dichotomies
  in 33rd International Colloquium on Automata, Languages and Programming (ICALP), volume 4051 of Lecture Notes in Computer Science, Springer-Verlag, pages 346-357, 2006.
  ArXiv

• 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.
  ps, 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.
  ps, 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., vol 84, pp.1106-1109, 2000.
  ArXiv

Thesis

• 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.
  ps, pdf

Last updated 3 Jul 2008