- CSB - MetaPress - Google - Bing - Yahoo
 | 2008 | |
|---|---|---|
| j15 |      | Lars Engebretsen, Jonas Holmerin: More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Random Struct. Algorithms 33(4): 497-514 (2008) |
| 2007 | ||
| j14 | | Lars Engebretsen: Bipartite multigraphs with expander-like properties. Discrete Applied Mathematics 155(13): 1667-1677 (2007) |
| 2006 | ||
| j13 | | Lars Engebretsen, Marek Karpinski: TSP with bounded metrics. J. Comput. Syst. Sci. 72(4): 509-546 (2006) |
| j12 | | Lars Engebretsen, Madhu Sudan: Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. Networks 47(3): 172-177 (2006) |
| j11 | | Lars Engebretsen: Platform-independent code conversion within the C++ locale framework. Softw., Pract. Exper. 36(15): 1643-1654 (2006) |
| 2005 | ||
| j10 | | Lars Engebretsen, Jonas Holmerin: Three-query PCPs with perfect completeness over non-Boolean domains. Random Struct. Algorithms 27(1): 46-75 (2005) |
| c12 | | Lars Engebretsen, Jonas Holmerin: More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. STACS 2005: 194-205 |
| 2004 | ||
| j9 | | Lars Engebretsen: Simplified tight analysis of Johnson's algorithm. Inf. Process. Lett. 92(4): 207-210 (2004) |
| j8 | | Lars Engebretsen, Venkatesan Guruswami: Is constraint satisfaction over two variables always easy? Random Struct. Algorithms 25(2): 150-178 (2004) |
| j7 | | Lars Engebretsen: The Nonapproximability of Non-Boolean Predicates. SIAM J. Discrete Math. 18(1): 114-129 (2004) |
| j6 | | Lars Engebretsen, Jonas Holmerin, Alexander Russell: Inapproximability results for equations over finite groups. Theor. Comput. Sci. 312(1): 17-45 (2004) |
| 2003 | ||
| j5 | | Lars Engebretsen: An Explicit Lower Bound for TSP with Distances One and Two. Algorithmica 35(4): 301-318 (2003) |
| j4 | | Lars Engebretsen, Jonas Holmerin: Towards optimal lower bounds for clique and chromatic number. Theor. Comput. Sci. 1-3(299): 537-584 (2003) |
| c11 | | Lars Engebretsen, Jonas Holmerin: Three-Query PCPs with Perfect Completeness over non-Boolean Domains. IEEE Conference on Computational Complexity 2003: 284-299 |
| 2002 | ||
| j3 | | Gunnar Andersson, Lars Engebretsen: Property testers for dense constraint satisfaction programs on finite domains. Random Struct. Algorithms 21(1): 14-32 (2002) |
| c10 | | Lars Engebretsen, Jonas Holmerin, Alexander Russell: Inapproximability Results for Equations over Finite Groups. ICALP 2002: 73-84 |
| c9 | | Lars Engebretsen, Venkatesan Guruswami: Is Constraint Satisfaction Over Two Variables Always Easy? RANDOM 2002: 224-238 |
| c8 | | |
| c7 | | Lars Engebretsen, Piotr Indyk, Ryan O'Donnell: Derandomized dimensionality reduction with applications. SODA 2002: 705-712 |
| i8 | | Lars Engebretsen, Jonas Holmerin, Alexander Russell: Inapproximability Results for Equations over Finite Groups. Electronic Colloquium on Computational Complexity (ECCC)(030) (2002) |
| i7 | | Lars Engebretsen, Jonas Holmerin: Three-Query PCPs with Perfect Completeness over non-Boolean Domains. Electronic Colloquium on Computational Complexity (ECCC)(040) (2002) |
| i6 | | Lars Engebretsen, Venkatesan Guruswami: Is Constraint Satisfaction Over Two Variables Always Easy? Electronic Colloquium on Computational Complexity (ECCC)(053) (2002) |
| 2001 | ||
| j2 | | Gunnar Andersson, Lars Engebretsen, Johan Håstad: A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. J. Algorithms 39(2): 162-204 (2001) |
| c6 | | Lars Engebretsen, Marek Karpinski: Approximation Hardness of TSP with Bounded Metrics. ICALP 2001: 201-212 |
| c5 | | |
| i5 | | Lars Engebretsen, Jonas Holmerin: Towards Optimal Lower Bounds For Clique and Chromatic Number. Electronic Colloquium on Computational Complexity (ECCC) 8(3) (2001) |
| 2000 | ||
| c4 | | |
| i4 | | Lars Engebretsen: Lower Bounds for non-Boolean Constraint Satisfaction. Electronic Colloquium on Computational Complexity (ECCC) 7(42) (2000) |
| i3 | | Lars Engebretsen, Marek Karpinski: Approximation Hardness of TSP with Bounded Metrics. Electronic Colloquium on Computational Complexity (ECCC) 7(89) (2000) |
| 1999 | ||
| c3 | | Gunnar Andersson, Lars Engebretsen, Johan Håstad: A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p. SODA 1999: 41-50 |
| c2 | | |
| 1998 | ||
| j1 | | Gunnar Andersson, Lars Engebretsen: Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. Inf. Process. Lett. 65(6): 305-311 (1998) |
| c1 | | Gunnar Andersson, Lars Engebretsen: Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems. RANDOM 1998: 357-368 |
| i2 | | Lars Engebretsen: An Explicit Lower Bound for TSP with Distances One and Two. Electronic Colloquium on Computational Complexity (ECCC) 5(46) (1998) |
| 1997 | ||
| i1 | | Gunnar Andersson, Lars Engebretsen: Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat. Electronic Colloquium on Computational Complexity (ECCC) 4(22) (1997) |
| 1 | Gunnar Andersson | |
| 2 | Venkatesan Guruswami | |
| 3 | Jonas Holmerin | |
| 4 | Johan Håstad | |
| 5 | Piotr Indyk | |
| 6 | Marek Karpinski | |
| 7 | Ryan O'Donnell | |
| 8 | Alexander Russell | |
| 9 | Madhu Sudan |
Colors in the list of coauthors
Last update Mon May 20 16:54:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page