
Peter Gottschling ,
David S. Wise,
and
Adwait R. Joshi.
Generic support of algorithmic and structural recursion for scientific computing.
Int. J. Parallel Emerg. Distrib. Syst.
24, 6 (2009 December), 479503.
http://dx.doi.org/10.1080/17445760902758560
Proc. Parallel/Highperformance ObjectOriented Scientific Computing (POOSC'08),
at Paphos, Cyprus.
New Mexico:Los Alamos National Labs (2008 July 8).
http://www.ccs3.lanl.gov/poosc08/finalsubs/gottschling_recursive_matrices.pdf

Rajeev Raman
and
David S. Wise.
Converting to and from Dilated Integers.
IEEE Trans. Comput.
57, 4 (2008 April), 567573.
This
authors' version
is presented to ensure timely dissemination
of scholarly and technical work. Copyright and all rights
therein are retained by other copyright holders.
All persons copying this information are expected
to adhere to the terms and constraints invoked by
copyright. In most cases, these works may not be
reposted without the explicit permission of the copyright
holder.

Peter Gottschling ,
David S. Wise,
and Michael D. Adams.
Representationtransparent
matrix algorithms with
scalable performance
.
Proc. 21st ACM Int. Conf. on Supercomputing,
New York: ACM Press
(2007 June), 116125.
©2007 by ACM, Inc.
This is the
authors' version
of the work.
It is posted here by permission of ACM for your personal use.
Not for redistribution. The definitive version
was published in Proc. ICS '07.
http://doi.acm.org/10.1145/1274971.1274989

Michael D. Adams
and
David S. Wise.
Seven at One Stroke: Results from a CacheOblivous
Paradigm for Scalable Matrix Algorithms
.
Proc. MSPC '06:
(Memory Systems Performance and Correctness)
New York: ACM Press
(2006 October), pp. 4150.
©2006 by ACM, Inc.
This is the
authors' version
of the work.
It is posted here by permission of ACM for your personal
use. Not for redistribution. The definitive version
was published in Proc. MSPC '06.
http://doi.acm.org/10.1145/1178597.1178604

K. Patrick Lorton.
and
David S. Wise.
Analyzing block locality in Mortonorder and Mortonhybrid matrices.
Proc.
MEDEA Workshop'06
(MEmory performance:
DEaling with Applications, systems and architecture),
New York: ACM Press
(2006 September), 512.
SIGARCH Comput. Archit. News
35, 4 (September 2007), 612.
©2006 by ACM, Inc.
This is the
authors' version
of the work.
It is posted here by permission of ACM for your personal
use. Not for redistribution. The definitive version
was published in Proc. MEDEA '06.
http://doi.acm.org/10.1145/1166133.1166134

Michael D. Adams.
and
David S. Wise.
Fast Additions on Masked Integers.
SIGPLAN Not.
41, 5 (May 2006), 3945.
©2006 by ACM, Inc.
This is the
authors' version
of the work.
It is posted here by permission of ACM for your personal
use. Not for redistribution. The definitive version
was published in
SIGPLAN Not. 41, 5 (May 2006).
http://doi.acm.org/10.1145/1149982.1149987

David S. Wise,
Craig L. Citro,
Joshua J. Hursey,
Fang Liu, and
Michael A. Rainey.
A Paradigm for Parallel Matrix Algorithms: Scalable Cholesky.
In J. C. Cuhha and P. D. Medeiros (Eds.),
Proc. EuroPar'05,
Lecture Notes in Computer Science 3648,
Berlin: Springer (August 2005), 687698.
Authors' version
.

Michael A. Rainey
and
David S. Wise.
Embedding Quadtree Matrices in a Functional Language.
Submitted for publication (2004).
Authors' version
.

Steven T. Gabriel.
and
David S. Wise.
The Opie Compiler: from Rowmajor Source to Mortonordered Matrices.
Proc. 3rd Workshop on Memory Performance Issues (WMPI2004),
,
New York: ACM Press,
(2004), 136144.
©2004 by ACM, Inc.
This is the
authors' version
of the work.
It is posted here by permission of ACM for your personal
use. Not for redistribution. The definitive version
was published in Proc. WMPI2004.
http://doi.acm.org/10.1145/1054943.1054962

Jeremy D. Frens and
David S. Wise.
QR factorization with Mortonordered quadtree matrices
for memory reuse and parallelism.
Proc. 2003 ACM Symp. on Principles and Practice of Parallel Programming,
SIGPLAN Not.
38,
10 (2003 October),
144154.
©2003 by ACM, Inc.
This is the
authors' version
of the work.
It is posted here by permission of ACM for your personal
use. Not for redistribution. The definitive version
was published in
SIGPLAN Not. 38, 10 (October 2003).
http://doi.acm.org/10.1145/781498.781525

David S. Wise,
Jeremy D. Frens, Yuhong Gu, and
Gregory A. Alexander.
Language support for Mortonorder matrices.
Proc. 2001 ACM Symp. on Principles and Practice of Parallel Programming,
SIGPLAN Not.
36, 7 (2001 July), 2433.
©2001 by ACM, Inc.
This is the
authors' version
of the work.
It is posted here by permission of ACM for your personal
use. Not for redistribution. The definitive version
was published in
SIGPLAN Not. 36, 7 (July 2001).
http://doi.acm.org/10.1145/379539.379559

David S. Wise.
Ahnentafel indexing into Mortonordered arrays, or matrix locality for free.
In A. Bode, T. Ludwig, R. Wismüller (eds.),
EuroPar 2000
 Parallel Processing,
Lecture Notes in Computer Science
1900,
Berlin: Springer
(2000 August), 774784.
Author's version.

David S. Wise
and
Jeremy D. Frens.
Mortonorder matrices deserve compilers' support.
Technical Report 533.
Computer Science Department,
Indiana University
(1999 November).

David S. Wise.
Undulant block elimination and integerpreserving
matrix inversion.
Sci. Comput. Program
33, 1 (1999 January), 2985.
Math Review
1 653 749.
Abstract only:
SIGSAM Bull.
29 (1995 June), 28.
Author's version.

Jeremy D. Frens
and
David S. Wise.
Autoblocking matrixmultiplication, or Tracking BLAS3 performance from
source code.
Proc. 1997 ACM Symp. on Principles and Practice of Parallel Programming,
SIGPLAN Not.
32, 7 (1997 July), 206216.
Authors' version.

Jeremy D. Frens.
and
David S. Wise
Matrix Inversion using Quadtrees Implemented in Gofer.
Technical Report 433.
Computer Science Department,
Indiana University
(1995 May).

David S. Wise.
Matrix algorithms using quadtrees (Invited talk).
In G. Hains and L. M. R. Mullin (eds.),
ATABLE92, Second Intl. Workshop on Array Structures.
Publ. 841,
Dépt. d'Informatique et recherche opérationnelle,
Univ. de Montréal (1992 November).
Author's version.

David S. Wise and
John Franco.
Costs of quadtree representation of nondense matrices.
J. Parallel Distrib. Comput.
9, 3 (1990 July), 282296.

S. Kamal Abdali
and
David S. Wise.
Experiments with quadtree representation of matrices.
In P. Gianni (ed.),
Proc. ISSAC 88,
Lecture Notes in Computer Science
358,
Berlin: Springer (1989), 96108.

David S. Wise.
Matrix algebra and applicative programming.
Functional Programming Languages and Computer Architecture,
Lecture Notes in Computer Science
274,
Berlin: Springer (1987), 134153.
Author's version
.

David S. Wise.
Parallel decomposition of matrix inversion using quadtrees.
Proc. 1986 Intl. Conf. on Parallel Processing
(IEEE Cat. No. 86CH23556), 9299.
Math Review
954 655.

David S. Wise.
Representing matrices as quadtrees for parallel processors.
Inf. Process. Lett.
20 (1985 May), 195199.
Math Review
86j:65204.
Extended abstract:
SIGSAM Bull.
18, 3 (1984 August), 2425.

David J. Roth and
David S. Wise.
Onebit counts between unique and sticky.
Proc. Intl. Symp. on Memory Management (ISMM '98),
SIGPLAN Not.
34, 3 (1999 March), 4956.
10.1145/301589.286866
Authors' version.

David S. Wise,
B. Heck,
C. Hess,
W. Hunt, and
E. Ost.
Research demonstration of a hardware referencecounting heap.
Lisp Symb. Comput.
10, 2 (1997 July), 159181.
10.1023/A:1007715101339
Authors' version.

David S. Wise
and
Joshua Walgenbach.
Static and dynamic partitioning of pointers as links and threads.
Proc. 1996 ACM SIGPLAN Intl. Conf. on Functional Programming,
SIGPLAN Not.
31, 6 (1996 June), 4249.
10.1145/232629.232634
Authors' version.

David S. Wise.
Stopandcopy and onebit reference counting.
Inf. Process. Lett.
46, 5 (1993 July), 243249.
10.1016/00200190(93)90103G
Author's version.

David S. Wise.
Design for a multiprocessing heap with onboard reference counting.
In J.P. Jouannaud (ed.),
Functional Programming Languages and Computer Architecture,
Lecture Notes in Computer Science
201,
Berlin, Springer (1985), 289304.
10.1007/3540159754_43

David S. Wise.
Morris's garbage compaction algorithm restores reference counts.
ACM Trans. Program. Lang. Syst.
1, 1. (July, l979), 115120.
10.1145/357062.357070

Daniel P. Friedman
and
David S. Wise.
Reference counting can manage the circular environments of mutual recursion.
Inf. Process. Lett.
8, 1 (1979 January), 4145.
10.1016/00200190(79)900917

David S. Wise.
The doublebuddy system.
Technical Report 79.
Computer Science Department,
Indiana University
(1978 December).

David S. Wise and Daniel P. Friedman.
The onebit reference count.
BIT 17, 3 (1977 September), 351359.
10.1007/10.1007/BF01932156

David S. Wise and Daniel C. Watson.
Tuning Garwick's algorithm for repacking sequential storage.
BIT 16,
4 (1976 December), 442450.
10.1007/BF01932727

Daniel P. Friedman and
David S. Wise.
Garbage collecting a heap which includes a scatter table.
Inf. Process. Lett.
5, 6 (1976 December), 161164.
10.1016/00200190(76)900119

Michael A. Rainey.
and
David S. Wise.
Embedding Quadtree Matrices in a Functional Language.
Submitted for publication (2004).
Authors' version
.

David S. Wise.
Functional programming (derived work).
In E. D. Reilly (ed.),
Concise Encyclopedia of Computer Science,
Chichester: John Wiley & Sons (2004), 339341.

David S. Wise.
Functional programming (completely revised). In A. Ralston, E. D. Reilly, and
D. Hammendinger (eds.),
Encyclopedia of Computer Science
(4th ed.),
New York: Grove's Dictionaries (2000), 736739.

David S. Wise.
Functional programming (revised). In A. Ralston and E. D. Reilly (eds.),
Encyclopedia of Computer Science
(3rd ed.),
New York: Van Nostrand Reinhold (1993), 573576.

Brian Heck and
David S. Wise.
An implementation of an applicative file system.
In Y. Bekkers and J. Cohen (eds.),
Memory Management,
Lecture Notes in Computer Science
637,
Berlin: Springer (1992), 248263.
Authors' version.

Yugo Kashiwagi
and
David S. Wise.
Graph algorithms in a lazy functional programming language.
Proc. 4th Intl. Symp. on Lucid and Intensional Programming.
Menlo Park, CA:
SRI Intl. (1991 April), 3546.
Authors' version.

Cordelia V. Hall
and
David S. Wise.
Compiling strictness into streams.
Conf. Rec. 14th ACM Symp. on Principles of Programming Languages
(1987 January), 132143.

David S. Wise.
The applicative style of programming.
Abacus 2, 2 (Winter 1985), New York: Springer, 2032 + cover.

David S. Wise.
Functional programming. In A. Ralston (ed.),
Encyclopedia of Computer Science
(2nd ed.),
New York: Van Nostrand Reinhold (1983), 647650.

Daniel P. Friedman and
David S. Wise.
Fancy ferns require little care.
In S. Holmstrom, B. Nordstrom, and A. Wikstrom (eds.),
Symp. on Functional Languages and Computer Architecture,
Lab for Programming Methodology, Goteborg, Sweden
(1981), 124156.
Authors' version.

David S. Wise.
Interpreters for Functional Programming.
In J. Darlington, P. Henderson, and D. Turner (eds.),
Functional Programming and its Applications,
Cambridge University Press (1982), 253280.
Author's version.

Daniel P. Friedman and
David S. Wise.
An indeterminate constructor for applicative multiprogramming,
Conf. Rec. 7th ACM Symp. on Principles of Programming Languages
(1980 January), 245250.

Daniel P. Friedman and
David S. Wise.
An approach to fair applicative multiprogramming.
In G. Kahn (ed.),
Semantics of Concurrent Computation,
Lecture Notes in Computer Science
70,
Berlin, Springer (1979), 203225.

Daniel P. Friedman and
David S. Wise.
A note on conditional expressions.
Commun. ACM
21, 11 (1978 November), 93l933.

Daniel P. Friedman and
David S. Wise.
Unbounded computational structures.
Softw. Pract. Exper.
8, 4 (1978 JulyAugust), 407416.

Daniel P. Friedman and
David S. Wise.
Aspects of applicative programming for parallel processing.
IEEE Trans. Comput.
C27, 4 (1978 April), 289296.
This
authors' version
is presented to ensure timely dissemination
of scholarly and technical work. Copyright and all rights
therein are retained by other copyright holders.
All persons copying this information are expected
to adhere to the terms and constraints invoked by
copyright. In most cases, these works may not be
reposted without the explicit permission of the copyright
holder.

Daniel P. Friedman and
David S. Wise.
Aspects of applicative programming for file systems .
Proc. ACM Conf. on Language Design for Reliable Software,
SIGPLAN Not.
12, 3 (1977 March), 4155.

Daniel P. Friedman and
David S. Wise.
An environment for multiplevalued recursive procedures.
In B. Robinet (ed.),
Programmation,
Paris: Dunod Informatique
(1977), 182200.

Daniel P. Friedman and
David S. Wise.
Outputdriven interpretation of recursive programs, or writing creates and destr
oys data structures.
Inf. Process. Lett.
5,
6 (1976 December), 155160.

Daniel P. Friedman and
David S. Wise.
The impact of applicative programming on multiprocessing.
Proc. 1976 Intl. Conf. on Parallel Processing
(IEEE Cat. No. 76CH1127OC), 263272.

Daniel P. Friedman,
Mitchell Wand,
and
David S. Wise.
Recursive programming through table lookup.
Proc. 1976 ACM Symp. on Symbolic and Algebraic Computation
(1976), 8589.

Cordelia V. Hall
and
David S. Wise.
Generating function versions with rational strictness patterns.
Sci. Comput. Program.
12 (1989), 3974.
Math Review
1 003 288.

S. Kamal Abdali
and
David S. Wise.
Standard, storeless semantics for ALGOLstyle block structure.
In A. Melton (ed.),
Mathematical Foundations of Programming Semantics,
Lecture Notes in Computer Science
239,
Berlin: Springer (1986), 119.
Math Review 874 373

Daniel P. Friedman and
David S. Wise.
Stingunless:
a conditional, interlockfree store instruction.
In M. B. Pursley and J. B. Cruz, Jr. (eds.),
Proc. 16th Annual Allerton Conf. on Communication,
Control, and Computing,"
Urbana: University of Illinois
(1978), 578584.

Daniel P. Friedman and
David S. Wise.
Functional combination.
Comput. Lang. 3, 1 (1978), 3135.

Daniel P. Friedman and
David S. Wise.
Cons
should not evaluate its arguments.
In S. Michaelson and R. Milner (eds.),
Automata, Languages and Programming,
Edinburgh University
Press
(1976), 257284.

David S. Wise.
A strong pumping lemma for context free languages.
Theor. Comput. Sci.
3,
3 (1976 December), 359369.
Math Review
57 #4678.

David S. Wise,
Daniel P. Friedman,
Stuart C. Shapiro,
and Mitchell Wand,
Booleanvalued loops.
BIT 15,
4 (1975 December), 431451.

David S. Wise.
Generalized overlap resolvable grammars and their parsers.
J. Comput. Syst. Sci.
6, 6 (1972 December), 538572.
Math Review
54 #11868.

David S. Wise.
Domolki's algorithm applied to generalized overlap resolvable grammars.
Proc. 3rd Annual ACM Symposium on Theory of Computing.
New York: ACM Press
(1971 May), 171184.

David S. Wise.
ACM at 60: a look back in time
,
Commun. ACM
50, 5 (2007 May), 2426.

Kasey Klipsch
and
David S. Wise.
Blood from Dahm's turnip.
Nordic J. Comput.
9, 1 (2002 Spring), 6668.
Authors' version.

David S. Wise.
Changes in ACM's revised copyright policy.
Commun. ACM
42, 6 (1999 June), 116119.

David S. Wise.
Proof without words: A generalization from Pythagoras.
Math. Mag.
71,
1 (1998 February), 64.
http://www.jstor.org/stable/2691348
Reprinted in
Roger B. Nelsen,
Proofs Without Words II,
Washington:
The Mathematical Assn. of America
(2000), 9.
Author's version: Apollonius's parallelogram theorem.
A very cool
animation
due to ShangChing Chou.

David S. Wise.
On applying for a United States passport.
Computer Professionals for Social Responsibility,
Palo Alto, CA (1993).

David S. Wise.
Compact layout of banyan/FFT networks.
In H. Kung, B. Sproull, and G. Steele (eds.),
VLSI Systems and Computations,
Rockville, MD: Computer Science Press (1981), 186195.

David S. Wise.
Referencing lists by an edge.
Commun. ACM
19,
6 (1976 June), 338342.