Search the dblp DataBase

Publications of Author

1. Patrick C. McGeer, Steven Trimberger, Erik Carlson, Dave Hightower, Ulrich Lauther, Alberto L. Sangiovanni-Vincentelli
   DA Algorithms in Non-EDA Applications: How Universal Are Our Techniques? (Panel). [Citation Graph (0, 0)][DBLP]
   DAC, 1994, pp:503- [Conf]
   
2. Josef Scheichenzuber, Werner Grass, Ulrich Lauther, Sabine März
   Global Hardware Synthesis from Behavioral Dataflow Descriptions. [Citation Graph (0, 0)][DBLP]
   DAC, 1990, pp:456-461 [Conf]
   
3. Ulrich Lauther, Tamás Lukovszki
   Space Efficient Algorithms for the Burrows-Wheeler Backtransformation. [Citation Graph (0, 0)][DBLP]
   ESA, 2005, pp:293-304 [Conf]
   
4. Ulrich Lauther, Andreas Stübinger
   Generating Schematic Cable Plans Using Springembedder Methods. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2001, pp:465-466 [Conf]
   
5. Ulrich Lauther
   Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree. [Citation Graph (0, 0)][DBLP]
   Graph Drawing, 2006, pp:20-29 [Conf]
   
6. Ulrich Lauther
   Anwendung von Plane-sweep Verfahren bei der Layouterzeugung integrierter Schaltungen. [Citation Graph (0, 0)][DBLP]
   GI Jahrestagung (Fachgespräche), 1984, pp:69-78 [Conf]
   
7. G. Meixner, Ulrich Lauther
   A New Global Router Based on a Flow Model and Linear Assignment. [Citation Graph (0, 0)][DBLP]
   ICCAD, 1990, pp:44-47 [Conf]
   
8. Stefan Mayrhofer, Ulrich Lauther
   Congestion-Driven Placement Using a New Multi-Partitioning Heuristic. [Citation Graph (0, 0)][DBLP]
   ICCAD, 1990, pp:332-335 [Conf]
   
9. Ulrich Lauther
   Some Experiences with Advanced Design Automation Tools. [Citation Graph (0, 0)][DBLP]
   IFIP Congress, 1989, pp:530- [Conf]
   
10. Stefan Mayrhofer, Massoud Pedram, Ulrich Lauther
    A Flow-Oriented Approach to the Placement of Boolean Networks. [Citation Graph (0, 0)][DBLP]
    VLSI, 1991, pp:101-110 [Conf]
    
11. Ulrich Lauther
    Additional Comments on `` An Optimal Solution for the Channel-Assignment Problem''. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1981, v:30, n:6, pp:455- [Journal]