Result 1 to 18 of 18 total
Novel efficient techniques for computer simulation of magnetic recording. (English)
IBM J. Res. Dev. 48, No. 2, 173-182 (2004).
1
A novel, scalable algorithm for magnetic recording simulation (English)
ISPE CE, 10191-1025 (2003).
2
io-port 01906499 Almasi, George S.;
Caşcaval, Călin;
Castaños, José G.;
Denneau, Monty;
Donath, Wilm;
Eleftheriou, Maria;
Giampapa, Mark;
Ho, Howard;
Lieber, Derek;
Moreira, José E.;
Newns, Dennis;
Snir, Marc;
Warren, Henry S.jun.
Demonstrating the scalability of a molecular dynamics application on a petaflops computer. (English)
Int. J. Parallel Program. 30, No.4, 317-351 (2002).
3
Performance of a novel algorithm for perpendicular magnetic recording simulation (English)
IPDPS (2002).
5
io-port 70576774 Almasi, George S.;
Cascaval, Calin;
Castaños, José G.;
Denneau, Monty;
Donath, Wilm E.;
Eleftheriou, Maria;
Giampapa, Mark;
Ho, C. T. Howard;
Lieber, Derek;
Moreira, José E.;
Newns, Dennis M.;
Snir, Marc;
Jr., Henry S. Warren
Demonstrating the scalability of a molecular dynamics application on a petaflop computer (English)
ICS, 393-406 (2001).
8
The right floorplanning formulations for future chip implementation methodologies (panel discussion - title only) (English)
ISPD, 214 (2000).
9
Transformational placement and synthesis (English)
DATE, 194-201 (2000).
10
Performance driven optimization of network length in physical placement (English)
ICCD, 258-265 (1999).
11
Timing driven placement using complete path delays (English)
DAC, 84-89 (1990).
12
Placement and average interconnection lengths of computer logic. (English)
IEEE Trans. Circuits Syst. 26, 272-277 (1979).
13
9-V algorithm for test pattern generation of combinational digital circuits. (English)
IEEE Trans. Comput. 27, No. 03, 193-200 (1978).
14
9-V algorithm for test pattern generation of combinational digital circuits (English)
IEEE Trans. Computers 27, No. 3, 193-200 (1978).
15
Equivalence of memory to ’random logic’. (English)
IBM J. Res. Dev. 18, 401-407 (1974).
16
Lower bounds for the partitioning of graphs. (English)
IBM J. Res. Dev. 17, 420-425 (1973).
17
Algorithm and average-value bounds for assignment problems. (English)
IBM J. Res. Dev. 13, 380-386 (1969).
18
Result 1 to 18 of 18 total