| 1999 |
|---|
| 24 | | Dana S. Richards,
Jeffrey S. Salowe:
Mixed Spanning Trees in Theory and Practice.
Int. J. Comput. Geometry Appl. 9(3): 277-292 (1999) |
| 1995 |
|---|
| 23 | | Dana S. Richards,
Arthur L. Liestman:
Degree-Constrained Pyramid Spanners.
J. Parallel Distrib. Comput. 25(1): 1-6 (1995) |
| 22 | | Louis Ibarra,
Dana S. Richards:
Tree Open Ear Decomposition in Parallel Graph Algorithms.
Parallel Processing Letters 5: 129-138 (1995) |
| 1994 |
|---|
| 21 | | Luisa Gargano,
Arthur L. Liestman,
Joseph G. Peters,
Dana S. Richards:
Reliable broadcasting.
Discrete Applied Mathematics 53(1-3): 135-148 (1994) |
| 1993 |
|---|
| 20 | | Arthur L. Liestman,
Dana S. Richards:
An Introduction to Perpetual Gossiping.
ISAAC 1993: 259-266 |
| 19 | | Louis Ibarra,
Dana S. Richards:
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
MFCS 1993: 506-516 |
| 18 | EE | Arthur L. Liestman,
Dana S. Richards:
Network Communication in Edge-Colored Graphs: Gossiping.
IEEE Trans. Parallel Distrib. Syst. 4(4): 438-445 (1993) |
| 17 | | Louis Ibarra,
Dana S. Richards:
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
Parallel Computing 19(8): 873-886 (1993) |
| 16 | | Arthur L. Liestman,
Dana S. Richards:
Perpetual Gossiping.
Parallel Processing Letters 3: 347-355 (1993) |
| 1992 |
|---|
| 15 | | Dana S. Richards,
Jeffrey S. Salowe:
Stacks, Queues, and Deques with Order-Statistic Operations.
Acta Inf. 29(5): 395-414 (1992) |
| 14 | | Dana S. Richards,
Jeffrey S. Salowe:
A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets.
Algorithmica 7(2&3): 247-276 (1992) |
| 13 | EE | Dana S. Richards:
Studies of self-organizing placement algorithms for linear and finger lists.
Inf. Sci. 63(1-2): 153-172 (1992) |
| 1991 |
|---|
| 12 | | James P. Cohoon,
Worthy N. Martin,
Dana S. Richards:
A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes.
ICGA 1991: 244-248 |
| 11 | EE | James P. Cohoon,
Shailesh U. Hegde,
Worthy N. Martin,
Dana S. Richards:
Distributed genetic algorithms for the floorplan design problem.
IEEE Trans. on CAD of Integrated Circuits and Systems 10(4): 483-492 (1991) |
| 1990 |
|---|
| 10 | | James P. Cohoon,
Worthy N. Martin,
Dana S. Richards:
Genetic Algorithms and Punctuated Equilibria in VLSI.
PPSN 1990: 134-144 |
| 9 | | Dana S. Richards,
Jeffrey S. Salowe:
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.
SWAT 1990: 201-212 |
| 8 | EE | James P. Cohoon,
Dana S. Richards,
Jeffrey S. Salowe:
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle.
IEEE Trans. on CAD of Integrated Circuits and Systems 9(4): 398-407 (1990) |
| 1989 |
|---|
| 7 | | Dana S. Richards:
Fast Heuristic Algorithms for Rectilinear Steiner Trees.
Algorithmica 4(2): 191-207 (1989) |
| 6 | | Charles Swart,
Dana S. Richards:
On the Inference of Strategies.
Theor. Comput. Sci. 67(1): 5-18 (1989) |
| 1988 |
|---|
| 5 | | Dana S. Richards,
Pravin M. Vaidya:
On the Distribution of Comparisons in Sorting Algorithms.
BIT 28(4): 764-774 (1988) |
| 1987 |
|---|
| 4 | | James P. Cohoon,
Shailesh U. Hegde,
Worthy N. Martin,
Dana S. Richards:
Punctuated Equilibria: A Parallel Genetic Algorithm.
ICGA 1987: 148-154 |
| 1986 |
|---|
| 3 | | Dana S. Richards:
Data Compression and Gray-Code Sorting.
Inf. Process. Lett. 22(4): 201-205 (1986) |
| 2 | | Dana S. Richards:
Finding Short Cycles in Planar Graphs Using Separators.
J. Algorithms 7(3): 382-394 (1986) |
| 1979 |
|---|
| 1 | | Dana S. Richards:
On a Theorem of Chorneyko and Mohanty.
J. Comb. Theory, Ser. A 27(3): 392-393 (1979) |
