John E. Savage

Q: What Schools Are Affiliated With John E. Savage

John E. Savage is affiliated with the following schools: Brown University, Massachusetts Institute of Technology

John E. Savage's AcademicInfluence.com Rankings

John E. Savage

Computer Science

#1288

World Rank

#1331

Historical Rank

#658

USA Rank

Database

#8149

World Rank

#8497

Historical Rank

#1060

USA Rank

computer-science Degrees

Download Badge

Computer Science

Why Is John E. Savage Influential?

(Suggest an Edit or Addition)

According to Wikipedia, John Edmund Savage is an American computer scientist and An Wang Professor Emeritus of Computer Science at Brown University. At his retirement in 2019, Savage was one of the longest-serving faculty members in Brown's history.

(See a Problem?)

John E. Savage's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Models of computation - exploring the power of computing (1998) (333)
The Complexity of Computing (1976) (181)
Stochastic assembly of sublithographic nanoscale interfaces (2003) (180)
Computational Work and Time on Finite Machines (1972) (122)
Extending the Hong-Kung Model to Memory Hierarchies (1995) (83)
Some simple self-synchronizing digital data scramblers (1967) (81)
Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models (1981) (69)
Parallelism in Graph-Partitioning (1991) (62)
Planar Circuit Complexity and The Performance of VLSI Algorithms (1981) (60)
Sequential decoding — the computation problem (1966) (57)
Space-time trade-offs on the FFT algorithm (1978) (52)
An Algorithm for the Computation of Linear Forms (1974) (44)
Radial addressing of nanowires (2006) (43)
A unified model for multicore architectures (2008) (42)
Space-Time Tradeoffs for Oblivious Interger Multiplications (1979) (40)
Sorting X + Y (1975) (38)
Combinational Complexity of Some Monotone Functions (1974) (34)
Evaluation of design strategies for stochastically assembled nanoarray memories (2005) (30)
Space-time tradeoffs for linear recursion (1979) (26)
The complexity of decoders-II: Computational work and decoding time (1971) (26)
The distribution of the sequential decoding computation time (1966) (25)
On the complexity of the marriage problem (1972) (25)
The Performance of Multilective VLSI Algorithms (1984) (22)
The Dynamic Adaptation of Parallel Mesh-Based Computation (1997) (21)
Decoding of stochastically assembled nanoarrays (2004) (20)
Upper and lower I/O bounds for pebbling r-pyramids (2010) (20)
Cache-optimal algorithms for option pricing (2010) (19)
Minimum distance estimates of the performance of sequential decoders (1969) (18)
Parallel Refinement of Unstructured Meshes (1999) (17)
Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements (1982) (17)
Space-Time Tradeoffs in Memory Hierarchies (1994) (16)
Complexity of decoders-I: Classes of decoding rules (1969) (15)
PARED: a framework for the adaptive solution of PDEs (1999) (15)
Repartitioning unstructured adaptive meshes (2000) (14)
A Parallel Algorithm for Channel Routing (1988) (14)
Strong I/O Lower Bounds for Binomial and FFT Computation Graphs (2011) (13)
Nanowire Addressing with Randomized-Contact Decoders (2006) (13)
A framework for coded computation (2008) (12)
Graph pebbling with many free pebbles can be difficult (1980) (12)
THE COMPUTATION PROBLEM WITH SEQUENTIAL DECODING (1965) (11)
Evaluating multicore algorithms on the unified memory model (2009) (10)
Lower Bounds on Synchronous Combinational Complexity (1979) (9)
Space-Time Trade-Offs for Banded Matrix Problems (1984) (9)
Nanowire addressing in the face of uncertainty (2006) (8)
On Parallelizing Graph-Partitioning Heuristics (1990) (8)
A note on the performance of concatenated codes (Corresp.) (1970) (8)
Efficient Data Storage in Large Nanoarrays (2005) (7)
Size-Space Tradeoffs for Oblivious Computations (1983) (7)
Three measures of decoder complexity (1970) (7)
Analysis of a mask-based nanowire decoder (2005) (7)
Progress in Sequential Decoding (1968) (7)
Analysis of Mask-Based Nanowire Decoders (2008) (7)
Processing power and delay—Limits on human performance (1977) (6)
The Complexity of Decoders (1975) (6)
Heuristics for Parallel Graph-Partitioning (1989) (6)
Parallel constraint graph generation (1989) (5)
Contributions of theoretical computer science (1995) (5)
Mob --- A Parallel Heuristic for Graph-Embedding (1993) (5)
Signal detection in the presence of multiple-access noise (1974) (5)
Generalized scans and tridiagonal systems (2001) (4)
The Mystical Machine; Issues and Ideas in Computing (1986) (4)
Parallel Graph-Embedding and the Mob Heuristic (1991) (4)
Heuristics for Level Graph Embeddings (1983) (4)
Advanced research in VLSI and parallel systems : proceedings of the 1992 Brown/MIT conference (1992) (4)
Parallel Graph-Embedding Heuristics (1991) (3)
Will computer science become irrelevant? (1995) (3)
Space-time Tradeoos in Memory Hierarchies (1995) (3)
Combinational Complexity Measures as a Function of Fan-out (1971) (3)
Vlsi Models of Computation (2)
Computational Work and Decoding Time (1971) (2)
Machines with Memory (2)
Memory Hierarchy Issues in Multicore Architectures (2008) (2)
Stochastic Assembly of Sublithographic (2003) (1)
Multiparadigm Design Environments (1992) (1)
Radial Addressing of Nanowires 1 (2006) (1)
Computing with Electronic Nanotechnologies (2003) (1)
The crossing number for neural networks (1989) (1)
Reducing the Complexity of Calculating Syndromes for Error-Correcting Codes (1972) (1)
Decision rules for a two-channel deep-space telemetry system (1971) (1)
Proceedings of the 1992 Brown/MIT conference on Advanced research in VLSI and parallel systems (1992) (1)
A bound on the reliability of block coding with feedback (1966) (1)
Crossbar Addressing Using Core-Shell Nanowires ∗ Extended Abstract (2005) (1)
Reliable Nanowire Addressing via Randomized-Contact Decoders (2007) (1)
Why NSF should not change its approach to HPCC/NII research (1994) (1)
A model for multi-grained parallelism (extended abstract) (1994) (1)
Cybersecurity Convergence: Digital Human and National Security (2020) (1)
The parallel complexity of minimizing column conflicts (1992) (1)
Algebraic and Combinatorial Circuits (2008) (1)
The history and contribution of theoretical computer science (2001) (0)
Probahilistic Information Theory--Discrete and Memoryless Models. By Frederik Jelinek. McGraw-Hill. (1968) (0)
Memory-hierarchy Tradeoffs (0)
The computation problem with sequential coding Technical report no. 439 (1965) (0)
A new approach to the first theory course (1998) (0)
The efficiency of algorithms and machines: a survey of the complexity theoretic approach (1973) (0)
Exploring the role of strain in colloidal thin film crystallization (2010) (0)
Computation on finite machines (1971) (0)
Parallel Computation (0)
Space–time Tradeoffs (0)
The Role of Theory in Computer Science (0)
Exploring the effect of liquid crystalline phase on droplet breakup (2010) (0)
Space-time Tradeoos in Memory Hierarchies Space-time Tradeoos in Memory Hierarchies (2007) (0)
Realizing stochastically assembled nanoarrays (2004) (0)
The complexity of deterministic source encoding with a fidelity criterion (1970) (0)
Three-dimensional storage array (2003) (0)
Design synthesis in VLSI and software engineering (1984) (0)
Strategic directions in research in theory of computing (1997) (0)
Computational work and efficient computation on general purpose machines (1971) (0)
Sub-lithographic nano-range storage architecture (2003) (0)
Ideal and Resistive Nanowire Decoders General models for nanowire addressing (2006) (0)
A Glance at the Showmanship of Physics (1969) (0)
Computing at the Nanoscale (2008) (0)
Whatever Happened to the Grammatical Revolution (1972) (0)
Mo deling and Analysis of a Membrane-Based Randomized-Contact Decoder (2008) (0)
Mob a P Arallel Heuristic for Graph-embedding Y Z Mob a P Arallel Heuristic for Graph-embedding (1999) (0)
Stochastic nanoscale addressing for logic (2010) (0)
Mob -a Parallel Heuristic for Graph-embedding Mob { a Parallel Heuristic for Graph-embedding Y Z X (1993) (0)
Generalized Scans and Tri-Diagonal Systems (1995) (0)
NIRT : Technologies , Architectures and Performance Analysis for Nanoelectronics (2005) (0)
Theoretical Computer Science in Transition (2008) (0)

This paper list is powered by the following services:

Other Resources About John E. Savage

en.wikipedia.org

What Schools Are Affiliated With John E. Savage?

John E. Savage is affiliated with the following schools: