David S. Wise

发表

QR factorization with Morton-ordered quadtree matrices for memory re-use and parallelism

Jeremy D. Frens, David S. Wise, 2003, PPoPP '03.

Daniel P. Friedman, David S. Wise, 1978, CACM.

Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, LFP 1980, August 15-18, 1982, Pittsburgh, PA, USA.

Guy L. Steele, Daniel P. Friedman, David S. Wise, 1982, Symposium on LISP and Functional Programming.

One-bit Counts between Unique and Sticky Technical Report 516 July 1998

David S. Wise, David J. Roth, 1998 .

Representation-transparent matrix algorithms with scalable performance

David S. Wise, Peter Gottschling, Michael D. Adams, 2007, ICS '07.

Aspects of Applicative Programming for Parallel Processing

Daniel P. Friedman, David S. Wise, D. Friedman, 1978, IEEE Transactions on Computers.

Aspects of applicative programming for file systems (Preliminary Version)

Daniel P. Friedman, David S. Wise, 1977 .

A Strong Pumping Lemma for Context-Free Languages

David S. Wise, 1976, Theor. Comput. Sci..

Garbage Collecting a Heap Which Includes a Scatter Table

Daniel P. Friedman, David S. Wise, 1976, Inf. Process. Lett..

An indeterminate constructor for applicative programming

Daniel P. Friedman, David S. Wise, D. Friedman, 1980, POPL '80.

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

David S. Wise, 2000, Euro-Par.

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

David S. Wise, K. Patrick Lorton, 2006, MEDEA '06.

Undulant-Block Elimination and Integer-Preserving Matrix Inversion

David S. Wise, 1999, Sci. Comput. Program..

Aspects of applicative programming for file systems (Preliminary Version)

Daniel P. Friedman, David S. Wise, D. Friedman, 1977, Language Design for Reliable Software.

Compiling strictness into streams

Cordelia V. Hall, David S. Wise, 1987, POPL '87.

An Approach to Fair Applicative Multiprogramming

Daniel P. Friedman, David S. Wise, D. Friedman, 1979, Semantics of Concurrent Computation.

Boolean-valued loops

Stuart C. Shapiro, Mitchell Wand, Daniel P. Friedman, 1975 .

The one-bit reference count

Daniel P. Friedman, David S. Wise, D. Friedman, 1977 .

Functional programming

David S. Wise, 2003 .

Generalized Overlap Resolvable Grammars and Their Parsers

David S. Wise, 1972, J. Comput. Syst. Sci..

Graph algorithms in a lazy functional programming language

David S. Wise, Y. Kashiwagi, 1991 .

Tuning Garwick's algorithm for repacking sequential storage

David S. Wise, Dan C. Watson, Dan C. Watson, 1976 .

Fast additions on masked integers

David S. Wise, Michael D. Adams, 2006, SIGP.

Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code

Jeremy D. Frens, David S. Wise, 1997, PPOPP '97.

Generic support of algorithmic and structural recursion for scientific computing

David S. Wise, Peter Gottschling, Adwait Joshi, 2009, Int. J. Parallel Emergent Distributed Syst..

Representing matrices as quadtrees for parallel processors: extended abstract

David S. Wise, 1984, SIGS.

Design for a Multiprocessing Heap with On-board Reference Counting

David S. Wise, 1985, FPCA.

Blood from Dahm's Turnip

David S. Wise, Kasey N. Klipsch, Kasey N. Klipsch, 2002, Nord. J. Comput..

Matrix algebra and applicative programming

David S. Wise, 1987, FPCA.

One-bit counts between unique and sticky

David S. Wise, David J. Roth, 1998, ISMM '98.

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

David S. Wise, Michael D. Adams, 2006, MSPC '06.

Costs of Quadtree Representation of Nondense Matrices

David S. Wise, John V. Franco, J. Franco, 1990, J. Parallel Distributed Comput..

Stop-and-Copy and One-Bit Reference Counting

David S. Wise, 1993, Inf. Process. Lett..

Changes in ACM's revised copyright policy

David S. Wise, 1999, CACM.

Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation

David S. Wise, 1991, PLDI 1991.

Morris's Garbage Compaction Algorithm Restores Reference Counts

David S. Wise, 1979, TOPL.

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

Daniel P. Friedman, David S. Wise, D. Friedman, 1976, Inf. Process. Lett..

Functional Combination

Daniel P. Friedman, David S. Wise, 1978, Comput. Lang..

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

David S. Wise, Steven T. Gabriel, 2004, WMPI '04.

A Paradigm for Parallel Matrix Algorithms:

