Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.

Thomas Lickteig

2000 – 2009

see FAQ

What is the meaning of the colors in the publication list?

2006
[e1]
- view
  - electronic edition @ dagstuhl.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/dagstuhl/2004P4061
- ask others
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo (Eds.): Real Computation and Complexity, 1.-6. February 2004. Dagstuhl Seminar Proceedings 04061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
2005
[j15]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jc/Lickteig05
- ask others
Thomas Lickteig: Festschrift in honor of Arnold Scho"nhage. J. Complexity 21(4): 372-376 (2005)
2004
[c4]
- view
  - electronic edition @ dagstuhl.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/dagstuhl/LickteigMP04
- ask others
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004
[c3]
- view
  - electronic edition @ dagstuhl.de
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/dagstuhl/LickteigMP04a
- ask others
Thomas Lickteig, Klaus Meer, Luis Miguel Pardo: 04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004
2001
[j14]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jsc/LickteigR01
- ask others
Thomas Lickteig, Marie-Françoise Roy: Sylvester-Habicht Sequences and Fast Cauchy Index Computation. J. Symb. Comput. 31(3): 315-341 (2001)
2000
[j13]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jc/CuckerL00
- ask others
Felipe Cucker, Thomas Lickteig: Preface. J. Complexity 16(1): 1 (2000)

1990 – 1999

see FAQ

What is the meaning of the colors in the publication list?

1997
[j12]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jc/LickteigM97
- ask others
Thomas Lickteig, Klaus Meer: Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complexity 13(1): 83-107 (1997)
1996
[j11]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jc/LickteigR96
- ask others
Thomas Lickteig, Marie-Françoise Roy: Semi-algebraic Complexity of Quotients and Sign Determination of Remainders. J. Complexity 12(4): 545-571 (1996)
1995
[j10]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/cc/LickteigW95
- ask others
Thomas Lickteig, Kai Werther: How can a Complex Square Root be Computed in an Optimal Way. Computational Complexity 5(3/4): 222-236 (1995)
[j9]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jc/LickteigM95
- ask others
Thomas Lickteig, Klaus Meer: A Note on Testing the Resultant. J. Complexity 11(3): 344-351 (1995)
[c2]
- view
  - electronic edition @ acm.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/stoc/CuckerKKLW95
- ask others
Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther: On real Turing machines that toss coins. STOC 1995: 335-342
1993
[j8]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jc/BurgisserKL93
- ask others
Peter Bürgisser, Marek Karpinski, Thomas Lickteig: On Randomized Semi-algebraic Test Complexity. J. Complexity 9(2): 231-251 (1993)
1992
[j7]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/jc/BurgisserLS92
- ask others
Peter Bürgisser, Thomas Lickteig, Michael Shub: Test complexity of generic polynomials. J. Complexity 8(3): 203-215 (1992)
1991
[j6]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/cc/BurgisserKL91
- ask others
Peter Bürgisser, Marek Karpinski, Thomas Lickteig: Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Computational Complexity 1: 131-155 (1991)

1980 – 1989

see FAQ

What is the meaning of the colors in the publication list?

1989
[j5]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamcomp/Lickteig89
- ask others
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)
[j4]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/tcs/LehmkuhlL89
- ask others
Thomas Lehmkuhl, Thomas Lickteig: On the Order of Approximation in Approximative Triadic Decompositions of Tensors. Theor. Comput. Sci. 66(1): 1-14 (1989)
1987
[j3]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/siamcomp/Lickteig87
- ask others
Thomas Lickteig: The Computational Complexity of Division in Quadratic Extension Fields. SIAM J. Comput. 16(2): 278-311 (1987)
[c1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - conf/birthday/LickteigV87
- ask others
Thomas Lickteig, Hugo Volger: Some Results on the Complexity of Powers. Computation Theory and Logic 1987: 249-255
1986
[j2]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/Lickteig86
- ask others
Thomas Lickteig: Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two. Inf. Process. Lett. 22(6): 277-279 (1986)
1984
[j1]
- view
  - electronic edition via DOI
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/ipl/Lickteig84
- ask others
Thomas Lickteig: A Note on Border Rank. Inf. Process. Lett. 18(3): 173-178 (1984)