#### Filter Results:

#### Publication Year

2013

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We consider the problem of constructing fast and small parallel prefix adders for non-uniform input arrival times. In modern computer chips, adders with up to hundreds of inputs occur frequently, and they are often embedded into more complex circuits, e.g. multipliers, leading to instance-specific non-uniform input arrival times. Most previous results are… (More)

The Euclidean TSP with neighborhoods (TSPN) is the following problem: Given a set R of k regions (subsets of R 2), find a shortest tour that visits at least one point from each region. We study the special cases of disjoint, connected, α-fat regions (i.e., every region P contains a disk of diameter diam(P) α) and disjoint unit disks. For the latter,… (More)

We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes the carry bits for two n-bit numbers (where n is a power of two) with a depth of 2 log 2 n logic gates, size 4n log 2 n, and all fan-outs bounded by two. Fan-outs of more than two… (More)

We consider the problem of constructing fast and small binary adder circuits. Among widely-used adders, the Kogge-Stone adder is often considered the fastest, because it computes the carry bits for two n-bit numbers (where n is a power of two) with a depth of 2 log 2 n logic gates, size 4n log 2 n, and all fan-outs bounded by two. Fan-outs of more than two… (More)

We study the minimum rectilinear Steiner tree problem in the presence of obstacles. Traversing obstacles is not strictly forbidden, but the total length of each connected component in the intersection of the tree with the interior of the blocked area is bounded by a constant.
This problem is motivated by the layout of repeater tree topologies, a central… (More)

- ‹
- 1
- ›