#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1985

2004

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman
- ISAAC
- 1994

- Shaodi Gao, Michael Kaufmann, Kurt Mehlhorn, Wolfgang Rülling, Christoph Storb, Mark Jerrum
- Workshop on Computational Geometry
- 1988

We give an &Ogr;(n<supscrpt>3</supscrpt>·log n) time and &Ogr;(n<supscrpt>3</supscrpt>) space algorithm for the continuous homotopic one layer routing problem. The main contribution is an extension of the sweep paradigm to a universal cover space of the plane.

- Shaodi Gao, Michael Kaufmann, F. Miller Maley
- SPAA
- 1989

Homotopic compaction is the compaction of a VLSI layout by means of a continuous motion of layout components that preserves routability. We present the most efficient algorithm for one-dimensional homotopic compaction yet discovered: it requires timeO(oN 2 log N) and space O(N 2) on input of size N. These bounds are pessimistic, and practical performance… (More)

- Shaodi Gao, Michael Kaufmann
- 28th Annual Symposium on Foundations of Computer…
- 1987

This paper presents new upper bounds for channel routing of multiterminal nets, which answers the long-standing open question whether or not multiterminal problems really require channels two times wider than 2-terminal problems. We transform any multiterminal problem of density <?Pub Fmt italic>d<?Pub Fmt /italic> into a so-called extended simple channel… (More)

- Lerong Cheng, Xiaoyu Song, Guowu Yang, William N. N. Hung, Zhiwei Tang, Shaodi Gao
- ASP-DAC 2004: Asia and South Pacific Design…
- 2004

Congestion estimation is an important issue for the success of the VLSI layout. Fast congestion estimation provides an efficient means to adjust the placement and routability. A probabilistic model of interconnections enables designers to quickly predict routing congestion. We propose a powerful and fast estimation approach which allows wires to have… (More)

- Shaodi Gao, Susanne E. Hambrusch
- Algorithmica
- 1986

We show that anyn-net 2-terminal channel routing problem of densityd can be wired on a two-layer grid of widthw =d +O(d 2/3) when vertical wire segments are allowed to overlap for a distance of length 1. This is a considerable asymptotic improvement over the best known, and optimal, channel width of 2d-1 for models in which no vertical overlap is allowed… (More)

- Sanjay Khanna, Shaodi Gao, Krishnaiyan Thulasiraman
- Great Lakes Symposium on VLSI
- 1995

In this paper we present a parallel global routing algorithm for general cell layout. The algorithm applies a hierarchical decomposition strategy that recursively divides routing problems into simple, independent subproblems for parallel processing. The solution of each subproblem is based on integer programming and network flow optimization. The algorithm… (More)

- Shaodi Gao
- STACS
- 1985

- Michael Kaufmann, Shaodi Gao, Krishnaiyan Thulasiraman
- Journal of Circuits, Systems, and Computers
- 1996

- Shaodi Gao
- 1991

- ‹
- 1
- ›