PREFACEFelipe Cucker; Thomas Lickteig · 2000

Typical tensorial rankThomas Lickteig · Linear Algebra and its Applications · 1985

Test complexity of generic polynomialsPeter Bürgisser; Thomas Lickteig; Michael Shub · 1992

Cauchy index computationThomas Lickteig; Marie-Françoise Roy · 1996

A note on border rankThomas Lickteig · 1984

On the order of approximation in approximative triadic decompositions of tensorsThomas Lehmkuhl; Thomas Lickteig · 1989

Verification complexity of linear prime idealsPeter Bürgisser; Thomas Lickteig · Journal of Pure and Applied Algebra · 1992

On Randomized Semi-algebraic Test ComplexityPeter Bürgisser; Marek Karpinski; Thomas Lickteig · 1993

On Three-Dimensional PackingLi, Keqin; Cheng, Kam-Hoi · SIAM Journal on Computing · 1990

Priority Search TreesMcCreight, Edward M. · SIAM Journal on Computing · 1985

Scheduling Split IntervalsBar-Yehuda, R.; Halldórsson, M. M.; Naor, J. (S.); Shachnai, H.; Shapira, I. · SIAM Journal on Computing · 2006

Nondeterminism within $P^ * $Buss, Jonathan F.; Goldsmith, Judy · SIAM Journal on Computing · 1993

Optimization of Straight Line ProgramsAho, Alfred V.; Ullman, Jeffrey D. · SIAM Journal on Computing · 1972

Quantum Entanglement and Communication ComplexityBuhrman, Harry; Cleve, Richard; van Dam, Wim · SIAM Journal on Computing · 2001

On Classes of Program SchemataConstable, Robert L.; David, Gries · SIAM Journal on Computing · 1972

Bounded Concurrent Time-StampingDolev, Danny; Shavit, Nir · SIAM Journal on Computing · 1997