default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Ziegler 0001
Person information
- affiliation: Korea Advanced Institute of Science and Technology (KAIST), School of Computing
- affiliation (former): Darmstadt University of Technology, Department of Mathematics
- affiliation (former): University of Paderborn, Department of Computer Science
Other persons with the same name
- Martin Ziegler 0002 — University of Freiburg, Institute of Mathematics (and 1 more)
- Martin Ziegler 0003 — Brunel University, School of Arts
- Martin Ziegler 0004 — University of Kiel, Institute of Electrical Engineering and Information Technology
- Martin Ziegler 0005 — Technical University of Berlin, Institut für Schiffs- und Meerestechnik, Germany
- Martin Ziegler 0006 — TU Ilmenau, Germany
- Martin Ziegler 0007 — RWTH Aachen University, Department of Geotechnical Engineering, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j23]Sewon Park
, Franz Brauße, Pieter Collins, SunYoung Kim, Michal Konecný, Gyesik Lee, Norbert Th. Müller, Eike Neumann, Norbert Preining, Martin Ziegler:
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation. Log. Methods Comput. Sci. 20(2) (2024)- [c49]Klaus Meer, Martin Ziegler:
Software Testing in Computable Analysis. UCNC 2024: 58-73 - 2023
- [j22]Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler:
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations. J. Complex. 76: 101727 (2023) - [i28]Donghyun Lim, Martin Ziegler:
Degrees of Second and Higher-Order Polynomials. CoRR abs/2305.03439 (2023) - 2022
- [c48]Franz Brauße, Pieter Collins, Martin Ziegler:
Computer Science for Continuous Data - Survey, Vision, Theory, and Practice of a Computer [inline-graphic not available: see fulltext]Analysis System. CASC 2022: 62-82 - 2021
- [c47]Svetlana Selivanova, Florian Steinberg, Holger Thies, Martin Ziegler:
Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations. CASC 2021: 370-390 - [c46]Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler:
Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations. CSR 2021: 223-241 - 2020
- [c45]Shu-Ming Sun, Ning Zhong, Martin Ziegler:
Computability of the Solutions to Navier-Stokes Equations via Effective Approximation. Complexity and Approximation 2020: 80-112 - [c44]Donghyun Lim, Martin Ziegler:
Quantitative Coding and Complexity Theory of Compact Metric Spaces. CiE 2020: 205-214 - [c43]Arno Pauly, Dongseong Seon, Martin Ziegler:
Computing Haar Measures. CSL 2020: 34:1-34:17 - [i27]Donghyun Lim, Martin Ziegler:
A Quantitative Multivalued Selection Theorem for Encoding Spaces of Continuum Cardinality. CoRR abs/2002.04005 (2020)
2010 – 2019
- 2019
- [c42]Ivan Koswara, Svetlana Selivanova, Martin Ziegler:
Computational Complexity of Real Powering and Improved Solving Linear Differential Equations. CSR 2019: 215-227 - [i26]Willem L. Fouché, Hyunwoo Lee, Donghyun Lim, Sewon Park, Matthias Schröder, Martin Ziegler:
Randomized Computation of Continuous Data: Is Brownian Motion Computable? CoRR abs/1906.06684 (2019) - [i25]Arno Pauly, Dongseong Seon, Martin Ziegler:
Computing Haar Measures. CoRR abs/1906.12220 (2019) - 2018
- [c41]Akitoshi Kawamura, Holger Thies, Martin Ziegler:
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. MFCS 2018: 30:1-30:17 - [c40]Junhee Cho, Sewon Park, Martin Ziegler:
Computing Periods ... . WALCOM 2018: 132-143 - [i24]Akitoshi Kawamura, Martin Ziegler:
Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs. CoRR abs/1801.07108 (2018) - [i23]Akitoshi Kawamura, Donghyun Lim, Svetlana Selivanova, Martin Ziegler:
Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory. CoRR abs/1809.08695 (2018) - 2017
- [j21]Andrej Bauer, Ulrich Berger, Willem L. Fouché, Dieter Spreen, Hideki Tsuiki, Martin Ziegler:
Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). J. Log. Anal. 9 (2017) - [j20]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
On the computational complexity of the Dirichlet Problem for Poisson's Equation. Math. Struct. Comput. Sci. 27(8): 1437-1465 (2017) - [i22]Chansu Park, Ji-won Park, Sewon Park, Dongseong Seon, Martin Ziegler:
Computable Operations on Compact Subsets of Metric Spaces with Applications to Fréchet Distance and Shape Optimization. CoRR abs/1701.08402 (2017) - 2016
- [j19]Christian Herrmann, Yasuyuki Tsukamoto, Martin Ziegler:
On the consistency problem for modular lattices and related structures. Int. J. Algebra Comput. 26(8): 1573-1595 (2016) - [j18]Christian Herrmann, Martin Ziegler:
Computational Complexity of Quantum Satisfiability. J. ACM 63(2): 19:1-19:31 (2016) - [c39]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. CiE 2016: 142-152 - [c38]Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Complexity Theory of (Functions on) Compact Metric Spaces. LICS 2016: 837-846 - [i21]Norbert Th. Müller, Sewon Park, Norbert Preining, Martin Ziegler:
On Formal Verification in Imperative Multivalued Programming over Continuous Data Types. CoRR abs/1608.05787 (2016) - 2015
- [j17]Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler:
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy. J. Complex. 31(5): 689-714 (2015) - [c37]Shu-Ming Sun, Ning Zhong, Martin Ziegler:
On Computability of Navier-Stokes' Equation. CiE 2015: 334-342 - [c36]Hugo Férée, Martin Ziegler:
On the Computational Complexity of Positive Linear Functionals on C[0;1]. MACIS 2015: 489-504 - [c35]Matthias Schröder, Florian Steinberg, Martin Ziegler:
Average-Case Bit-Complexity Theory of Real Functions. MACIS 2015: 505-519 - 2014
- [j16]Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. Log. Methods Comput. Sci. 10(1) (2014) - [c34]Norbert Th. Müller, Martin Ziegler:
From Calculus to Algorithms without Errors. ICMS 2014: 718-724 - [i20]Matthias Englert, Sandra Siebert, Martin Ziegler:
Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons. CoRR abs/1411.2842 (2014) - 2013
- [j15]Arno Pauly, Martin Ziegler:
Relative computability and uniform continuity of relations. J. Log. Anal. 5 (2013) - [c33]Klaus Ambos-Spies, Ulrike Brandt, Martin Ziegler:
Real Benefit of Promises and Advice. CiE 2013: 1-11 - [c32]Christian Herrmann, Johanna Sokoli, Martin Ziegler:
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines. MCU 2013: 85-92 - 2012
- [j14]Martin Ziegler:
Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. Ann. Pure Appl. Log. 163(8): 1108-1139 (2012) - [c31]Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler:
Computational Complexity of Smooth Differential Equations. MFCS 2012: 578-589 - [i19]Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick, Martin Ziegler:
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime. CoRR abs/1211.4974 (2012) - 2011
- [j13]Tobias Gärtner, Martin Ziegler:
Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation. Log. Methods Comput. Sci. 7(3) (2011) - [c30]Christian Herrmann, Martin Ziegler:
Computational Complexity of Quantum Satisfiability. LICS 2011: 175-184 - [c29]Tobias Gärtner, Martin Ziegler:
Real Analytic Machines and Degrees. CCA 2011: 77-91 - 2010
- [i18]Christian Herrmann, Martin Ziegler:
Expressiveness and Computational Complexity of Geometric Quantum Logic. CoRR abs/1004.1696 (2010)
2000 – 2009
- 2009
- [j12]Martin Ziegler:
Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics. Appl. Math. Comput. 215(4): 1431-1447 (2009) - [j11]Klaus Meer, Martin Ziegler:
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. Found. Comput. Math. 9(5): 599-609 (2009) - [c28]Martin Ziegler:
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability. CCA 2009 - [c27]Florentin Neumann, Andrea Reichenberger, Martin Ziegler:
Variations of the Turing Test in the Age of Internet and Virtual Reality. KI 2009: 355-362 - [i17]Matthias Fischer, Claudius Jähn, Martin Ziegler:
Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics. CoRR abs/0903.2119 (2009) - [i16]Florentin Neumann, Andrea Reichenberger, Martin Ziegler:
Variations of the Turing Test in the Age of Internet and Virtual Reality. CoRR abs/0904.3612 (2009) - 2008
- [j10]M. Reza Emamy-Khansary, Martin Ziegler:
On the coverings of the d-cube for d<=6. Discret. Appl. Math. 156(17): 3156-3165 (2008) - [j9]Klaus Meer, Martin Ziegler:
An explicit solution to Post's Problem over the reals. J. Complex. 24(1): 3-15 (2008) - [j8]Stéphane Le Roux, Martin Ziegler:
Singular coverings and non-uniform notions of closed set computability. Math. Log. Q. 54(5): 545-560 (2008) - [c26]Katharina Lürwer-Brüggemeier, Martin Ziegler:
On Faster Integer Calculations Using Non-arithmetic Primitives. UC 2008: 111-128 - [c25]Martin Ziegler, Wouter M. Koolen:
Kolmogorov Complexity Theory over the Reals. CCA 2008: 153-169 - [i15]Martin Ziegler, Wouter M. Koolen:
Kolmogorov Complexity Theory over the Reals. CoRR abs/0802.2027 (2008) - [i14]Martin Ziegler:
Physically-Relativized Church-Turing Hypotheses. CoRR abs/0805.1292 (2008) - [i13]Matthias Fischer, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, Martin Ziegler:
Planar Visibility Counting. CoRR abs/0810.0052 (2008) - [i12]Martin Ziegler:
Real Computation with Few Discrete Advice: A Complexity Theory of Nonuniform Computability. CoRR abs/0811.3782 (2008) - 2007
- [b2]Martin Ziegler:
Real computability and hypercomputation. University of Paderborn, Germany, Technischer Bericht : Reihe Informatik 07-285, 2007, pp. 1-160 - [j7]Christian Schindelhauer, Klaus Volbert, Martin Ziegler:
Geometric spanners with applications in wireless networks. Comput. Geom. 36(3): 197-214 (2007) - [j6]Martin Ziegler:
Real Hypercomputation and Continuity. Theory Comput. Syst. 41(1): 177-206 (2007) - [c24]Martin Ziegler:
(Short) Survey of Real Hypercomputation. CiE 2007: 809-824 - [c23]Klaus Meer, Martin Ziegler:
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. MFCS 2007: 726-737 - [c22]Stéphane Le Roux, Martin Ziegler:
Singular Coverings and Non-Uniform Notions of Closed Set Computability. CCA 2007: 73-88 - [i11]Katharina Lürwer-Brüggemeier, Martin Ziegler:
On Faster Integer Calculations using Non-Arithmetic Primitives. CoRR abs/0709.0624 (2007) - 2006
- [j5]Martin Ziegler:
Effectively open real functions. J. Complex. 22(6): 827-849 (2006) - [j4]Martin Ziegler:
Stability versus speed in a computable algebraic model. Theor. Comput. Sci. 351(1): 14-26 (2006) - [c21]Klaus Meer, Martin Ziegler:
Uncomputability Below the Real Halting Problem. CiE 2006: 368-377 - [c20]Martin Ziegler:
Revising Type-2 Computation and Degrees of Discontinuity. CCA 2006: 255-274 - [i10]Klaus Meer, Martin Ziegler:
Real Computational Universality: The Word Problem for a class of groups with infinite presentation. Algorithms and Complexity for Continuous Problems 2006 - [i9]Klaus Meer, Martin Ziegler:
An Explicit Solution to Post's Problem over the Reals. CoRR abs/cs/0603071 (2006) - [i8]Martin Ziegler, Klaus Meer:
Real Computational Universality: The Word Problem for a class of groups with infinite presentation. CoRR abs/cs/0604032 (2006) - [i7]Martin Ziegler:
Revising Type-2 Computation and Degrees of Discontinuity. CoRR abs/cs/0607114 (2006) - [i6]Stéphane Le Roux, Martin Ziegler:
Computable Closed Euclidean Subsets with and without Computable Points. CoRR abs/cs/0610080 (2006) - 2005
- [c19]Martin Ziegler:
Effectively Open Real Functions. CCA 2005: 357-374 - [c18]Martin Ziegler:
Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. CiE 2005: 562-571 - [c17]Sven Köhler, Christian Schindelhauer, Martin Ziegler:
On Approximating Real-World Halting Problems. FCT 2005: 454-466 - [c16]Klaus Meer, Martin Ziegler:
An Explicit Solution to Post's Problem over the Reals. FCT 2005: 467-478 - [i5]Martin Ziegler:
Effectively Open Real Functions. CoRR abs/cs/0501024 (2005) - [i4]Martin Ziegler:
Real Hypercomputation and Continuity. CoRR abs/cs/0508069 (2005) - [i3]Martin Ziegler:
Fast (Multi-)Evaluation of Linearly Recurrent Sequences: Improvements and Applications. CoRR abs/cs/0511033 (2005) - 2004
- [j3]Martin Ziegler:
Computable operators on regular sets. Math. Log. Q. 50(4-5): 392-404 (2004) - [j2]Martin Ziegler, Vasco Brattka:
Computability in linear algebra. Theor. Comput. Sci. 326(1-3): 187-211 (2004) - [c15]Michael Nüsken, Martin Ziegler:
Fast Multipoint Evaluation of Bivariate Polynomials. ESA 2004: 544-555 - [c14]Christian Schindelhauer, Klaus Volbert, Martin Ziegler:
Spanners, Weak Spanners, and Power Spanners for Wireless Networks. ISAAC 2004: 805-821 - [i2]Michael Nüsken, Martin Ziegler:
Fast Multipoint-Evaluation of Bivariate Polynomials. CoRR cs.DS/0403022 (2004) - 2003
- [b1]Martin Ziegler:
Zur Berechenbarkeit reeller geometrischer Probleme. HNI-Verlagsschriftenreihe 115, Heinz Nixdorf Institut 2003, ISBN 978-3-935433-24-2, pp. 1-121 - [c13]Martin Ziegler:
Quasi-optimal Arithmetic for Quaternion Polynomials. ISAAC 2003: 705-715 - [c12]Martin Ziegler:
Fast Relative Approximation of Potential Fields. WADS 2003: 140-149 - [i1]Martin Ziegler:
Quasi-Optimal Arithmetic for Quaternion Polynomials. CoRR cs.SC/0304004 (2003) - 2002
- [j1]Martin Ziegler:
Computability on Regular Subsets of Euclidean Space. Math. Log. Q. 48(S1): 157-181 (2002) - [c11]Valentina Damerow, Lukas Finschi, Martin Ziegler:
Point location algorithms of minimum size. CCCG 2002: 5-9 - [c10]Vasco Brattka, Martin Ziegler:
Computability of Linear Equations. IFIP TCS 2002: 95-106 - 2001
- [c9]Martin Ziegler, Vasco Brattka:
Turing computability of (non-)linear optimization. CCCG 2001: 181-184 - [c8]M. Reza Emamy-Khansary, Martin Ziegler:
New Bounds for Hypercube Slicing Numbers. DM-CCG 2001: 155-164 - 2000
- [c7]Martin Ziegler, Vasco Brattka:
A Computable Spectral Theorem. CCA 2000: 378-388 - [c6]Christian Sohler, Martin Ziegler:
Computing Cut Numbers. CCCG 2000 - [c5]Artur Czumaj, Christian Sohler, Martin Ziegler:
Property Testing in Computational Geometry. ESA 2000: 155-166 - [c4]Martin Ziegler, Vasco Brattka:
Computing the Dimension of Linear Subspaces. SOFSEM 2000: 450-458
1990 – 1999
- 1999
- [c3]Matthias Fischer, Tamás Lukovszki, Martin Ziegler:
Partitioned neighborhood spanners of minimal outdegree. CCCG 1999 - 1998
- [c2]Matthias Fischer, Tamás Lukovszki, Martin Ziegler:
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. ESA 1998: 163-174 - [c1]Matthias Fischer, Tamás Lukovszki, Martin Ziegler:
A Network Based Approach for Realtime Walkthrough of Massive Models. WAE 1998: 133-142
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 2024-11-06 20:31 CET 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:
