default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThorsten Theobald
Person information
- affiliation: Goethe-Universität, Frankfurt am Main, Germany
- affiliation (former): Technical University of Berlin, Department of Mathematics, Germany
- affiliation (former): University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j28]Philippe Moustrou, Cordian Riener, Thorsten Theobald
, Hugues Verdure:
Symmetric SAGE and SONC forms, exactness and quantitative gaps. J. Symb. Comput. 127: 102374 (2025)- 2024
- [j27]Constantin Ickstadt, Thorsten Theobald, Elias P. Tsigaridas:
Semidefinite games. Int. J. Game Theory 53(3): 827-857 (2024) - 2023
- [j26]Riley Murray, Helen Naumann, Thorsten Theobald:
Sublinear circuits and the constrained signomial nonnegativity problem. Math. Program. 198(1): 471-505 (2023) - [i17]Constantin Ickstadt, Thorsten Theobald, Elias P. Tsigaridas, Antonios Varvitsiotis:
Semidefinite network games: multiplayer minimax and semidefinite complementarity problems. CoRR abs/2310.20333 (2023) - 2022
- [j25]Alessandra Bernardi, Carlos D'Andrea, Thorsten Theobald:
Foreword: Special issue of JSC on the occasion of MEGA 2019. J. Symb. Comput. 109: 199-201 (2022) - [j24]Philippe Moustrou, Helen Naumann, Cordian Riener, Thorsten Theobald, Hugues Verdure:
Symmetry Reduction in AM/GM-Based Optimization. SIAM J. Optim. 32(2): 765-785 (2022) - [i16]Constantin Ickstadt, Thorsten Theobald, Elias P. Tsigaridas:
Semidefinite games. CoRR abs/2202.12035 (2022) - 2021
- [j23]Lukas Katthän, Helen Naumann, Thorsten Theobald:
A unified framework of SAGE and SONC polynomials and its duality theory. Math. Comput. 90(329): 1297-1322 (2021)
2010 – 2019
- 2019
- [j22]Kai Kellner, Marc E. Pfetsch, Thorsten Theobald:
Irreducible Infeasible Subsystems of Semidefinite Systems. J. Optim. Theory Appl. 181(3): 727-742 (2019) - [j21]Thorsten Jörgens, Thorsten Theobald, Timo de Wolff:
Imaginary projections of polynomials. J. Symb. Comput. 91: 181-199 (2019) - [i15]Janin Heuer, Frederic Matter, Marc E. Pfetsch, Thorsten Theobald:
Block-sparse Recovery of Semidefinite Systems and Generalized Null Space Conditions. CoRR abs/1907.09442 (2019) - 2017
- [j20]Christian Haase, Martina Juhnke-Kubitzke, Raman Sanyal, Thorsten Theobald:
Mixed Ehrhart polynomials. Electron. J. Comb. 24(1): 1 (2017) - 2016
- [b6]Thorsten Theobald, Sadik Iliman:
Einführung in die computerorientierte Mathematik mit Sage. Springer Studium Mathematik - Bachelor, Springer 2016, ISBN 978-3-658-10452-8, pp. I-IX, 1-195 - [j19]Kai Kellner, Thorsten Theobald:
Sum of Squares Certificates for Containment of H-Polytopes in V-Polytopes. SIAM J. Discret. Math. 30(2): 763-776 (2016) - [i14]Stéphane Gaubert, Dima Grigoriev, Michael Joswig, Thorsten Theobald:
Algorithms and Effectivity in Tropical Mathematics and Beyond (Dagstuhl Seminar 16482). Dagstuhl Reports 6(11): 168-184 (2016) - 2015
- [j18]Thorsten Theobald, Timo de Wolff:
Approximating amoebas and coamoebas by sums of squares. Math. Comput. 84(291): 455-473 (2015) - [j17]Kai Kellner, Thorsten Theobald, Christian Trabandt:
A Semidefinite Hierarchy for Containment of Spectrahedra. SIAM J. Optim. 25(2): 1013-1033 (2015) - 2013
- [b5]Michael Joswig, Thorsten Theobald:
Polyhedral and Algebraic Methods in Computational Geometry. Universitext, Springer 2013, ISBN 978-1-4471-4816-6, pp. I-X, 1-250 - [j16]Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre:
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization. Math. Oper. Res. 38(1): 122-141 (2013) - [j15]Kai Kellner, Thorsten Theobald, Christian Trabandt:
Containment Problems for Polytopes and Spectrahedra. SIAM J. Optim. 23(2): 1000-1020 (2013) - 2012
- [j14]Richard J. Gardner, Paolo Gronchi, Thorsten Theobald:
Determining a Rotation of a Tetrahedron from a Projection. Discret. Comput. Geom. 48(3): 749-765 (2012) - 2011
- [i13]Cordian Riener, Thorsten Theobald, Lina Jansson Andrén, Jean B. Lasserre:
Exploiting symmetries in SDP-relaxations for polynomial optimization. CoRR abs/1103.0486 (2011) - [i12]Richard J. Gardner, Paolo Gronchi, Thorsten Theobald:
Determining a rotation of a tetrahedron from a projection. CoRR abs/1111.7100 (2011) - 2010
- [j13]Reinhard Steffens, Thorsten Theobald:
Mixed volume techniques for embeddings of Laman graphs. Comput. Geom. 43(2): 84-93 (2010) - [j12]Reinhard Steffens, Thorsten Theobald:
Combinatorics and Genus of Tropical Intersections and Ehrhart Theory. SIAM J. Discret. Math. 24(1): 17-32 (2010)
2000 – 2009
- 2008
- [b4]Michael Joswig, Thorsten Theobald:
Algorithmische Geometrie - Polyedrische und algebraische Methoden. Vieweg Studium, Vieweg+Teubner 2008, ISBN 978-3-8348-0281-1, pp. I-X, 1-265 - 2007
- [c9]Ravi Kannan, Thorsten Theobald:
Games of fixed rank: a hierarchy of bimatrix games. SODA 2007: 1124-1132 - [i11]Thorsten Theobald:
Enumerating the Nash equilibria of rank 1-games. CoRR abs/0709.1263 (2007) - 2006
- [j11]Thorsten Theobald:
On the frontiers of polynomial computations in tropical geometry. J. Symb. Comput. 41(12): 1360-1375 (2006) - 2005
- [i10]René Brandenberg, Thorsten Theobald:
Exact analysis of optimal configurations in radii computations. EuroCG 2005: 135-138 - [i9]Ravi Kannan, Thorsten Theobald:
Games of fixed rank: A hierarchy of bimatrix games. CoRR abs/cs/0511021 (2005) - 2004
- [j10]René Brandenberg, Thorsten Theobald:
Algebraic Methods for Computing Smallest Enclosing and Circumscribing Cylinders of Simplices. Appl. Algebra Eng. Commun. Comput. 14(6): 439-460 (2004) - 2003
- [j9]Gábor Megyesi, Frank Sottile, Thorsten Theobald:
Common Transversals and Tangents to Two Lines and Two Quadrics in P. Discret. Comput. Geom. 30(4): 543-571 (2003) - 2002
- [j8]Thorsten Theobald:
Computing Amoebas. Exp. Math. 11(4): 513-526 (2002) - [j7]Thorsten Theobald:
An Enumerative Geometry Framework for Algorithmic Line Problems in $\mathbb R^3$. SIAM J. Comput. 31(4): 1212-1228 (2002) - [c8]Daniel Kotzor, Thorsten Theobald:
Homotopy techniques for real-time visualization of geometric tangent problems. SCG 2002: 275-276 - [i8]Gábor Megyesi, Frank Sottile, Thorsten Theobald:
Common transversals and tangents to two lines and two quadrics in P3. CoRR math.AG/0206044 (2002) - [i7]René Brandenberg, Thorsten Theobald:
Algebraic methods for computing smallest enclosing and circumscribing cylinders of simplices. CoRR math.OC/0211344 (2002) - 2001
- [j6]I. G. MacDonald, János Pach, Thorsten Theobald:
Common Tangents to Four Unit Balls in R3. Discret. Comput. Geom. 26(1): 1-17 (2001) - [j5]Christoph Meinel, Thorsten Theobald:
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines. Formal Methods Syst. Des. 18(3): 285-301 (2001) - [c7]Thorsten Theobald:
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry. Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science 2001: 207-219 - 2000
- [j4]Christoph Meinel, Fabio Somenzi, Thorsten Theobald:
Linear sifting of decision diagrams and its application insynthesis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(5): 521-533 (2000)
1990 – 1999
- 1999
- [j3]Christoph Meinel, Thorsten Theobald:
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines. RAIRO Theor. Informatics Appl. 33(1): 21-32 (1999) - [j2]Christoph Meinel, Thorsten Theobald:
Ordered Binary Decision Diagrams and their Significance in Computer-Aided Design of VLSI Circuits. J. Circuits Syst. Comput. 9(3-4): 181-198 (1999) - 1998
- [b3]Christoph Meinel, Thorsten Theobald:
Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications. Springer 1998, ISBN 3-540-64486-5 - [b2]Christoph Meinel, Thorsten Theobald:
Algorithmen und Datenstrukturen im VLSI-Design: OBDD - Grundlagen und Anwendungen. Springer 1998, ISBN 3-540-63869-5 - [c6]Christoph Meinel, Fabio Somenzi, Thorsten Theobald:
Function Decomposition and Synthesis Using Linear Sifting. ASP-DAC 1998: 81-86 - [i6]Christoph Meinel, Thorsten Theobald:
Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits - a Survey. Electron. Colloquium Comput. Complex. TR98 (1998) - [i5]Christoph Meinel, Thorsten Theobald:
Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits. Universität Trier, Mathematik/Informatik, Forschungsbericht 98-01 (1998) - 1997
- [b1]Thorsten Theobald:
Transformation techniques for decision diagrams in computer-aided design. University of Trier, Germany, Shaker 1997, ISBN 978-3-8265-3705-9, pp. I-III, 1-100 - [j1]Christoph Meinel, Thorsten Theobald:
Geordnete binäre Entscheidungsgraphen und ihre Bedeutung im rechnergestützten Entwurf hochintegrierter Schaltkreise. Inform. Spektrum 20(5): 268-275 (1997) - [c5]Christoph Meinel, Fabio Somenzi, Thorsten Theobald:
Linear Sifting of Decision Diagrams. DAC 1997: 202-207 - [c4]Christoph Meinel, Thorsten Theobald:
Geordnete binäre Entscheidungsgraphen und ihre Bedeutung im rechnergestützten Entwurf hochintegrierter Schaltkreise. GI Jahrestagung 1997: 307-316 - [c3]Christoph Meinel, Thorsten Theobald:
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines. MFCS 1997: 408-417 - [i4]Christoph Meinel, Fabio Somenzi, Thorsten Theobald:
Function Decomposition and Synthesis Using Linear Sifting. Universität Trier, Mathematik/Informatik, Forschungsbericht 97-14 (1997) - 1996
- [c2]Christoph Meinel, Thorsten Theobald:
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines. FMCAD 1996: 404-418 - [i3]Thorsten Theobald, Christoph Meinel:
State Encodings and OBDD-Sizes. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-04 (1996) - [i2]Christoph Meinel, Thorsten Theobald:
Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-23 (1996) - [i1]Christoph Meinel, Fabio Somenzi, Thorsten Theobald:
Linear Sifting of Decision Diagrams. Universität Trier, Mathematik/Informatik, Forschungsbericht 96-42 (1996) - 1995
- [c1]Thorsten Theobald:
How to Break Shamir's Asymmetric Basis. CRYPTO 1995: 136-147
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 2025-01-27 00:45 CET 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:
