Martin Ziegler

Orcid: 0000-0001-6734-7875

Affiliations:
  • Korea Advanced Institute of Science and Technology (KAIST), School of Computing
  • Darmstadt University of Technology, Department of Mathematics (former)
  • University of Paderborn, Department of Computer Science (former)


According to our database1, Martin Ziegler authored at least 84 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation.
Log. Methods Comput. Sci., 2024

Software Testing in Computable Analysis.
Proceedings of the Unconventional Computation and Natural Computation, 2024

2023
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations.
J. Complex., June, 2023

Degrees of Second and Higher-Order Polynomials.
CoRR, 2023

2022
Computer Science for Continuous Data - Survey, Vision, Theory, and Practice of a Computer [inline-graphic not available: see fulltext]Analysis System.
Proceedings of the Computer Algebra in Scientific Computing - 24th International Workshop, 2022

2021
Bit-Complexity of Solving Systems of Linear Evolutionary Partial Differential Equations.
Proceedings of the Computer Science - Theory and Applications, 2021

Exact Real Computation of Solution Operators for Linear Analytic Systems of Partial Differential Equations.
Proceedings of the Computer Algebra in Scientific Computing - 23rd International Workshop, 2021

2020
A Quantitative Multivalued Selection Theorem for Encoding Spaces of Continuum Cardinality.
CoRR, 2020

Computing Haar Measures.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

Quantitative Coding and Complexity Theory of Compact Metric Spaces.
Proceedings of the Beyond the Horizon of Computability, 2020

Computability of the Solutions to Navier-Stokes Equations via Effective Approximation.
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020

2019
Randomized Computation of Continuous Data: Is Brownian Motion Computable?
CoRR, 2019

Computational Complexity of Real Powering and Improved Solving Linear Differential Equations.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
Quantitatively Admissible Representations and the "Main Theorem" of Type-2 COMPLEXITY Theory.
CoRR, 2018

Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs.
CoRR, 2018

Computing Periods ... .
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Average-Case Polynomial-Time Computability of Hamiltonian Dynamics.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017
On the computational complexity of the Dirichlet Problem for Poisson's Equation.
Math. Struct. Comput. Sci., 2017

Continuity, computability, constructivity: from logic to algorithms 2014 (Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014).
J. Log. Anal., 2017

Computable Operations on Compact Subsets of Metric Spaces with Applications to Fréchet Distance and Shape Optimization.
CoRR, 2017

2016
Computational Complexity of Quantum Satisfiability.
J. ACM, 2016

On the consistency problem for modular lattices and related structures.
Int. J. Algebra Comput., 2016

On Formal Verification in Imperative Multivalued Programming over Continuous Data Types.
CoRR, 2016

Complexity Theory of (Functions on) Compact Metric Spaces.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Towards Computational Complexity Theory on Advanced Function Spaces in Analysis.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2015
Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy.
J. Complex., 2015

Average-Case Bit-Complexity Theory of Real Functions.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

On the Computational Complexity of Positive Linear Functionals on <i>C</i>[0;1].
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2015

On Computability of Navier-Stokes' Equation.
Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014
Computational Complexity of Smooth Differential Equations.
Log. Methods Comput. Sci., 2014

Logical Limitations to Machine Ethics with Consequences to Lethal Autonomous Weapons.
CoRR, 2014

From Calculus to Algorithms without Errors.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Relative computability and uniform continuity of relations.
J. Log. Anal., 2013

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines.
Proceedings of the Proceedings Machines, Computations and Universality 2013, 2013

Real Benefit of Promises and Advice.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
CoRR, 2012

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

2011
Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation.
Log. Methods Comput. Sci., 2011

Real Analytic Machines and Degrees
Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2011

2010
Expressiveness and Computational Complexity of Geometric Quantum Logic
CoRR, 2010

2009
Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.
Found. Comput. Math., 2009

Adaptive Mesh Approach for Predicting Algorithm Behavior with Application to Visibility Culling in Computer Graphics
CoRR, 2009

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

Variations of the Turing Test in the Age of Internet and Virtual Reality.
Proceedings of the KI 2009: Advances in Artificial Intelligence, 2009

Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability.
Proceedings of the Sixth International Conference on Computability and Complexity in Analysis, 2009

2008
An explicit solution to Post's Problem over the reals.
J. Complex., 2008

Kolmogorov Complexity Theory over the Reals.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

On the coverings of the d-cube for d<=6.
Discret. Appl. Math., 2008

Real Computation with Few Discrete Advice: A Complexity Theory of Nonuniform Computability
CoRR, 2008

Planar Visibility Counting
CoRR, 2008

Physically-Relativized Church-Turing Hypotheses
CoRR, 2008

On Faster Integer Calculations Using Non-arithmetic Primitives.
Proceedings of the Unconventional Computing, 7th International Conference, 2008

2007
Real Hypercomputation and Continuity.
Theory Comput. Syst., 2007

Singular Coverings and Non-Uniform Notions of Closed Set Computability.
Proceedings of the Fourth International Conference on Computability and Complexity in Analysis, 2007

Geometric spanners with applications in wireless networks.
Comput. Geom., 2007

(Short) Survey of Real Hypercomputation.
Proceedings of the Computation and Logic in the Real World, 2007

Real computability and hypercomputation.
PhD thesis, 2007

2006
Stability versus speed in a computable algebraic model.
Theor. Comput. Sci., 2006

Effectively open real functions.
J. Complex., 2006

Revising Type-2 Computation and Degrees of Discontinuity.
Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Computable Closed Euclidean Subsets with and without Computable Points
CoRR, 2006

Uncomputability Below the Real Halting Problem.
Proceedings of the Logical Approaches to Computational Barriers, 2006

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

On Approximating Real-World Halting Problems.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.
Proceedings of the New Computational Paradigms, 2005

2004
Computability in linear algebra.
Theor. Comput. Sci., 2004

Computable operators on regular sets.
Math. Log. Q., 2004

Spanners, Weak Spanners, and Power Spanners for Wireless Networks.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

Fast Multipoint Evaluation of Bivariate Polynomials.
Proceedings of the Algorithms, 2004

2003
Fast Relative Approximation of Potential Fields.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Quasi-optimal Arithmetic for Quaternion Polynomials.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Zur Berechenbarkeit reeller geometrischer Probleme.
HNI-Verlagsschriftenreihe 115, Heinz Nixdorf Institut, ISBN: 978-3-935433-24-2, 2003

2002
Computability on Regular Subsets of Euclidean Space.
Math. Log. Q., 2002

Computability of Linear Equations.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Point location algorithms of minimum size.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
New Bounds for Hypercube Slicing Numbers.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

Turing computability of (non-)linear optimization.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Computing the Dimension of Linear Subspaces.
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Property Testing in Computational Geometry.
Proceedings of the Algorithms, 2000

Computing Cut Numbers.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

A Computable Spectral Theorem.
Proceedings of the Computability and Complexity in Analysis, 4th International Workshop, 2000

1999
Partitioned neighborhood spanners of minimal outdegree.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
A Network Based Approach for Realtime Walkthrough of Massive Models.
Proceedings of the Algorithm Engineering, 2nd International Workshop, 1998

Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.
Proceedings of the Algorithms, 1998


  Loading...