( en | de | ru )

 

Disambiguation of "Lauther, Ulrich"

Author of the publication

copydeleteadd this publication to your clipboard
A min-cut placement algorithm for general cell assemblies based on a graph representation.

. DAC, page 1-10. ACM, (1979)

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.

Ulrich Lauther

Kurt Lauther

Nadine Lauther

Ulrich Pötter

Statistical models of incomplete data and their use in the social sciences. Uni Bochum, habilitation, (2009)

Ulrich Mayer

Analysis of the molecular mechanisms underlying the activity of the Ets-1-USF-1 transcription factor complex on the HIV-1 LTR. Uni Heidelberg, (2004)
 

Other publications of authors with the same name

DA Algorithms in Non-EDA Applications: How Universal Are Our Techniques? (Panel)., , , , , and . DAC, page 503. ACM Press, (1994)An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-Flags.. The Shortest Path Problem, volume 74 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 19-39. DIMACS/AMS, (2006)A data structure for gridless routing.. DAC, page 603-609. ACM/IEEE, (1980)Some Experiences with Advanced Design Automation Tools.. IFIP Congress, page 530. North-Holland/IFIP, (1989)HEX: An instruction-driven approach to feature extraction., and . DAC, page 331-336. ACM/IEEE, (1983)09261 Abstracts Collection - Models and Algorithms for Optimization in Logistics., , , and . Models and Algorithms for Optimization in Logistics, volume 09261 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree.. GD, volume 4372 of Lecture Notes in Computer Science, page 20-29. Springer, (2006)A Flow-Oriented Approach to the Placement of Boolean Networks., , and . VLSI, volume A-1 of IFIP Transactions, page 101-110. North-Holland, (1991)Additional Comments on " An Optimal Solution for the Channel-Assignment Problem".. IEEE Trans. Computers, 30 (6): 455 (1981)Gridless Channelrouting Revisited - a New Formulation of the Problem., and . WG, page 177-183. Universitätsverlag Rudolf Trauner, Linz, (1983)