David S. Wise

According to our database, David S. Wise authored at least 48 papers between 1971 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2009

Generic support of algorithmic and structural recursion for scientific computing.

Peter Gottschling, David S. Wise, Adwait Joshi

Int. J. Parallel Emergent Distributed Syst., 2009

2008

Converting to and from Dilated Integers.

Rajeev Raman, David S. Wise

IEEE Trans. Computers, 2008

2007

Analyzing block locality in Morton-order and Morton-hybrid matrices.

K. Patrick Lorton, David S. Wise

SIGARCH Comput. Archit. News, 2007

Introduction.

David S. Wise

Commun. ACM, 2007

Representation-transparent matrix algorithms with scalable performance.

Peter Gottschling, David S. Wise, Michael D. Adams

Proceedings of the 21th Annual International Conference on Supercomputing, 2007

2006

Fast additions on masked integers.

Michael D. Adams, David S. Wise

ACM SIGPLAN Notices, 2006

Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms.

Michael D. Adams, David S. Wise

Proceedings of the 2006 workshop on Memory System Performance and Correctness, 2006

2005

A Paradigm for Parallel Matrix Algorithms: .

David S. Wise, Craig Citro, Joshua Hursey, Fang Liu, Michael Rainey

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004

The Opie compiler from row-major source to Morton-ordered matrices.

Steven T. Gabriel, David S. Wise

Proceedings of the 3rd Workshop on Memory Performance Issues, 2004

2003

Factorization with morton-ordered quadtree matrices for memory re-use and parallelism.

Jeremy D. Frens, David S. Wise

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2003

2002

Blood from Dahm's Turnip.

Kasey N. Klipsch, David S. Wise

Nord. J. Comput., 2002

2001

Language support for Morton-order matrices.

David S. Wise, Jeremy D. Frens, Yuhong Gu, Gregory A. Alexander

Proceedings of the 2001 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPOPP'01), 2001

2000

Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free.

David S. Wise

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1999

Undulant-Block Elimination and Integer-Preserving Matrix Inversion.

David S. Wise

Sci. Comput. Program., 1999

Changes in ACM's Revised Copyright Policy.

David S. Wise

Commun. ACM, 1999

1998

One-Bit Counts between Unique and Sticky.

David J. Roth, David S. Wise

Proceedings of the International Symposium on Memory Management, 1998

1997

Research Demonstration of a Hardware Reference-Counting Heap.

David S. Wise, Brian C. Heck, Caleb Hess, Willie Hunt, Eric Ost

LISP Symb. Comput., 1997

Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code.

Jeremy D. Frens, David S. Wise

Proceedings of the Sixth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), 1997

1996

Static and Dynamic Partitioning of Pointers as Links and Threads.

David S. Wise, Joshua Walgenbach

Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

1993

Stop-and-Copy and One-Bit Reference Counting.

David S. Wise

Inf. Process. Lett., 1993

1992

An Implementation of an Applicative File System.

Brian C. Heck, David S. Wise

Proceedings of the Memory Management, 1992

1990

Costs of Quadtree Representation of Nondense Matrices.

David S. Wise, John V. Franco

J. Parallel Distributed Comput., 1990

1989

Generating Function Versions with Rational Strictness Patterns.

Cordelia V. Hall, David S. Wise

Sci. Comput. Program., 1989

1988

Experiments with Quadtree Representation of Matrices.

S. Kamal Abdali, David S. Wise

Proceedings of the Symbolic and Algebraic Computation, 1988

1987

Compiling Strictness into Streams.

Cordelia V. Hall, David S. Wise

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Matrix algebra and applicative programming.

David S. Wise

Proceedings of the Functional Programming Languages and Computer Architecture, 1987

1986

Parallel Decomposition of Matrix Inversion Using Quadtrees.

David S. Wise

Proceedings of the International Conference on Parallel Processing, 1986

1985

Representing Matrices as Quadtrees for Parallel Processors.

David S. Wise

Inf. Process. Lett., 1985

Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by Name.

S. Kamal Abdali, David S. Wise

Proceedings of the Mathematical Foundations of Programming Semantics, 1985

Design for a Multiprocessing Heap with On-board Reference Counting.

David S. Wise

Proceedings of the Functional Programming Languages and Computer Architecture, 1985

1984

Representing matrices as quadtrees for parallel processors: extended abstract.

David S. Wise

SIGSAM Bull., 1984

1980

An Indeterminate Constructor for Applicative Programming.

Daniel P. Friedman, David S. Wise

Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

1979

Morris's Garbage Compaction Algorithm Restores Reference Counts.

David S. Wise

ACM Trans. Program. Lang. Syst., 1979

Reference Counting Can Manage the Circular Environments of Mutual Recursion.

Daniel P. Friedman, David S. Wise

Inf. Process. Lett., 1979

An Approach to Fair Applicative Multiprogramming.

Daniel P. Friedman, David S. Wise

Proceedings of the Semantics of Concurrent Computation, 1979

1978

Aspects of Applicative Programming for Parallel Processing.

Daniel P. Friedman, David S. Wise

IEEE Trans. Computers, 1978

Unbounded Computational Structures.

Daniel P. Friedman, David S. Wise

Softw. Pract. Exp., 1978

Functional Combination.

Daniel P. Friedman, David S. Wise

Comput. Lang., 1978

A Note on Conditional Expressions.

Daniel P. Friedman, David S. Wise

Commun. ACM, 1978

1977

Aspects of Applicative Programming for File Systems (Preliminary Version).

Daniel P. Friedman, David S. Wise

Proceedings of an ACM Conference on Language Design for Reliable Software (LDRS), 1977

1976

A Strong Pumping Lemma for Context-Free Languages.

David S. Wise

Theor. Comput. Sci., 1976

Garbage Collecting a Heap Which Includes a Scatter Table.

Daniel P. Friedman, David S. Wise

Inf. Process. Lett., 1976

Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures.

Daniel P. Friedman, David S. Wise

Inf. Process. Lett., 1976

Referencing Lists by an Edge.

David S. Wise

Commun. ACM, 1976

Recursive programming through table look-up.

Daniel P. Friedman, David S. Wise, Mitchell Wand

Proceedings of the third ACM Symposium on Symbolic and Algebraic Manipulation, 1976

CONS Should Not Evaluate its Arguments.

Daniel P. Friedman, David S. Wise

Proceedings of the Third International Colloquium on Automata, 1976

1972

Generalized Overlap Resolvable Grammars and Their Parsers.

David S. Wise

J. Comput. Syst. Sci., 1972

1971

Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars

David S. Wise

Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971