#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2000

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We introduce a novel game that models the creation of Internet-like networks by selfish node-agents without central design or coordination. Nodes pay for the links that they establish, and benefit from short paths to all destinations. We study the Nash equilibria of this game, and prove results suggesting that the "price of anarchy" [4] in this context (the… (More)

- Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright
- J. ACM
- 2005

We study the survey propagation algorithm [19, 5, 4], which is an iterative technique that appears to be very effective in solving random <i>k</i>-SAT problems even with densities close to threshold. We first describe how any SAT formula can be associated with a novel family of Markov random fields (MRFs), parameterized by a real number ρ. We then show… (More)

- Andrej Bogdanov, Elitza N. Maneva, Samantha Riesenfeld
- INFOCOM
- 2004

We consider the problem of positioning data collecting base stations in a sensor network. We show that in general, the choice of positions has a marked influence on the data rate, or equivalently, the power efficiency, of the network. In our model, which is partly motivated by an experimental environmental monitoring system, the optimum data rate for a… (More)

- Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
- Electronic Colloquium on Computational Complexity
- 2006

Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisfiability threshold has centered around the structure and connectivity of the solution space. Motivated by this work, we study structural and connectivity-related properties of the… (More)

- Martin J. Wainwright, Elitza N. Maneva
- Proceedings. International Symposium on…
- 2005

We describe message-passing and decimation approaches for lossy source coding using low-density generator matrix (LDGM) codes. In particular, this paper addresses the problem of encoding a Bernoulli(1/2) source: for randomly generated LDGM codes with suitably irregular degree distributions, our methods yield performance very close to the rate distortion… (More)

- Albert Atserias, Elitza N. Maneva
- ITCS
- 2012

Two graphs with adjacency matrices <b>A</b> and <b>B</b> are isomorphic if there exists a permutation matrix <b>P</b> for which the identity <b>P</b><sup>T</sup><b>AP</b> = <b>B</b> holds. Multiplying through by <b>P</b> and relaxing the permutation matrix to a doubly stochastic matrix leads to the linear programming relaxation known as fractional… (More)

- Elitza N. Maneva, Alistair Sinclair
- Theor. Comput. Sci.
- 2008

We study the structure of satisfying assignments of a random 3-Sat formula. In particular, we show that a random formula of density α ≥ 4.453 almost surely has no non-trivial “core” assignments. Core assignments are certain partial assignments that can be extended to satisfying assignments, and have been studied recently in connection with the Survey… (More)

- Elitza N. Maneva, Amin Shokrollahi
- 2006 IEEE International Symposium on Information…
- 2006

We present a new model for LT codes which simplifies the analysis of the error probability of decoding by belief propagation. For any given degree distribution, we provide the first rigorous expression for the limiting bit-error probability as the length of the code goes to infinity via recent results in random hypergraphs by Darling and Norris, Ann. Appl.… (More)

- Martin J. Wainwright, Elitza N. Maneva, Emin Martinian
- IEEE Transactions on Information Theory
- 2010

We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average distortion achieved by check-regular ensemble of LDGM codes under optimal minimum distance source encoding. These bounds establish that the average distortion using such bounded… (More)

- Albert Atserias, Elitza N. Maneva
- Electronic Colloquium on Computational Complexity
- 2010

We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in Σ2-Frege (i.e. DNF-resolution). This reduces mean-payoff games to the weak automatizability of Σ2-Frege,… (More)