default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid S. Wise
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j25]Peter Gottschling, David S. Wise, Adwait Joshi:
Generic support of algorithmic and structural recursion for scientific computing. Int. J. Parallel Emergent Distributed Syst. 24(6): 479-503 (2009)- 2008
- [j24]Rajeev Raman
, David S. Wise:
Converting to and from Dilated Integers. IEEE Trans. Computers 57(4): 567-573 (2008) - 2007
- [j23]David S. Wise:
Introduction. Commun. ACM 50(5): 24-26 (2007) - [j22]K. Patrick Lorton, David S. Wise:
Analyzing block locality in Morton-order and Morton-hybrid matrices. SIGARCH Comput. Archit. News 35(4): 6-12 (2007) - [c24]Peter Gottschling, David S. Wise, Michael D. Adams:
Representation-transparent matrix algorithms with scalable performance. ICS 2007: 116-125 - 2006
- [j21]Michael D. Adams, David S. Wise:
Fast additions on masked integers. ACM SIGPLAN Notices 41(5): 39-45 (2006) - [c23]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 - [c22]K. Patrick Lorton, David S. Wise:
Analyzing block locality in Morton-order and Morton-hybrid matrices. MEDEA@PACT 2006: 5-12 - 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
- [j20]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
1990 – 1999
- 1999
- [j19]David S. Wise:
Changes in ACM's Revised Copyright Policy. Commun. ACM 42(6): 116-119 (1999) - [j18]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
- [j17]David S. Wise, Brian C. Heck, Caleb Hess, Willie Hunt, Eric Ost:
Research Demonstration of a Hardware Reference-Counting Heap. LISP Symb. Comput. 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
- [j16]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
- [e4]David S. Wise:
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 [contents] - [e3]David S. Wise:
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 [contents] - [e2]David S. Wise:
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 [contents] - 1990
- [j15]David S. Wise, John V. Franco:
Costs of Quadtree Representation of Nondense Matrices. J. Parallel Distributed Comput. 9(3): 282-296 (1990)
1980 – 1989
- 1989
- [j14]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
- [j13]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 - 1984
- [j12]David S. Wise:
Representing matrices as quadtrees for parallel processors: extended abstract. SIGSAM Bull. 18(3): 24-25 (1984) - 1982
- [e1]David M. R. Park, Daniel P. Friedman, David S. Wise, Guy L. Steele Jr.:
Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, LFP 1980, Pittsburgh, PA, USA, August 15-18, 1982. ACM 1982, ISBN 0-89791-082-6 [contents] - 1980
- [c6]Daniel P. Friedman, David S. Wise:
An Indeterminate Constructor for Applicative Programming. POPL 1980: 245-250
1970 – 1979
- 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. Exp. 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
