John E. Savage's Publications
2006
Rachlin, E., and Savage, J. E. Addressing in the Face of Uncertainty. In Proceedings of the International Symposium on Very Large-Scale Integration (VLSI) (Feb 2006), IEEE Computer Society, pp. 225-230. [ pdf ]
Rachlin, E., and Savage, J. E. Nanowire Addressing with Randomized-Contact Decoders. In Procs. IEEE/ACM Int. Conf. on Computer-Aided Design (ICCAD) (Nov 2006). [ pdf ]
Savage, J. E., Rachlin, E., DeHon, A., Lieber, C. M., and Wu, Y. Radial Addressing of Nanowires. ACM Journal on Emerging Technologies in Computing Systems 2, 2 (2006), 129-154. [ pdf ]
2005
Rachlin, E., Savage, J. E., and Gojman, B. Analysis of a Mask-Based Decoder. In Procs. Annual Symposium on VLSI (May 2005), IEEE Computer Society, pp. 6-13. [ pdf ]
Gojman, B., Rachlin, E., and Savage, J. E. Evaluation of Design Strategies for Stochastically Assembled Nanoarray Memories. ACM Journal on Emerging Technologies in Computing Systems 1, 2 (Jul 2005), 73-108. [ pdf ]
Gottlieb, L.-A., Savage, J. E., and Yerukhimovich, A. Efficient Data Storage in Large Nanoarrays. Theory of Computing Systems 38, 4 (Jul 2005), 503-536. [ pdf ]
Rachlin, E., and Savage, J. E. Crossbar Addressing Using Core-Shell Nanowires. In Proceedings of TECHCON 2005 (2005), Semiconductor Research Corporation. [ pdf ]
2004
Gojman, B., Rachlin, E., and Savage, J. E. Decoding of Stochastically Assembled Nanoarrays. In Procs. Int. Symposium on VLSI (Feb 2004), pp. 11-18. [ pdf ]
Savage, J. E. Realizing Stochastically Assembled Nanoarrays. In Procs. of 2004 Asilomar Conf. on Signals, Systems and Computers (Nov 2004), pp. 25-29. [ pdf ]
2003
DeHon, A., Lincoln, P., and Savage, J. E. Stochastic Assembly of Sublithographic Nanoscale Interfaces. IEEE Transactions on Nanotechnology 2, 3 (Sep 2003), 165-174. [ pdf ]
DeHon, A., Lieber, C., Lincoln, P., and Savage, J. E. Sub-lithographic semiconductor computing systems. In Procs. Hot Chips Conf. (Hot Chips 15) (Aug 2003), Stanford University. [ pdf ]
2001
Fischer, P., Preparata, F., and Savage, J. Generalized scans and tridiagonal systems. Theoretical Computer Science 255 (2001), 423-436. [ pdf ]
Savage, J., Selman, A., and Smith, C. History and Contributions of Theoretical Computer Science. In Advances in Computers, M. Zelkowitz, Ed. Academic Press, 2001. [ pdf ]
2000
Castaños, J. G., and Savage, J. E. Repartitioning Unstructured Adaptive Meshes. In Procs. Int. Symposium on Parallel and Distributed Processes (ISPDS-80) (May 2000), pp. 823-832. [ pdf ]
1999
Castaños, J. G., and Savage, J. E. PARED: A Framework for the Adaptive Solution of PDEs. In Procs. Eighth IEEE Int. Symp. High Performance Distributed Computing (HPDC'99) (Mar 1999), p. 15. [ pdf ]
Castaños, J., and Savage, J. E. Parallel Refinement of Unstructured Meshes. In Procs. IASTED Conf. on Parallel and Distributed Computing (PDCS-99) (Nov 1999). [ pdf ]
1998
Savage, J. E. Models of Computation: Exploring the Power of Computing. Addison-Wesley, 1998.
1997
Castaños, J. G., and Savage, J. E. The Dynamic Adaptation of Parallel Mesh-Based Computation. In Procs. Eighth SIAM Conference on Parallel Processing for Scientific Computing (Mar 1997). [ pdf ]
1995
Fischer, P. F., Preparata, F. P., and Savage, J. E. Generalized scans and tri-diagonal systems. In Procs. Symposium on Theoretical Aspects of Computer Science (1995), pp. 168-180. [ pdf ]
Savage, J. E. Extending the Hong-Kung Model to Memory Hierarchies. In Computing and Combinatorics, D.-Z. Du and M. Li, Eds. Springer-Verlag, 1995, pp. 270-281. [ pdf ]
1994
Savage, J. E. A Model for Multi-Grained Parallelism. In Procs. ACM Symposium on Parallel Algorithms and Architectures (1994), pp. 330-335. [ pdf ]
1992
Knight, T., and Savage, J. E., Eds. Advanced Research in VLSI and Parallel Systems. MIT Press, 1992.
Savage, J. E., and Wloka, M. G. The Parallel Complexity of Minimizing Column Conflicts. In Procs. IEEE 2nd Great Lakes Symposium on VLSI (1992), pp. 30-34. [ pdf ]
Savage, J. E., and Wloka, M. G. Parallel Graph-Embedding Heuristics. In Procs. Fifth SIAM Conference on Parallel Processing for Scientific Computing (Philadelphia, PA, USA, 1992), SIAM, pp. 472-477.
1991
Savage, J. E., and Wloka, M. G. Parallelism in Graph Partitioning. Journal of Parallel and Distributed Computing 13, 3 (Nov 1991), 257-272. [ pdf ]
Savage, J. E., and Wloka, M. G. Parallelizing SA For Graph Embedding Is Hard. In Procs. IMACS World Congress on Computation and Applied Mathematics (Dublin, Ireland, 1991), pp. 818-823.
1990
Savage, J. E., and Wloka, M. G. On Parallelizing Graph-Partitioning Heuristics. In Procs. Int. Colloquium on Automata, Languages, and Programming (ICALP '90), M. S. Paterson, Ed. Springer-Verlag, 1990, pp. 476-489.
1989
Dalio, B. A., and Savage, J. E. DECO: A Device Compilation System. In Procs. Int. Workshop on Logic and Architecture Synthesis for Silicon Compilation (1989).
Durfee, D. A., and Savage, J. E. The Crossing Number for Neural Networks (Abstract Only). In Procs. IEEE Int. Joint Conf. on Neural Networks (1989), pp. II-613. [ pdf ]
Savage, J. E., and Wloka, M. G. Parallel Constraint Graph Generation. In Procs. Decennial Caltech Conf. on Very Large-Scale Integration (1989), MIT Press, pp. 241-259.
1988
Savage, J. E., and Wloka, M. G. A Parallel Algorithm for Channel Routing. In Procs. 14th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG '88), J. van Leeuwen, Ed. Springer-Verlag, 1988, pp. 288-303.
1987
Savage, J. E., and Vitter, J. S. Parallelism in Space-Time Tradeoffs. Advances in Computing Research 4 (1987), 117-146.
1986
Savage, J. E., Magidson, S., and Stein, A. M. The Mystical Machine. Addison-Wesley, 1986.
1985
Savage, J. E., and Vitter, J. S. Parallelism in Space-Time Tradeoffs. In Procs. Int. Workshop on Parallel Computing and Very Large-Scale Integration (VLSI) (1985), P. Bertolazzi and F. Luccio, Eds., Elsevier Science press, pp. 49-58.
Savage, J. E. Three VLSI Compilation Techniques: PLA's Weinberger Arrays, and SLAP, a New Silicon Layout Program. In Algorithmically Specialized Parallel Computers, L. Snyder, L. H. Jamieson, D. B. Gannon, and J. J. Siegel, Eds. Academic Press, 1985, pp. 17-26.
1984
Carlson, D. A., and Savage, J. E. Size-Space Tradeoffs for Oblivious Computations. Journal of Computer and Systems Science 26, 1 (Feb 1984), 65-81.
Cuykendall, R., Domic, A., Joyner, W. H., Johnson, S. C., Kelem, S. H., McBride, D., Mostow, J., Savage, J. E., and Saucier, G. Design Synthesis in VLSI and Software Engineering. Journal of Systems and Software 4, 1 (1984), 7-12.
Savage, J. E. The Performance of Multilective VLSI Algorithms. Journal of Computer and Systems Sciences 29, 2 (Oct 1984), 243-273.
Savage, J. E. Space-Time Tradeoffs for Banded Matrix Problems. Journal of ACM 31, 2 (Apr 1984), 422-437.
1983
Savage, J. E. Heuristics for Graph Embedding Using Level Graphs. In Procs. WG-83 Int. Workshop on Graphtheoretic Concepts in Computer Science (Jun 1983), M. Nagl and J. Perl, Eds., pp. 307-318.
Savage, J. E. Heuristics in the SLAP Layout System. In Procs. IEEE Int. Conf. on Computer Design: Very Large-Scale Integration in Computers (1983), pp. 637-640.
Swamy, S., and Savage, J. E. Space-Time Tradeoffs for Linear Recursion. Mathematical Systems Theory 16, 1 (1983), 9-27.
1982
Carlson, D. A., and Savage, J. E. Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements. Information Processing Letters 14, 5 (Jul 1982), 223-227.
Cuykendall, R., Domic, A., Joyner, W. H., Johnson, S. C., Kelem, S. H., McBride, D., Mostow, J., Savage, J. E., and Saucier, G. Design Synthesis and Measurement. In IEEE Procs. Workshop on VLSI and Software Engineering (1982), pp. 6-9.
Reiss, S. P., and Savage, J. E. SLAP - A Methodology for Silicon Layout. In Procs. IEEE Int. Conf. on Circuits and Computers (Sep 1982), pp. 281-285.
Savage, J. E. Multilective Planar Circuit Size. In Procs. Allerton Conf. on Communication, Control, and Computing (Oct 1982), pp. 665-671.
1981
Savage, J. E. Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models. Journal of Computer and Systems Sciences 22, 2 (Apr 1981), 230-242.
Savage, J. E. Planar Circuit Complexity and the Performance of VLSI Algorithms. In VLSI Systems and Computations, H. T. Kung, R. Sproull, and G. Steele, Eds. 1981, pp. 61-68.
Savage, J. E. Space-Time Tradeoffs - A Survey. In Procs. Third Hungarian Computer Science Conf. (1981), pp. 93-104.
1980
Carlson, D. A., and Savage, J. E. Graph Pebbling with Many Free Pebbles can be Difficult. In Proceedings 12th Annual ACM Symposium on Theory of Computing (Apr 1980), pp. 326-332.
1979
Harper, L. H., and Savage, J. E. Lower Bounds on Synchronous Combinational Complexity. SIAM Journal on Computing 8, 2 (May 1979), 115-119.
Savage, J. E. Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models. In Procs. 17th Annual Allerton Conf. on Communication, Control, and Computing (Oct 1979), pp. 670-676.
Savage, J. E., and Swamy, S. Space-Time Tradeoffs for Oblivious Integer Multiplication. In Automata, Languages, and Programming, H. A. Maurer, Ed. Springer-Verlag, 1979, pp. 498-504.
Swamy, S., and Savage, J. E. Space-Time Tradeoffs for Linear Recursion. In Procs. ACM Symposium on Principles of Programming Languages (POPL '79) (1979), pp. 135-142.
1978
Swamy, S., and Savage, J. E. Space-Time Tradeoffs on the FFT Algorithm. IEEE Transactions on Information Theory IT-24 (Sep 1978), 563-568.
1977
Kiss, G. R., and Savage, J. E. Processing Power and Delay - Limits on Human Performance. Journal of Mathematical Psychology 16, 1 (Aug 1977), 68-90.
1976
Savage, J. E. The Complexity of Computing. Wiley-Interscience, 1976.
Savage, J. E. The Complexity of Decoders. In Coding and Complexity (1976), Centre Int. des Sciences Mecaniques, Udine.
Savage, J. E. A Computational Inequality and Storage-Time Tradeoffs. In Seminaires INRIA, Theorie des Algorithmes, des Languages et de la Programmation (Oct 1976), Institut de Recherché d'Informatique et de Automatique, pp. 59-84.
1975
Harper, L. H., Hsieh, W. N., and Savage, J. E. A Class of Boolean Functions with Linear Combinational Complexity. Theoretical Computer Science 1, 2 (1975), 161-183,.
Harper, L. H., Payne, T. H., Savage, J. E., and Straus, E. Sorting X + Y. Communications ACM (CACM) 18, 6 (1975), 347-349.
1974
Lamagna, E. A., and Savage, J. E. Combinational Complexity of Some Monotone Functions. In Procs. 15th IEEE Symposium on Switching and Automata (1974), pp. 140-144.
Savage, J. E. An Algorithm for the Computation of Linear Forms. SIAM Journal on Computing 3, 2 (Jun 1974), 150-158.
Savage, J. E. Signal Detection in the Presence of Multiple-Access Noise. IEEE Transactions on Information Theory 20, 1 (Jan 1974), 42-49.
1973
Harper, L. H., and Savage, J. E. Complexity Made Simple. In Procs. Int. Symposium on Combinatorial Theory (1973).
Savage, J. E. Bounds on the Performance of Computing Systems. In Procs. Seventh Annual Symposium on Computer Science and Statistics (1973).
Savage, J. E. Computational Work and Time. In Courant Computer Science Colloquium Vol. 7: Computational Complexity, R. Rustin, Ed. Algorithmics Press, 1973, pp. 103-111.
1972
Denning, P. J., Savage, J. E., and Spirn, J. R. Some Thoughts About Locality in Program Behavior. In Procs. Brooklyn Polytechnic Institute Symposium on Computer-Communication Networks and Traffic (1972), Polytechnic Press, pp. 101-112.
Harper, L. H., and Savage, J. E. On the Complexity of the Marriage Problem. Advances in Mathematics 9, 3 (Dec 1972), 299-312.
Savage, J. E. Computational Work and Time on Finite Machines. Journal ACM 19, 4 (Oct 1972), 660-674. [ pdf ]
1971
Butman, S., Savage, J. E., and Timor, U. Decision Rules for a Two-channel Deep Space Telemetry System. In Procs. Int. Conf. on Communication (1971).
Savage, J. E. The Complexity of Decoders - Part II: Computational Work and Decoding Time. IEEE Transactions on Information Theory II-17, 1 (Jan 1971), 77-85.
1970
Savage, J. E. A Note on the Performance on Concatenated Coding. IEEE Transactions on Information Theory IT-16, 4 (Jul 1970), 512-513.
Savage, J. E. Some Remarks on the Complexity of Source Encoders (summary only). In Procs. Fourth Annual Princeton Conf. on Information Sciences and Systems (1970).
Savage, J. E. Three Measures of Decoder Complexity. IBM Journal of Research and Development 14, 4 (Jul 1970), 417-425.
1969
Savage, J. E. The Complexity of Decoders - Part I: Decoder Classes. IEEE Transactions on Information Theory IT-15, 6 (1969), 689-694.
Savage, J. E. Minimum Distance Estimates of the Performance of Sequential Decoding. IEEE Transactions on Information Theory IT-15, 1 (1969), 128-140.
Savage, J. E. Some Comments on the Computation Time and Complexity of Algorithms (Summary only). In Procs. Princeton Conf. on Information Sciences and Systems (1969).
1968
Savage, J. E. Progress in Sequential Decoding. In Advances in Communication Systems, A. V. Balakrishnan, Ed. Academic Press, 1968, pp. 149-204.
1967
Savage, J. E. Some Simple Self-synchronizing Digital Data Scramblers. Bell System Technical Journal XLVI, 2 (1967), 449-487.
1966
Savage, J. E. A Bound on the Reliability of Block Coding with Feedback. Bell System Technical Journal XLV, 6 (1966), 967-978.
Savage, J. E. The Distribution of Sequential Decoding Computation Time. IEEE Transactions on Information Theory IT-12, 2 (Apr 1966), 143-148.
Savage, J. E. Sequential Decoding - The Computation Problem. Bell System Technical Journal XLV, 1 (1966), 149-175.
| Page Owner: John E. Savage | Last Modified: Fri Nov 3 15:46:54 2006 |