Searching for authors named "Uriel Feige" – sorted by Relevance.
-
Small linear dependencies for binary vectors of low weight
- Small linear dependencies for binary vectors of low weight Uriel Feige Department of Computer
- Add To MetaCart
-
Lecture 12
- Lecture 12 Uriel Feige May 22, 2008 1 Max cut in planar graphs After adding the triangle
- Add To MetaCart
-
A Fast Randomized LOGSPACE Algorithm for Graph Connectivity
- A Fast Randomized LOGSPACE Algorithm for Graph Connectivity Uriel Feige August 5, 1996 Abstract
- Cited by 6 (1 self) – Add To MetaCart
-
Collecting Coupons On Trees, And The Cover Time Of Random Walks
- COLLECTING COUPONS ON TREES, AND THE COVER TIME OF RANDOM WALKS Uriel Feige Abstract. We consider
- Cited by 2 (0 self) – Add To MetaCart
-
Randomized Rounding for Semidefinite Programs - Variations on the MAX CUT Example
- Randomized Rounding for Semidefinite Programs -- Variations on the MAX CUT Example Uriel Feige
- Cited by 8 (1 self) – Add To MetaCart
-
Sampling Vertex Degrees and Estimating Network Load Parameters
- Sampling vertex degrees and estimating network load parameters Uriel Feige Department of Computer
- Cited by 2 (0 self) – Add To MetaCart
-
Rigorous analysis of heuristics for NP-hard problems
- Rigorous Analysis of Heuristics for NP-hard Problems Uriel Feige Weizmann Institute, Israel uriel
- Cited by 1 (0 self) – Add To MetaCart
-
Approximation algorithms for allocation problems: Improving the Factor
- Approximation algorithms for allocation problems: Improving the factor of 1 − 1/e Uriel Feige
- Cited by 11 (5 self) – Add To MetaCart
-
On Limited versus Polynomial Nondeterminism
- Computer Science 1997-1 On Limited versus Polynomial Nondeterminism Uriel Feige Joe Kilian 12 March, 1997
- Cited by 11 (1 self) – Add To MetaCart
-
Error Reduction By Parallel Repetition - the State of the Art
- Error reduction by parallel repetition -- the state of the art (Preliminary version) Uriel Feige
- Cited by 7 (0 self) – Add To MetaCart

