Thomas Lickteig

20 papers A* 1Journal 15Unranked 3
YearRankTypeTitle / Venue / Authors
2006 — ed.
Real Computation and Complexity, 1.-6. February 2004
Real Computation and Complexity
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
2005 J jnl
Festschrift in honor of Arnold Scho"nhage.
J. Complex.
Thomas Lickteig
2004 — conf
04061 Abstracts Collection - Real Computation and Complexity.
Real Computation and Complexity
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
2004 — conf
04061 Summary - Real Computation and Complexity.
Real Computation and Complexity
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
2001 J jnl
Sylvester-Habicht Sequences and Fast Cauchy Index Computation.
J. Symb. Comput.
Thomas Lickteig, Marie-Françoise Roy
2000 J jnl
Preface.
J. Complex.
Felipe Cucker, Thomas Lickteig
1997 J jnl
Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks.
J. Complex.
Thomas Lickteig, Klaus Meer
1996 J jnl
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders.
J. Complex.
Thomas Lickteig, Marie-Françoise Roy
1995 J jnl
A Note on Testing the Resultant.
J. Complex.
Thomas Lickteig, Klaus Meer
1995 J jnl
How can a Complex Square Root be Computed in an Optimal Way.
Comput. Complex.
Thomas Lickteig, Kai Werther
1995 A* conf
On real Turing machines that toss coins.
STOC
Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther
1993 J jnl
On Randomized Semi-algebraic Test Complexity.
J. Complex.
Peter Bürgisser, Marek Karpinski, Thomas Lickteig
1992 J jnl
Test complexity of generic polynomials.
J. Complex.
Peter Bürgisser, Thomas Lickteig, Michael Shub
1991 J jnl
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
Comput. Complex.
Peter Bürgisser, Marek Karpinski, Thomas Lickteig
1989 J jnl
A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras.
SIAM J. Comput.
Thomas Lickteig
1989 J jnl
On the Order of Approximation in Approximative Triadic Decompositions of Tensors.
Theor. Comput. Sci.
Thomas Lehmkuhl, Thomas Lickteig
1987 — conf
Some Results on the Complexity of Powers.
Computation Theory and Logic
Thomas Lickteig, Hugo Volger
1987 J jnl
The Computational Complexity of Division in Quadratic Extension Fields.
SIAM J. Comput.
Thomas Lickteig
1986 J jnl
Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two.
Inf. Process. Lett.
Thomas Lickteig
1984 J jnl
A Note on Border Rank.
Inf. Process. Lett.
Thomas Lickteig