DBLP: David S. Wise

	2009
j24		Peter Gottschling, David S. Wise, Adwait Joshi: Generic support of algorithmic and structural recursion for scientific computing. IJPEDS 24(6): 479-503 (2009)
	2008
j23		Rajeev Raman, David S. Wise: Converting to and from Dilated Integers. IEEE Trans. Computers 57(4): 567-573 (2008)
	2007
j22		David S. Wise: Introduction. Commun. ACM 50(5): 24-26 (2007)
j21		K. Patrick Lorton, David S. Wise: Analyzing block locality in Morton-order and Morton-hybrid matrices. SIGARCH Computer Architecture News 35(4): 6-12 (2007)
c23		Peter Gottschling, David S. Wise, Michael D. Adams: Representation-transparent matrix algorithms with scalable performance. ICS 2007: 116-125
	2006
j20		Michael D. Adams, David S. Wise: Fast additions on masked integers. SIGPLAN Notices 41(5): 39-45 (2006)
c22		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
	2005
c21		David S. Wise, Craig Citro, Joshua Hursey, Fang Liu, Michael Rainey: A Paradigm for Parallel Matrix Algorithms: . Euro-Par 2005: 687-698
	2004
c20		Steven T. Gabriel, David S. Wise: The Opie compiler from row-major source to Morton-ordered matrices. WMPI 2004: 136-144
	2003
c19		Jeremy D. Frens, David S. Wise: Factorization with morton-ordered quadtree matrices for memory re-use and parallelism. PPOPP 2003: 144-154
	2002
j19		Kasey N. Klipsch, David S. Wise: Blood from Dahm's Turnip. Nord. J. Comput. 9(1): 66-68 (2002)
	2001
c18		David S. Wise, Jeremy D. Frens, Yuhong Gu, Gregory A. Alexander: Language support for Morton-order matrices. PPOPP 2001: 24-33
	2000
c17		David S. Wise: Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free. Euro-Par 2000: 774-783
	1999
j18		David S. Wise: Changes in ACM's Revised Copyright Policy. Commun. ACM 42(6): 116-119 (1999)
j17		David S. Wise: Undulant-Block Elimination and Integer-Preserving Matrix Inversion. Sci. Comput. Program. 33(1): 29-85 (1999)
	1998
c16		David J. Roth, David S. Wise: One-Bit Counts between Unique and Sticky. ISMM 1998: 49-56
	1997
j16		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)
c15		Jeremy D. Frens, David S. Wise: Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code. PPOPP 1997: 206-216
	1996
c14		David S. Wise, Joshua Walgenbach: Static and Dynamic Partitioning of Pointers as Links and Threads. ICFP 1996: 42-49
	1993
j15		David S. Wise: Stop-and-Copy and One-Bit Reference Counting. Inf. Process. Lett. 46(5): 243-249 (1993)
	1992
c13		Brian C. Heck, David S. Wise: An Implementation of an Applicative File System. IWMM 1992: 248-263
	1991
e3		David S. Wise (Ed.): Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), Toronto, Ontario, Canada, June 26-28, 1991. ACM 1991, isbn 0-89791-428-7
e2		David S. Wise (Ed.): Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, January 21-23, 1991. ACM Press 1991, isbn 0-89791-419-8
e1		David S. Wise (Ed.): Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), Williamsburg, Virginia, USA, April 21-24, 1991. ACM 1991, isbn 0-89791-390-6
	1990
j14		David S. Wise, John V. Franco: Costs of Quadtree Representation of Nondense Matrices. J. Parallel Distrib. Comput. 9(3): 282-296 (1990)
	1989
j13		Cordelia V. Hall, David S. Wise: Generating Function Versions with Rational Strictness Patterns. Sci. Comput. Program. 12(1): 39-74 (1989)
	1988
c12		S. Kamal Abdali, David S. Wise: Experiments with Quadtree Representation of Matrices. ISSAC 1988: 96-108
	1987
c11		David S. Wise: Matrix algebra and applicative programming. FPCA 1987: 134-153
c10		Cordelia V. Hall, David S. Wise: Compiling Strictness into Streams. POPL 1987: 132-143
	1986
c9		David S. Wise: Parallel Decomposition of Matrix Inversion Using Quadtrees. ICPP 1986: 92-99
	1985
j12		David S. Wise: Representing Matrices as Quadtrees for Parallel Processors. Inf. Process. Lett. 20(4): 195-199 (1985)
c8		David S. Wise: Design for a Multiprocessing Heap with On-board Reference Counting. FPCA 1985: 289-304
c7		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
	1980
c6		Daniel P. Friedman, David S. Wise: An Indeterminate Constructor for Applicative Programming. POPL 1980: 245-250
	1979
