Henry D. Shapiro

2001
8	EE	Bernard M. E. Moret, Henry D. Shapiro: Algorithms and Experiments: The New (and Old) Methodology. J. UCS 7(5): 434-446 (2001)
1993
7		Paul Helman, Bernard M. E. Moret, Henry D. Shapiro: An Exact Characterization of Greedy Structures. SIAM J. Discrete Math. 6(2): 274-283 (1993)
1992
6		Paul Helman, Bernard M. E. Moret, Henry D. Shapiro: An Exact Characterization of Greedy Structures. IPCO 1992: 287-297
1991
5		Bernard M. E. Moret, Henry D. Shapiro: How to Find a Minimum Spanning Tree in Practice. New Results and New Trends in Computer Science 1991: 192-203
4		Bernard M. E. Moret, Henry D. Shapiro: An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. WADS 1991: 400-411
3		Craig A. Morgenstern, Henry D. Shapiro: Heuristics for Rapidly Four-Coloring Large Planar Graphs. Algorithmica 6(6): 869-891 (1991)
1986
2		Raymond A. Archuleta, Henry D. Shapiro: A Fast Probabilistic Algorithm for Four-Coloring Large Planar Graphs. FJCC 1986: 595-599
1978
1		Henry D. Shapiro: Theoretical Limitations on the Efficient Use of Parallel Memories. IEEE Trans. Computers 27(5): 421-428 (1978)

Coauthor Index

1	Raymond A. Archuleta	[2]
2	Paul Helman	[6] [7]
3	Bernard M. E. Moret	[4] [5] [6] [7] [8]
4	Craig A. Morgenstern	[3]

Colors in the list of coauthors