 | 1997 |
|---|
| 11 |       | Ramsey W. Haddad,
Lukas P. P. P. van Ginneken,
Narendra V. Shenoy:
Discrete Drive Selection for Continuous Sizing.
ICCD 1997: 110-115 |
| 1996 |
|---|
| 10 |  | Olivier Coudert,
Ramsey W. Haddad,
Srilatha Manne:
New Algorithms for Gate Sizing: A Comparative Study.
DAC 1996: 734-739 |
| 9 | | Olivier Coudert,
Ramsey W. Haddad:
Integrated resynthesis for low power.
ISLPED 1996: 169-174 |
| 8 | | James Burr,
Laszlo Gal,
Ramsey W. Haddad,
Jan M. Rabaey,
Bruce Wooley:
Which has greater potential power impact: high-level design and algorithms or innovative low power technology? (panel).
ISLPED 1996: 175 |
| 7 | | Kurt Keutzer,
Olivier Coudert,
Ramsey W. Haddad:
What is the state of the art in commercial EDA tools for low power?
ISLPED 1996: 181-187 |
| 1995 |
|---|
| 6 | | Louis Monier,
Ramsey W. Haddad,
Jeremy Dion:
Recursive layout generation.
ARVLSI 1995: 172-184 |
| 1991 |
|---|
| 5 | | Ramsey W. Haddad,
Anton T. Dahbura,
Anup B. Sharma:
Increased Thoughput for the Testing and Repair of RAM's with Redundancy.
IEEE Trans. Computers 40(2): 154-166 (1991) |
| 4 | | Ramsey W. Haddad,
Jeffrey F. Naughton:
A Counting Algorithm for a Cyclic Binary Query.
J. Comput. Syst. Sci. 43(1): 145-169 (1991) |
| 1989 |
|---|
| 3 | | Joan Feigenbaum,
Ramsey W. Haddad:
On Factorable Extensions and Subgraphs of Prime Graphs.
SIAM J. Discrete Math. 2(2): 197-218 (1989) |
| 1988 |
|---|
| 2 | | Ramsey W. Haddad,
Jeffrey F. Naughton:
Counting Methods for Cyclic Relations.
PODS 1988: 333-340 |
| 1 | | Ramsey W. Haddad,
Alejandro A. Schäffer:
Recognizing Bellman-Ford-Orderable Graphs.
SIAM J. Discrete Math. 1(4): 447-471 (1988) |