j11		Daniel P. Friedman, David S. Wise: Reference Counting Can Manage the Circular Environments of Mutual Recursion. Inf. Process. Lett. 8(1): 41-45 (1979)
j10		David S. Wise: Morris's Garbage Compaction Algorithm Restores Reference Counts. ACM Trans. Program. Lang. Syst. 1(1): 115-120 (1979)
c5		Daniel P. Friedman, David S. Wise: An Approach to Fair Applicative Multiprogramming. Semantics of Concurrent Computation 1979: 203-225
	1978
j9		Daniel P. Friedman, David S. Wise: A Note on Conditional Expressions. Commun. ACM 21(11): 931-933 (1978)
j8		Daniel P. Friedman, David S. Wise: Functional Combination. Comput. Lang. 3(1): 31-35 (1978)
j7		Daniel P. Friedman, David S. Wise: Unbounded Computational Structures. Softw., Pract. Exper. 8(4): 407-416 (1978)
j6		Daniel P. Friedman, David S. Wise: Aspects of Applicative Programming for Parallel Processing. IEEE Trans. Computers 27(4): 289-296 (1978)
	1977
c4		Daniel P. Friedman, David S. Wise: Aspects of Applicative Programming for File Systems (Preliminary Version). Language Design for Reliable Software 1977: 41-55
	1976
j5		David S. Wise: Referencing Lists by an Edge. Commun. ACM 19(6): 338-342 (1976)
j4		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)
j3		Daniel P. Friedman, David S. Wise: Garbage Collecting a Heap Which Includes a Scatter Table. Inf. Process. Lett. 5(6): 161-164 (1976)
j2		David S. Wise: A Strong Pumping Lemma for Context-Free Languages. Theor. Comput. Sci. 3(3): 359-369 (1976)
c3		Daniel P. Friedman, David S. Wise: CONS Should Not Evaluate its Arguments. ICALP 1976: 257-284
c2		Daniel P. Friedman, David S. Wise, Mitchell Wand: Recursive programming through table look-up. SYMSACC 1976: 85-89
	1972
j1		David S. Wise: Generalized Overlap Resolvable Grammars and Their Parsers. J. Comput. Syst. Sci. 6(6): 538-572 (1972)
	1971
c1		David S. Wise: Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars. STOC 1971: 171-184

2009

j24

Peter Gottschling, David S. Wise, Adwait Joshi: Generic support of algorithmic and structural recursion for scientific computing. IJPEDS 24(6): 479-503 (2009)

2008

j23

Rajeev Raman, David S. Wise: Converting to and from Dilated Integers. IEEE Trans. Computers 57(4): 567-573 (2008)

2007

j22

David S. Wise: Introduction. Commun. ACM 50(5): 24-26 (2007)

j21

K. Patrick Lorton, David S. Wise: Analyzing block locality in Morton-order and Morton-hybrid matrices. SIGARCH Computer Architecture News 35(4): 6-12 (2007)

c23

Peter Gottschling, David S. Wise, Michael D. Adams: Representation-transparent matrix algorithms with scalable performance. ICS 2007: 116-125

2006

j20

Michael D. Adams, David S. Wise: Fast additions on masked integers. SIGPLAN Notices 41(5): 39-45 (2006)

c22

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

2005

c21

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

2004

c20

Steven T. Gabriel, David S. Wise: The Opie compiler from row-major source to Morton-ordered matrices. WMPI 2004: 136-144

2003

c19

Jeremy D. Frens, David S. Wise: Factorization with morton-ordered quadtree matrices for memory re-use and parallelism. PPOPP 2003: 144-154

2002

j19

Kasey N. Klipsch, David S. Wise: Blood from Dahm's Turnip. Nord. J. Comput. 9(1): 66-68 (2002)

2001

c18

David S. Wise, Jeremy D. Frens, Yuhong Gu, Gregory A. Alexander: Language support for Morton-order matrices. PPOPP 2001: 24-33

2000

c17

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

1999

j18

David S. Wise: Changes in ACM's Revised Copyright Policy. Commun. ACM 42(6): 116-119 (1999)

j17

David S. Wise: Undulant-Block Elimination and Integer-Preserving Matrix Inversion. Sci. Comput. Program. 33(1): 29-85 (1999)

1998

c16

David J. Roth, David S. Wise: One-Bit Counts between Unique and Sticky. ISMM 1998: 49-56

1997

j16

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)

c15

Jeremy D. Frens, David S. Wise: Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code. PPOPP 1997: 206-216

1996

c14

David S. Wise, Joshua Walgenbach: Static and Dynamic Partitioning of Pointers as Links and Threads. ICFP 1996: 42-49

1993

j15

David S. Wise: Stop-and-Copy and One-Bit Reference Counting. Inf. Process. Lett. 46(5): 243-249 (1993)

