Teaching experience
-
Tutorial Computeralgebra in der Physik (german)
-
Tutor for Lectures
-
Organizer and Student Advisor at Seminar
"Perlen der Theoretischen Informatik"
(2000,
2001,
2002,
2003,
2004)
- in WS2003/2004: Lecturer for
"Advanced Computability Theory", held
in English
- in WS2004/2005: Lecturer for
"Hypercomputation"
- in WS2007/2008: Supply lecturer for
Einführung
in Berechenbarkeit, Komplexität und Formale Sprachen,
sessions
#06,
#11,
#21, and
tutorial
#04.
- in SS2008: Complexity Theory
- in September 2008: Selected Topics in the Theory of Computation
(CS493@KAIST)
- in WS2008/2009: Einführung
in Berechenbarkeit, Komplexität und Formale Sprachen (4h)
- in WS2009/2010: Proseminar "Berechenbare Analysis" (2h)
- in SS2010: Introduction to Mathematical Logic (4+2h)
und der
SchülerInnen-Informationstag TUDay
- in WS2010/2011:
- in SS2011
- in WS2011/2012
Theses Supervision
- Diploma-Thesis of Valentina Damerow "Time-Space Trade-Offs for Deciding Line-Arrangements",
- Teachers' Thesis (Staatsexamensarbeit) of
Tomas Brajkovic "Polynomarithmetik über reellen Divisionsalgebren",
- Bachelor's Thesis of Oliver Sudmann "Algorithmen
zur Visualisierung der Relativitätstheorie",
- Bachelor's Thesis of Matthias Hilbig
"Perspektivische Suche in geometrischen Szenen",
- Bachelor's Thesis of Sven Köhler
"Zur Approximierbarkeit des Halteproblems
in einer praktischen Gödelisierung",
- Master's Thesis of Paul Kaufmann
"Computer-Methoden zur Lösung konkreter Instanzen
einiger kombinatorischer Probleme",
- Master's Thesis of Oliver Sudmann
"Interaktive Visualisierung der Speziellen Relativitätstheorie auf programmierbarer Grafikhardware",
- Bachelor's Thesis of Jochen Darley "Zeitkritisches Rendering mittels perspektivischer Suche",
- Diploma Thesis of Sven Köhler "Zur Praktikabilität schneller Polynomarithmetik",
- Diploma Thesis of Nermin Junuzovic "Praktische Berechnung des geometrischen Verdeckungsgrads virtueller Szenen",
- Diploma Thesis of Matthias Hilbig "Parametrisierte Generierung und automatische Bewertung virtueller Szenen",
- Bachelor's Thesis of Alexander Spot "RAM-Modell und 64Bit Prozessoren",
- Bachelor's Thesis of Sven Kurras "Die Grafikkarte als Parallelcomputer"
+ Upgrade Thesis "Schwarmsimulation in CUDA",
- PhD Thesis of Katharina Lürwer-Brüggemeier "Berechenbarkeit und Komplexität von Berechnungen mit der ganzzahligen Division",
- Bachelor's Thesis of Florentin Neumann "Der
Hofstadter-Turing-Test als anwendungsorientiertes philosophisches Problem
am Beispiel von Second Life",
- Bachelor's Thesis of Max Drees "Combinatorial Aspects
of Quantum Logic",
- Bachelor's Thesis of Lucas Jillek "Interaktive
Exploration gravitativer Orbits"",
- Master's Thesis of Carsten
Rösnick "Approximate
Real Function Maximization and Query Complexity",
- Bachelor's Thesis of Sandra Maria Meyer
"Berechenbarkeitstheorie: Church-Turing Hypothese und Asimovs Robotergesetze",
- Bachelor's Thesis of Arne Seehaus
"Revolutionen
in der Mathematik: Wissenschaftstheoretische Standpunkte",
- Bachelor's Thesis of ZHANG Jingwen
"Ein
effektiver Zwischenwertsatz als Fallstudie für exakte reelle Arithmetik"
张静雯 "关于实数精确计算的一个可行中值定理"
- Bachelor's Thesis of Holger Thies
"Complexity Theory and Practice of Integrating
Lipschitz-continuous functions in Exact Real Arithmetic"
- Diploma Thesis of Selim Dogruel
"Revisiting
and Tailoring Auction Theory for Eurex Clearing"
(supervised by Dr. Stephane Le Roux from TUD's math department and Teo Floor and Thomas Laux from Eurex Clearing)
Publications
- M. Ziegler:
"Scientific Software in Physics Research"
pp.718-719 in: Physikalische Blätter Vol.53 (1997)
No.7/8
- M. Fischer, T. Lukovszki, M. Ziegler:
"Geometric Searching in Walkthrough Animations with
Weak Spanners in Real Time"
pp.163-174 in:
Proceedings 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: Proceedings 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: Proceedings of the 11th Canadian Conference on
Computational Geometry
(CCCG'99)
- A. Czumaj,
C. Sohler, M. Ziegler:
"Property Testing in Computational Geometry"
pp.155-166 in:
Proceedings of the 8th Annual European Symposium on Algorithms
(ESA'00),
Springer LNCS Vol.1879.
- C. Sohler, M. Ziegler:
"Computing
Cut Numbers"
pp.73-79 in
Proceedings of the 12th Canadian Conference on Computational Geometry
(CCCG'00).
- V. Brattka, M. Ziegler:
"Computing the Dimension of Linear Subspaces"
pp.450-458 in:
Proceedings 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:
Proceedings 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 Proceedings of the First International Conference on
Discrete Models - Combinatorics, Computation and Geometry
(DM-CCG, Paris),
DMTCS vol.AA (2001).
- V. Brattka, M. Ziegler:
"Turing
Computability of (Non-)Linear Optimization"
pp.181-184 in Proceedings of the 13th Canadian Conference on
Computational Geometry
(CCCG'01).
- 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).
- V. Damerow,
L. Finschi,
M. Ziegler:
"Point
Location Algorithms of Minimum Size"
pp.5-9 in Proceedings 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:
"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:
"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.Ziegler:
"Computable operators on regular sets"
pp.392-404 in
Mathematical
Logic Quarterly (MLQ),
Vol.50 (2004) (© VCH-Wiley).
- 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.
- M.Ziegler, V.Brattka:
"Computability in linear algebra",
pp.187-211 in
Theoretical Computer Science vol.326 (© Elsevier);
- 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.
- 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-Word 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.
- 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).
- 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:
"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).
- 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 International Symposium 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.
- M.Ziegler:
"Real Computability and Hypercomputation",
Proc Zero 2007, KIAS Preprint
C-07013.
- 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).
- M.Ziegler:
"A Meta-Theory of Physics and Computation",
Verhandlungen der Deutschen Physikalischen Gesellschaft,
Feb.2008 p.145.
- 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).
- 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.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).
- 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).
- 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).
- 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).
- 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 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).
- 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:
"Relative
Computability and Uniform Continuity of Relations",
presented at Computability and Complexity in Analysis 2011.
- C. Herrmann, M. Ziegler:
Computational Complexity
of Quantum Satisfiability, extended abstract
pp.175-184 in Proc. 26th IEEE LiCS
- A. Seehaus, M. Ziegler:
Raise and Fall of Scientific Branches,
presented at the
14th Congress of Logic,
Methodology and Philosophy of Science (Nancy, 2011)
- 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)