2002 |
21 | EE | Sandeep N. Bhatt,
Shimon Even,
David S. Greenberg,
Rafi Tayar:
Traversing Directed Eulerian Mazes.
J. Graph Algorithms Appl. 6(2): 157-173 (2002) |
2000 |
20 | EE | Sandeep N. Bhatt,
Shimon Even,
David S. Greenberg,
Rafi Tayar:
Traversing Directed Eulerian Mazes.
WG 2000: 35-46 |
19 | | Ron Brightwell,
Lee Ann Fisk,
David S. Greenberg,
Trammell Hudson,
Michael Levenhagen,
Arthur B. Maccabe,
Rolf Riesen:
Massively parallel computing using commodity components.
Parallel Computing 26(2-3): 243-266 (2000) |
1999 |
18 | | David E. Womble,
Sudip S. Dosanjh,
Bruce Hendrickson,
Michael A. Heroux,
Steve Plimpton,
James L. Tomkins,
David S. Greenberg:
Massively parallel computing: A Sandia perspective.
Parallel Computing 25(13-14): 1853-1876 (1999) |
17 | | Sandeep N. Bhatt,
David S. Greenberg,
Frank Thomson Leighton,
Pangfeng Liu:
Tight Bounds for On-Line Tree Embeddings.
SIAM J. Comput. 29(2): 474-491 (1999) |
1997 |
16 | EE | David Bruce Wilson,
David S. Greenberg,
Cynthia A. Phillips:
Beyond islands (extended abstract): runs in clone-probe matrices.
RECOMB 1997: 320-329 |
15 | | David E. Womble,
David S. Greenberg:
Parallel I/O: An Introduction.
Parallel Computing 23(4-5): 403-417 (1997) |
1996 |
14 | | David S. Greenberg,
James K. Park,
Eric J. Schwabe:
The Cost of Complex Communication on Simple Networks.
J. Parallel Distrib. Comput. 35(2): 133-141 (1996) |
1995 |
13 | EE | Yehuda Afek,
David S. Greenberg,
Michael Merritt,
Gadi Taubenfeld:
Computing With Faulty Shared Objects.
J. ACM 42(6): 1231-1274 (1995) |
12 | | David S. Greenberg,
Sorin Istrail:
Physical Mapping by STS Hybridization: Algorithmic Strategies and the Challenge of Software Evaluation.
Journal of Computational Biology 2(2): 219-273 (1995) |
1994 |
11 | EE | David E. Womble,
David S. Greenberg,
Stephen R. Wheat,
Robert E. Benner,
Marc S. Ingber,
Greg Henry,
Satya Gupta:
Applications of boundary element methods on the Intel Paragon.
SC 1994: 680-684 |
10 | EE | David S. Greenberg,
Sorin Istrail:
The Chimeric Mapping Problem: Algorithmic Strategies and Performance Evaluation on Synthetic Genomic Data.
Computers & Chemistry 18(3): 207-220 (1994) |
1993 |
9 | EE | David S. Greenberg:
Efficient Wiring of Reconfigurable Parallel Processors.
SPAA 1993: 318-324 |
8 | | David S. Greenberg,
James K. Park,
Eric J. Schwabe:
Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns.
SPDP 1993: 276-283 |
1992 |
7 | | Yehuda Afek,
David S. Greenberg,
Michael Merritt,
Gadi Taubenfeld:
Computing with Faulty Shared Memory (Extended Abstract).
PODC 1992: 47-58 |
6 | | David S. Greenberg,
Gadi Taubenfeld,
Da-Wei Wang:
Choice Coordination with Multiple Alternatives (Preliminary Version).
WDAG 1992: 54-68 |
1991 |
5 | | Sandeep N. Bhatt,
David S. Greenberg,
Frank Thomson Leighton,
Pangfeng Liu:
Tight Bounds for On-Line Tree Embeddings.
SODA 1991: 344-350 |
4 | | David S. Greenberg,
Sandeep N. Bhatt:
Routing Multiple Paths in Hypercubes.
Mathematical Systems Theory 24(4): 295-321 (1991) |
1990 |
3 | EE | David S. Greenberg,
Sandeep N. Bhatt:
Routing Multiple Paths in Hypercubes.
SPAA 1990: 45-54 |
2 | | David S. Greenberg,
Lenwood S. Heath,
Arnold L. Rosenberg:
Optimal Embeddings of Butterfly-Like Graphs in the Hypercube.
Mathematical Systems Theory 23(1): 61-77 (1990) |
1984 |
1 | | David S. Greenberg,
Annie W. Shum:
Performance Analysis of I/O Subchannel Skews.
Int. CMG Conference 1984: 189-194 |