1992

c13

Brian C. Heck, David S. Wise: An Implementation of an Applicative File System. IWMM 1992: 248-263

1991

David S. Wise (Ed.): Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), Toronto, Ontario, Canada, June 26-28, 1991. ACM 1991, isbn 0-89791-428-7

David S. Wise (Ed.): Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, January 21-23, 1991. ACM Press 1991, isbn 0-89791-419-8

David S. Wise (Ed.): Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), Williamsburg, Virginia, USA, April 21-24, 1991. ACM 1991, isbn 0-89791-390-6

1990

j14

David S. Wise, John V. Franco: Costs of Quadtree Representation of Nondense Matrices. J. Parallel Distrib. Comput. 9(3): 282-296 (1990)

1989

j13

Cordelia V. Hall, David S. Wise: Generating Function Versions with Rational Strictness Patterns. Sci. Comput. Program. 12(1): 39-74 (1989)

1988

c12

S. Kamal Abdali, David S. Wise: Experiments with Quadtree Representation of Matrices. ISSAC 1988: 96-108

1987

c11

David S. Wise: Matrix algebra and applicative programming. FPCA 1987: 134-153

c10

Cordelia V. Hall, David S. Wise: Compiling Strictness into Streams. POPL 1987: 132-143

1986

David S. Wise: Parallel Decomposition of Matrix Inversion Using Quadtrees. ICPP 1986: 92-99

1985

j12

David S. Wise: Representing Matrices as Quadtrees for Parallel Processors. Inf. Process. Lett. 20(4): 195-199 (1985)

David S. Wise: Design for a Multiprocessing Heap with On-board Reference Counting. FPCA 1985: 289-304

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

1980

Daniel P. Friedman, David S. Wise: An Indeterminate Constructor for Applicative Programming. POPL 1980: 245-250

1979

j11

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

j10

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

Daniel P. Friedman, David S. Wise: An Approach to Fair Applicative Multiprogramming. Semantics of Concurrent Computation 1979: 203-225

1978

Daniel P. Friedman, David S. Wise: A Note on Conditional Expressions. Commun. ACM 21(11): 931-933 (1978)

Daniel P. Friedman, David S. Wise: Functional Combination. Comput. Lang. 3(1): 31-35 (1978)

Daniel P. Friedman, David S. Wise: Unbounded Computational Structures. Softw., Pract. Exper. 8(4): 407-416 (1978)

Daniel P. Friedman, David S. Wise: Aspects of Applicative Programming for Parallel Processing. IEEE Trans. Computers 27(4): 289-296 (1978)

1977

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

1976

David S. Wise: Referencing Lists by an Edge. Commun. ACM 19(6): 338-342 (1976)

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)

Daniel P. Friedman, David S. Wise: Garbage Collecting a Heap Which Includes a Scatter Table. Inf. Process. Lett. 5(6): 161-164 (1976)

David S. Wise: A Strong Pumping Lemma for Context-Free Languages. Theor. Comput. Sci. 3(3): 359-369 (1976)

Daniel P. Friedman, David S. Wise: CONS Should Not Evaluate its Arguments. ICALP 1976: 257-284

Daniel P. Friedman, David S. Wise, Mitchell Wand: Recursive programming through table look-up. SYMSACC 1976: 85-89

1972

David S. Wise: Generalized Overlap Resolvable Grammars and Their Parsers. J. Comput. Syst. Sci. 6(6): 538-572 (1972)

1971

David S. Wise: Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars. STOC 1971: 171-184

1	S. Kamal Abdali	[c12] [c7]
2	Michael D. Adams 0001	[c23] [j20] [c22]
3	Gregory A. Alexander	[c18]
4	Craig Citro	[c21]
5	John V. Franco	[j14]
6	Jeremy D. Frens	[c19] [c18] [c15]
7	Daniel P. Friedman	[c6] [j11] [c5] [j9] [j8] [j7] [j6] [c4] [j4] [j3] [c3] [c2]
8	Steven T. Gabriel	[c20]
9	Peter Gottschling	[j24] [c23]
10	Yuhong Gu	[c18]
11	Cordelia V. Hall	[j13] [c10]
12	Brian C. Heck	[j16] [c13]
13	Caleb Hess	[j16]
14	Willie Hunt	[j16]
15	Joshua Hursey	[c21]
16	Adwait Joshi	[j24]
17	Kasey N. Klipsch	[j19]
18	Fang Liu	[c21]
19	K. Patrick Lorton	[j21]
20	Eric Ost	[j16]
21	Michael Rainey	[c21]
22	Rajeev Raman	[j23]
23	David J. Roth	[c16]
24	Joshua Walgenbach	[c14]
25	Mitchell Wand	[c2]

David S. Wise

Coauthor Index