Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars - David S. Wise (STOC, 1971)

Generalized Overlap Resolvable Grammars and Their Parsers. - David S. Wise (J. Comput. Syst. Sci., 1972)

CONS Should Not Evaluate its Arguments. - Daniel P. Friedman; David S. Wise (ICALP, 1976)

Recursive programming through table look-up. - Daniel P. Friedman; David S. Wise; Mitchell Wand (SYMSACC, 1976)

Referencing Lists by an Edge. - David S. Wise (Commun. ACM, 1976)

Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. - Daniel P. Friedman; David S. Wise (Inf. Process. Lett., 1976)

Garbage Collecting a Heap Which Includes a Scatter Table. - Daniel P. Friedman; David S. Wise (Inf. Process. Lett., 1976)

A Strong Pumping Lemma for Context-Free Languages. - David S. Wise (Theor. Comput. Sci., 1976)

Aspects of Applicative Programming for File Systems (Preliminary Version). - Daniel P. Friedman; David S. Wise (Language Design for Reliable Software, 1977)

A Note on Conditional Expressions. - Daniel P. Friedman; David S. Wise (Commun. ACM, 1978)

Functional Combination. - Daniel P. Friedman; David S. Wise (Comput. Lang., 1978)

Unbounded Computational Structures. - Daniel P. Friedman; David S. Wise (Softw. Pract. Exp., 1978)

Aspects of Applicative Programming for Parallel Processing. - Daniel P. Friedman; David S. Wise (IEEE Trans. Computers, 1978)

An Approach to Fair Applicative Multiprogramming. - Daniel P. Friedman; David S. Wise (Semantics of Concurrent Computation, 1979)

Reference Counting Can Manage the Circular Environments of Mutual Recursion. - Daniel P. Friedman; David S. Wise (Inf. Process. Lett., 1979)

Morris's Garbage Compaction Algorithm Restores Reference Counts. - David S. Wise (ACM Trans. Program. Lang. Syst., 1979)

An Indeterminate Constructor for Applicative Programming. - Daniel P. Friedman; David S. Wise (POPL, 1980)

Representing matrices as quadtrees for parallel processors: extended abstract. - David S. Wise (SIGSAM Bull., 1984)

Design for a Multiprocessing Heap with On-board Reference Counting. - David S. Wise (FPCA, 1985)

Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by Name. - S. Kamal Abdali; David S. Wise (Mathematical Foundations of Programming Semantics, 1985)

Representing Matrices as Quadtrees for Parallel Processors. - David S. Wise (Inf. Process. Lett., 1985)

Parallel Decomposition of Matrix Inversion Using Quadtrees. - David S. Wise (ICPP, 1986)

Matrix algebra and applicative programming. - David S. Wise (FPCA, 1987)

Compiling Strictness into Streams. - Cordelia V. Hall; David S. Wise (POPL, 1987)

Experiments with Quadtree Representation of Matrices. - S. Kamal Abdali; David S. Wise (ISSAC, 1988)

Generating Function Versions with Rational Strictness Patterns. - Cordelia V. Hall; David S. Wise (Sci. Comput. Program., 1989)

Costs of Quadtree Representation of Nondense Matrices. - David S. Wise; John V. Franco (J. Parallel Distributed Comput., 1990)

An Implementation of an Applicative File System. - Brian C. Heck; David S. Wise (IWMM, 1992)

Stop-and-Copy and One-Bit Reference Counting. - David S. Wise (Inf. Process. Lett., 1993)

Static and Dynamic Partitioning of Pointers as Links and Threads. - David S. Wise; Joshua Walgenbach (ICFP, 1996)

Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code. - Jeremy D. Frens; David S. Wise (PPoPP, 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)

One-Bit Counts between Unique and Sticky. - David J. Roth; David S. Wise (ISMM, 1998)

Changes in ACM's Revised Copyright Policy. - David S. Wise (Commun. ACM, 1999)

Undulant-Block Elimination and Integer-Preserving Matrix Inversion. - David S. Wise (Sci. Comput. Program., 1999)

Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free. - David S. Wise (Euro-Par, 2000)

Language support for Morton-order matrices. - David S. Wise; Jeremy D. Frens; Yuhong Gu; Gregory A. Alexander (PPoPP, 2001)

Blood from Dahm's Turnip. - Kasey N. Klipsch; David S. Wise (Nord. J. Comput., 2002)

Factorization with morton-ordered quadtree matrices for memory re-use and parallelism. - Jeremy D. Frens; David S. Wise (PPoPP, 2003)

The Opie compiler from row-major source to Morton-ordered matrices. - Steven T. Gabriel; David S. Wise (WMPI, 2004)

A Paradigm for Parallel Matrix Algorithms: . - David S. Wise; Craig Citro; Joshua Hursey; Fang Liu; Michael Rainey (Euro-Par, 2005)

Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms. - Michael D. Adams 001; David S. Wise (Memory System Performance and Correctness, 2006)

Fast additions on masked integers. - Michael D. Adams 001; David S. Wise (ACM SIGPLAN Notices, 2006)

Representation-transparent matrix algorithms with scalable performance. - Peter Gottschling; David S. Wise; Michael D. Adams 001 (ICS, 2007)

Introduction. - David S. Wise (Commun. ACM, 2007)

Analyzing block locality in Morton-order and Morton-hybrid matrices. - K. Patrick Lorton; David S. Wise (SIGARCH Comput. Archit. News, 2007)

Converting to and from Dilated Integers. - Rajeev Raman; David S. Wise (IEEE Trans. Computers, 2008)

Generic support of algorithmic and structural recursion for scientific computing. - Peter Gottschling; David S. Wise; Adwait Joshi (Int. J. Parallel Emergent Distributed Syst., 2009)