The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Lickteig: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Lickteig, Hugo Volger
    Some Results on the Complexity of Powers. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:249-255 [Conf]
  2. Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
    04061 Summary - Real Computation and Complexity. [Citation Graph (0, 0)][DBLP]
    Real Computation and Complexity, 2004, pp:- [Conf]
  3. Thomas Lickteig, Klaus Meer, Luis Miguel Pardo
    04061 Abstracts Collection - Real Computation and Complexity. [Citation Graph (0, 0)][DBLP]
    Real Computation and Complexity, 2004, pp:- [Conf]
  4. Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther
    On real Turing machines that toss coins. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:335-342 [Conf]
  5. Peter Bürgisser, Marek Karpinski, Thomas Lickteig
    Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1991, v:1, n:, pp:131-155 [Journal]
  6. Thomas Lickteig, Kai Werther
    How can a Complex Square Root be Computed in an Optimal Way. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:3/4, pp:222-236 [Journal]
  7. Thomas Lickteig
    A Note on Border Rank. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:18, n:3, pp:173-178 [Journal]
  8. Thomas Lickteig
    Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:6, pp:277-279 [Journal]
  9. Peter Bürgisser, Marek Karpinski, Thomas Lickteig
    On Randomized Semi-algebraic Test Complexity. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1993, v:9, n:2, pp:231-251 [Journal]
  10. Peter Bürgisser, Thomas Lickteig, Michael Shub
    Test complexity of generic polynomials. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1992, v:8, n:3, pp:203-215 [Journal]
  11. Felipe Cucker, Thomas Lickteig
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:1- [Journal]
  12. Thomas Lickteig
    Festschrift in honor of Arnold Scho"nhage. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:372-376 [Journal]
  13. Thomas Lickteig, Klaus Meer
    A Note on Testing the Resultant. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1995, v:11, n:3, pp:344-351 [Journal]
  14. Thomas Lickteig, Klaus Meer
    Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:1, pp:83-107 [Journal]
  15. Thomas Lickteig, Marie-Françoise Roy
    Semi-algebraic Complexity of Quotients and Sign Determination of Remainders. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1996, v:12, n:4, pp:545-571 [Journal]
  16. Thomas Lickteig, Marie-Françoise Roy
    Sylvester-Habicht Sequences and Fast Cauchy Index Computation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2001, v:31, n:3, pp:315-341 [Journal]
  17. Thomas Lickteig
    The Computational Complexity of Division in Quadratic Extension Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:2, pp:278-311 [Journal]
  18. Thomas Lickteig
    A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:209-215 [Journal]
  19. Thomas Lehmkuhl, Thomas Lickteig
    On the Order of Approximation in Approximative Triadic Decompositions of Tensors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:1, pp:1-14 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002