Thorsten Theobald

Learn More
When there are many people who don't need to expect something more than the benefits to take, we will suggest you to have willing to reach all benefits. Be sure and surely do to take this algorithms and data structures in vlsi design obdd foundations and applications that gives the best reasons to read. When you really need to get the reason why, this(More)
We provide a characterization of the radii minimal projections of polytopes onto j-dimensional subspaces in Euclidean space E. Applied on simplices this characterization allows to reduce the computation of an outer radius to a computation in the circumscribing case or to the computation of an outer radius of a lower-dimensional simplex. In the second part(More)
Ordered binary decision diagrams are the state-of-the-art representation of switching functions. In order to keep the sizes of the OBDDs tractable, heuristics and dynamic reordering algorithms are applied to optimize the underlying variable order. When-nite state machines are represented by OBDDs the state encoding can be used as an additional optimization(More)
We propose a new algorithm, called linear sifting, for theoptimization of decision diagrams that combines the efficiency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples, and that inmany cases it leads to substantiallymore compact diagrams when compared to simple variablereordering. We show(More)
We solve the following geometric problem, which arises in several threedimensional applications in computational geometry: For which arrangements of two lines and two spheres in R are there infinitely many lines simultaneously transversal to the two lines and tangent to the two spheres? We also treat a generalization of this problem to projective quadrics:(More)
Ordered binaxy décision diagrams are an important data structure for the représentation of Boolean functions. Typically, the underlying variable ordering is used as an optimization parameter. When finite state machines are represented by OBDDs the state encoding can be used as an additional optimization parameter. In this paper, we analyze the influence of(More)
We consider the tropical variety T (I) of a prime ideal I generated by the polynomials f1, . . . , fr and revisit the regular projection technique introduced by Bieri and Groves from a computational point of view. In particular, we show that I has a short tropical basis of cardinality at most r+codim I +1 at the price of increased degrees, and we provide a(More)