Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLars Engebretsen
Person information
- affiliation: Royal Institute of Technology, Stockholm, Sweden
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 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. Discret. Appl. Math. 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. Exp. 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) - 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. Discret. 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. 299(1-3): 537-584 (2003) - 2002
- [j3]Gunnar Andersson, Lars Engebretsen:
Property testers for dense constraint satisfaction programs on finite domains. Random Struct. Algorithms 21(1): 14-32 (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) - 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)
Conference and Workshop Papers
- 2005
- [c13]Lars Engebretsen, Jonas Holmerin:
More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. STACS 2005: 194-205 - 2003
- [c12]Lars Engebretsen, Jonas Holmerin:
Three-Query PCPs with Perfect Completeness over non-Boolean Domains. CCC 2003: 284-299 - 2002
- [c11]Lars Engebretsen, Jonas Holmerin, Alexander Russell:
Inapproximability Results for Equations over Finite Groups. ICALP 2002: 73-84 - [c10]Lars Engebretsen, Venkatesan Guruswami:
Is Constraint Satisfaction Over Two Variables Always Easy? RANDOM 2002: 224-238 - [c9]Lars Engebretsen, Madhu Sudan:
Harmonic broadcasting is optimal. SODA 2002: 431-432 - [c8]Lars Engebretsen, Piotr Indyk, Ryan O'Donnell:
Derandomized dimensionality reduction with applications. SODA 2002: 705-712 - 2001
- [c7]Lars Engebretsen:
Using easy optimization problems to solve hard ones. FotFS 2001: 77-93 - [c6]Lars Engebretsen, Marek Karpinski:
Approximation Hardness of TSP with Bounded Metrics. ICALP 2001: 201-212 - [c5]Lars Engebretsen:
The Non-approximability of Non-Boolean Predicates. RANDOM-APPROX 2001: 241-248 - 2000
- [c4]Lars Engebretsen, Jonas Holmerin:
Clique Is Hard to Approximate within n1-o(1). ICALP 2000: 2-12 - 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]Lars Engebretsen:
An Explicit Lower Bound for TSP with Distances One and Two. STACS 1999: 373-382 - 1998
- [c1]Gunnar Andersson, Lars Engebretsen:
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems. RANDOM 1998: 357-368
Informal and Other Publications
- 2002
- [i8]Lars Engebretsen, Jonas Holmerin, Alexander Russell:
Inapproximability Results for Equations over Finite Groups. Electron. Colloquium Comput. Complex. TR02 (2002) - [i7]Lars Engebretsen, Jonas Holmerin:
Three-Query PCPs with Perfect Completeness over non-Boolean Domains. Electron. Colloquium Comput. Complex. TR02 (2002) - [i6]Lars Engebretsen, Venkatesan Guruswami:
Is Constraint Satisfaction Over Two Variables Always Easy? Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [i5]Lars Engebretsen, Jonas Holmerin:
Towards Optimal Lower Bounds For Clique and Chromatic Number. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [i4]Lars Engebretsen:
Lower Bounds for non-Boolean Constraint Satisfaction. Electron. Colloquium Comput. Complex. TR00 (2000) - [i3]Lars Engebretsen, Marek Karpinski:
Approximation Hardness of TSP with Bounded Metrics. Electron. Colloquium Comput. Complex. TR00 (2000) - 1998
- [i2]Lars Engebretsen:
An Explicit Lower Bound for TSP with Distances One and Two. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [i1]Gunnar Andersson, Lars Engebretsen:
Better Approximation Algorithms and Tighter Analysis for Set Splitting and Not-All-Equal Sat. Electron. Colloquium Comput. Complex. TR97 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