Fang Liu, David S. Wise, Joshua Hursey, 2005, Euro-Par.

Automatic time-bound analysis for high-level languages

David S. Wise, Gustavo Gomez, G. Gomez, 2007 .

Generating Function Versions with Rational Strictness Patterns

Cordelia V. Hall, David S. Wise, 1989, Sci. Comput. Program..

Unbounded computational structures

Daniel P. Friedman, David S. Wise, 1978, Softw. Pract. Exp..

Domolki's algorithm applied to generalized overlap resolvable grammars

David S. Wise, 1971, STOC.

Parallel Decomposition of Matrix Inversion Using Quadtrees

David S. Wise, 1986, ICPP.

Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming

David S. Wise, 1991, PPoPP 1991.

Referencing lists by an edge

David S. Wise, 1976, CACM.

Experiments with Quadtree Representation of Matrices

David S. Wise, S. Kamal Abdali, 1988, ISSAC.

Recursive programming through table look-up

Mitchell Wand, Daniel P. Friedman, David S. Wise, 1976, SYMSAC '76.

Compact Layouts of Banyan/FFT Networks

David S. Wise, 1981 .

CONS Should Not Evaluate its Arguments

Daniel P. Friedman, David S. Wise, D. Friedman, 1976, ICALP.

Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

David S. Wise, 1991, POPL 1991.

Reference Counting Can Manage the Circular Environments of Mutual Recursion

Daniel P. Friedman, David S. Wise, 1979, Inf. Process. Lett..

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

David S. Wise, K. Patrick Lorton, 2007, CARN.

Converting to and from Dilated Integers

Rajeev Raman, David S. Wise, R. Raman, 2008, IEEE Transactions on Computers.

Static and dynamic partitioning of pointers as links and threads

David S. Wise, Joshua Walgenbach, J. Walgenbach, 1996, ICFP '96.

The Three-register Garbage Recycler, or Nodes for Free Technical Report 4xx

David S. Wise, 1998 .

Representing Matrices as Quadtrees for Parallel Processors

David S. Wise, 1985, Inf. Process. Lett..

The Military Pension, Compensation, and Retirement of U.S. Air Force Pilots

David S. Wise, John A. Ausink, 1993 .

Matrix factorization using a block-recursive structure and block-recursive algorithms

Jeremy D. Frens, David S. Wise, 2002 .

An Implementation of an Applicative File System

David S. Wise, Brian C. Heck, 1992, IWMM.

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

David S. Wise, S. Kamal Abdali, S. K. Abdali, 1986, Mathematical Foundations of Programming Semantics.

Research Demonstration of a Hardware Reference-Counting Heap

David S. Wise, Eric Ost, Brian C. Heck, 1997, LISP Symb. Comput..

Morton-order Matrices Deserve Compilers ’ Support Technical Report 533

Jeremy D. Frens, David S. Wise, 1999 .

A Paradigm for Parallel Matrix Algorithms : ? Scalable Cholesky

David S. Wise, F. Liu, Joshua Hursey, 2022 .

Static and Dynamic Partitioning of Pointers as Links and Threads Technical Report 437

David S. Wise, Joshua WalgenbachComputer, 1996 .

Matrix Algebra and Applicative Programming* Cr Categories and Subject Descriptors: C.1.2 Multiple Data Stream Architectures (multiprocessors)]: Array and Vector Proces- Sors, Parallel Processorss D.1.1 Applicative ( F Unctional) Programming Techniques]] G.1.3 Numerical Linear Algebra]: Sparse and Ve

David S. Wise, 1987 .

Proof Without Words: A Generalization from Pythagoras

David S. Wise, 1998 .

Language support for Morton-order matrices

Jeremy D. Frens, David S. Wise, Gregory A. Alexander, 2001, PPoPP '01.

Meaning of Other Abbreviations: Clear: Clearing Dirty Marks. Reinforce: Reinforcing Connict Slots. Consolidate: Consolidating Thread Buuers. Update: Updating Reference Counters. X: Incrementing Reference Counters Due to Undetermined Slots. Reclaim: Reclaiming Garbage Objects. Figure 17: Timing Diagr

David S. Wise, C. S. Scholten, L. Lamport, 2007 .

Static and Dynamic Partitioning of Pointers as Links and Threads Technical Report 437

David S. Wise, Joshua WalgenbachComputer, 1996 .

An Implementation of an Applicative File System ? Technical Report 354 ? ?

David S. Wise, Brian C. Heck, 1992 .

Language support for Morton-order matrices

Jeremy D. Frens, David S. Wise, David S. Wise, 2001, PPoPP '01.