John E. Savage

Publication Activity (10 Years)

Years Active: 1966-2012
Publications (10 Years): 0

Top Topics

Multiresolution

Top Venues

J. Discrete Algorithms

Publications

Desh Ranjan, John E. Savage, Mohammad Zubair
Upper and lower I/O bounds for pebbling r-pyramids. J. Discrete Algorithms 14 (2012)
Desh Ranjan, John E. Savage, Mohammad Zubair
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs. COCOON (2011)
John E. Savage, Mohammad Zubair
Cache-optimal algorithms for option pricing. ACM Trans. Math. Softw. 37 (1) (2010)
Desh Ranjan, John E. Savage, Mohammad Zubair
-Pyramids. IWOCA (2010)
Eric Rachlin, John E. Savage
Stochastic nanoscale addressing for logic. NANOARCH (2010)
John E. Savage, Mohammad Zubair
Evaluating multicore algorithms on the unified memory model. Sci. Program. 17 (4) (2009)
Eric Rachlin, John E. Savage
A framework for coded computation. ISIT (2008)
Eric Rachlin, John E. Savage
Analysis of Mask-Based Nanowire Decoders. IEEE Trans. Computers 57 (2) (2008)
Eric Rachlin, John E. Savage
Nanowire addressing with randomized-contact decoders. Theor. Comput. Sci. 408 (2-3) (2008)
John E. Savage, Mohammad Zubair
A unified model for multicore architectures. IFMT (2008)
John E. Savage
Computing at the Nanoscale. DFT (2008)
Eric Rachlin, John E. Savage
Nanowire Addressing in the Face of Uncertainty. ISVLSI (2006)
Eric Rachlin, John E. Savage
Nanowire addressing with randomized-contact decoders. ICCAD (2006)
John E. Savage, Eric Rachlin, André DeHon, Charles M. Lieber, Yue Wu
Radial addressing of nanowires. ACM J. Emerg. Technol. Comput. Syst. 2 (2) (2006)
Eric Rachlin, John E. Savage, Benjamin Gojman
Analysis of a Mask-Based Nanowire Decoder. ISVLSI (2005)
Lee-Ad Gottlieb, John E. Savage, Arkady Yerukhimovich
Efficient Data Storage in Large Nanoarrays. Theory Comput. Syst. 38 (4) (2005)
Benjamin Gojman, Eric Rachlin, John E. Savage
Evaluation of design strategies for stochastically assembled nanoarray memories. ACM J. Emerg. Technol. Comput. Syst. 1 (2) (2005)
Benjamin Gojman, Eric Rachlin, John E. Savage
Decoding of Stochastically Assembled Nanoarrays. ISVLSI (2004)
John E. Savage
Computing with Electronic Nanotechnologies. CIAC (2003)
Paul F. Fischer, Franco P. Preparata, John E. Savage
Generalized scans and tridiagonal systems. Theor. Comput. Sci. 255 (1-2) (2001)
John E. Savage, Alan L. Selman, Carl Smith
The history and contribution of theoretical computer science. Adv. Comput. 55 (2001)
José G. Castaños, John E. Savage
Repartitioning Unstructured Adaptive Meshes. IPDPS (2000)
José G. Castaños, John E. Savage
PARED: A Framework for the Adaptive Solution of PDEs. HPDC (1999)
John E. Savage
A new approach to the first theory course. SIGACT News 29 (4) (1998)
José G. Castaños, John E. Savage
The Dynamic Adaptation of Parallel Mesh-Based Computation. PPSC (1997)
Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
Strategic directions in research in theory of computing. SIGACT News 28 (3) (1997)
John E. Savage
Extending the Hong-Kung Model to Memory Hierarchies. COCOON (1995)
Paul F. Fischer, Franco P. Preparata, John E. Savage
Generalized Scans and Tri-Diagonal Systems. STACS (1995)
John E. Savage
Will Computer Science Become Irrelevant? ACM Comput. Surv. 27 (1) (1995)
Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith
Contributions of theoretical computer science. SIGACT News 26 (4) (1995)
John E. Savage
A Model for Multi-Grained Parallelism (Extended Abstract). SPAA (1994)
John E. Savage, Markus G. Wloka
The parallel complexity of minimizing column conflicts. Great Lakes Symposium on VLSI (1992)
John E. Savage, Markus G. Wloka
Parallel Graph-Embedding Heuristics. PPSC (1991)
John E. Savage, Markus G. Wloka
Parallelism in Graph-Partitioning. J. Parallel Distributed Comput. 13 (3) (1991)
John E. Savage, Markus G. Wloka
On Parallelizing Graph-Partitioning Heuristics. ICALP (1990)
John E. Savage, Markus G. Wloka
A Parallel Algorithm for Channel Routing. WG (1988)
John E. Savage
Space-Time Trade-Offs for Banded Matrix Problems. J. ACM 31 (2) (1984)
John E. Savage
The Performance of Multilective VLSI Algorithms. J. Comput. Syst. Sci. 29 (2) (1984)
Robert Cuykendall, Antun Domic, William H. Joyner, Stephen C. Johnson, Steven H. Kelem, Dennis McBride, Jack Mostow, John E. Savage, Gabriele Saucier
Design synthesis in VLSI and software engineering. J. Syst. Softw. 4 (1) (1984)
Sowmitri Swamy, John E. Savage
Space-Time Tradeoffs for Linear Recursion. Math. Syst. Theory 16 (1) (1983)
John E. Savage
Heuristics for Level Graph Embeddings. WG (1983)
David A. Carlson, John E. Savage
Size-Space Tradeoffs for Oblivious Computations. J. Comput. Syst. Sci. 26 (1) (1983)
David A. Carlson, John E. Savage
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements. Inf. Process. Lett. 14 (5) (1982)
John E. Savage
Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models. J. Comput. Syst. Sci. 22 (2) (1981)
David A. Carlson, John E. Savage
Graph Pebbling with Many Free Pebbles can be Difficult STOC (1980)
L. H. Harper, John E. Savage
Lower Bounds on Synchronous Combinational Complexity. SIAM J. Comput. 8 (2) (1979)
John E. Savage, Sowmitri Swamy
Space-Time Tradeoffs for Oblivious Interger Multiplications. ICALP (1979)
Sowmitri Swamy, John E. Savage
Space-Time Tradeoffs for Linear Recursion. POPL (1979)
John E. Savage, Sowmitri Swamy
Space-time trade-offs on the FFT algorithm. IEEE Trans. Inf. Theory 24 (5) (1978)
L. H. Harper, Thomas H. Payne, John E. Savage, Ernst G. Straus
Sorting X + Y. Commun. ACM 18 (6) (1975)
John E. Savage
Signal detection in the presence of multiple-access noise. IEEE Trans. Inf. Theory 20 (1) (1974)
Edmund A. Lamagna, John E. Savage
Combinational Complexity of Some Monotone Functions SWAT (1974)
John E. Savage
An Algorithm for the Computation of Linear Forms. SIAM J. Comput. 3 (2) (1974)
John E. Savage
The efficiency of algorithms and machines: a survey of the complexity theoretic approach. AFIPS National Computer Conference (1973)
John E. Savage
Computational Work and Time on Finite Machines. J. ACM 19 (4) (1972)
John E. Savage
The complexity of decoders-II: Computational work and decoding time. IEEE Trans. Inf. Theory 17 (1) (1971)
John E. Savage
A note on the performance of concatenated codes (Corresp.). IEEE Trans. Inf. Theory 16 (4) (1970)
John E. Savage
Minimum distance estimates of the performance of sequential decoders. IEEE Trans. Inf. Theory 15 (1) (1969)
John E. Savage
Complexity of decoders-I: Classes of decoding rules. IEEE Trans. Inf. Theory 15 (6) (1969)
John E. Savage
The distribution of the sequential decoding computation time. IEEE Trans. Inf. Theory 12 (2) (1966)