David S. Wise - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 49 from 49

2009

Generic support of algorithmic and structural recursion for scientific computingPeter Gottschling, David S. Wise, Adwait Joshi. paapp, 24(6):479-503, 2009. [doi]

2008

Converting to and from Dilated IntegersRajeev Raman, David S. Wise. TC, 57(4):567-573, 2008. [doi]

2007

Representation-transparent matrix algorithms with scalable performancePeter Gottschling, David S. Wise, Michael D. Adams. ics 2007: 116-125 [doi]

Analyzing block locality in Morton-order and Morton-hybrid matricesK. Patrick Lorton, David S. Wise. sigarch, 35(4):6-12, 2007. [doi]

IntroductionDavid S. Wise. CACM, 50(5):24-26, 2007. [doi]

2006

Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithmsMichael D. Adams, David S. Wise. ACMmsp 2006: 41-50 [doi]

Fast additions on masked integersMichael D. Adams, David S. Wise. SIGPLAN, 41(5):39-45, 2006. [doi]

Analyzing block locality in Morton-order and Morton-hybrid matricesK. Patrick Lorton, David S. Wise. medea 2006: 5-12 [doi]

2005

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

2004

The Opie compiler from row-major source to Morton-ordered matricesSteven T. Gabriel, David S. Wise. wmpi 2004: 136-144 [doi]

2003

Factorization with morton-ordered quadtree matrices for memory re-use and parallelismJeremy D. Frens, David S. Wise. ppopp 2003: 144-154 [doi]

2002

Blood from Dahm s TurnipKasey N. Klipsch, David S. Wise. njc, 9(1):66-68, 2002.

2001

Language support for Morton-order matricesDavid S. Wise, Jeremy D. Frens, Yuhong Gu, Gregory A. Alexander. ppopp 2001: 24-33 [doi]

2000

Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for FreeDavid S. Wise. europar 2000: 774-783 [doi]

1999

Changes in ACM s Revised Copyright PolicyDavid S. Wise. CACM, 42(6):116-119, 1999. [doi]

Undulant-Block Elimination and Integer-Preserving Matrix InversionDavid S. Wise. SCP, 33(1):29-85, 1999.

1998

One-Bit Counts between Unique and StickyDavid J. Roth, David S. Wise. iwmm 1998: 49-56 [doi]

1997

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

Research Demonstration of a Hardware Reference-Counting HeapDavid S. Wise, Brian C. Heck, Caleb Hess, Willie Hunt, Eric Ost. lisp, 10(2):159-181, 1997.

1996

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

1993

Stop-and-Copy and One-Bit Reference CountingDavid S. Wise. ipl, 46(5):243-249, 1993.

1992

An Implementation of an Applicative File SystemBrian C. Heck, David S. Wise. iwmm 1992: 248-263

1990

Costs of Quadtree Representation of Nondense MatricesDavid S. Wise, John V. Franco. jpdc, 9(3):282-296, 1990.

1989

Generating Function Versions with Rational Strictness PatternsCordelia V. Hall, David S. Wise. SCP, 12(1):39-74, 1989.

1988

Experiments with Quadtree Representation of MatricesS. Kamal Abdali, David S. Wise. issac 1989: 96-108

1987

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

Matrix algebra and applicative programmingDavid S. Wise. fpca 1987: 134-153

1986

Parallel Decomposition of Matrix Inversion Using QuadtreesDavid S. Wise. icpp 1986: 92-99

1985

Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by NameS. Kamal Abdali, David S. Wise. mfps 1986: 1-19

Design for a Multiprocessing Heap with On-board Reference CountingDavid S. Wise. fpca 1985: 289-304

Representing Matrices as Quadtrees for Parallel ProcessorsDavid S. Wise. ipl, 20(4):195-199, 1985.

1984

Representing matrices as quadtrees for parallel processors: extended abstractDavid S. Wise. cca, 18(3):24-25, 1984. [doi]

1980

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

1979

An Approach to Fair Applicative MultiprogrammingDaniel P. Friedman, David S. Wise. scc 1979: 203-225

Reference Counting Can Manage the Circular Environments of Mutual RecursionDaniel P. Friedman, David S. Wise. ipl, 8(1):41-45, 1979.

Morris s Garbage Compaction Algorithm Restores Reference CountsDavid S. Wise. TOPLAS, 1(1):115-120, 1979. [doi]

1978

Unbounded Computational StructuresDaniel P. Friedman, David S. Wise. SPE, 8(4):407-416, 1978.

A Note on Conditional ExpressionsDaniel P. Friedman, David S. Wise. CACM, 21(11):931-933, 1978.

Aspects of Applicative Programming for Parallel ProcessingDaniel P. Friedman, David S. Wise. TC, 27(4):289-296, 1978.

Functional CombinationDaniel P. Friedman, David S. Wise. Comp. Lang., Syst. \& Struct., 3(1):31-35, 1978.

1977

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

1976

Recursive programming through table look-upDaniel P. Friedman, David S. Wise, Mitchell Wand. issac 1976: 85-89 [doi]

CONS Should Not Evaluate its ArgumentsDaniel P. Friedman, David S. Wise. icalp 1976: 257-284

Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data StructuresDaniel P. Friedman, David S. Wise. ipl, 5(6):155-160, 1976.

Garbage Collecting a Heap Which Includes a Scatter TableDaniel P. Friedman, David S. Wise. ipl, 5(6):161-164, 1976.

Referencing Lists by an EdgeDavid S. Wise. CACM, 19(6):338-342, 1976.

A Strong Pumping Lemma for Context-Free LanguagesDavid S. Wise. TCS, 3(3):359-369, 1976.

1972

Generalized Overlap Resolvable Grammars and Their ParsersDavid S. Wise. jcss, 6(6):538-572, 1972.

1971

Domolki s Algorithm Applied to Generalized Overlap Resolvable GrammarsDavid S. Wise. stoc 1971: 171-184

Sign in or sign up to see more results.

runs on WebDSL