Teaching


Outreach


Theses Supervision


Publications

in referreed journals in refereed Proceedings unrefereed/theses/miscellaneous
M. Fischer, T. Lukovszki, M. Ziegler:
"Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time"
pp.163-174 in: Proc. of the 6th Annual European Symposium on Algorithms (ESA'98), Springer LNCS Vol.1461.

M. Fischer, T. Lukovszki, M. Ziegler:
"A Network Based Approach for Realtime Walkthrough of Massive Models"
pp.133-142 in: Proc. of the 2nd Workshop on Algorithms Engineering (WAE'98).

M. Fischer, T. Lukovszki, M. Ziegler:
Partitioned Neighborhood Spanners of Minimal Outdegree
pp.47-50 in: Proc. of the 11th Canadian Conference on Computational Geometry (CCCG'99)
M. Ziegler:
"Computability on Regular Subsets of Euclidean Space"
pp.157-181 in Mathematical Logic Quarterly (MLQ), Vol.48 S1 (2002).
Abstract and PDF   (© VCH-Wiley).

M.Ziegler:
"Computable operators on regular sets"
pp.392-404 in Mathematical Logic Quarterly (MLQ), Vol.50 (2004)   (© VCH-Wiley).

M.Ziegler, V.Brattka:
"Computability in linear algebra",
pp.187-211 in Theoretical Computer Science vol.326 (© Elsevier);

A. Czumaj, C. Sohler, M. Ziegler: "Property Testing in Computational Geometry" pp.155-166 in: Proc. of the 8th Annual European Symposium on Algorithms (ESA'00), Springer LNCS Vol.1879.

V. Brattka, M. Ziegler: "Computing the Dimension of Linear Subspaces" pp.450-458 in: Proc. of the 27th Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM'2000), Springer LNCS Vol.1963.

V. Brattka, M. Ziegler: "A Computable Spectral Theorem" pp. 378-388 in: Proc. of the 4th Computability and Complexity in Analysis (CCA'2000), Springer LNCS Vol.2064.

M. Reza Emamy-K., M. Ziegler: "New Bounds for Hypercube Slicing Numbers" pp.155-164 in Proc. First International Conference on Discrete Models — Combinatorics, Computation and Geometry (2001).

V. Brattka, M. Ziegler: "Computability of Linear Equations"
pp.95-106 in Foundations of Information Technology, Proc. of the 2nd IFIP International Conference on Theoretical Computer Science (TCS2002@Montreal), Kluwer. Also available as Technical Report-Reihe Informatik tr-ri-01-226, Universität Paderborn [Abstract, pdf].

M. Ziegler: "Fast Relative Approximation of Potential Fields", (© Springer-Verlag) pp.140-149 in Proc. 8th Workshop on Algorithms and Data Structures (WADS'03), Springer LNCS 2748.

M.Ziegler: "Stability versus Speed in a Computable Algebraic Model", pp.47-64 of Proc. 5th Conference on Real Numbers and Computers (RNC5), INRIA.

M.Ziegler: "Quasi-Optimal Arithmetic for Quaternion Polynomials", (© Springer-Verlag) pp.705-715 in Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC'03), Springer LNCS 2906.

M.Nüsken, M.Ziegler: "Fast Multipoint Evaluation of Bivariate Polynomials", (© Springer-Verlag) pp.544-555 in Proc. 12th Annual European Symposium on Algorithms (ESA'04), Springer LNCS 3221.

C.Schindelhauer, K.Volbert, M.Ziegler: "Spanners, Weak Spanners, and Power Spanners for Wireless Networks", (© Springer-Verlag) pp.805-821 in Proc. 15th Annual International Symposium on Algorithms and Computation (ISAAC'04), Springer LNCS vol.3341.

C. Sohler, M. Ziegler: "Computing Cut Numbers"
pp.73-79 in Proc. of the 12th Canadian Conference on Computational Geometry (CCCG'00).

V. Brattka, M. Ziegler:
"Turing Computability of (Non-)Linear Optimization"
pp.181-184 in Proc. of the 13th Canadian Conference on Computational Geometry (CCCG'01).

V. Damerow, L. Finschi, M. Ziegler:
"Point Location Algorithms of Minimum Size"
pp.5-9 in Proc. of the 14th Canadian Conference on Computational Geometry (CCCG'02).

M. Ziegler: "Zur Berechenbarkeit reeller geometrischer Probleme",
Dissertation, HNI Verlagsschriftenreihe Vol.115 (2002), ISBN 3-935433-24-7.

M.Ziegler:
"Computable Operators on Regular Sets",
presented at International Conference on Computability and Complexity in Analysis (CCA'03),
pp.389-406 in Informatik Berichte FernUniversität Hagen 302-8/2003.

B.Fuchssteiner, M.Ziegler:
"Nonlinear Reformulation of Heisenberg's Dynamics" (© Springer-Verlag),
pp.693-717 in International Journal of Theoretical Physics vol.44:7 (2005).

M.Ziegler:
"Computational Power of Infinite Quantum Parallelism" (© Springer-Verlag),
pp.2059-2071 in International Journal of Theoretical Physics vol.44:11 (2005).

M.Ziegler:
"Stability versus Speed in a Computable Algebraic Model",
pp.14-26 in Theoretical Computer Science vol.351 (© Elsevier 2006).

C.Schindelhauer, K.Volbert, M.Ziegler:
"Geometric spanners with applications in wireless networks",
pp.197-214 in Computational Geometry vol.36:3 (2007).

M.Ziegler:
"Effectively Open Real Functions" (© Elsevier),
pp.827-849 in Journal of Complexity vol.22 (2006).

M.Ziegler:
"Real Hypercomputation and Continuity" (© Springer),
pp.177-206 in Theory of Computing Systems vol.41 (2007).

K.Meer, M.Ziegler:
"An explicit solution to Post's Problem over the reals" (© Elsevier),
pp.3-15 in Journal of Complexity vol.24:1 (2008).

S.Le Roux, M.Ziegler: "Singular Coverings and Non-Uniform Notions of Closed Set Computability",
pp.545-560 in Mathematical Logic Quarterly vol.54 (2008).

M.R.Emamy-K., M.Ziegler:
"On the coverings of the d-cube for d≤6",
pp.3156-3165 in Discrete Applied Mathematics vol.156:17 (2008).

K.Meer, M.Ziegler:
"Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation,
pp.599-609 in Foundations of Computational Mathematics vol.9 (2009).

M.Ziegler:
"Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics",
pp.1431-1447 in Applied Mathematics and Computation vol.215:4 (2009).

M.Ziegler:
"Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism", (© Springer-Verlag)
pp.562-571 in Proc. CiE 2005: New Computational Paradigms, Springer LNCS vol.3526.

S.Köhler, C.Schindelhauer, M.Ziegler:
"On Approximating Real-World Halting Problems", (© Springer-Verlag)
pp.454-466 in Proc. 15th International Symposium on Fundamentals of Computation Theory (FCT'05), Springer LNCS vol.3623.
The very last claim of Lemma 21 (io-approximation), and thus the proof of Theorem 7b, seems to be flawed. We're working on it!

K.Meer, M.Ziegler:
"An Explicit Solution to Post's Problem over the Reals", (© Springer-Verlag)
pp.467-478 in Proc. 15th International Symposium on Fundamentals of Computation Theory (FCT'05), Springer LNCS vol.3623.

K.Meer, M.Ziegler:
"Uncomputability Below the Real Halting Problem" (© Springer-Verlag),
pp.368-377 in 2nd Conference on Computability in Europe (CiE'06), Springer LNCS vol.3988.

M.Ziegler:
Revising Type-2 Computation and Degrees of Discontinuity (© Elsevier),
pp.255-274 in Proc. 3rd International Conference on Computability and Complexity in Analysis (CCA'06), Electronic Notes in Theoretical Computer Science vol.167 (Jan.2007)

K.Meer, M.Ziegler:
"Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation (Extended Abstract)" (© Springer-Verlag),
pp.726-737 in Proc. 32nd Int. Symp. on Mathematical Foundations of Computer Science (MFCS 2007), Springer LNCS vol.4708.

M.Ziegler:
"(Short) Survey of Real Hypercomputation" (© Springer-Verlag),
pp.809-824 in Proc. 3rd Conference on Computability in Europe (CiE'07), Springer LNCS vol.4497.

S.Köhler, M.Ziegler:
"On the Stability of Fast Polynomial Arithmetic",
pp.147-156 in Proc. 8th Conference on Real Numbers and Computers (J.D.Bruguera, M.Daumas Edts.), July 2008, Santiago de Compostela.

K.Lürwer-Brüggemeier, M.Ziegler:
"On Faster Integer Calculations Using Non-arithmetic Primitives",
pp.111-128 in Proc. 7th International Conference on Unconventional Computation (UC'08), Springer LNCS 5204.

M.Ziegler, W.Koolen:
"Kolmogorov Complexity Theory over the Reals",
pp.153-169 in Proc. 5th Int. Conf. on Computability and Complexity in Analysis (CCA'08), Electronic Notes in Theoretical Computer Science vol.221 (2008).

F.Neumann, A.Reichenberger, M.Ziegler:
"Variations of the Turing Test in the Age of Internet and Virtual Reality (Extended Abstract)",
pp.355-362 in Proc. 32nd Annual Conference on Artificial Intelligence (KI2009), Springer LNCS/LNAI vol.5803.

M.Ziegler:
"Real Computability and Hypercomputation",
Proc Zero 2007, KIAS Preprint C-07013.

M.Ziegler:
"A Meta-Theory of Physics and Computation",
Verhandlungen der Deutschen Physikalischen Gesellschaft, Feb.2008 p.145.

M.Fischer, M.Hilbig, C.Jähn, F.Meyer auf der Heide, M.Ziegler: "Planar Visibility Counting" (4-page extended abstract),
pp.203-206 in Proc. 25th European Workshop on Computational Geometry (2009).

M.Ziegler: "Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability",
extended abstract pp.291-302 in Proc. 6th Int. Conference on Computability and Complexity in Analysis (CCA09).

T.Gärtner, M.Ziegler:
"Real Analytic Machines and Degrees",
pp.1-20 in Logical Methods in Computer Science vol.7:3 (2011)

M. Ziegler:
"Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability with Applications to Effective Linear Algebra",
pp.1108-1139 in Annals of Pure and Applied Logic vol.163 (2012)

A.M. Pauly, M. Ziegler:
"Relative Computability and Uniform Continuity of Relations",
in the Journal of Logic and Analysis vol.5 (2013).

A. Kawamura, H. Ota, C. Rösnick, M. Ziegler:
"Computational Complexity of Smooth Differential Equations",
Logical Methods in Computer Science vol.10:1 (2014).

A. Kawamura, N. Müller, C. Rösnick, M. Ziegler: "Computational Benefit of Smoothness: Parameterized Bit-Complexity of Numerical Operators on Analytic Functions and Gevrey's Hierarchy", pp.689-714 in Journal of Complexity vol.31:5 (2015).

C. Herrmann, M. Ziegler:
Computational Complexity of Quantum Satisfiability, extended abstract pp.175-184 in Proc. 26th IEEE LiCS (2011).

A. Kawamura, H. Ota, C. Rösnick, M. Ziegler:
"Computational Complexity of Smooth Differential Equations",
extended abstract in pp.578-589 in Proc. 37th Int. Symp. Mathematical Foundations of Computer Science (MFCS 2012), Springer LNCS vol.7464.

K. Ambos-Spies, U. Brandt, M. Ziegler:
"Real Benefit of Promises and Advice",
pp.1-11 in Proc. 9th Conf. on Computability in Europe (CiE'2013), Springer LNCS vol.7921.

C. Herrmann, J. Sokoli, M. Ziegler:
"Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines",
in Proc. 6th Int. Conf. Machines, Computations and Universality, pp.85-92 of Electronic Proc. in Theoretical Computer Science vol.128 (2013).

N. Müller, M. Ziegler:
"From Calculus to Algorithms without Errors",
pp.718-724 in Proc. 4th International Congress on Mathematical Software (ICMS2014), Springer LNCS vol.8592.

S. Sun, N. Zhong, M. Ziegler:
"On Computability of Navier-Stokes' Equation",
pp.334-342 in Proc. 11th Conf. on Computability in Europe (CiE2015), Springer LNCS vol.9136.

A. Seehaus, M. Ziegler:
Raise and Fall of Scientific Branches, presented at the 14th Congress of Logic, Methodology and Philosophy of Science (Nancy, 2011)

河村 彰星, N. Müller, C. Rösnick, M. Ziegler: "解析函数の表現と演算子の計算量について", p.8 in Proc. Spring Meeting of the Mathematical Society of Japan (Kyoto 2013).

M. Ziegler: Bericht als JSPS Bridge Fellow 2013

M. Englert, S. Siebert, M. Ziegler: "Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons", preprint (2014).

C. Rösnick: "Parametrisierte uniforme Berechnungs- komplexität in Geometrie und Numerik" (Dissertation, 2015)

The 'Logic' of Deterrence, plenary talk at the 2015 annual meeting of the IANUS group

M. Ziegler: Report on Science Circle (Wissenschaftlicher Gesprächskreis, WGK), pp.144-146 in Festschrift on the occasion of the 20th Anniversary of German-Japanese Scientific Exchange (2015)

C.Herrmann, Y.Tsukamoto, M.Ziegler: "On the Satisfiability Problem for Classes of Structures Related to Finite Dimensional Vector Space" (extended abstract), in Proc. 16th International Workshop on Logic and Computational Complexity (2015)

A. Kawamura, M. Ziegler:
"Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs", 18th Korea-Japan Joint Workshop on Algorithms and Computation (2015).

C. Herrmann and M. Ziegler: "Computational Complexity of Quantum Satisfiability", Journal of the ACM article 19 vol 63:2 (2016).

C. Herrmann, Yasuyuki Tsukamoto (塚本 靖之), M. Ziegler:
"On the Consistency Problem for Modular Lattices and Related Structures", pp.1573-1595 in the International Journal of Algebra and Computation vol.26:8 (2016).

A. Kawamura, F. Steinberg, M. Ziegler:
"On the Computational Complexity of the Dirichlet Problem for Poisson's Equation", pp.1437-1465 in Mathematical Structures in Computer Science vol.27:8 (2017)

C. Herrmann and M. Ziegler: "Definable Relations in Finite-Dimensional Subspace Lattices with Involution" article #68 in Algebra Universalis vol.79 (2018).

C. Herrmann and M. Ziegler: "Definable Relations in Finite-Dimensional Subspace Lattices II" in Algebra Universalis vol.80 no.3(2019).

S. Sun, N. Zhong, M. Ziegler:
"Computability of Navier-Stokes' Equation",
pp.80-112 in Complexity and Approximation, Springer LNCS vol.26000.

H.Férée, M.Ziegler: "On the Computational Complexity of Positive Linear Functionals on C[0;1]", pp.489-504 in Proc. 6th Int. Conf. on Mathematical Aspects of Computer and Information Sciences (MACIS 2015), Springer LNCS vol.9582 (2016).

M.Schröder, F.Steinberg, M.Ziegler: "Average-Case Bit-Complexity Theory of Real Functions", pp.505-519 in Proc. 6th Int. Conf. on Mathematical Aspects of Computer and Information Sciences (MACIS 2015), Springer LNCS vol.9582 (2016).

A.Kawamura, F.Steinberg, M.Ziegler: "Towards Computational Complexity Theory on Advanced Function Spaces in Analysis", pp.142-152 in Proc. 12th Int. Conf. on Computability in Europe, Springer LNCS vol.9709 (2016).

A.Kawamura, F.Steinberg, M.Ziegler: "Complexity Theory of (Functions on) Compact Metric Spaces", pp.837-846 in Proc. 31st Annual ACM-IEEE Symposium on Logic in Computer Science (LiCS'2016).

Junhee Cho, Sewon Park, M.Ziegler: "Computing Periods...", pp.132-143 in Proc. 12th Int. Workshop on Algorithms an Computation (WALCOM 2018), Springer LNCS vol.10755.

Akitoshi Kawamura, Holger Thies, Martin Ziegler: "Average-case polynomial-time computability of Hamiltonian dynamics", Mathematical Foundations of Computer Science (MFCS'2018), LIPIcs-Leibniz International Proceedings in Informatics. vol. 117.

Ivan Koswara, Svetlana Selivanova, Martin Ziegler: "Computational Complexity of Real Powering and Improved Solving Linear Differential Equations", pp.215-227 in Proc. 14th International Computer Science Symposium in Russia (CSR2019), Springer LNCS vol.11532

Arno Pauly, Dongseong Seon, Martin Ziegler: "Computing Haar Measures", pp.34:1--34:17 in Proc. 28th International Conference on Computer Science Logic (CSL 2020), LIPIcs vol. 152.

Donghyun Lim, Martin Ziegler: "Quantitative Coding and Complexity Theory of Compact Metric Spaces", pp.205-214 in Proc. 16th Conference on Computability in Europe (CiE 2020), Springer LNCS vol.12098.

M.Ziegler: "Hyper-degrees of 2nd-order polynomial-time reductions", abstract 3.20 in Dagstuhl Seminar 15392 Report (2016).

R.Hesse, M.Ziegler: "Logik im Mathematikunterricht", pp.51-53+95-104+140-161 in Mathe vernetzt Band 4, Aulis/Pearson (2016).

M.Kollenberg, M.Ziegler: "Abschied vom Menschen: Informatik und künstliche Intelligenz", Interview, Korean Broadcasting System (27. Mai 2016)

U. von Rauchhaupt: "Wenn mein Auto mich opfert" (Frankfurter Allgemeine Zeitung, 28. Juni 2016)

박찬수, 선동성, M. Ziegler: On well-posedness and computability in shape optimization, KMS 2016 Fall Meeting

M. Ziegler: Academia and Science: Ideals we Live and Strive for, p.10 in The KAIST Herald vol.155 (June 2017).

M. Ziegler: Philosophy of Virtualization and the Fabric of Reality, presentation at the Center for Axion and Precision Physics Research (Aug 2017)

Norbert T. Müller, Siegfried M. Rump, Klaus Weihrauch, Martin Ziegler (editors): Reliable Computation and Complexity on the Reals, Proc. Dagstuhl Seminar 17481.

Martin Ziegler: 선형대수학과 해석학에서의 정확한 연속체 연산에 대한 연구, p.142-148 in Proceedings of the Conference on Mathematics to Industry.

Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler: "Bit-Complexity of Classical Solutions of Linear Evolutionary Systems of Partial Differential Equations", vol.76 in the Journal of Complexity. Svetlana Selivanova, Florian Steinberg, Holger Thies, Martin Ziegler: "Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations", pp.370-390 in Proc. 23rd International Workshop on Computer Algebra in Scientific Computing (CASC2021), Springer LNCS vol.12865.

Ivan Koswara, Gleb Pogudin, Svetlana Selivanova, Martin Ziegler: "Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations" pp.223-241 in Proc. CSR 2021, Springer LNCS vol.12730.

Franz Brauße, Pieter Collins, Martin Ziegler: Computer Science for Continuous Data, pp.62-82 in Proc. Computer Algebra in Scientific Computing (CASC 2022), Springer LNCS vol.13366

Martin Ziegler: Avi Wigderson's work linking between Mathematics and Computation, KIAS Horizon (June 2021).

Martin Ziegler: Tutorial: Quantitative Coding and Complexity Theory of Compact Metric Spaces, p.81 in Dagstuhl Reports/21461 vol.11, Issue 10 (2021)

Andrea Reichenberger, Martin Ziegler: KI aus interdisziplinärer Perspektive, pp.25-28 in FIfF-Kommunikation vol.2 (2022)