Department of Mathematics, Technische Universität Darmstadt
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
| 2013 | ||
|---|---|---|
| j18 | Katrin Tent, Martin Ziegler: On the isometry group of the Urysohn space. J. London Math. Society 87(1): 289-303 (2013) | |
| c30 | ||
| 2012 | ||
| j17 | Martin Ziegler: Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra. Ann. Pure Appl. Logic 163(8): 1108-1139 (2012) | |
| c29 | Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick, Martin Ziegler: Computational Complexity of Smooth Differential Equations. MFCS 2012: 578-589 | |
| i18 | 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 | ||
| j16 | Tobias Gärtner, Martin Ziegler: Real Analytic Machines and Degrees: A Topological View on Algebraic Limiting Computation. Logical Methods in Computer Science 7(3) (2011) | |
| c28 | Christian Herrmann, Martin Ziegler: Computational Complexity of Quantum Satisfiability. LICS 2011: 175-184 | |
| c27 | ||
| 2010 | ||
| i17 | Christian Herrmann, Martin Ziegler: Expressiveness and Computational Complexity of Geometric Quantum Logic. CoRR abs/1004.1696 (2010) | |
| 2009 | ||
| j15 | Martin Ziegler: Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics. Applied Mathematics and Computation 215(4): 1431-1447 (2009) | |
| j14 | Klaus Meer, Martin Ziegler: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. Foundations of Computational Mathematics 9(5): 599-609 (2009) | |
| c26 | Martin Ziegler: Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability. CCA 2009 | |
| c25 | Florentin Neumann, Andrea Reichenberger, Martin Ziegler: Variations of the Turing Test in the Age of Internet and Virtual Reality. KI 2009: 355-362 | |
| i16 | 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) | |
| i15 | 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 | ||
| j13 | M. Reza Emamy-Khansary, Martin Ziegler: On the coverings of the d-cube for d<=6. Discrete Applied Mathematics 156(17): 3156-3165 (2008) | |
| j12 | Stéphane Le Roux, Martin Ziegler: Singular Coverings and Non-Uniform Notions of Closed Set Computability. Electr. Notes Theor. Comput. Sci. 202: 73-88 (2008) | |
| j11 | Martin Ziegler, Wouter M. Koolen: Kolmogorov Complexity Theory over the Reals. Electr. Notes Theor. Comput. Sci. 221: 153-169 (2008) | |
| j10 | Klaus Meer, Martin Ziegler: An explicit solution to Post's Problem over the reals. J. Complexity 24(1): 3-15 (2008) | |
| j9 | Stéphane Le Roux, Martin Ziegler: Singular coverings and non-uniform notions of closed set computability. Math. Log. Q. 54(5): 545-560 (2008) | |
| c24 | Katharina Lürwer-Brüggemeier, Martin Ziegler: On Faster Integer Calculations Using Non-arithmetic Primitives. UC 2008: 111-128 | |
| i14 | Martin Ziegler, Wouter M. Koolen: Kolmogorov Complexity Theory over the Reals. CoRR abs/0802.2027 (2008) | |
| i13 | ||
| i12 | Matthias Fischer, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, Martin Ziegler: Planar Visibility Counting. CoRR abs/0810.0052 (2008) | |
| i11 | Martin Ziegler: Real Computation with Few Discrete Advice: A Complexity Theory of Nonuniform Computability. CoRR abs/0811.3782 (2008) | |
| 2007 | ||
| j8 | Christian Schindelhauer, Klaus Volbert, Martin Ziegler: Geometric spanners with applications in wireless networks. Comput. Geom. 36(3): 197-214 (2007) | |
| j7 | Martin Ziegler: Revising Type-2 Computation and Degrees of Discontinuity. Electr. Notes Theor. Comput. Sci. 167: 255-274 (2007) | |
| j6 | ||
| c23 | ||
| c22 | Klaus Meer, Martin Ziegler: Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. MFCS 2007: 726-737 | |
| i10 | Katharina Lürwer-Brüggemeier, Martin Ziegler: On Faster Integer Calculations using Non-Arithmetic Primitives. CoRR abs/0709.0624 (2007) | |
| 2006 | ||
| j5 | ||
| j4 | Martin Ziegler: Stability versus speed in a computable algebraic model. Theor. Comput. Sci. 351(1): 14-26 (2006) | |
| c21 | ||
| c20 | 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 | ||
| 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 | ||
| i4 | ||
| i3 | Martin Ziegler: Fast (Multi-)Evaluation of Linearly Recurrent Sequences: Improvements and Applications. CoRR abs/cs/0511033 (2005) | |
| 2004 | ||
| j3 | ||
| 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 | ||
| c13 | ||
| c12 | ||
| i1 | ||
| 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 | ||
| 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 | ||
| c6 | ||
| c5 | Artur Czumaj, Christian Sohler, Martin Ziegler: Property Testing in Computational Geometry. ESA 2000: 155-166 | |
| c4 | ||
| 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. Algorithm Engineering 1998: 133-142 | |
Colors in the list of coauthors
Last update Wed May 22 13:33:57 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page