Lars Engebretsen
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
8
Venues
3
Active years
1999–2005
Best venue rank
A*
Where they publish
Papers
8 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2005 | STACS | More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. | Lars Engebretsen, Jonas Holmerin |
| 2002 | ICALP | Inapproximability Results for Equations over Finite Groups. | Lars Engebretsen, Jonas Holmerin, Alexander Russell |
| 2002 | SODA | Derandomized dimensionality reduction with applications. | Lars Engebretsen, Piotr Indyk, Ryan O'Donnell |
| 2002 | SODA | Harmonic broadcasting is optimal. | Lars Engebretsen, Madhu Sudan |
| 2001 | ICALP | Approximation Hardness of TSP with Bounded Metrics. | Lars Engebretsen, Marek Karpinski |
| 2000 | ICALP | Clique Is Hard to Approximate within | Lars Engebretsen, Jonas Holmerin |
| 1999 | SODA | A New Way to Use Semidefinite Programming with Applications to Linear Equations mod | Gunnar Andersson, Lars Engebretsen, Johan Hstad |
| 1999 | STACS | An Explicit Lower Bound for TSP with Distances One and Two. | Lars Engebretsen |