@misc{BenningElkoushyMeer, author = {Benning, Wilhelm and Elkoushy, Ashraf and Meer, Klaus}, title = {Innere-Punkt Methoden f{\"u}r die automatisierte Fehlersuche in geod{\"a}tischen Anwendungen (Interior point methods for automatic blunders detection in surveying)}, series = {Allgemeine Vermessungsnachrichten}, volume = {104}, journal = {Allgemeine Vermessungsnachrichten}, number = {8-9}, issn = {0002-5968}, pages = {319 -- 324}, language = {de} } @misc{MeerMichaux, author = {Meer, Klaus and Michaux, Christian}, title = {A Survey on Real Structural Complexity Theory}, series = {Bulletin of the Belgian Mathematical Society Simon Stevin}, volume = {4}, journal = {Bulletin of the Belgian Mathematical Society Simon Stevin}, number = {1}, issn = {1370-1444}, pages = {113 -- 148}, language = {en} } @inproceedings{BaartseMeer, author = {Baartse, Martijn and Meer, Klaus}, title = {Real Interactive Proofs for VPSPACE}, series = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik GmbH}, address = {Wadern}, isbn = {978-3-95977-016-3}, doi = {10.4230/LIPIcs.MFCS.2016.14}, url = {http://nbn-resolving.de/urn:nbn:de:0030-drops-64300}, pages = {14.1 -- 14.13}, language = {en} } @misc{BaartseMeer, author = {Baartse, Martijn and Meer, Klaus}, title = {An algebraic proof of the real number PCP theorem}, series = {Journal of Complexity}, volume = {40}, journal = {Journal of Complexity}, issn = {0885-064X}, doi = {10.1016/j.jco.2016.11.006}, pages = {34 -- 77}, abstract = {The PCP theorem has recently been shown to hold as well in the real number model of Blum, Shub, and Smale (Baartse and Meer, 2015). The proof given there structurally closely follows the proof of the original PCP theorem by Dinur (2007). In this paper we show that the theorem also can be derived using algebraic techniques similar to those employed by Arora et al. (Arora et al., 1998; Arora and Safra, 1998) in the first proof of the PCP theorem. This needs considerable additional efforts. Due to severe problems when using low degree algebraic polynomials over the reals as codewords for one of the verifiers to be constructed, we work with certain trigonometric polynomials. This entails the necessity to design new segmentation procedures in order to obtain well structured real verifiers appropriate for applying the classical technique of verifier composition. We believe that designing as well an algebraic proof for the real PCP theorem on one side leads to interesting questions in real number complexity theory and on the other sheds light on which ingredients are necessary in order to prove an important result as the PCP theorem in different computational models.}, language = {en} } @periodical{OPUS4-21276, title = {Mathematical Logic Quarterly}, volume = {Vol. 63}, number = {1-2, 3-4, 5, 6}, editor = {Meer, Klaus and L{\"o}we, Benedikt and Macpherson, H. Dugald}, publisher = {Wiley-VCH}, address = {Berlin [u.a.]}, issn = {1521-3870}, language = {en} } @periodical{OPUS4-21277, title = {Mathematical Logic Quarterly}, volume = {Vol. 62}, number = {1-2, 3, 4-5, 6}, editor = {Meer, Klaus and L{\"o}we, Benedikt and Macpherson, H. Dugald}, publisher = {Wiley-VCH}, address = {Berlin [u.a.]}, issn = {1521-3870}, language = {en} } @periodical{OPUS4-21279, title = {Journal of Complexity}, volume = {Vol. 38 - 43}, editor = {Meer, Klaus and Novak, Erich and Dick, Josef and Hinrichs, Aicke and Ritter, Klaus and Sloan, Ian and Wasilkowski, Greg and Wozniakowski, Henryk}, publisher = {Elsevier}, address = {Amsterdam [u.a.]}, issn = {0885-064X}, language = {en} } @periodical{OPUS4-21283, title = {Journal of Complexity}, volume = {Vol. 32 - 37}, editor = {Meer, Klaus and Novak, Erich and Dick, Josef and Hinrichs, Aicke and Ritter, Klaus and Sloan, Ian and Wasilkowski, Greg and Wozniakowski, Henryk}, publisher = {Elsevier}, address = {Amsterdam [u.a.]}, issn = {0885-064X}, language = {en} } @misc{OPUS4-22626, title = {Graph-theoretic concepts in computer science : 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018}, editor = {Brandst{\"a}dt, Andreas and K{\"o}hler, Ekkehard and Meer, Klaus}, publisher = {Springer International Publishing}, address = {Cham, Switzerland}, isbn = {978-3-030-00255-8}, pages = {XIII, 384}, language = {en} } @misc{BaartseMeer, author = {Baartse, Martijn and Meer, Klaus}, title = {Interactive proofs and a Shamir-like result for real number computations}, series = {Computational Complexity}, journal = {Computational Complexity}, issn = {1016-3328}, doi = {10.1007/s00037-018-0174-6}, pages = {33}, language = {en} } @misc{OPUS4-15563, title = {Informatik 2015, 45. Jahrestagung der Gesellschaft f{\"u}r Informatik,Informatik, Energie und Umwelt, Tagung von 28. September - 2. Oktober 2015 in Cottbus}, editor = {Cunningham, Douglas William and Hofstedt, Petra and Meer, Klaus and Schmitt, Ingo}, publisher = {Gesellschaft f{\"u}r Informatik}, address = {Bonn}, isbn = {978-3-88579-640-4}, language = {de} }