#### Filter Results:

#### Publication Year

1992

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Typically, physical design engineers fall in the category of CAD engineers. et al., 2011 and "Handbook of Algorithms for Physical Design Automation" by Alpert. stages of partitioning and placement and optimize the physical design process S Sapatnekar, " Handbook of Algorithms for physical design automation " ,CRC.

—A floorplan of a bounding box is its dissection into rectangles (rooms) by horizontal and vertical segments. This paper proposes a string data structure called the Quarter-state sequence (or Q sequence) to represent the floorplan. The Q sequence is a con-catenation of the states of rooms along the Abe order and is related to the VH graph, which is the… (More)

- Yan Feng, Dinesh P. Mehta
- 19th International Conference on VLSI Design held…
- 2006

The large size of modern FPGAs has caused researchers to consider deploying hierarchical techniques in their design. In this paper, we consider the floorplanning of FPGAs. We present a two-step approach for the floorplanning of modern FPGAs that we believe is cleaner and more versatile than recent floorplanners. The steps, based on resource-aware fixed… (More)

- Dinesh P. Mehta, Vijay Raghavan
- Theor. Comput. Sci.
- 2000

Decision trees are popular representations of Bool-ean functions. We show that, given an alternative representation of a Boolean function , say as a read-once branching program, one can find a decision tree Ì which approximates to any desired amount of accuracy. Moreover, the size of the decision tree is at most that of the smallest decision tree which can… (More)

- Dinesh P. Mehta, Mario A. López, Lan Lin
- ICC
- 2003

— This paper discusses the computation of optimal coverage paths in an ad-hoc network consisting of n sensors. Improved algorithms, with a preprocessing time of O(n log n), to compute a maximum breach/support path P in optimal O(|P |) time or the maximum breach/support value in O(1) time are presented. Algorithms for computing a shortest path that has… (More)

- Brad Williams, Dinesh P. Mehta, Tracy Camp, William Navidi
- IEEE Transactions on Mobile Computing
- 2004

Network wide broadcast is a fundamental operation in mobile ad hoc networks (MANETs). Several broadcast protocols have been proposed in the literature that improves on simple flooding by reducing the probability that a receiving node retransmits a packet. We propose analytical models to estimate these probabilities for three broadcast protocols. Our… (More)

- Mario A. López, Dinesh P. Mehta
- ACM Trans. Design Autom. Electr. Syst.
- 1996

We present two practical algorithms for partitioning circuit components represented by rectilinear polygons so that they can be stored using the L-shaped corner stitching data structure; that is, our algorithms decompose a simple polygon into a set of nonoverlapping L-shapes and rectangles by using horizontal cuts only. The more general of our algorithms… (More)

- John D. Crabtree, Dinesh P. Mehta
- ACM Journal of Experimental Algorithmics
- 2008

Automated reaction mapping is a fundamental first step in the analysis of chemical reactions and opens the door to the development of sophisticated chemical kinetic tools. This article formulates the reaction mapping problem as an optimization problem. The problem is shown to be NP-Complete for general graphs. Five algorithms based on canonical graph naming… (More)

- Yan Feng, Dinesh P. Mehta, Hannah Honghua Yang
- IEEE Transactions on Computer-Aided Design of…
- 2004

This paper presents algorithms for a constrained version of the "modern" floorplanning problem proposed by Kahng in "Classical Floorplanning Harmful?" (Kahng, 2000). Specifically, the constrained modern floorplanning problem (CMFP) is suitable when die-size is fixed, modules are permitted to have rectilinear shapes and, in addition, the approximate relative… (More)

- Dinesh P. Mehta, Sartaj Sahni
- IEEE Trans. Computers
- 1994

Strings are used to represent a variety of objects such as DNA sequences, text, and numerical sequences. A model for a system for the visualization and analysis of strings was proposed in 1]. In this paper, we present algorithms which implement some of the queries supported by this model.