Thomas Lickteig

Publication Activity (10 Years)

Years Active: 1984-2005
Publications (10 Years): 0

Publications

Thomas Lickteig
Festschrift in honor of Arnold Scho"nhage. J. Complex. 21 (4) (2005)
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
04061 Summary - Real Computation and Complexity. Real Computation and Complexity (2004)
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity (2004)
Thomas Lickteig, Marie-Françoise Roy
Sylvester-Habicht Sequences and Fast Cauchy Index Computation. J. Symb. Comput. 31 (3) (2001)
Felipe Cucker, Thomas Lickteig
Preface. J. Complex. 16 (1) (2000)
Thomas Lickteig, Klaus Meer
Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complex. 13 (1) (1997)
Thomas Lickteig, Marie-Françoise Roy
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders. J. Complex. 12 (4) (1996)
Thomas Lickteig, Kai Werther
How can a Complex Square Root be Computed in an Optimal Way. Comput. Complex. 5 (3/4) (1995)
Thomas Lickteig, Klaus Meer
A Note on Testing the Resultant. J. Complex. 11 (3) (1995)
Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther
On real Turing machines that toss coins. STOC (1995)
Peter Bürgisser, Marek Karpinski, Thomas Lickteig
On Randomized Semi-algebraic Test Complexity. J. Complex. 9 (2) (1993)
Peter Bürgisser, Thomas Lickteig, Michael Shub
Test complexity of generic polynomials. J. Complex. 8 (3) (1992)
Peter Bürgisser, Marek Karpinski, Thomas Lickteig
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Comput. Complex. 1 (1991)
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) (1989)
Thomas Lehmkuhl, Thomas Lickteig
On the Order of Approximation in Approximative Triadic Decompositions of Tensors. Theor. Comput. Sci. 66 (1) (1989)
Thomas Lickteig, Hugo Volger
Some Results on the Complexity of Powers. Computation Theory and Logic (1987)
Thomas Lickteig
The Computational Complexity of Division in Quadratic Extension Fields. SIAM J. Comput. 16 (2) (1987)
Thomas Lickteig
Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two. Inf. Process. Lett. 22 (6) (1986)
Thomas Lickteig
A Note on Border Rank. Inf. Process. Lett. 18 (3) (1984)