John E. Savage

J. Discrete Algorithms, 2012

2011

Strong I/O Lower Bounds for Binomial and FFT Computation Graphs.

[BibT_eX]

[DOI]

Desh Ranjan

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Cache-optimal algorithms for option pricing.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2010

Stochastic nanoscale addressing for logic.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE/ACM International Symposium on Nanoscale Architectures, 2010

Upper and Lower I/O Bounds for Pebbling <i>r</i>-Pyramids.

[BibT_eX]

[DOI]

Desh Ranjan

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Evaluating multicore algorithms on the unified memory model.

[BibT_eX]

[DOI]

Sci. Program., 2009

2008

Nanowire addressing with randomized-contact decoders.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Analysis of Mask-Based Nanowire Decoders.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2008

A framework for coded computation.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

A unified model for multicore architectures.

[BibT_eX]

[DOI]

Proceedings of the 1st international forum on Next-generation multicore/manycore technologies, 2008

Computing at the Nanoscale.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (DFT 2008), 2008

2006

Radial addressing of nanowires.

[BibT_eX]

[DOI]

ACM J. Emerg. Technol. Comput. Syst., 2006

Nanowire Addressing in the Face of Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2006), 2006

2005

Efficient Data Storage in Large Nanoarrays.

[BibT_eX]

[DOI]

Lee-Ad Gottlieb

Arkady Yerukhimovich

Theory Comput. Syst., 2005

Evaluation of design strategies for stochastically assembled nanoarray memories.

[BibT_eX]

[DOI]

Benjamin Gojman

ACM J. Emerg. Technol. Comput. Syst., 2005

Analysis of a Mask-Based Nanowire Decoder.

[BibT_eX]

[DOI]

Benjamin Gojman

Proceedings of the 2005 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2005), 2005

2004

Decoding of Stochastically Assembled Nanoarrays.

[BibT_eX]

[DOI]

Benjamin Gojman

Proceedings of the 2004 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2004), 2004

2003

Computing with Electronic Nanotechnologies.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2001

Generalized scans and tridiagonal systems.

[BibT_eX]

[DOI]

Paul F. Fischer

Franco P. Preparata

Theor. Comput. Sci., 2001

The history and contribution of theoretical computer science.

[BibT_eX]

[DOI]

Alan L. Selman

Carl Smith

Adv. Comput., 2001

2000

Repartitioning Unstructured Adaptive Meshes.

[BibT_eX]

[DOI]

José G. Castaños

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1999

PARED: A Framework for the Adaptive Solution of PDEs.

[BibT_eX]

[DOI]

José G. Castaños

Proceedings of the Eighth IEEE International Symposium on High Performance Distributed Computing, 1999

1998

A new approach to the first theory course.

[BibT_eX]

[DOI]

SIGACT News, 1998

Models of computation - exploring the power of computing.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-201-89539-1, 1998

1997

Strategic directions in research in theory of computing.

[BibT_eX]

[DOI]

SIGACT News, 1997

The Dynamic Adaptation of Parallel Mesh-Based Computation.

[BibT_eX]

José G. Castaños

Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, 1997

1995

Contributions of theoretical computer science.

[BibT_eX]

[DOI]

SIGACT News, 1995

Will Computer Science Become Irrelevant?

[BibT_eX]

[DOI]

ACM Comput. Surv., 1995

Generalized Scans and Tri-Diagonal Systems.

[BibT_eX]

[DOI]

Paul F. Fischer

Franco P. Preparata

Proceedings of the STACS 95, 1995

Extending the Hong-Kung Model to Memory Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

A Model for Multi-Grained Parallelism (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1992

The parallel complexity of minimizing column conflicts.

[BibT_eX]

[DOI]

Proceedings of the Second Great Lakes Symposium on VLSI, 1992

1991

Parallelism in Graph-Partitioning.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1991

Parallel Graph-Embedding Heuristics.

[BibT_eX]

Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991

1990

On Parallelizing Graph-Partitioning Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988

A Parallel Algorithm for Channel Routing.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

1984

Design synthesis in VLSI and software engineering.

[BibT_eX]

[DOI]

J. Syst. Softw., 1984

The Performance of Multilective VLSI Algorithms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1984

Space-Time Trade-Offs for Banded Matrix Problems.

[BibT_eX]

[DOI]

J. ACM, 1984

1983

Space-Time Tradeoffs for Linear Recursion.

[BibT_eX]

[DOI]

Sowmitri Swamy

Math. Syst. Theory, 1983

Size-Space Tradeoffs for Oblivious Computations.

[BibT_eX]

[DOI]

David A. Carlson

J. Comput. Syst. Sci., 1983

Heuristics for Level Graph Embeddings.

[BibT_eX]

Proceedings of the WG '83, 1983

1982

Extreme Time-Space Tradeoffs for Graphs with Small Space Requirements.

[BibT_eX]

[DOI]

David A. Carlson

Inf. Process. Lett., 1982

1981

Area-Time Tradeoffs for Matrix Multiplication and Related Problems in VLSI Models.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

1980

Graph Pebbling with Many Free Pebbles can be Difficult

[BibT_eX]

[DOI]

David A. Carlson

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

Lower Bounds on Synchronous Combinational Complexity.

[BibT_eX]

[DOI]

L. H. Harper

SIAM J. Comput., 1979

Space-Time Tradeoffs for Oblivious Interger Multiplications.

[BibT_eX]

[DOI]

Sowmitri Swamy

Proceedings of the Automata, 1979

1978

Space-time trade-offs on the FFT algorithm.

[BibT_eX]

[DOI]

Sowmitri Swamy

IEEE Trans. Inf. Theory, 1978

1975

Sorting X + Y.

[BibT_eX]

[DOI]

Commun. ACM, 1975

1974

Signal detection in the presence of multiple-access noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1974

An Algorithm for the Computation of Linear Forms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1974

Combinational Complexity of Some Monotone Functions

[BibT_eX]

[DOI]

Edmund A. Lamagna

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

1973

The efficiency of algorithms and machines: a survey of the complexity theoretic approach.

[BibT_eX]

[DOI]

Proceedings of the American Federation of Information Processing Societies: 1973 National Computer Conference, 1973

1972

Computational Work and Time on Finite Machines.

[BibT_eX]

[DOI]

J. ACM, 1972

1971

The complexity of decoders-II: Computational work and decoding time.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1971

1970

A note on the performance of concatenated codes (Corresp.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1970

1969

Complexity of decoders-I: Classes of decoding rules.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1969

Minimum distance estimates of the performance of sequential decoders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1969

1966

The distribution of the sequential decoding computation time.

[BibT_eX]

[DOI]