John E. Savage

61 papers A* 4A 4B 4C 2Misc 2Journal 33Unranked 11

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