default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Lickteig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
[j15]Thomas Lickteig:
Festschrift in honor of Arnold Scho"nhage. J. Complex. 21(4): 372-376 (2005)- 2001
- [j14]Thomas Lickteig, Marie-Françoise Roy:
Sylvester-Habicht Sequences and Fast Cauchy Index Computation. J. Symb. Comput. 31(3): 315-341 (2001) - 2000
- [j13]Felipe Cucker, Thomas Lickteig:
Preface. J. Complex. 16(1): 1 (2000) - 1997
- [j12]Thomas Lickteig, Klaus Meer:
Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks. J. Complex. 13(1): 83-107 (1997) - 1996
- [j11]Thomas Lickteig, Marie-Françoise Roy:
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders. J. Complex. 12(4): 545-571 (1996) - 1995
- [j10]Thomas Lickteig, Kai Werther:
How can a Complex Square Root be Computed in an Optimal Way. Comput. Complex. 5(3/4): 222-236 (1995) - [j9]Thomas Lickteig, Klaus Meer:
A Note on Testing the Resultant. J. Complex. 11(3): 344-351 (1995) - 1993
- [j8]Peter Bürgisser, Marek Karpinski, Thomas Lickteig:
On Randomized Semi-algebraic Test Complexity. J. Complex. 9(2): 231-251 (1993) - 1992
- [j7]Peter Bürgisser, Thomas Lickteig, Michael Shub:
Test complexity of generic polynomials. J. Complex. 8(3): 203-215 (1992) - 1991
- [j6]Peter Bürgisser, Marek Karpinski, Thomas Lickteig:
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication. Comput. Complex. 1: 131-155 (1991) - 1989
- [j5]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]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]Thomas Lickteig:
The Computational Complexity of Division in Quadratic Extension Fields. SIAM J. Comput. 16(2): 278-311 (1987) - 1986
- [j2]Thomas Lickteig:
Gaussian Elimination is Optimal for Solving Linear Equations in Dimension Two. Inf. Process. Lett. 22(6): 277-279 (1986) - 1984
- [j1]Thomas Lickteig:
A Note on Border Rank. Inf. Process. Lett. 18(3): 173-178 (1984)
Conference and Workshop Papers
- 1995
- [c2]Felipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther:
On real Turing machines that toss coins. STOC 1995: 335-342 - 1987
- [c1]Thomas Lickteig, Hugo Volger:
Some Results on the Complexity of Powers. Computation Theory and Logic 1987: 249-255
Editorship
- 2006
- [e1]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
Real Computation and Complexity, 1.-6. February 2004. Dagstuhl Seminar Proceedings 04061, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents]
Informal and Other Publications
- 2004
- [i2]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
04061 Summary - Real Computation and Complexity. Real Computation and Complexity 2004 - [i1]Thomas Lickteig, Klaus Meer, Luis Miguel Pardo:
04061 Abstracts Collection - Real Computation and Complexity. Real Computation and Complexity 2004
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
