default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Klaus Meer
@inproceedings{DBLP:conf/uc/MeerZ24,
author = {Klaus Meer and
Martin Ziegler},
editor = {Da{-}Jung Cho and
Jongmin Kim},
title = {Software Testing in Computable Analysis},
booktitle = {Unconventional Computation and Natural Computation - 21st International
Conference, {UCNC} 2024, Pohang, South Korea, June 17-21, 2024, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14776},
pages = {58--73},
publisher = {Springer},
year = {2024},
url = {https://doi.org/10.1007/978-3-031-63742-1\_5},
doi = {10.1007/978-3-031-63742-1\_5},
timestamp = {Mon, 01 Jul 2024 21:34:13 +0200},
biburl = {https://dblp.org/rec/conf/uc/MeerZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Meer21,
author = {Klaus Meer},
editor = {Rahul Santhanam and
Daniil Musatov},
title = {A {PCP} of Proximity for Real Algebraic Polynomials},
booktitle = {Computer Science - Theory and Applications - 16th International Computer
Science Symposium in Russia, {CSR} 2021, Sochi, Russia, June 28 -
July 2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12730},
pages = {264--282},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79416-3\_16},
doi = {10.1007/978-3-030-79416-3\_16},
timestamp = {Thu, 17 Jun 2021 14:43:33 +0200},
biburl = {https://dblp.org/rec/conf/csr/Meer21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BaartseM19,
author = {Martijn Baartse and
Klaus Meer},
title = {Interactive proofs and a Shamir-like result for real number computations},
journal = {Comput. Complex.},
volume = {28},
number = {3},
pages = {437--469},
year = {2019},
url = {https://doi.org/10.1007/s00037-018-0174-6},
doi = {10.1007/S00037-018-0174-6},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/BaartseM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/MeerN19,
author = {Klaus Meer and
Ameen Naif},
title = {Periodic generalized automata over the reals},
journal = {Inf. Comput.},
volume = {269},
year = {2019},
url = {https://doi.org/10.1016/j.ic.2019.104452},
doi = {10.1016/J.IC.2019.104452},
timestamp = {Wed, 11 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/MeerN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/MeerN19,
author = {Klaus Meer and
Ameen Naif},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Alexander Okhotin and
Dana Shapira},
title = {Automata over Infinite Sequences of Reals},
booktitle = {Language and Automata Theory and Applications - 13th International
Conference, {LATA} 2019, St. Petersburg, Russia, March 26-29, 2019,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11417},
pages = {121--133},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-13435-8\_9},
doi = {10.1007/978-3-030-13435-8\_9},
timestamp = {Tue, 03 Mar 2020 11:22:06 +0100},
biburl = {https://dblp.org/rec/conf/lata/MeerN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2018,
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5},
doi = {10.1007/978-3-030-00256-5},
isbn = {978-3-030-00255-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/BaartseM17,
author = {Martijn Baartse and
Klaus Meer},
title = {An algebraic proof of the real number {PCP} theorem},
journal = {J. Complex.},
volume = {40},
pages = {34--77},
year = {2017},
url = {https://doi.org/10.1016/j.jco.2016.11.006},
doi = {10.1016/J.JCO.2016.11.006},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/BaartseM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/MeerN16,
author = {Klaus Meer and
Ameen Naif},
editor = {Adrian{-}Horia Dediu and
Jan Janousek and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Periodic Generalized Automata over the Reals},
booktitle = {Language and Automata Theory and Applications - 10th International
Conference, {LATA} 2016, Prague, Czech Republic, March 14-18, 2016,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9618},
pages = {168--180},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30000-9\_13},
doi = {10.1007/978-3-319-30000-9\_13},
timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
biburl = {https://dblp.org/rec/conf/lata/MeerN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BaartseM16,
author = {Martijn Baartse and
Klaus Meer},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Real Interactive Proofs for {VPSPACE}},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {14:1--14:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.14},
doi = {10.4230/LIPICS.MFCS.2016.14},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/BaartseM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/BaartseM15,
author = {Martijn Baartse and
Klaus Meer},
title = {The {PCP} Theorem for {NP} Over the Reals},
journal = {Found. Comput. Math.},
volume = {15},
number = {3},
pages = {651--680},
year = {2015},
url = {https://doi.org/10.1007/s10208-014-9188-x},
doi = {10.1007/S10208-014-9188-X},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/BaartseM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MeerN15,
author = {Klaus Meer and
Ameen Naif},
title = {Generalized finite automata over real and complex numbers},
journal = {Theor. Comput. Sci.},
volume = {591},
pages = {85--98},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2015.05.001},
doi = {10.1016/J.TCS.2015.05.001},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MeerN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/BaartseM15,
author = {Martijn Baartse and
Klaus Meer},
editor = {Arnold Beckmann and
Victor Mitrana and
Mariya Ivanova Soskova},
title = {Some Results on Interactive Proofs for Real Computations},
booktitle = {Evolving Computability - 11th Conference on Computability in Europe,
CiE 2015, Bucharest, Romania, June 29 - July 3, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9136},
pages = {107--116},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-20028-6\_11},
doi = {10.1007/978-3-319-20028-6\_11},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/BaartseM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BaartseM15,
author = {Martijn Baartse and
Klaus Meer},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {An Algebraic Proof of the Real Number {PCP} Theorem},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {50--61},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_5},
doi = {10.1007/978-3-662-48054-0\_5},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BaartseM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/gi/2015,
editor = {Douglas W. Cunningham and
Petra Hofstedt and
Klaus Meer and
Ingo Schmitt},
title = {45. Jahrestagung der Gesellschaft f{\"{u}}r Informatik, Informatik,
Energie und Umwelt, {INFORMATIK} 2015, Cottbus, Germany, September
28 - October 2, 2015},
series = {{LNI}},
volume = {{P-246}},
publisher = {{GI}},
year = {2015},
url = {https://dl.gi.de/handle/20.500.12116/20511},
isbn = {978-3-88579-640-4},
timestamp = {Wed, 13 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gi/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Meer14,
author = {Klaus Meer},
title = {An Extended Tree-Width Notion for Directed Graphs Related to the Computation
of Permanents},
journal = {Theory Comput. Syst.},
volume = {55},
number = {2},
pages = {330--346},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9490-z},
doi = {10.1007/S00224-013-9490-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Meer14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BaartseM14,
author = {Martijn Baartse and
Klaus Meer},
editor = {Edward A. Hirsch and
Sergei O. Kuznetsov and
Jean{-}{\'{E}}ric Pin and
Nikolay K. Vereshchagin},
title = {Testing Low Degree Trigonometric Polynomials},
booktitle = {Computer Science - Theory and Applications - 9th International Computer
Science Symposium in Russia, {CSR} 2014, Moscow, Russia, June 7-11,
2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8476},
pages = {77--96},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06686-8\_7},
doi = {10.1007/978-3-319-06686-8\_7},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BaartseM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/MeerN14,
author = {Klaus Meer and
Ameen Naif},
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {Generalized Finite Automata over Real and Complex Numbers},
booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
pages = {168--187},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7\_12},
doi = {10.1007/978-3-319-06089-7\_12},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/MeerN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cie/2014,
editor = {Arnold Beckmann and
Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Klaus Meer},
title = {Language, Life, Limits - 10th Conference on Computability in Europe,
CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8493},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08019-2},
doi = {10.1007/978-3-319-08019-2},
isbn = {978-3-319-08018-5},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaartseM13,
author = {Martijn Baartse and
Klaus Meer},
editor = {Natacha Portier and
Thomas Wilke},
title = {The {PCP} theorem for {NP} over the reals},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {104--115},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.104},
doi = {10.4230/LIPICS.STACS.2013.104},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaartseM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Meer12,
author = {Klaus Meer},
title = {On Ladner's result for a class of real machines with restricted use
of constants},
journal = {Inf. Comput.},
volume = {210},
pages = {13--20},
year = {2012},
url = {https://doi.org/10.1016/j.ic.2011.11.001},
doi = {10.1016/J.IC.2011.11.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Meer12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Meer12,
author = {Klaus Meer},
title = {Some Initial Thoughts on Bounded Query Computations over the Reals},
journal = {Int. J. Found. Comput. Sci.},
volume = {23},
number = {7},
pages = {1499--1510},
year = {2012},
url = {https://doi.org/10.1142/S0129054112400618},
doi = {10.1142/S0129054112400618},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Meer12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BriquelKM11,
author = {Ir{\'{e}}n{\'{e}}e Briquel and
Pascal Koiran and
Klaus Meer},
title = {On the expressive power of {CNF} formulas of bounded tree- and clique-width},
journal = {Discret. Appl. Math.},
volume = {159},
number = {1},
pages = {1--14},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.09.007},
doi = {10.1016/J.DAM.2010.09.007},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BriquelKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Meer11,
author = {Klaus Meer},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {An Extended Tree-Width Notion for Directed Graphs Related to the Computation
of Permanents},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {247--260},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_19},
doi = {10.1007/978-3-642-20712-9\_19},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/Meer11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Meer11,
author = {Klaus Meer},
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Almost Transparent Short Proofs for NP{\(\mathbb{R}\)}},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
pages = {41--52},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4\_4},
doi = {10.1007/978-3-642-22953-4\_4},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Meer11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/Meer10,
author = {Klaus Meer},
title = {Tree-width in Algebraic Complexity},
journal = {Fundam. Informaticae},
volume = {98},
number = {4},
pages = {391--409},
year = {2010},
url = {https://doi.org/10.3233/FI-2010-235},
doi = {10.3233/FI-2010-235},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/Meer10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MeerR09,
author = {Klaus Meer and
Dieter Rautenbach},
title = {On the {OBDD} size for graphs of bounded tree- and clique-width},
journal = {Discret. Math.},
volume = {309},
number = {4},
pages = {843--851},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.01.022},
doi = {10.1016/J.DISC.2008.01.022},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MeerR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/MeerZ09,
author = {Klaus Meer and
Martin Ziegler},
title = {Real Computational Universality: The Word Problem for a Class of Groups
with Infinite Presentation},
journal = {Found. Comput. Math.},
volume = {9},
number = {5},
pages = {599--609},
year = {2009},
url = {https://doi.org/10.1007/s10208-009-9048-2},
doi = {10.1007/S10208-009-9048-2},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/MeerZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Meer09,
author = {Klaus Meer},
editor = {Klaus Ambos{-}Spies and
Benedikt L{\"{o}}we and
Wolfgang Merkle},
title = {On Ladner's Result for a Class of Real Machines with Restricted Use
of Constants},
booktitle = {Mathematical Theory and Computational Practice, 5th Conference on
Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5635},
pages = {352--361},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03073-4\_36},
doi = {10.1007/978-3-642-03073-4\_36},
timestamp = {Sun, 02 Jun 2019 21:17:54 +0200},
biburl = {https://dblp.org/rec/conf/cie/Meer09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/MeerZ08,
author = {Klaus Meer and
Martin Ziegler},
title = {An explicit solution to Post's Problem over the reals},
journal = {J. Complex.},
volume = {24},
number = {1},
pages = {3--15},
year = {2008},
url = {https://doi.org/10.1016/j.jco.2006.09.004},
doi = {10.1016/J.JCO.2006.09.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/MeerZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KoiranMH08,
author = {Pascal Koiran and
Klaus Meer},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {On the Expressive Power of {CNF} Formulas of Bounded Tree- and Clique-Width},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {252--263},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_23},
doi = {10.1007/978-3-540-92248-3\_23},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/KoiranMH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Meer07,
author = {Klaus Meer},
title = {Simulated Annealing versus Metropolis for a {TSP} instance},
journal = {Inf. Process. Lett.},
volume = {104},
number = {6},
pages = {216--219},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.06.016},
doi = {10.1016/J.IPL.2007.06.016},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Meer07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MalajovichM07,
author = {Gregorio Malajovich and
Klaus Meer},
title = {Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard},
journal = {Theory Comput. Syst.},
volume = {40},
number = {4},
pages = {553--570},
year = {2007},
url = {https://doi.org/10.1007/s00224-006-1322-y},
doi = {10.1007/S00224-006-1322-Y},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MalajovichM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Meer07,
author = {Klaus Meer},
title = {Some Relations between Approximation Problems and PCPs over the Real
Numbers},
journal = {Theory Comput. Syst.},
volume = {41},
number = {1},
pages = {107--118},
year = {2007},
url = {https://doi.org/10.1007/s00224-006-1336-5},
doi = {10.1007/S00224-006-1336-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Meer07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/GoriM07,
author = {Marco Gori and
Klaus Meer},
editor = {S. Barry Cooper and
Benedikt L{\"{o}}we and
Andrea Sorbi},
title = {Some Aspects of a Complexity Theory for Continuous Time Systems},
booktitle = {Computation and Logic in the Real World, Third Conference on Computability
in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4497},
pages = {554--565},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73001-9\_58},
doi = {10.1007/978-3-540-73001-9\_58},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/GoriM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MeerZ07,
author = {Klaus Meer and
Martin Ziegler},
editor = {Ludek Kucera and
Anton{\'{\i}}n Kucera},
title = {Real Computational Universality: The Word Problem for a Class of Groups
with Infinite Presentation},
booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International
Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
August 26-31, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4708},
pages = {726--737},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74456-6\_64},
doi = {10.1007/978-3-540-74456-6\_64},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MeerZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/HansenM06,
author = {Uffe Flarup Hansen and
Klaus Meer},
title = {Two logical hierarchies of optimization problems over the real numbers},
journal = {Math. Log. Q.},
volume = {52},
number = {1},
pages = {37--50},
year = {2006},
url = {https://doi.org/10.1002/malq.200510021},
doi = {10.1002/MALQ.200510021},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/HansenM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Meer06,
author = {Klaus Meer},
editor = {Arnold Beckmann and
Ulrich Berger and
Benedikt L{\"{o}}we and
John V. Tucker},
title = {Optimization and Approximation Problems Related to Polynomial System
Solving},
booktitle = {Logical Approaches to Computational Barriers, Second Conference on
Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3988},
pages = {360--367},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780342\_38},
doi = {10.1007/11780342\_38},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/Meer06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/MeerZ06,
author = {Klaus Meer and
Martin Ziegler},
editor = {Arnold Beckmann and
Ulrich Berger and
Benedikt L{\"{o}}we and
John V. Tucker},
title = {Uncomputability Below the Real Halting Problem},
booktitle = {Logical Approaches to Computational Barriers, Second Conference on
Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3988},
pages = {368--377},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11780342\_39},
doi = {10.1007/11780342\_39},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cie/MeerZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/MeerR06,
author = {Klaus Meer and
Dieter Rautenbach},
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {On the {OBDD} Size for Graphs of Bounded Tree- and Clique-Width},
booktitle = {Parameterized and Exact Computation, Second International Workshop,
{IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4169},
pages = {72--83},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250\_7},
doi = {10.1007/11847250\_7},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/MeerR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uc/HansenM06,
author = {Uffe Flarup Hansen and
Klaus Meer},
editor = {Cristian S. Calude and
Michael J. Dinneen and
Gheorghe Paun and
Grzegorz Rozenberg and
Susan Stepney},
title = {Approximation Classes for Real Number Optimization Problems},
booktitle = {Unconventional Computation, 5th International Conference, {UC} 2006,
York, UK, September 4-8, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4135},
pages = {86--100},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11839132\_8},
doi = {10.1007/11839132\_8},
timestamp = {Sat, 09 Apr 2022 12:39:24 +0200},
biburl = {https://dblp.org/rec/conf/uc/HansenM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4061,
editor = {Thomas Lickteig and
Klaus Meer and
Luis Miguel Pardo},
title = {Real Computation and Complexity, 1.-6. February 2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04061},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/portals/04061/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2004P4061.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/MeerZ06,
author = {Klaus Meer and
Martin Ziegler},
editor = {Stephan Dahlke and
Klaus Ritter and
Ian H. Sloan and
Joseph F. Traub},
title = {Real Computational Universality: The Word Problem for a class of groups
with infinite presentation},
booktitle = {Algorithms and Complexity for Continuous Problems, 24.09. - 29.09.2006},
series = {Dagstuhl Seminar Proceedings},
volume = {06391},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2006},
url = {http://drops.dagstuhl.de/opus/volltexte/2007/877},
timestamp = {Thu, 10 Jun 2021 13:02:06 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/MeerZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0603071,
author = {Klaus Meer and
Martin Ziegler},
title = {An Explicit Solution to Post's Problem over the Reals},
journal = {CoRR},
volume = {abs/cs/0603071},
year = {2006},
url = {http://arxiv.org/abs/cs/0603071},
eprinttype = {arXiv},
eprint = {cs/0603071},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0603071.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0604032,
author = {Martin Ziegler and
Klaus Meer},
title = {Real Computational Universality: The Word Problem for a class of groups
with infinite presentation},
journal = {CoRR},
volume = {abs/cs/0604032},
year = {2006},
url = {http://arxiv.org/abs/cs/0604032},
eprinttype = {arXiv},
eprint = {cs/0604032},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0604032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/Meer05,
author = {Klaus Meer},
title = {Transparent Long Proofs: {A} First {PCP} Theorem for NP\({}_{\mbox{R}}\)},
journal = {Found. Comput. Math.},
volume = {5},
number = {3},
pages = {231--255},
year = {2005},
url = {https://doi.org/10.1007/s10208-005-0142-1},
doi = {10.1007/S10208-005-0142-1},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/Meer05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/Meer05,
author = {Klaus Meer},
editor = {S. Barry Cooper and
Benedikt L{\"{o}}we and
Leen Torenvliet},
title = {On Some Relations Between Approximation Problems and PCPs over the
Real Numbers},
booktitle = {New Computational Paradigms, First Conference on Computability in
Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3526},
pages = {322--331},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11494645\_40},
doi = {10.1007/11494645\_40},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/Meer05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/MeerZ05,
author = {Klaus Meer and
Martin Ziegler},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {An Explicit Solution to Post's Problem over the Reals},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {467--478},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_41},
doi = {10.1007/11537311\_41},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/MeerZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HansenM05,
author = {Uffe Flarup Hansen and
Klaus Meer},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {Two Logical Hierarchies of Optimization Problems over the Real Numbers},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {459--470},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_40},
doi = {10.1007/11549345\_40},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HansenM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MalajovichM05,
author = {Gregorio Malajovich and
Klaus Meer},
editor = {Volker Diekert and
Bruno Durand},
title = {Computing Minimal Multi-homogeneous B{\'{e}}zout Numbers Is Hard},
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 = {244--255},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_20},
doi = {10.1007/978-3-540-31856-9\_20},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MalajovichM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0016464,
author = {Hubertus Th. Jongen and
Klaus Meer and
Eberhard Triesch},
title = {Optimization theory},
publisher = {Kluwer},
year = {2004},
isbn = {978-1-4020-8098-2},
timestamp = {Thu, 14 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0016464.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rc/Meer04,
author = {Klaus Meer},
title = {On a Refined Analysis of Some Problems in Interval Arithmetic Using
Real Number Complexity Theory},
journal = {Reliab. Comput.},
volume = {10},
number = {3},
pages = {209--225},
year = {2004},
url = {https://doi.org/10.1023/B:REOM.0000032109.55408.1a},
doi = {10.1023/B:REOM.0000032109.55408.1A},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rc/Meer04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Meer04,
author = {Klaus Meer},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Transparent Long Proofs: {A} First {PCP} Theorem for NP\({}_{\mbox{R}}\)},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {959--970},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_80},
doi = {10.1007/978-3-540-27836-8\_80},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Meer04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/para/Meer04,
author = {Klaus Meer},
editor = {Jack J. Dongarra and
Kaj Madsen and
Jerzy Wasniewski},
title = {On the Approximation of Interval Functions},
booktitle = {Applied Parallel Computing, State of the Art in Scientific Computing,
7th International Workshop, {PARA} 2004, Lyngby, Denmark, June 20-23,
2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3732},
pages = {169--178},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11558958\_19},
doi = {10.1007/11558958\_19},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/para/Meer04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/Meer05,
author = {Klaus Meer},
editor = {Ruy J. G. B. de Queiroz and
Patrick C{\'{e}}gielski},
title = {Probabilistically Checkable Proofs Over the Reals},
booktitle = {Proceedings of the 11th Workshop on Logic, Language, Information and
Computation, WoLLIC 2004, Fontainebleau, France, July 19-22, 2004},
series = {Electronic Notes in Theoretical Computer Science},
volume = {123},
pages = {165--177},
publisher = {Elsevier},
year = {2004},
url = {https://doi.org/10.1016/j.entcs.2004.04.047},
doi = {10.1016/J.ENTCS.2004.04.047},
timestamp = {Mon, 05 Dec 2022 16:29:12 +0100},
biburl = {https://dblp.org/rec/journals/entcs/Meer05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/LickteigMP04,
author = {Thomas Lickteig and
Klaus Meer and
Luis Miguel Pardo},
editor = {Thomas Lickteig and
Klaus Meer and
Luis Miguel Pardo},
title = {04061 Summary - Real Computation and Complexity},
booktitle = {Real Computation and Complexity, 1.-6. February 2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04061},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2006/499},
timestamp = {Thu, 10 Jun 2021 13:02:07 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/LickteigMP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/LickteigMP04a,
author = {Thomas Lickteig and
Klaus Meer and
Luis Miguel Pardo},
editor = {Thomas Lickteig and
Klaus Meer and
Luis Miguel Pardo},
title = {04061 Abstracts Collection - Real Computation and Complexity},
booktitle = {Real Computation and Complexity, 1.-6. February 2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04061},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2006/458},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/LickteigMP04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/MeerM04,
author = {Klaus Meer and
Gregorio Malajovich},
editor = {Thomas M{\"{u}}ller{-}Gronbach and
Erich Novak and
Knut Petras and
Joseph F. Traub},
title = {On the Complexity of Computing Multi-Homogeneous B{\'{e}}zout
Numbers},
booktitle = {Algorithms and Complexity for Continuous Problems, 26. September -
1. October 2004},
series = {Dagstuhl Seminar Proceedings},
volume = {04401},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/146},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/MeerM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0405021,
author = {Gregorio Malajovich and
Klaus Meer},
title = {Computing Multi-Homogeneous Bezout Numbers is Hard},
journal = {CoRR},
volume = {cs.CC/0405021},
year = {2004},
url = {http://arxiv.org/abs/cs/0405021},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0405021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Meer03,
author = {Klaus Meer},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {On the Complexity of Some Problems in Interval Arithmetic},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {582--591},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_52},
doi = {10.1007/978-3-540-45138-9\_52},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Meer03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/MeerW02,
author = {Klaus Meer and
Gerhard{-}Wilhelm Weber},
title = {Some aspects of studying an optimization or decision problem in different
computational models},
journal = {Eur. J. Oper. Res.},
volume = {143},
number = {2},
pages = {406--418},
year = {2002},
url = {https://doi.org/10.1016/S0377-2217(02)00269-2},
doi = {10.1016/S0377-2217(02)00269-2},
timestamp = {Fri, 21 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eor/MeerW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/GoriM02,
author = {Marco Gori and
Klaus Meer},
title = {A Step towards a Complexity Theory for Analog Systems},
journal = {Math. Log. Q.},
volume = {48},
number = {{S1}},
pages = {45--58},
year = {2002},
url = {https://doi.org/10.1002/1521-3870(200210)48:1\%2B\&\#60;45::AID-MALQ45\&\#62;3.0.CO;2-7},
doi = {10.1002/1521-3870(200210)48:1\%2B\&\#60;45::AID-MALQ45\&\#62;3.0.CO;2-7},
timestamp = {Wed, 04 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/GoriM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/flops/Meer02,
author = {Klaus Meer},
editor = {Zhenjiang Hu and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {On Consistency and Width Notions for Constraint Programs with Algebraic
Constraints},
booktitle = {Functional and Logic Programming, 6th International Symposium, {FLOPS}
2002, Aizu, Japan, September 15-17, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2441},
pages = {88--102},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45788-7\_5},
doi = {10.1007/3-540-45788-7\_5},
timestamp = {Sun, 02 Jun 2019 21:12:36 +0200},
biburl = {https://dblp.org/rec/conf/flops/Meer02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Ben-DavidMM00,
author = {Shai Ben{-}David and
Klaus Meer and
Christian Michaux},
title = {A Note on Non-complete Problems in NPImage},
journal = {J. Complex.},
volume = {16},
number = {1},
pages = {324--332},
year = {2000},
url = {https://doi.org/10.1006/jcom.1999.0537},
doi = {10.1006/JCOM.1999.0537},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jc/Ben-DavidMM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Meer00,
author = {Klaus Meer},
title = {Counting problems over the reals},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {41--58},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00190-X},
doi = {10.1016/S0304-3975(98)00190-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Meer00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/MakowskyM00,
author = {Johann A. Makowsky and
Klaus Meer},
editor = {Peter Clote and
Helmut Schwichtenberg},
title = {On the Complexity of Combinatorial and Metafinite Generating Functions
of Graph Properties in the Computational Model of Blum, Shub and Smale},
booktitle = {Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau,
Germany, August 21-26, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1862},
pages = {399--410},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44622-2\_27},
doi = {10.1007/3-540-44622-2\_27},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/MakowskyM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MatamalaM99,
author = {Mart{\'{\i}}n Matamala and
Klaus Meer},
title = {On the computational structure of the connected components of a hard
problem},
journal = {Inf. Process. Lett.},
volume = {72},
number = {3-4},
pages = {83--90},
year = {1999},
url = {https://doi.org/10.1016/S0020-0190(99)00130-1},
doi = {10.1016/S0020-0190(99)00130-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MatamalaM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/CuckerM99,
author = {Felipe Cucker and
Klaus Meer},
title = {Logics Which Capture Complexity Classes Over The Reals},
journal = {J. Symb. Log.},
volume = {64},
number = {1},
pages = {363--390},
year = {1999},
url = {https://doi.org/10.2307/2586770},
doi = {10.2307/2586770},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/CuckerM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Meer99,
author = {Klaus Meer},
editor = {Miroslaw Kutylowski and
Leszek Pacholski and
Tomasz Wierzbicki},
title = {Query Languages for Real Number Databases Based on Descriptive Complexity
over {R}},
booktitle = {Mathematical Foundations of Computer Science 1999, 24th International
Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1672},
pages = {12--22},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48340-3\_2},
doi = {10.1007/3-540-48340-3\_2},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Meer99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MalajovichM98,
author = {Gregorio Malajovich and
Klaus Meer},
title = {On the Structure of NP{\_}C},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {1},
pages = {27--35},
year = {1998},
url = {https://doi.org/10.1137/S0097539795294980},
doi = {10.1137/S0097539795294980},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MalajovichM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/LickteigM97,
author = {Thomas Lickteig and
Klaus Meer},
title = {Semi-algebraic Complexity--Additive Complexity of Matrix Computational
Tasks},
journal = {J. Complex.},
volume = {13},
number = {1},
pages = {83--107},
year = {1997},
url = {https://doi.org/10.1006/jcom.1997.0430},
doi = {10.1006/JCOM.1997.0430},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/LickteigM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/CuckerM97,
author = {Felipe Cucker and
Klaus Meer},
editor = {Bogdan S. Chlebus and
Ludwik Czaja},
title = {Logics Which Capture Complexity Classes over the Reals},
booktitle = {Fundamentals of Computation Theory, 11th International Symposium,
{FCT} '97, Krak{\'{o}}w, Poland, September 1-3, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1279},
pages = {157--167},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0036180},
doi = {10.1007/BFB0036180},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/CuckerM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Meer97,
author = {Klaus Meer},
editor = {Igor Pr{\'{\i}}vara and
Peter Ruzicka},
title = {Counting Problems over the Reals},
booktitle = {Mathematical Foundations of Computer Science 1997, 22nd International
Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1295},
pages = {398--407},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0029983},
doi = {10.1007/BFB0029983},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Meer97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cca/Meer96,
author = {Klaus Meer},
editor = {Ker{-}I Ko and
Norbert Th. M{\"{u}}ller and
Klaus Weihrauch},
title = {On diagonal sets in uncountable structures},
booktitle = {Second Workshop on Computability and Complexity in Analysis, {CCA}
1996, August 22-23, 1996, Trier, Germany},
series = {Technical Report},
volume = {{TR} 96-44},
publisher = {Unjiversity of Trier},
year = {1996},
url = {ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports/96-44/meer.ps},
timestamp = {Tue, 30 Jul 2019 14:53:11 +0200},
biburl = {https://dblp.org/rec/conf/cca/Meer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/LickteigM95,
author = {Thomas Lickteig and
Klaus Meer},
title = {A Note on Testing the Resultant},
journal = {J. Complex.},
volume = {11},
number = {3},
pages = {344--351},
year = {1995},
url = {https://doi.org/10.1006/jcom.1995.1016},
doi = {10.1006/JCOM.1995.1016},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/LickteigM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Meer95,
author = {Klaus Meer},
title = {On the Relations Between Discrete and Continuous Complexity Theory},
journal = {Math. Log. Q.},
volume = {41},
pages = {281--286},
year = {1995},
url = {https://doi.org/10.1002/malq.19950410214},
doi = {10.1002/MALQ.19950410214},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Meer95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GradelM95,
author = {Erich Gr{\"{a}}del and
Klaus Meer},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Descriptive complexity theory over the real numbers},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {315--324},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225151},
doi = {10.1145/225058.225151},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GradelM95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/Meer94,
author = {Klaus Meer},
title = {Real Number Computations: On the Use of Information},
journal = {J. Symb. Comput.},
volume = {18},
number = {3},
pages = {199--206},
year = {1994},
url = {https://doi.org/10.1006/jsco.1994.1044},
doi = {10.1006/JSCO.1994.1044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/Meer94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Meer94,
author = {Klaus Meer},
title = {On the Complexity of Quadratic Programming in Real Number Models of
Computation},
journal = {Theor. Comput. Sci.},
volume = {133},
number = {1},
pages = {85--84},
year = {1994},
url = {https://doi.org/10.1016/0304-3975(94)00070-0},
doi = {10.1016/0304-3975(94)00070-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Meer94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Meer93,
author = {Klaus Meer},
title = {Komplexit{\"{a}}tsbetrachtungen f{\"{u}}r reelle Maschinenmodelle},
school = {{RWTH} Aachen University, Germany},
year = {1993},
url = {https://d-nb.info/930390938},
isbn = {978-3-86111-385-0},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Meer93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Meer93,
author = {Klaus Meer},
title = {Real Number Models under Various Sets of Operations},
journal = {J. Complex.},
volume = {9},
number = {3},
pages = {366--372},
year = {1993},
url = {https://doi.org/10.1006/jcom.1993.1023},
doi = {10.1006/JCOM.1993.1023},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Meer93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Meer92,
author = {Klaus Meer},
title = {A note on a \emph{P} \emph{NP} result for a restricted class of real
machines},
journal = {J. Complex.},
volume = {8},
number = {4},
pages = {451--453},
year = {1992},
url = {https://doi.org/10.1016/0885-064X(92)90007-X},
doi = {10.1016/0885-064X(92)90007-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Meer92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jc/Meer90,
author = {Klaus Meer},
title = {Computations over {Z} and {R:} {A} comparison},
journal = {J. Complex.},
volume = {6},
number = {3},
pages = {256--263},
year = {1990},
url = {https://doi.org/10.1016/0885-064X(90)90022-6},
doi = {10.1016/0885-064X(90)90022-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jc/Meer90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-09-05 02:08 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:
