default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonas Holmerin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j4]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)- 2005
- [j3]Lars Engebretsen, Jonas Holmerin:
Three-query PCPs with perfect completeness over non-Boolean domains. Random Struct. Algorithms 27(1): 46-75 (2005) - [c11]Lars Engebretsen, Jonas Holmerin:
More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. STACS 2005: 194-205 - 2004
- [j2]Lars Engebretsen, Jonas Holmerin, Alexander Russell
:
Inapproximability results for equations over finite groups. Theor. Comput. Sci. 312(1): 17-45 (2004) - [c10]Jonas Holmerin, Subhash Khot:
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. STOC 2004: 11-20 - 2003
- [j1]Lars Engebretsen, Jonas Holmerin:
Towards optimal lower bounds for clique and chromatic number. Theor. Comput. Sci. 299(1-3): 537-584 (2003) - [c9]Lars Engebretsen, Jonas Holmerin:
Three-Query PCPs with Perfect Completeness over non-Boolean Domains. CCC 2003: 284-299 - [c8]Jonas Holmerin, Subhash Khot:
A Strong Inapproximability Gap for a Generalization of Minimum Bisection. CCC 2003: 371-378 - 2002
- [c7]Jonas Holmerin:
Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - ε. CCC 2002: 6 - [c6]Lars Engebretsen, Jonas Holmerin, Alexander Russell:
Inapproximability Results for Equations over Finite Groups. ICALP 2002: 73-84 - [c5]Jonas Holmerin:
Improved Inapproximability Results for Vertex Cover on k -Uniform Hypergraphs. ICALP 2002: 1005-1016 - [c4]Jonas Holmerin:
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon. STOC 2002: 544-552 - [i4]Lars Engebretsen, Jonas Holmerin, Alexander Russell:
Inapproximability Results for Equations over Finite Groups. Electron. Colloquium Comput. Complex. TR02 (2002) - [i3]Lars Engebretsen, Jonas Holmerin:
Three-Query PCPs with Perfect Completeness over non-Boolean Domains. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [i2]Lars Engebretsen, Jonas Holmerin:
Towards Optimal Lower Bounds For Clique and Chromatic Number. Electron. Colloquium Comput. Complex. TR01 (2001) - [i1]Jonas Holmerin:
Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate Within 2-epsilon. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c3]Jonas Holmerin, Björn Lisper:
Development of Parallel Algorithms in Data Field Haskell (Research Note). Euro-Par 2000: 762-766 - [c2]Lars Engebretsen, Jonas Holmerin:
Clique Is Hard to Approximate within n1-o(1). ICALP 2000: 2-12 - [c1]Jonas Holmerin, Björn Lisper:
Data Field Haskell. Haskell 2000: 4
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 2024-04-24 22:51 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:
