Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. - Matthias Fischer 001; Tamás Lukovszki; Martin Ziegler 001 (ESA, 1998)

A Network Based Approach for Realtime Walkthrough of Massive Models. - Matthias Fischer 001; Tamás Lukovszki; Martin Ziegler 001 (WAE, 1998)

Partitioned neighborhood spanners of minimal outdegree. - Matthias Fischer 001; Tamás Lukovszki; Martin Ziegler 001 (CCCG, 1999)

A Computable Spectral Theorem. - Martin Ziegler 001; Vasco Brattka (CCA, 2000)

Computing Cut Numbers. - Christian Sohler; Martin Ziegler 001 (CCCG, 2000)

Property Testing in Computational Geometry. - Artur Czumaj; Christian Sohler; Martin Ziegler 001 (ESA, 2000)

Computing the Dimension of Linear Subspaces. - Martin Ziegler 001; Vasco Brattka (SOFSEM, 2000)

Turing computability of (non-)linear optimization. - Martin Ziegler 001; Vasco Brattka (CCCG, 2001)

New Bounds for Hypercube Slicing Numbers. - M. Reza Emamy-Khansary; Martin Ziegler 001 (DM-CCG, 2001)

Point location algorithms of minimum size. - Valentina Damerow; Lukas Finschi; Martin Ziegler 001 (CCCG, 2002)

Computability of Linear Equations. - Vasco Brattka; Martin Ziegler 001 (IFIP TCS, 2002)

Computability on Regular Subsets of Euclidean Space. - Martin Ziegler 001 (Math. Log. Q., 2002)

Zur Berechenbarkeit reeller geometrischer Probleme. - Martin Ziegler 001 (Heinz Nixdorf Institut, 2003)

Quasi-optimal Arithmetic for Quaternion Polynomials. - Martin Ziegler 001 (ISAAC, 2003)

Fast Relative Approximation of Potential Fields. - Martin Ziegler 001 (WADS, 2003)

Fast Multipoint Evaluation of Bivariate Polynomials. - Michael Nüsken; Martin Ziegler 001 (ESA, 2004)

Spanners, Weak Spanners, and Power Spanners for Wireless Networks. - Christian Schindelhauer; Klaus Volbert; Martin Ziegler 001 (ISAAC, 2004)

Computable operators on regular sets. - Martin Ziegler 001 (Math. Log. Q., 2004)

Computability in linear algebra. - Martin Ziegler 001; Vasco Brattka (Theor. Comput. Sci., 2004)

Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. - Martin Ziegler 001 (CiE, 2005)

On Approximating Real-World Halting Problems. - Sven Köhler 001; Christian Schindelhauer; Martin Ziegler 001 (FCT, 2005)

Fast (Multi-)Evaluation of Linearly Recurrent Sequences: Improvements and Applications - Martin Ziegler 001 (CoRR, 2005)

Uncomputability Below the Real Halting Problem. - Klaus Meer; Martin Ziegler 001 (CiE, 2006)

Computable Closed Euclidean Subsets with and without Computable Points - Stéphane Le Roux 001; Martin Ziegler 001 (CoRR, 2006)

Revising Type-2 Computation and Degrees of Discontinuity. - Martin Ziegler 001 (CCA, 2006)

Effectively open real functions. - Martin Ziegler 001 (J. Complex., 2006)

Stability versus speed in a computable algebraic model. - Martin Ziegler 001 (Theor. Comput. Sci., 2006)

Real computability and hypercomputation. - Martin Ziegler 001 (2007)

(Short) Survey of Real Hypercomputation. - Martin Ziegler 001 (CiE, 2007)

Geometric spanners with applications in wireless networks. - Christian Schindelhauer; Klaus Volbert; Martin Ziegler 001 (Comput. Geom., 2007)

Singular Coverings and Non-Uniform Notions of Closed Set Computability. - Stéphane Le Roux 001; Martin Ziegler 001 (CCA, 2007)

Real Hypercomputation and Continuity. - Martin Ziegler 001 (Theory Comput. Syst., 2007)

On Faster Integer Calculations Using Non-arithmetic Primitives. - Katharina Lürwer-Brüggemeier; Martin Ziegler 001 (UC, 2008)

Physically-Relativized Church-Turing Hypotheses - Martin Ziegler 001 (CoRR, 2008)

Planar Visibility Counting - Matthias Fischer 001; Matthias Hilbig 002; Claudius Jähn; Friedhelm Meyer auf der Heide; Martin Ziegler 001 (CoRR, 2008)

Real Computation with Few Discrete Advice: A Complexity Theory of Nonuniform Computability - Martin Ziegler 001 (CoRR, 2008)

On the coverings of the d-cube for d<=6. - M. Reza Emamy-Khansary; Martin Ziegler 001 (Discret. Appl. Math., 2008)

Kolmogorov Complexity Theory over the Reals. - Martin Ziegler 001; Wouter M. Koolen (CCA, 2008)

An explicit solution to Post's Problem over the reals. - Klaus Meer; Martin Ziegler 001 (J. Complex., 2008)

Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability. - Martin Ziegler 001 (CCA, 2009)

Variations of the Turing Test in the Age of Internet and Virtual Reality. - Florentin Neumann; Andrea Reichenberger; Martin Ziegler 001 (KI, 2009)

Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics. - Martin Ziegler 001 (Appl. Math. Comput., 2009)

Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics - Matthias Fischer 001; Claudius Jähn; Martin Ziegler 001 (CoRR, 2009)

Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. - Klaus Meer; Martin Ziegler 001 (Found. Comput. Math., 2009)

Expressiveness and Computational Complexity of Geometric Quantum Logic - Christian Herrmann 003; Martin Ziegler 001 (CoRR, 2010)

Real Analytic Machines and Degrees - Tobias Gärtner; Martin Ziegler 001 (CCA, 2011)

Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation. - Tobias Gärtner; Martin Ziegler 001 (Log. Methods Comput. Sci., 2011)

Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. - Martin Ziegler 001 (Ann. Pure Appl. Log., 2012)

Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime - Akitoshi Kawamura; Norbert Th. Müller; Carsten Rösnick; Martin Ziegler 001 (CoRR, 2012)

Real Benefit of Promises and Advice. - Klaus Ambos-Spies; Ulrike Brandt; Martin Ziegler 001 (CiE, 2013)

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines. - Christian Herrmann 003; Johanna Sokoli; Martin Ziegler 001 (MCU, 2013)

Relative computability and uniform continuity of relations. - Arno Pauly; Martin Ziegler 001 (J. Log. Anal., 2013)

From Calculus to Algorithms without Errors. - Norbert Th. Müller; Martin Ziegler 001 (ICMS, 2014)

Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons. - Matthias Englert; Sandra Siebert; Martin Ziegler 001 (CoRR, 2014)

Computational Complexity of Smooth Differential Equations. - Akitoshi Kawamura; Hiroyuki Ota; Carsten Rösnick; Martin Ziegler 001 (Log. Methods Comput. Sci., 2014)

On Computability of Navier-Stokes' Equation. - Shu-Ming Sun; Ning Zhong 002; Martin Ziegler 001 (CiE, 2015)

On the Computational Complexity of Positive Linear Functionals on C[0;1]. - Hugo Férée; Martin Ziegler 001 (MACIS, 2015)

Average-Case Bit-Complexity Theory of Real Functions. - Matthias Schröder 001; Florian Steinberg 001; Martin Ziegler 001 (MACIS, 2015)

Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy. - Akitoshi Kawamura; Norbert Th. Müller; Carsten Rösnick; Martin Ziegler 001 (J. Complex., 2015)

Towards Computational Complexity Theory on Advanced Function Spaces in Analysis. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (CiE, 2016)

Complexity Theory of (Functions on) Compact Metric Spaces. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (LICS, 2016)

On Formal Verification in Imperative Multivalued Programming over Continuous Data Types. - Norbert Th. Müller; Sewon Park 001; Norbert Preining; Martin Ziegler 001 (CoRR, 2016)

