 | 2008 |
|---|
| 44 |       | Rajeev Raman,
David S. Wise:
Converting to and from Dilated Integers.
IEEE Trans. Computers 57(4): 567-573 (2008) |
| 2007 |
|---|
| 43 | | Peter Gottschling,
David S. Wise,
Michael D. Adams:
Representation-transparent matrix algorithms with scalable performance.
ICS 2007: 116-125 |
| 42 | | David S. Wise:
Introduction.
Commun. ACM 50(5): 24-26 (2007) |
| 2006 |
|---|
| 41 | | Michael D. Adams,
David S. Wise:
Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms.
Memory System Performance and Correctness 2006: 41-50 |
| 40 | | Michael D. Adams,
David S. Wise:
Fast additions on masked integers.
SIGPLAN Notices 41(5): 39-45 (2006) |
| 2005 |
|---|
| 39 | | David S. Wise,
Craig Citro,
Joshua Hursey,
Fang Liu,
Michael Rainey:
A Paradigm for Parallel Matrix Algorithms: .
Euro-Par 2005: 687-698 |
| 2004 |
|---|
| 38 | | Steven T. Gabriel,
David S. Wise:
The Opie compiler from row-major source to Morton-ordered matrices.
WMPI 2004: 136-144 |
| 2003 |
|---|
| 37 | | Jeremy D. Frens,
David S. Wise:
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism.
PPOPP 2003: 144-154 |
| 2002 |
|---|
| 36 |  | Kasey N. Klipsch,
David S. Wise:
Blood from Dahm's Turnip.
Nord. J. Comput. 9(1): 66-68 (2002) |
| 2001 |
|---|
| 35 | | David S. Wise,
Jeremy D. Frens,
Yuhong Gu,
Gregory A. Alexander:
Language support for Morton-order matrices.
PPOPP 2001: 24-33 |
| 2000 |
|---|
| 34 | | David S. Wise:
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free.
Euro-Par 2000: 774-783 |
| 1999 |
|---|
| 33 | | David S. Wise:
Changes in ACM's Revised Copyright Policy.
Commun. ACM 42(6): 116-119 (1999) |
| 32 | | David S. Wise:
Undulant-Block Elimination and Integer-Preserving Matrix Inversion.
Sci. Comput. Program. 33(1): 29-85 (1999) |
| 1998 |
|---|
| 31 | | David J. Roth,
David S. Wise:
One-Bit Counts between Unique and Sticky.
ISMM 1998: 49-56 |
| 1997 |
|---|
| 30 | | Jeremy D. Frens,
David S. Wise:
Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code.
PPOPP 1997: 206-216 |
| 29 | | David S. Wise,
Brian C. Heck,
Caleb Hess,
Willie Hunt,
Eric Ost:
Research Demonstration of a Hardware Reference-Counting Heap.
Lisp and Symbolic Computation 10(2): 159-181 (1997) |
| 1996 |
|---|
| 28 | | David S. Wise,
Joshua Walgenbach:
Static and Dynamic Partitioning of Pointers as Links and Threads.
ICFP 1996: 42-49 |
| 1993 |
|---|
| 27 | | David S. Wise:
Stop-and-Copy and One-Bit Reference Counting.
Inf. Process. Lett. 46(5): 243-249 (1993) |
| 1992 |
|---|
| 26 | | Brian C. Heck,
David S. Wise:
An Implementation of an Applicative File System.
IWMM 1992: 248-263 |
| 1990 |
|---|
| 25 | | David S. Wise,
John V. Franco:
Costs of Quadtree Representation of Nondense Matrices.
J. Parallel Distrib. Comput. 9(3): 282-296 (1990) |
| 1989 |
|---|
| 24 | | Cordelia V. Hall,
David S. Wise:
Generating Function Versions with Rational Strictness Patterns.
Sci. Comput. Program. 12(1): 39-74 (1989) |
| 1988 |
|---|
| 23 | | S. Kamal Abdali,
David S. Wise:
Experiments with Quadtree Representation of Matrices.
ISSAC 1988: 96-108 |
| 1987 |
|---|
| 22 | | David S. Wise:
Matrix algebra and applicative programming.
FPCA 1987: 134-153 |
| 21 | | Cordelia V. Hall,
David S. Wise:
Compiling Strictness into Streams.
POPL 1987: 132-143 |
| 1986 |
|---|
| 20 | | David S. Wise:
Parallel Decomposition of Matrix Inversion Using Quadtrees.
ICPP 1986: 92-99 |
| 1985 |
|---|
| 19 | | David S. Wise:
Design for a Multiprocessing Heap with On-board Reference Counting.
FPCA 1985: 289-304 |
| 18 | | S. Kamal Abdali,
David S. Wise:
Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by Name.
Mathematical Foundations of Programming Semantics 1985: 1-19 |
| 17 | | David S. Wise:
Representing Matrices as Quadtrees for Parallel Processors.
Inf. Process. Lett. 20(4): 195-199 (1985) |
| 1980 |
|---|
| 16 | | Daniel P. Friedman,
David S. Wise:
An Indeterminate Constructor for Applicative Programming.
POPL 1980: 245-250 |
| 1979 |
|---|
| 15 | | Daniel P. Friedman,
David S. Wise:
An Approach to Fair Applicative Multiprogramming.
Semantics of Concurrent Computation 1979: 203-225 |
| 14 | | David S. Wise:
Morris's Garbage Compaction Algorithm Restores Reference Counts.
ACM Trans. Program. Lang. Syst. 1(1): 115-120 (1979) |
| 13 | | Daniel P. Friedman,
David S. Wise:
Reference Counting Can Manage the Circular Environments of Mutual Recursion.
Inf. Process. Lett. 8(1): 41-45 (1979) |
| 1978 |
|---|
| 12 | | Daniel P. Friedman,
David S. Wise:
A Note on Conditional Expressions.
Commun. ACM 21(11): 931-933 (1978) |
| 11 | | Daniel P. Friedman,
David S. Wise:
Functional Combination.
Comput. Lang. 3(1): 31-35 (1978) |
| 10 | | Daniel P. Friedman,
David S. Wise:
Aspects of Applicative Programming for Parallel Processing.
IEEE Trans. Computers 27(4): 289-296 (1978) |
| 9 | | Daniel P. Friedman,
David S. Wise:
Unbounded Computational Structures.
Softw., Pract. Exper. 8(4): 407-416 (1978) |
| 1977 |
|---|
| 8 | | Daniel P. Friedman,
David S. Wise:
Aspects of Applicative Programming for File Systems (Preliminary Version).
Language Design for Reliable Software 1977: 41-55 |
| 1976 |
|---|
| 7 | | Daniel P. Friedman,
David S. Wise:
CONS Should Not Evaluate its Arguments.
ICALP 1976: 257-284 |
| 6 | | David S. Wise:
Referencing Lists by an Edge.
Commun. ACM 19(6): 338-342 (1976) |
| 5 | | Daniel P. Friedman,
David S. Wise:
Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures.
Inf. Process. Lett. 5(6): 155-160 (1976) |
| 4 | | Daniel P. Friedman,
David S. Wise:
Garbage Collecting a Heap Which Includes a Scatter Table.
Inf. Process. Lett. 5(6): 161-164 (1976) |
| 3 | | David S. Wise:
A Strong Pumping Lemma for Context-Free Languages.
Theor. Comput. Sci. 3(3): 359-369 (1976) |
| 1972 |
|---|
| 2 | | David S. Wise:
Generalized Overlap Resolvable Grammars and Their Parsers.
J. Comput. Syst. Sci. 6(6): 538-572 (1972) |
| 1971 |
|---|
| 1 | | David S. Wise:
Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars
STOC 1971: 171-184 |
