default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElitza N. Maneva
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j8]Albert Atserias, Elitza N. Maneva
:
Sherali-Adams Relaxations and Indistinguishability in Counting Logics. SIAM J. Comput. 42(1): 112-137 (2013)- 2012
- [c8]Albert Atserias, Elitza N. Maneva:
Sherali-Adams relaxations and indistinguishability in counting logics. ITCS 2012: 367-379 - 2011
- [j7]Albert Atserias, Elitza N. Maneva:
Mean-payoff games and propositional proofs. Inf. Comput. 209(4): 664-691 (2011) - [j6]Nayantara Bhatnagar, Elitza N. Maneva:
A Computational Method for Bounding the Probability of Reconstruction on Trees. SIAM J. Discret. Math. 25(2): 854-871 (2011) - [i11]Albert Atserias, Elitza N. Maneva:
Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in Counting Logics. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j5]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): 1351-1368 (2010) - [c7]Albert Atserias, Elitza N. Maneva:
Mean-Payoff Games and Propositional Proofs. ICALP (1) 2010: 102-113 - [i10]Albert Atserias, Elitza N. Maneva:
Mean-payoff games and propositional proofs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j4]Federico Ardila, Elitza N. Maneva:
Pruning processes and a new characterization of convex geometries. Discret. Math. 309(10): 3083-3091 (2009) - [j3]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): 2330-2355 (2009) - [i9]Nayantara Bhatnagar, Elitza N. Maneva:
A computational method for bounding the probability of reconstruction on trees. CoRR abs/0903.4812 (2009) - 2008
- [j2]Elitza N. Maneva, Alistair Sinclair:
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theor. Comput. Sci. 407(1-3): 359-369 (2008) - 2007
- [j1]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A new look at survey propagation and its generalizations. J. ACM 54(4): 17 (2007) - [i8]Federico Ardila, Elitza N. Maneva:
Shelling Processes and a New Characterization of Convex Geometries. CoRR abs/0706.3750 (2007) - [i7]Elitza N. Maneva, Alistair Sinclair:
On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas. CoRR abs/0710.0805 (2007) - [i6]Elitza N. Maneva, Talya Meltzer, Jack Raymond, Andrea Sportiello, Lenka Zdeborová:
A Hike in the Phases of the 1-in-3 Satisfiability. CoRR abs/cond-mat/0702421 (2007) - 2006
- [c6]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. ICALP (1) 2006: 346-357 - [c5]Elitza N. Maneva, Amin Shokrollahi:
New model for rigorous analysis of LT-codes. ISIT 2006: 2677-2679 - [i5]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. CoRR abs/cs/0609072 (2006) - [i4]Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou:
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c4]Martin J. Wainwright, Elitza N. Maneva:
Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes. ISIT 2005: 1493-1497 - [c3]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A new look at survey propagation and its generalizations. SODA 2005: 1089-1098 - [i3]Martin J. Wainwright, Elitza N. Maneva:
Lossy source encoding via message-passing and decimation over generalized codewords of LDGM codes. CoRR abs/cs/0508068 (2005) - [i2]Elitza N. Maneva, Amin Shokrollahi:
New model for rigorous analysis of LT-codes. CoRR abs/cs/0512029 (2005) - 2004
- [c2]Andrej Bogdanov, Elitza N. Maneva, Samantha J. Riesenfeld:
Power-aware base station positioning for sensor networks. INFOCOM 2004 - [i1]Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright:
A New Look at Survey Propagation and its Generalizations. CoRR cs.CC/0409012 (2004) - 2003
- [c1]Alex Fabrikant, Ankur Luthra, Elitza N. Maneva, Christos H. Papadimitriou, Scott Shenker:
On a network creation game. PODC 2003: 347-351
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