On the consistency problem for modular lattices and related structures. - Christian Herrmann 003; Yasuyuki Tsukamoto; Martin Ziegler 001 (Int. J. Algebra Comput., 2016)

Computational Complexity of Quantum Satisfiability. - Christian Herrmann 003; Martin Ziegler 001 (J. ACM, 2016)

Computable Operations on Compact Subsets of Metric Spaces with Applications to Fréchet Distance and Shape Optimization. - Chansu Park; Ji-won Park; Sewon Park 001; Dongseong Seon; Martin Ziegler 001 (CoRR, 2017)

Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014). - Andrej Bauer; Ulrich Berger 001; Willem L. Fouché; Dieter Spreen; Hideki Tsuiki; Martin Ziegler 001 (J. Log. Anal., 2017)

On the computational complexity of the Dirichlet Problem for Poisson's Equation. - Akitoshi Kawamura; Florian Steinberg 001; Martin Ziegler 001 (Math. Struct. Comput. Sci., 2017)

Average-Case Polynomial-Time Computability of Hamiltonian Dynamics. - Akitoshi Kawamura; Holger Thies; Martin Ziegler 001 (MFCS, 2018)

Computing Periods ... . - Junhee Cho 001; Sewon Park 001; Martin Ziegler 001 (WALCOM, 2018)

Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs. - Akitoshi Kawamura; Martin Ziegler 001 (CoRR, 2018)

Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory. - Akitoshi Kawamura; Donghyun Lim; Svetlana Selivanova; Martin Ziegler 001 (CoRR, 2018)

Computational Complexity of Real Powering and Improved Solving Linear Differential Equations. - Ivan Koswara; Svetlana Selivanova; Martin Ziegler 001 (CSR, 2019)

Randomized Computation of Continuous Data: Is Brownian Motion Computable? - Willem L. Fouché; Hyunwoo Lee; Donghyun Lim; Sewon Park 001; Matthias Schröder 001; Martin Ziegler 001 (CoRR, 2019)

Computability of the Solutions to Navier-Stokes Equations via Effective Approximation. - Shu-Ming Sun; Ning Zhong 002; Martin Ziegler 001 (Complexity and Approximation, 2020)

Quantitative Coding and Complexity Theory of Compact Metric Spaces. - Donghyun Lim; Martin Ziegler 001 (CiE, 2020)

Computing Haar Measures. - Arno Pauly; Dongseong Seon; Martin Ziegler 001 (CSL, 2020)

A Quantitative Multivalued Selection Theorem for Encoding Spaces of Continuum Cardinality. - Donghyun Lim; Martin Ziegler 001 (CoRR, 2020)

Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations. - Svetlana Selivanova; Florian Steinberg 001; Holger Thies; Martin Ziegler 001 (CASC, 2021)

Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations. - Ivan Koswara; Gleb Pogudin; Svetlana Selivanova; Martin Ziegler 001 (CSR, 2021)

Computer Science for Continuous Data - Survey, Vision, Theory, and Practice of a Computer [inline-graphic not available: see fulltext]Analysis System. - Franz Brauße; Pieter Collins; Martin Ziegler 001 (CASC, 2022)

Degrees of Second and Higher-Order Polynomials. - Donghyun Lim; Martin Ziegler 001 (CoRR, 2023)

Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations. - Ivan Koswara; Gleb Pogudin; Svetlana Selivanova; Martin Ziegler 001 (J. Complex., 2023)

Software Testing in Computable Analysis. - Klaus Meer; Martin Ziegler 001 (UCNC, 2024)

Semantics, Specification Logic, and Hoare Logic of Exact Real Computation. - Sewon Park 001; Franz Brauße; Pieter Collins; SunYoung Kim; Michal Konecný; Gyesik Lee; Norbert Th. Müller; Eike Neumann; Norbert Preining; Martin Ziegler 001 (Log. Methods Comput. Sci., 2024)

Quantitative Coding and Complexity Theory of Continuous Data: Part I: Motivation, Definition, Consequences. - Donghyun Lim; Martin Ziegler 001 (J. ACM, 2025)