The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David S. Wise: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  43. Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002