default search action
John E. Savage
Person information
- affiliation: Brown University, Providence, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [j33]Desh Ranjan, John E. Savage, Mohammad Zubair:
Upper and lower I/O bounds for pebbling r-pyramids. J. Discrete Algorithms 14: 2-12 (2012) - 2011
- [c27]Desh Ranjan, John E. Savage, Mohammad Zubair:
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs. COCOON 2011: 134-145 - 2010
- [j32]John E. Savage, Mohammad Zubair:
Cache-optimal algorithms for option pricing. ACM Trans. Math. Softw. 37(1): 7:1-7:30 (2010) - [c26]Desh Ranjan, John E. Savage, Mohammad Zubair:
Upper and Lower I/O Bounds for Pebbling r-Pyramids. IWOCA 2010: 107-120 - [c25]Eric Rachlin, John E. Savage:
Stochastic nanoscale addressing for logic. NANOARCH 2010: 59-64
2000 – 2009
- 2009
- [j31]John E. Savage, Mohammad Zubair:
Evaluating multicore algorithms on the unified memory model. Sci. Program. 17(4): 295-308 (2009) - 2008
- [j30]Eric Rachlin, John E. Savage:
Analysis of Mask-Based Nanowire Decoders. IEEE Trans. Computers 57(2): 175-187 (2008) - [j29]Eric Rachlin, John E. Savage:
Nanowire addressing with randomized-contact decoders. Theor. Comput. Sci. 408(2-3): 241-261 (2008) - [c24]John E. Savage:
Computing at the Nanoscale. DFT 2008: 423-423 - [c23]John E. Savage, Mohammad Zubair:
A unified model for multicore architectures. IFMT 2008: 9 - [c22]Eric Rachlin, John E. Savage:
A framework for coded computation. ISIT 2008: 2342-2346 - 2006
- [j28]John E. Savage, Eric Rachlin, André DeHon, Charles M. Lieber, Yue Wu:
Radial addressing of nanowires. ACM J. Emerg. Technol. Comput. Syst. 2(2): 129-154 (2006) - [c21]Eric Rachlin, John E. Savage:
Nanowire addressing with randomized-contact decoders. ICCAD 2006: 735-742 - [c20]Eric Rachlin, John E. Savage:
Nanowire Addressing in the Face of Uncertainty. ISVLSI 2006: 225-230 - 2005
- [j27]Benjamin Gojman, Eric Rachlin, John E. Savage:
Evaluation of design strategies for stochastically assembled nanoarray memories. ACM J. Emerg. Technol. Comput. Syst. 1(2): 73-108 (2005) - [j26]Lee-Ad Gottlieb
, John E. Savage, Arkady Yerukhimovich:
Efficient Data Storage in Large Nanoarrays. Theory Comput. Syst. 38(4): 503-536 (2005) - [c19]Eric Rachlin, John E. Savage, Benjamin Gojman:
Analysis of a Mask-Based Nanowire Decoder. ISVLSI 2005: 6-13 - 2004
- [c18]Benjamin Gojman, Eric Rachlin, John E. Savage:
Decoding of Stochastically Assembled Nanoarrays. ISVLSI 2004: 11-18 - 2003
- [c17]John E. Savage:
Computing with Electronic Nanotechnologies. CIAC 2003: 11 - 2001
- [j25]John E. Savage, Alan L. Selman, Carl Smith:
The history and contribution of theoretical computer science. Adv. Comput. 55: 171-183 (2001) - [j24]Paul F. Fischer, Franco P. Preparata, John E. Savage:
Generalized scans and tridiagonal systems. Theor. Comput. Sci. 255(1-2): 423-436 (2001) - 2000
- [c16]José G. Castaños, John E. Savage:
Repartitioning Unstructured Adaptive Meshes. IPDPS 2000: 823-832
1990 – 1999
- 1999
- [c15]José G. Castaños, John E. Savage:
PARED: A Framework for the Adaptive Solution of PDEs. HPDC 1999: 133-140 - 1998
- [b1]John E. Savage:
Models of computation - exploring the power of computing. Addison-Wesley 1998, ISBN 978-0-201-89539-1, pp. I-XXIII, 1-672 - [j23]John E. Savage:
A new approach to the first theory course. SIGACT News 29(4): 58-62 (1998) - 1997
- [j22]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): 75-93 (1997) - [c14]José G. Castaños, John E. Savage:
The Dynamic Adaptation of Parallel Mesh-Based Computation. PP 1997 - 1995
- [j21]John E. Savage:
Will Computer Science Become Irrelevant? ACM Comput. Surv. 27(1): 35-37 (1995) - [j20]Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith:
Contributions of theoretical computer science. SIGACT News 26(4): 2-4 (1995) - [c13]John E. Savage:
Extending the Hong-Kung Model to Memory Hierarchies. COCOON 1995: 270-281 - [c12]Paul F. Fischer, Franco P. Preparata, John E. Savage:
Generalized Scans and Tri-Diagonal Systems. STACS 1995: 168-180 - 1994
- [c11]John E. Savage:
A Model for Multi-Grained Parallelism (Extended Abstract). SPAA 1994: 330-335 - 1992
- [c10]John E. Savage, Markus G. Wloka:
The parallel complexity of minimizing column conflicts. Great Lakes Symposium on VLSI 1992: 30-34 - 1991
- [j19]John E. Savage, Markus G. Wloka:
Parallelism in Graph-Partitioning. J. Parallel Distributed Comput. 13(3): 257-272 (1991) - [c9]John E. Savage, Markus G. Wloka:
Parallel Graph-Embedding Heuristics. PP 1991: 472-477 - 1990
- [c8]John E. Savage, Markus G. Wloka:
On Parallelizing Graph-Partitioning Heuristics. ICALP 1990: 476-489
1980 – 1989
- 1988
- [c7]John E. Savage, Markus G. Wloka:
A Parallel Algorithm for Channel Routing. WG 1988: 288-303 - 1984
- [j18]John E. Savage:
Space-Time Trade-Offs for Banded Matrix Problems. J. ACM 31(2): 422-437 (1984) - [j17]John E. Savage:
The Performance of Multilective VLSI Algorithms. J. Comput. Syst. Sci. 29(2): 243-273 (1984) - [j16]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): 7-12 (1984) - 1983
- [j15]David A. Carlson, John E. Savage:
Size-Space Tradeoffs for Oblivious Computations. J. Comput. Syst. Sci. 26(1): 65-81 (1983) - [j14]Sowmitri Swamy, John E. Savage:
Space-Time Tradeoffs for Linear Recursion. Math. Syst. Theory 16(1): 9-27 (1983) - [c6]John E. Savage:
Heuristics for Level Graph Embeddings. WG 1983: 307-318 - 1982
- [j13]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
- [j12]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
- [c5]David A. Carlson, John E. Savage:
Graph Pebbling with Many Free Pebbles can be Difficult. STOC 1980: 326-332
1970 – 1979
- 1979
- [j11]L. H. Harper, John E. Savage:
Lower Bounds on Synchronous Combinational Complexity. SIAM J. Comput. 8(2): 115-119 (1979) - [c4]John E. Savage, Sowmitri Swamy:
Space-Time Tradeoffs for Oblivious Interger Multiplications. ICALP 1979: 498-504 - [c3]Sowmitri Swamy, John E. Savage:
Space-Time Tradeoffs for Linear Recursion. POPL 1979: 135-142 - 1978
- [j10]John E. Savage, Sowmitri Swamy:
Space-time trade-offs on the FFT algorithm. IEEE Trans. Inf. Theory 24(5): 563-568 (1978) - 1975
- [j9]L. H. Harper, Thomas H. Payne, John E. Savage, Ernst G. Straus:
Sorting X + Y. Commun. ACM 18(6): 347-349 (1975) - 1974
- [j8]John E. Savage:
An Algorithm for the Computation of Linear Forms. SIAM J. Comput. 3(2): 150-158 (1974) - [j7]John E. Savage:
Signal detection in the presence of multiple-access noise. IEEE Trans. Inf. Theory 20(1): 42-49 (1974) - [c2]Edmund A. Lamagna, John E. Savage:
Combinational Complexity of Some Monotone Functions. SWAT 1974: 140-144 - 1973
- [c1]John E. Savage:
The efficiency of algorithms and machines: a survey of the complexity theoretic approach. AFIPS National Computer Conference 1973: 452 - 1972
- [j6]John E. Savage:
Computational Work and Time on Finite Machines. J. ACM 19(4): 660-674 (1972) - 1971
- [j5]John E. Savage:
The complexity of decoders-II: Computational work and decoding time. IEEE Trans. Inf. Theory 17(1): 77-85 (1971) - 1970
- [j4]John E. Savage:
A note on the performance of concatenated codes (Corresp.). IEEE Trans. Inf. Theory 16(4): 512-513 (1970)
1960 – 1969
- 1969
- [j3]John E. Savage:
Minimum distance estimates of the performance of sequential decoders. IEEE Trans. Inf. Theory 15(1): 128-140 (1969) - [j2]John E. Savage:
Complexity of decoders-I: Classes of decoding rules. IEEE Trans. Inf. Theory 15(6): 689-695 (1969) - 1966
- [j1]John E. Savage:
The distribution of the sequential decoding computation time. IEEE Trans. Inf. Theory 12(2): 143-147 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: