Search the dblp DataBase
Eran Ofek :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Uriel Feige , Eran Ofek Finding a Maximum Independent Set in a Sparse Random Graph. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2005, pp:282-293 [Conf ] Uriel Feige , Eran Ofek , Udi Wieder Approximating Maximum Edge Coloring in Multigraphs. [Citation Graph (0, 0)][DBLP ] APPROX, 2002, pp:108-121 [Conf ] Uriel Feige , Jeong Han Kim , Eran Ofek Witnesses for non-satisfiability of dense random 3CNF formulas. [Citation Graph (0, 0)][DBLP ] FOCS, 2006, pp:497-508 [Conf ] Uriel Feige , Eran Ofek Easily Refutable Subformulas of Large Random 3CNF Formulas. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:519-530 [Conf ] Omer Angel , Itai Benjamini , Eran Ofek , Udi Wieder Routing complexity of faulty networks. [Citation Graph (0, 0)][DBLP ] PODC, 2005, pp:209-217 [Conf ] Uriel Feige , Eran Ofek Finding a Maximum Independent Set in a Sparse Random Graph [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:050, pp:- [Journal ] Eran Ofek On the expansion of the giant component in percolated (n,d,lambda) graphs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:112, pp:- [Journal ] Uriel Feige , Eran Ofek Spectral techniques applied to sparse random graphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2005, v:27, n:2, pp:251-275 [Journal ] Uriel Feige , Eran Ofek Random 3CNF formulas elude the Lovasz theta function [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs. [Citation Graph (, )][DBLP ] Random 3CNF formulas elude the Lovasz theta function. [Citation Graph (, )][DBLP ] Search in 0.198secs, Finished in 0.199secs