Thorsten Theobald

According to our database1, Thorsten Theobald authored at least 41 papers between 1995 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Imaginary projections of polynomials.
J. Symb. Comput., 2019

Irreducible Infeasible Subsystems of Semidefinite Systems.
J. Optim. Theory Appl., 2019

Block-sparse Recovery of Semidefinite Systems and Generalized Null Space Conditions.
CoRR, 2019

Mixed Ehrhart polynomials.
Electr. J. Comb., 2017

Sum of Squares Certificates for Containment of H-Polytopes in V-Polytopes.
SIAM J. Discret. Math., 2016

Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482).
Dagstuhl Reports, 2016

Einführung in die computerorientierte Mathematik mit Sage.
Springer Studium Mathematik - Bachelor, Springer, ISBN: 978-3-658-10452-8, 2016

A Semidefinite Hierarchy for Containment of Spectrahedra.
SIAM J. Optim., 2015

Approximating amoebas and coamoebas by sums of squares.
Math. Comput., 2015

Containment Problems for Polytopes and Spectrahedra.
SIAM J. Optim., 2013

Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization.
Math. Oper. Res., 2013

Polyhedral and Algebraic Methods in Computational Geometry.
Universitext, Springer, ISBN: 978-1-4471-4816-6, 2013

Determining a Rotation of a Tetrahedron from a Projection.
Discret. Comput. Geom., 2012

Combinatorics and Genus of Tropical Intersections and Ehrhart Theory.
SIAM J. Discret. Math., 2010

Mixed volume techniques for embeddings of Laman graphs.
Comput. Geom., 2010

Algorithmische Geometrie - Polyedrische und algebraische Methoden.
Vieweg Studium, Vieweg+Teubner, ISBN: 978-3-8348-0281-1, 2008

Enumerating the Nash equilibria of rank 1-games
CoRR, 2007

Games of fixed rank: a hierarchy of bimatrix games.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On the frontiers of polynomial computations in tropical geometry.
J. Symb. Comput., 2006

Exact analysis of optimal configurations in radii computations.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Algebraic Methods for Computing Smallest Enclosing and Circumscribing Cylinders of Simplices.
Appl. Algebra Eng. Commun. Comput., 2004

Common Transversals and Tangents to Two Lines and Two Quadrics in P.
Discret. Comput. Geom., 2003

An Enumerative Geometry Framework for Algorithmic Line Problems in $\mathbb R^3$.
SIAM J. Comput., 2002

Computing Amoebas.
Experimental Mathematics, 2002

Common transversals and tangents to two lines and two quadrics in P3
CoRR, 2002

Homotopy techniques for real-time visualization of geometric tangent problems.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Common Tangents to Four Unit Balls in R3.
Discret. Comput. Geom., 2001

Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry.
Proceedings of the Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, 2001

Linear sifting of decision diagrams and its application insynthesis.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2000

On the Influence of the State Encoding on OBDD-Representations of Finite State Machines.
RAIRO Theor. Informatics Appl., 1999

Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1998

Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits - a Survey
Electronic Colloquium on Computational Complexity (ECCC), 1998

Algorithmen und Datenstrukturen im VLSI-Design: OBDD - Grundlagen und Anwendungen
Springer, ISBN: 3-540-63869-5, 1998

Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications
Springer, ISBN: 3-540-64486-5, 1998

Function Decomposition and Synthesis Using Linear Sifting
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1997

Geordnete binäre Entscheidungsgraphen und ihre Bedeutung im rechnergestützten Entwurf hochintegrierter Schaltkreise.
Informatik Spektrum, 1997

Transformation techniques for decision diagrams in computer-aided design.
PhD thesis, 1997

Linear Sifting of Decision Diagrams
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

State Encodings and OBDD-Sizes
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

How to Break Shamir's Asymmetric Basis.
Proceedings of the Advances in Cryptology, 1995