Travelled to:1 × Italy
2 × USA
Collaborated with:N.Alon A.Moitra A.Shapira B.Barak G.Kindler R.Shaltiel A.Wigderson
Talks about:graph (2) extractor (1) construct (1) independ (1) decompos (1) approxim (1) problem (1) dispers (1) condens (1) complet (1)
Person: Benny Sudakov
DBLP: Sudakov:Benny
Contributed to:
2012
20062005Wrote 3 papers:
- STOC-2012-AlonMS #graph #scalability
- Nearly complete graphs decomposable into large induced matchings and their applications (NA, AM, BS), pp. 1079–1090.
- ICALP-v1-2006-AlonSS #approximate #problem
- Additive Approximation for Edge-Deletion Problems (NA, AS, BS), pp. 1–2.
- STOC-2005-BarakKSSW #graph #independence #simulation
- Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors (BB, GK, RS, BS, AW), pp. 1–10.