2008 |
40 | EE | John E. Savage:
Computing at the Nanoscale.
DFT 2008: 423-423 |
39 | EE | John E. Savage,
Mohammad Zubair:
A unified model for multicore architectures.
IFMT 2008: 9 |
38 | EE | Eric Rachlin,
John E. Savage:
Analysis of Mask-Based Nanowire Decoders.
IEEE Trans. Computers 57(2): 175-187 (2008) |
37 | EE | Eric Rachlin,
John E. Savage:
Nanowire addressing with randomized-contact decoders.
Theor. Comput. Sci. 408(2-3): 241-261 (2008) |
2006 |
36 | EE | Eric Rachlin,
John E. Savage:
Nanowire addressing with randomized-contact decoders.
ICCAD 2006: 735-742 |
35 | EE | Eric Rachlin,
John E. Savage:
Nanowire Addressing in the Face of Uncertainty.
ISVLSI 2006: 225-230 |
34 | EE | John E. Savage,
Eric Rachlin,
André DeHon,
Charles M. Lieber,
Yue Wu:
Radial addressing of nanowires.
JETC 2(2): 129-154 (2006) |
2005 |
33 | EE | Eric Rachlin,
John E. Savage,
Benjamin Gojman:
Analysis of a Mask-Based Nanowire Decoder.
ISVLSI 2005: 6-13 |
32 | EE | Benjamin Gojman,
Eric Rachlin,
John E. Savage:
Evaluation of design strategies for stochastically assembled nanoarray memories.
JETC 1(2): 73-108 (2005) |
31 | EE | Lee-Ad Gottlieb,
John E. Savage,
Arkady Yerukhimovich:
Efficient Data Storage in Large Nanoarrays.
Theory Comput. Syst. 38(4): 503-536 (2005) |
2004 |
30 | EE | Benjamin Gojman,
Eric Rachlin,
John E. Savage:
Decoding of Stochastically Assembled Nanoarrays.
ISVLSI 2004: 11-18 |
2003 |
29 | EE | John E. Savage:
Computing with Electronic Nanotechnologies.
CIAC 2003: 11 |
2001 |
28 | | John E. Savage,
Alan L. Selman,
Carl Smith:
The history and contribution of theoretical computer science.
Advances in Computers 55: 172-185 (2001) |
27 | EE | Paul F. Fischer,
Franco P. Preparata,
John E. Savage:
Generalized scans and tridiagonal systems.
Theor. Comput. Sci. 255(1-2): 423-436 (2001) |
2000 |
26 | EE | José G. Castaños,
John E. Savage:
Repartitioning Unstructured Adaptive Meshes.
IPDPS 2000: 823-832 |
1999 |
25 | EE | José G. Castaños,
John E. Savage:
PARED: A Framework for the Adaptive Solution of PDEs.
HPDC 1999 |
1997 |
24 | | José G. Castaños,
John E. Savage:
The Dynamic Adaptation of Parallel Mesh-Based Computation.
PPSC 1997 |
1995 |
23 | | John E. Savage:
Extending the Hong-Kung Model to Memory Hierarchies.
COCOON 1995: 270-281 |
22 | | Paul F. Fischer,
Franco P. Preparata,
John E. Savage:
Generalized Scans and Tri-Diagonal Systems.
STACS 1995: 168-180 |
21 | | John E. Savage:
Will Computer Science Become Irrelevant?
ACM Comput. Surv. 27(1): 35-37 (1995) |
1994 |
20 | EE | John E. Savage:
A Model for Multi-Grained Parallelism (Extended Abstract).
SPAA 1994: 330-335 |
1991 |
19 | | John E. Savage,
Markus G. Wloka:
Parallel Graph-Embedding Heuristics.
PPSC 1991: 472-477 |
18 | | John E. Savage,
Markus G. Wloka:
Parallelism in Graph-Partitioning.
J. Parallel Distrib. Comput. 13(3): 257-272 (1991) |
1990 |
17 | | John E. Savage,
Markus G. Wloka:
On Parallelizing Graph-Partitioning Heuristics.
ICALP 1990: 476-489 |
1988 |
16 | | John E. Savage,
Markus G. Wloka:
A Parallel Algorithm for Channel Routing.
WG 1988: 288-303 |
1984 |
15 | EE | John E. Savage:
Space-Time Trade-Offs for Banded Matrix Problems.
J. ACM 31(2): 422-437 (1984) |
14 | | John E. Savage:
The Performance of Multilective VLSI Algorithms.
J. Comput. Syst. Sci. 29(2): 243-273 (1984) |
13 | EE | Robert Cuykendall,
Antun Domic,
William H. Joyner,
Steve C. Johnson,
Steven H. Kelem,
Dennis McBride,
Jack Mostow,
John E. Savage,
Gabriele Saucier:
Design synthesis in VLSI and software engineering.
Journal of Systems and Software 4(1): 7-12 (1984) |
1983 |
12 | | David A. Carlson,
John E. Savage:
Size-Space Tradeoffs for Oblivious Computations.
J. Comput. Syst. Sci. 26(1): 65-81 (1983) |
11 | | Sowmitri Swamy,
John E. Savage:
Space-Time Tradeoffs for Linear Recursion.
Mathematical Systems Theory 16(1): 9-27 (1983) |
1982 |
10 | | David A. Carlson,
John E. Savage:
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements.
Inf. Process. Lett. 14(5): 223-227 (1982) |
1981 |
9 | | John E. Savage:
Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models.
J. Comput. Syst. Sci. 22(2): 230-242 (1981) |
1980 |
8 | | David A. Carlson,
John E. Savage:
Graph Pebbling with Many Free Pebbles can be Difficult
STOC 1980: 326-332 |
1979 |
7 | | John E. Savage,
Sowmitri Swamy:
Space-Time Tradeoffs for Oblivious Interger Multiplications.
ICALP 1979: 498-504 |
6 | EE | Sowmitri Swami,
John E. Savage:
Space-Time Tradeoffs for Linear Recursion.
POPL 1979: 135-142 |
5 | | L. H. Harper,
John E. Savage:
Lower Bounds on Synchronous Combinational Complexity.
SIAM J. Comput. 8(2): 115-119 (1979) |
1975 |
4 | | L. H. Harper,
Thomas H. Payne,
John E. Savage,
E. Straus:
Sorting X + Y.
Commun. ACM 18(6): 347-349 (1975) |
1974 |
3 | | Edmund A. Lamagna,
John E. Savage:
Combinational Complexity of Some Monotone Functions
FOCS 1974: 140-144 |
2 | | John E. Savage:
An Algorithm for the Computation of Linear Forms.
SIAM J. Comput. 3(2): 150-158 (1974) |
1972 |
1 | EE | John E. Savage:
Computational Work and Time on Finite Machines.
J. ACM 19(4): 660-674 (1972) |