Ramsey W. Haddad

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

11 Ramsey W. Haddad, Lukas P. P. P. van Ginneken, Narendra V. Shenoy: Discrete Drive Selection for Continuous Sizing. ICCD 1997: 110-115
10EEOlivier Coudert, Ramsey W. Haddad, Srilatha Manne: New Algorithms for Gate Sizing: A Comparative Study. DAC 1996: 734-739
9EEOlivier Coudert, Ramsey W. Haddad: Integrated resynthesis for low power. ISLPED 1996: 169-174
8EEJames 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
7EEKurt Keutzer, Olivier Coudert, Ramsey W. Haddad: What is the state of the art in commercial EDA tools for low power? ISLPED 1996: 181-187
6EELouis Monier, Ramsey W. Haddad, Jeremy Dion: Recursive layout generation. ARVLSI 1995: 172-184
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)
3 Joan Feigenbaum, Ramsey W. Haddad: On Factorable Extensions and Subgraphs of Prime Graphs. SIAM J. Discrete Math. 2(2): 197-218 (1989)
2EERamsey 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)

Coauthor Index

1James Burr [8]
2Olivier Coudert [7] [9] [10]
3Anton T. Dahbura [5]
4Jeremy Dion [6]
5Joan Feigenbaum [3]
6Laszlo Gal [8]
7Lukas P. P. P. van Ginneken [11]
8Kurt Keutzer [7]
9Srilatha Manne [10]
10Louis Monier [6]
11Jeffrey F. Naughton [2] [4]
12Jan M. Rabaey [8]
13Alejandro A. Schäffer [1]
14Anup B. Sharma [5]
15Narendra V. Shenoy [11]
16Bruce Wooley [8]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)