David S. Wise - RankMe

53 papers A* 6A 2B 7C 1Journal 25Unranked 11

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	Generic support of algorithmic and structural recursion for scientific computing. Int. J. Parallel Emergent Distributed Syst. Peter Gottschling, David S. Wise, Adwait Joshi
2008	J	`jnl`	Converting to and from Dilated Integers. IEEE Trans. Computers Rajeev Raman, David S. Wise
2007	J	`jnl`	Analyzing block locality in Morton-order and Morton-hybrid matrices. SIGARCH Comput. Archit. News K. Patrick Lorton, David S. Wise
2007	J	`jnl`	Introduction. Commun. ACM David S. Wise
2007	A	`conf`	Representation-transparent matrix algorithms with scalable performance. ICS Peter Gottschling, David S. Wise, Michael D. Adams
2006	—	`conf`	Analyzing block locality in Morton-order and Morton-hybrid matrices. MEDEA@PACT K. Patrick Lorton, David S. Wise
2006	J	`jnl`	Fast additions on masked integers. ACM SIGPLAN Notices Michael D. Adams, David S. Wise
2006	—	`conf`	Seven at one stroke: results from a cache-oblivious paradigm for scalable matrix algorithms. Memory System Performance and Correctness Michael D. Adams, David S. Wise
2005	—	`conf`	A Paradigm for Parallel Matrix Algorithms: . Euro-Par David S. Wise, Craig Citro, Joshua Hursey, Fang Liu, Michael Rainey
2004	—	`conf`	The Opie compiler from row-major source to Morton-ordered matrices. WMPI Steven T. Gabriel, David S. Wise
2003	B	`conf`	Factorization with morton-ordered quadtree matrices for memory re-use and parallelism. PPoPP Jeremy D. Frens, David S. Wise
2002	J	`jnl`	Blood from Dahm's Turnip. Nord. J. Comput. Kasey N. Klipsch, David S. Wise
2001	B	`conf`	Language support for Morton-order matrices. PPoPP David S. Wise, Jeremy D. Frens, Yuhong Gu, Gregory A. Alexander
2000	—	`conf`	Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free. Euro-Par David S. Wise
1999	J	`jnl`	Changes in ACM's Revised Copyright Policy. Commun. ACM David S. Wise
1999	J	`jnl`	Undulant-Block Elimination and Integer-Preserving Matrix Inversion. Sci. Comput. Program. David S. Wise
1998	C	`conf`	One-Bit Counts between Unique and Sticky. ISMM David J. Roth, David S. Wise
1997	B	`conf`	Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code. PPoPP Jeremy D. Frens, David S. Wise
1997	J	`jnl`	Research Demonstration of a Hardware Reference-Counting Heap. LISP Symb. Comput. David S. Wise, Brian C. Heck, Caleb Hess, Willie Hunt, Eric Ost
1996	A	`conf`	Static and Dynamic Partitioning of Pointers as Links and Threads. ICFP David S. Wise, Joshua Walgenbach
1993	J	`jnl`	Stop-and-Copy and One-Bit Reference Counting. Inf. Process. Lett. David S. Wise
1992	—	`conf`	An Implementation of an Applicative File System. IWMM Brian C. Heck, David S. Wise
1991	A*	`ed.`	Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, January 21-23, 1991 POPL David S. Wise
1991	A*	`ed.`	Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), Toronto, Ontario, Canada, June 26-28, 1991 PLDI David S. Wise
1991	B	`ed.`	Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), Williamsburg, Virginia, USA, April 21-24, 1991 PPoPP David S. Wise
1990	J	`jnl`	Costs of Quadtree Representation of Nondense Matrices. J. Parallel Distributed Comput. David S. Wise, John V. Franco
1989	J	`jnl`	Generating Function Versions with Rational Strictness Patterns. Sci. Comput. Program. Cordelia V. Hall, David S. Wise
1988	B	`conf`	Experiments with Quadtree Representation of Matrices. ISSAC S. Kamal Abdali, David S. Wise
1987	A*	`conf`	Compiling Strictness into Streams. POPL Cordelia V. Hall, David S. Wise
1987	—	`conf`	Matrix algebra and applicative programming. FPCA David S. Wise
1986	B	`conf`	Parallel Decomposition of Matrix Inversion Using Quadtrees. ICPP David S. Wise
1985	—	`conf`	Design for a Multiprocessing Heap with On-board Reference Counting. FPCA David S. Wise
1985	J	`jnl`	Representing Matrices as Quadtrees for Parallel Processors. Inf. Process. Lett. David S. Wise
1985	B	`conf`	Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by Name. Mathematical Foundations of Programming Semantics S. Kamal Abdali, David S. Wise
1984	J	`jnl`	Representing matrices as quadtrees for parallel processors: extended abstract. SIGSAM Bull. David S. Wise
1982	—	`ed.`	Proceedings of the 1982 ACM Symposium on LISP and Functional Programming, LFP 1980, Pittsburgh, PA, USA, August 15-18, 1982. Symposium on LISP and Functional Programming David M. R. Park, Daniel P. Friedman, David S. Wise, Guy L. Steele Jr.
1980	A*	`conf`	An Indeterminate Constructor for Applicative Programming. POPL Daniel P. Friedman, David S. Wise
1979	—	`conf`	An Approach to Fair Applicative Multiprogramming. Semantics of Concurrent Computation Daniel P. Friedman, David S. Wise
1979	J	`jnl`	Morris's Garbage Compaction Algorithm Restores Reference Counts. ACM Trans. Program. Lang. Syst. David S. Wise
1979	J	`jnl`	Reference Counting Can Manage the Circular Environments of Mutual Recursion. Inf. Process. Lett. Daniel P. Friedman, David S. Wise
1978	J	`jnl`	A Note on Conditional Expressions. Commun. ACM Daniel P. Friedman, David S. Wise
1978	J	`jnl`	Aspects of Applicative Programming for Parallel Processing. IEEE Trans. Computers Daniel P. Friedman, David S. Wise
1978	J	`jnl`	Functional Combination. Comput. Lang. Daniel P. Friedman, David S. Wise
1978	J	`jnl`	Unbounded Computational Structures. Softw. Pract. Exp. Daniel P. Friedman, David S. Wise
1977	—	`conf`	Aspects of Applicative Programming for File Systems (Preliminary Version). Language Design for Reliable Software Daniel P. Friedman, David S. Wise
1976	J	`jnl`	A Strong Pumping Lemma for Context-Free Languages. Theor. Comput. Sci. David S. Wise
1976	A*	`conf`	CONS Should Not Evaluate its Arguments. ICALP Daniel P. Friedman, David S. Wise
1976	J	`jnl`	Garbage Collecting a Heap Which Includes a Scatter Table. Inf. Process. Lett. Daniel P. Friedman, David S. Wise
1976	J	`jnl`	Output Driven Interpretation of Recursive Programs, or Writing Creates and Destroys Data Structures. Inf. Process. Lett. Daniel P. Friedman, David S. Wise
1976	—	`conf`	Recursive programming through table look-up. SYMSACC Daniel P. Friedman, David S. Wise, Mitchell Wand
1976	J	`jnl`	Referencing Lists by an Edge. Commun. ACM David S. Wise
1972	J	`jnl`	Generalized Overlap Resolvable Grammars and Their Parsers. J. Comput. Syst. Sci. David S. Wise
1971	A*	`conf`	Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars STOC David S. Wise