Travelled to:1 × Finland
1 × Greece
1 × Italy
1 × The Netherlands
2 × USA
Collaborated with:R.M.Karp R.Krauthgamer G.Kortsarz E.Cohen H.Kaplan M.Adler V.V.Vazirani R.Gandhi S.Khuller A.Srinivasan G.E.Blelloch K.Dhamdhere R.Ravi R.Schwartz S.Sridhar J.Chuzhoy S.Guha S.Khanna J.Naor
Talks about:approxim (2) cover (2) peer (2) hard (2) polylogarithm (1) reconstruct (1) phylogenet (1) inapproxim (1) distribut (1) algorithm (1)
Person: Eran Halperin
DBLP: Halperin:Eran
Contributed to:
20062004
2004200320032001Wrote 7 papers:
- ICALP-v1-2006-BlellochDHRSS #parametricity #re-engineering
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction (GEB, KD, EH, RR, RS, SS), pp. 667–678.
- ICALP-2004-HalperinK #problem #set
- The Minimum-Entropy Set Cover Problem (EH, RMK), pp. 733–744.
- STOC-2004-ChuzhoyGHKKN #approximate #symmetry
- Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.
- ICALP-2003-GandhiHKKS #algorithm #approximate
- An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.
- STOC-2003-AdlerHKV #network #peer-to-peer #probability #process
- A stochastic process on the hypercube with applications to peer-to-peer networks (MA, EH, RMK, VVV), pp. 575–584.
- STOC-2003-HalperinK
- Polylogarithmic inapproximability (EH, RK), pp. 585–594.
- ICALP-2001-CohenHK #aspect-oriented #consistency #distributed #performance #using
- Performance Aspects of Distributed Caches Using TTL-Based Consistency (EC, EH, HK), pp. 744–756.