PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Thierauf, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Selectivity.

, , , , , and . ICCI, page 55-59. IEEE Computer Society, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Dipl.-Ing. Thomas Kuestner

Scan time reduction in DWI of the pancreas using simultaneous multislice technique with different acceleration factors: how fast can we go?, , , , , , , and . Proceedings of the International Society for Magnetic Resonance in Medicine (ISMRM), Honolulu, Hawaii, USA, (April 2017)

Dr. -Ing. Thomas Keilig University of Stuttgart

Dr. -Ing. Thomas Wegmann University of Stuttgart

Hon. -Prof. Dr. -Ing. Thomas Weber University of Stuttgart

Univ. -Prof. Dr. -Ing. Thomas Maier University of Stuttgart

 

Other publications of authors with the same name

The quantum query complexity of the determinant., and . Inf. Process. Lett., 109 (6): 325-328 (2009)A note on the search for k elements via quantum walk., and . Inf. Process. Lett., 110 (22): 975-978 (2010)Complements of Multivalued Functions., , , , , and . Chicago J. Theor. Comput. Sci., (1999)A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability., and . Theor. Comput. Sci., (2012)The polynomially bounded perfect matching problem is in NC^2., , and . Electronic Colloquium on Computational Complexity (ECCC), (2006)Bipartite Perfect Matching is in quasi-NC., , and . Electronic Colloquium on Computational Complexity (ECCC), (2015)On Sets Bounded Truth-Table Reducible to P-selective Sets., , and . STACS, volume 775 of Lecture Notes in Computer Science, page 427-438. Springer, (1994)The Polynomially Bounded Perfect Matching Problem Is in NC 2., , and . STACS, volume 4393 of Lecture Notes in Computer Science, page 489-499. Springer, (2007)The Complexity of the Inertia., and . FSTTCS, volume 2556 of Lecture Notes in Computer Science, page 206-217. Springer, (2002)A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability., and . COCOON, volume 6842 of Lecture Notes in Computer Science, page 168-179. Springer, (2011)