Lars Engebretsen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2008

More efficient queries in PCPs for NP and improved approximation hardness of maximum CSPLars Engebretsen, Jonas Holmerin. rsa, 33(4):497-514, 2008. [doi]

2007

Bipartite multigraphs with expander-like propertiesLars Engebretsen. DAM, 155(13):1667-1677, 2007. [doi]

2006

Harmonic broadcasting is bandwidth-optimal assuming constant bit rateLars Engebretsen, Madhu Sudan. networks, 47(3):172-177, 2006. [doi]

Platform-independent code conversion within the C++ locale frameworkLars Engebretsen. SPE, 36(15):1643-1654, 2006. [doi]

TSP with bounded metricsLars Engebretsen, Marek Karpinski. jcss, 72(4):509-546, 2006. [doi]

2005

More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSPLars Engebretsen, Jonas Holmerin. STACS 2005: 194-205 [doi]

Three-query PCPs with perfect completeness over non-Boolean domainsLars Engebretsen, Jonas Holmerin. rsa, 27(1):46-75, 2005. [doi]

2004

The Nonapproximability of Non-Boolean PredicatesLars Engebretsen. siamdm, 18(1):114-129, 2004. [doi]

Simplified tight analysis of Johnson s algorithmLars Engebretsen. ipl, 92(4):207-210, 2004. [doi]

Inapproximability results for equations over finite groupsLars Engebretsen, Jonas Holmerin, Alexander Russell. TCS, 312(1):17-45, 2004. [doi]

Is constraint satisfaction over two variables always easy?Lars Engebretsen, Venkatesan Guruswami. rsa, 25(2):150-178, 2004. [doi]

2003

Three-Query PCPs with Perfect Completeness over non-Boolean DomainsLars Engebretsen, Jonas Holmerin. cocoon 2003: 284-299 [doi]

An Explicit Lower Bound for TSP with Distances One and TwoLars Engebretsen. algorithmica, 35(4):301-318, 2003. [doi]

Towards optimal lower bounds for clique and chromatic numberLars Engebretsen, Jonas Holmerin. TCS, 1-3(299):537-584, 2003. [doi]

2002

Property testers for dense constraint satisfaction programs on finite domainsGunnar Andersson, Lars Engebretsen. rsa, 21(1):14-32, 2002. [doi]

Harmonic broadcasting is optimalLars Engebretsen, Madhu Sudan. soda 2002: 431-432 [doi]

Three-Query PCPs with Perfect Completeness over non-Boolean DomainsLars Engebretsen, Jonas Holmerin. eccc, (040), 2002. [doi]

Inapproximability Results for Equations over Finite GroupsLars Engebretsen, Jonas Holmerin, Alexander Russell. eccc, (030), 2002. [doi]

Inapproximability Results for Equations over Finite GroupsLars Engebretsen, Jonas Holmerin, Alexander Russell. icalp 2002: 73-84 [doi]

Is Constraint Satisfaction Over Two Variables Always Easy?Lars Engebretsen, Venkatesan Guruswami. random 2002: 224-238 [doi]

Is Constraint Satisfaction Over Two Variables Always Easy?Lars Engebretsen, Venkatesan Guruswami. eccc, (053), 2002. [doi]

Derandomized dimensionality reduction with applicationsLars Engebretsen, Piotr Indyk, Ryan O Donnell. soda 2002: 705-712 [doi]

2001

2000

Lower Bounds for non-Boolean Constraint SatisfactionLars Engebretsen. eccc, 7(42), 2000. [doi]

Clique Is Hard to Approximate within ::::n:::::::1-::::o::::(1):::Lars Engebretsen, Jonas Holmerin. icalp 2000: 2-12 [doi]

Approximation Hardness of TSP with Bounded MetricsLars Engebretsen, Marek Karpinski. eccc, 7(89), 2000. [doi]

1999

A New Way to Use Semidefinite Programming with Applications to Linear Equations mod ::::p::::Gunnar Andersson, Lars Engebretsen, Johan Håstad. soda 1999: 41-50 [doi]

An Explicit Lower Bound for TSP with Distances One and TwoLars Engebretsen. STACS 1999: 373-382 [doi]

1998

Sampling Methods Applied to Dense Instances of Non-Boolean Optimization ProblemsGunnar Andersson, Lars Engebretsen. random 1998: 357-368 [doi]

Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SATGunnar Andersson, Lars Engebretsen. ipl, 65(6):305-311, 1998. [doi]

An Explicit Lower Bound for TSP with Distances One and TwoLars Engebretsen. eccc, 5(46), 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL