BibTeX records: Jonas Holmerin

download as .bib file

@article{DBLP:journals/rsa/EngebretsenH08,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {More efficient queries in PCPs for {NP} and improved approximation
                  hardness of maximum {CSP}},
  journal      = {Random Struct. Algorithms},
  volume       = {33},
  number       = {4},
  pages        = {497--514},
  year         = {2008},
  url          = {https://doi.org/10.1002/rsa.20226},
  doi          = {10.1002/RSA.20226},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EngebretsenH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/rsa/EngebretsenH05,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Three-query PCPs with perfect completeness over non-Boolean domains},
  journal      = {Random Struct. Algorithms},
  volume       = {27},
  number       = {1},
  pages        = {46--75},
  year         = {2005},
  url          = {https://doi.org/10.1002/rsa.20050},
  doi          = {10.1002/RSA.20050},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/rsa/EngebretsenH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/EngebretsenH05,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {More Efficient Queries in PCPs for {NP} and Improved Approximation
                  Hardness of Maximum {CSP}},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {194--205},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_16},
  doi          = {10.1007/978-3-540-31856-9\_16},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/EngebretsenH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EngebretsenHR04,
  author       = {Lars Engebretsen and
                  Jonas Holmerin and
                  Alexander Russell},
  title        = {Inapproximability results for equations over finite groups},
  journal      = {Theor. Comput. Sci.},
  volume       = {312},
  number       = {1},
  pages        = {17--45},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0304-3975(03)00401-8},
  doi          = {10.1016/S0304-3975(03)00401-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EngebretsenHR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/HolmerinK04,
  author       = {Jonas Holmerin and
                  Subhash Khot},
  editor       = {L{\'{a}}szl{\'{o}} Babai},
  title        = {A new {PCP} outer verifier with applications to homogeneous linear
                  equations and max-bisection},
  booktitle    = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing,
                  Chicago, IL, USA, June 13-16, 2004},
  pages        = {11--20},
  publisher    = {{ACM}},
  year         = {2004},
  url          = {https://doi.org/10.1145/1007352.1007362},
  doi          = {10.1145/1007352.1007362},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HolmerinK04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EngebretsenH03,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Towards optimal lower bounds for clique and chromatic number},
  journal      = {Theor. Comput. Sci.},
  volume       = {299},
  number       = {1-3},
  pages        = {537--584},
  year         = {2003},
  url          = {https://doi.org/10.1016/S0304-3975(02)00535-2},
  doi          = {10.1016/S0304-3975(02)00535-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EngebretsenH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/EngebretsenH03,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Three-Query PCPs with Perfect Completeness over non-Boolean Domains},
  booktitle    = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
                  2003), 7-10 July 2003, Aarhus, Denmark},
  pages        = {284--299},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/CCC.2003.1214428},
  doi          = {10.1109/CCC.2003.1214428},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/EngebretsenH03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/HolmerinK03,
  author       = {Jonas Holmerin and
                  Subhash Khot},
  title        = {A Strong Inapproximability Gap for a Generalization of Minimum Bisection},
  booktitle    = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
                  2003), 7-10 July 2003, Aarhus, Denmark},
  pages        = {371--378},
  publisher    = {{IEEE} Computer Society},
  year         = {2003},
  url          = {https://doi.org/10.1109/CCC.2003.1214436},
  doi          = {10.1109/CCC.2003.1214436},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/HolmerinK03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/Holmerin02,
  author       = {Jonas Holmerin},
  title        = {Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within
                  2 - {\(\epsilon\)}},
  booktitle    = {Proceedings of the 17th Annual {IEEE} Conference on Computational
                  Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
                  2002},
  pages        = {6},
  publisher    = {{IEEE} Computer Society},
  year         = {2002},
  url          = {https://doi.ieeecomputersociety.org/10.1109/CCC.2002.10005},
  doi          = {10.1109/CCC.2002.10005},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/Holmerin02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/EngebretsenHR02,
  author       = {Lars Engebretsen and
                  Jonas Holmerin and
                  Alexander Russell},
  editor       = {Peter Widmayer and
                  Francisco Triguero Ruiz and
                  Rafael Morales Bueno and
                  Matthew Hennessy and
                  Stephan J. Eidenbenz and
                  Ricardo Conejo},
  title        = {Inapproximability Results for Equations over Finite Groups},
  booktitle    = {Automata, Languages and Programming, 29th International Colloquium,
                  {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2380},
  pages        = {73--84},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45465-9\_8},
  doi          = {10.1007/3-540-45465-9\_8},
  timestamp    = {Wed, 11 Sep 2019 13:15:53 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/EngebretsenHR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/Holmerin02,
  author       = {Jonas Holmerin},
  editor       = {Peter Widmayer and
                  Francisco Triguero Ruiz and
                  Rafael Morales Bueno and
                  Matthew Hennessy and
                  Stephan J. Eidenbenz and
                  Ricardo Conejo},
  title        = {Improved Inapproximability Results for Vertex Cover on k -Uniform
                  Hypergraphs},
  booktitle    = {Automata, Languages and Programming, 29th International Colloquium,
                  {ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2380},
  pages        = {1005--1016},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45465-9\_86},
  doi          = {10.1007/3-540-45465-9\_86},
  timestamp    = {Tue, 23 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/Holmerin02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/Holmerin02,
  author       = {Jonas Holmerin},
  editor       = {John H. Reif},
  title        = {Vertex cover on 4-regular hyper-graphs is hard to approximate within
                  2-epsilon},
  booktitle    = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
                  May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
  pages        = {544--552},
  publisher    = {{ACM}},
  year         = {2002},
  url          = {https://doi.org/10.1145/509907.509986},
  doi          = {10.1145/509907.509986},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/Holmerin02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR02-030,
  author       = {Lars Engebretsen and
                  Jonas Holmerin and
                  Alexander Russell},
  title        = {Inapproximability Results for Equations over Finite Groups},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR02-030}},
  year         = {2002},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-030/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR02-030},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR02-030.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR02-040,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Three-Query PCPs with Perfect Completeness over non-Boolean Domains},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR02-040}},
  year         = {2002},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-040/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR02-040},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR02-040.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR01-003,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  title        = {Towards Optimal Lower Bounds For Clique and Chromatic Number},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR01-003}},
  year         = {2001},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-003/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR01-003},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR01-003.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR01-094,
  author       = {Jonas Holmerin},
  title        = {Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate Within
                  2-epsilon},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR01-094}},
  year         = {2001},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-094/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR01-094},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR01-094.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/europar/HolmerinL00,
  author       = {Jonas Holmerin and
                  Bj{\"{o}}rn Lisper},
  editor       = {Arndt Bode and
                  Thomas Ludwig and
                  Wolfgang Karl and
                  Roland Wism{\"{u}}ller},
  title        = {Development of Parallel Algorithms in Data Field Haskell (Research
                  Note)},
  booktitle    = {Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference,
                  Munich, Germany, August 29 - September 1, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1900},
  pages        = {762--766},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-44520-X\_105},
  doi          = {10.1007/3-540-44520-X\_105},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/europar/HolmerinL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/EngebretsenH00,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  editor       = {Ugo Montanari and
                  Jos{\'{e}} D. P. Rolim and
                  Emo Welzl},
  title        = {Clique Is Hard to Approximate within \emph{n}\({}^{\mbox{1-\emph{o}(1)}}\)},
  booktitle    = {Automata, Languages and Programming, 27th International Colloquium,
                  {ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1853},
  pages        = {2--12},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-45022-X\_2},
  doi          = {10.1007/3-540-45022-X\_2},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/EngebretsenH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:journals/entcs/HolmerinL00,
  author       = {Jonas Holmerin and
                  Bj{\"{o}}rn Lisper},
  editor       = {Graham Hutton},
  title        = {Data Field Haskell},
  booktitle    = {Proceedings of the 2000 {ACM} {SIGPLAN} Workshop on Haskell, Haskell
                  2000, Satellite Event of {PLI} 2000, Montreal, Canada, September 17,
                  2000},
  series       = {Electronic Notes in Theoretical Computer Science},
  volume       = {41},
  number       = {1},
  pages        = {4},
  publisher    = {Elsevier},
  year         = {2000},
  url          = {https://doi.org/10.1016/S1571-0661(05)80541-9},
  doi          = {10.1016/S1571-0661(05)80541-9},
  timestamp    = {Thu, 01 Dec 2022 09:58:30 +0100},
  biburl       = {https://dblp.org/rec/journals/entcs/HolmerinL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.