Ulrich Lauther - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2010

Space Efficient Algorithms for the Burrows-Wheeler BacktransformationUlrich Lauther, Tamás Lukovszki. algorithmica, 58(2):339-351, 2010. [doi]

2009

09261 Abstracts Collection - Models and Algorithms for Optimization in LogisticsCynthia Barnhart, Uwe Clausen, Ulrich Lauther, Rolf H. Möhring. Dagstuhl 2009: [doi]

09261 Executive Summary - Models and Algorithms for Optimization in LogisticsCynthia Barnhart, Uwe Clausen, Ulrich Lauther, Rolf H. Möhring. Dagstuhl 2009: [doi]

2006

Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-TreeUlrich Lauther. gd 2007: 20-29 [doi]

An Experimental Evaluation of Point-To-Point Shortest Path Calculation on Road Networks with Precalculated Edge-FlagsUlrich Lauther. dimacs 2009: 19-40

2005

Space Efficient Algorithms for the Burrows-Wheeler BacktransformationUlrich Lauther, Tamás Lukovszki. esa 2005: 293-304 [doi]

2001

Generating Schematic Cable Plans Using Springembedder MethodsUlrich Lauther, Andreas Stübinger. gd 2002: 465-466 [doi]

1994

DA Algorithms in Non-EDA Applications: How Universal Are Our Techniques? (Panel)Patrick C. McGeer, Steven Trimberger, Erik Carlson, Dave Hightower, Ulrich Lauther, Alberto L. Sangiovanni-Vincentelli. dac 1994: 503 [doi]

1991

A Flow-Oriented Approach to the Placement of Boolean NetworksStefan Mayrhofer, Massoud Pedram, Ulrich Lauther. vlsi 1992: 101-110

1990

Congestion-Driven Placement Using a New Multi-Partitioning HeuristicStefan Mayrhofer, Ulrich Lauther. iccad 1990: 332-335

A New Global Router Based on a Flow Model and Linear AssignmentG. Meixner, Ulrich Lauther. iccad 1990: 44-47

Global Hardware Synthesis from Behavioral Dataflow DescriptionsJosef Scheichenzuber, Werner Grass, Ulrich Lauther, Sabine März. dac 1990: 456-461 [doi]

1989

Some Experiences with Advanced Design Automation ToolsUlrich Lauther. ifip 1989: 530

1984

Anwendung von Plane-sweep Verfahren bei der Layouterzeugung integrierter SchaltungenUlrich Lauther. gi 1984: 69-78

1983

HEX: An instruction-driven approach to feature extractionMark Hofmann, Ulrich Lauther. dac 1983: 331-336 [doi]

Gridless Channelrouting Revisited - a New Formulation of the ProblemUlrich Lauther, Martin Nett. wg 1984: 177-183

1981

Additional Comments on An Optimal Solution for the Channel-Assignment Problem Ulrich Lauther. TC, 30(6):455, 1981.

An O (N log N) algorithm for Boolean mask operationsUlrich Lauther. dac 1981: 555-562 [doi]

1980

A data structure for gridless routingUlrich Lauther. dac 1980: 603-609 [doi]

1979

A min-cut placement algorithm for general cell assemblies based on a graph representationUlrich Lauther. dac 1979: 1-10 [doi]

1977

The siemens-avesta-system for computer-aided design of MOS-standard cell circuitsKonrad W. Koller, Ulrich Lauther. dac 1977: 153-157 [doi]

Sign in or sign up to see more results.

runs on WebDSL