- CSB - MetaPress - Google - Bing - Yahoo
 | 2006 | |
|---|---|---|
| 20 |      | Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: Real Computation and Complexity, 1.-6. February 2004 Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 2005 | ||
| 19 |  | Thomas Lickteig: Festschrift in honor of Arnold Scho"nhage. J. Complexity 21(4): 372-376 (2005) |
| 2004 | ||
| 18 | | Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004 |
| 17 | | Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004 |
| 2001 | ||
| 16 | | Thomas Lickteig, Marie-Françoise Roy: Sylvester-Habicht Sequences and Fast Cauchy Index Computation. J. Symb. Comput. 31(3): 315-341 (2001) |
| 2000 | ||
| 15 | | Felipe Cucker, Thomas Lickteig: Preface. J. Complexity 16(1): 1 (2000) |
| 1997 | ||
| 14 | | Thomas Lickteig, Klaus Meer: Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complexity 13(1): 83-107 (1997) |
| 1996 | ||
| 13 | | Thomas Lickteig, Marie-Françoise Roy: Semi-algebraic Complexity of Quotients and Sign Determination of Remainders. J. Complexity 12(4): 545-571 (1996) |
| 1995 | ||
| 12 | | Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther: On real Turing machines that toss coins. STOC 1995: 335-342 |
| 11 | | Thomas Lickteig, Kai Werther: How can a Complex Square Root be Computed in an Optimal Way. Computational Complexity 5(3/4): 222-236 (1995) |
| 10 | | Thomas Lickteig, Klaus Meer: A Note on Testing the Resultant. J. Complexity 11(3): 344-351 (1995) |
| 1993 | ||
| 9 | | Peter Bürgisser, Marek Karpinski, Thomas Lickteig: On Randomized Semi-algebraic Test Complexity. J. Complexity 9(2): 231-251 (1993) |
| 1992 | ||
| 8 | | Peter Bürgisser, Thomas Lickteig, Michael Shub: Test complexity of generic polynomials. J. Complexity 8(3): 203-215 (1992) |
| 1991 | ||
| 7 | | Peter Bürgisser, Marek Karpinski, Thomas Lickteig: Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Computational Complexity 1: 131-155 (1991) |
| 1989 | ||
| 6 | | Thomas Lickteig: A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras. SIAM J. Comput. 18(2): 209-215 (1989) |
| 5 | | Thomas Lehmkuhl, Thomas Lickteig: On the Order of Approximation in Approximative Triadic Decompositions of Tensors. Theor. Comput. Sci. 66(1): 1-14 (1989) |
| 1987 | ||
| 4 | | Thomas Lickteig, Hugo Volger: Some Results on the Complexity of Powers. Computation Theory and Logic 1987: 249-255 |
| 3 | | Thomas Lickteig: The Computational Complexity of Division in Quadratic Extension Fields. SIAM J. Comput. 16(2): 278-311 (1987) |
| 1986 | ||
| 2 | | Thomas Lickteig: Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two. Inf. Process. Lett. 22(6): 277-279 (1986) |
| 1984 | ||
| 1 | | Thomas Lickteig: A Note on Border Rank. Inf. Process. Lett. 18(3): 173-178 (1984) |
| 1 | Peter Bürgisser (Peter Buergisser) | [7] [8] [9] |
| 2 | Felipe Cucker | [12] [15] |
| 3 | Marek Karpinski | [7] [9] [12] |
| 4 | Pascal Koiran | [12] |
| 5 | Thomas Lehmkuhl | [5] |
| 6 | Klaus Meer | [10] [14] [17] [18] [20] |
| 7 | Luis M. Pardo (Luis Miguel Pardo) | [17] [18] [20] |
| 8 | Marie-Françoise Roy | [13] [16] |
| 9 | Mike Shub (Michael Shub) | [8] |
| 10 | Hugo Volger | [4] |
| 11 | Kai Werther | [11] [12] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page