Dana S. Richards

41 papers A 2B 2C 1Journal 30Unranked 5
YearRankTypeTitle / Venue / Authors
2022 J jnl
Analysis of consensus sorting via the cycle metric.
J. Comb. Optim.
Ivan Avramovic, Dana S. Richards
2018 C conf
Analysis of Consensus Sorting via the Cycle Metric.
COCOA
Ivan Avramovic, Dana S. Richards
2017 J jnl
A Simple Convex Layers Algorithm.
CoRR
Raimi A. Rufai, Dana S. Richards
2017 J jnl
New Results On Routing Via Matchings On Graphs.
CoRR
Indranil Banerjee, Dana S. Richards
2016 J jnl
Routing Number Of A Pyramid.
CoRR
Indranil Banerjee, Dana S. Richards
2016 J jnl
Routing and Sorting Via Matchings On Graphs.
CoRR
Indranil Banerjee, Dana S. Richards
2016 — conf
Sorting Under Forbidden Comparisons.
SWAT
Indranil Banerjee, Dana S. Richards
2009 J jnl
Broadcasting from multiple originators.
Discret. Appl. Math.
Arthur L. Liestman, Dana S. Richards, Ladislav Stacho
1999 J jnl
Mixed Spanning Trees in Theory and Practice.
Int. J. Comput. Geom. Appl.
Dana S. Richards, Jeffrey S. Salowe
1995 J jnl
Degree-Constrained Pyramid Spanners.
J. Parallel Distributed Comput.
Dana S. Richards, Arthur L. Liestman
1995 J jnl
Tree Open Ear Decomposition in Parallel Graph Algorithms.
Parallel Process. Lett.
Louis Ibarra, Dana S. Richards
1994 J jnl
Reliable broadcasting.
Discret. Appl. Math.
Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards
1993 B conf
An Introduction to Perpetual Gossiping.
ISAAC
Arthur L. Liestman, Dana S. Richards
1993 B conf
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
MFCS
Louis Ibarra, Dana S. Richards
1993 J jnl
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
Parallel Comput.
Louis Ibarra, Dana S. Richards
1993 — conf
Mixed spanning trees: a technique for performance-driven routing.
Great Lakes Symposium on VLSI
Jeffrey S. Salowe, Dana S. Richards, Dallas E. Wrege
1993 J jnl
Network Communication in Edge-Colored Graphs: Gossiping.
IEEE Trans. Parallel Distributed Syst.
Arthur L. Liestman, Dana S. Richards
1993 J jnl
Perpetual Gossiping.
Parallel Process. Lett.
Arthur L. Liestman, Dana S. Richards
1992 J jnl
A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets.
Algorithmica
Dana S. Richards, Jeffrey S. Salowe
1992 J jnl
Stacks, Queues, and Deques with Order-Statistic Operations.
Acta Informatica
Dana S. Richards, Jeffrey S. Salowe
1992 J jnl
Steiner tree problems.
Networks
Frank K. Hwang, Dana S. Richards
1992 J jnl
Studies of self-organizing placement algorithms for linear and finger lists.
Inf. Sci.
Dana S. Richards
1991 — conf
A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes.
ICGA
James P. Cohoon, Worthy N. Martin, Dana S. Richards
1991 J jnl
A platform for biological sequence comparison on parallel computers.
Comput. Appl. Biosci.
A. S. Deshpande, Dana S. Richards, William R. Pearson
1991 J jnl
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees.
Ann. Oper. Res.
Dana S. Richards, Jeffrey S. Salowe
1991 J jnl
Distributed genetic algorithms for the floorplan design problem.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards
1990 — conf
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.
SWAT
Dana S. Richards, Jeffrey S. Salowe
1990 J jnl
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe
1990 A conf
Genetic Algorithms and Punctuated Equilibria in VLSI.
PPSN
James P. Cohoon, Worthy N. Martin, Dana S. Richards
1990 J jnl
VLSI median filters.
IEEE Trans. Acoust. Speech Signal Process.
Dana S. Richards
1989 J jnl
Fast Heuristic Algorithms for Rectilinear Steiner Trees.
Algorithmica
Dana S. Richards
1989 J jnl
On the Inference of Strategies.
Theor. Comput. Sci.
Charles Swart, Dana S. Richards
1988 A conf
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle.
ICCAD
James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe
1988 J jnl
On the Distribution of Comparisons in Sorting Algorithms.
BIT
Dana S. Richards, Pravin M. Vaidya
1988 J jnl
Optimal two-terminal α-β wire routing.
Integr.
James P. Cohoon, Dana S. Richards
1987 — conf
Punctuated Equilibria: A Parallel Genetic Algorithm.
ICGA
James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards
1986 J jnl
Data Compression and Gray-Code Sorting.
Inf. Process. Lett.
Dana S. Richards
1986 J jnl
Finding Short Cycles in Planar Graphs Using Separators.
J. Algorithms
Dana S. Richards
1984 — —
Problems in Sorting and Graph Algorithms
Dana S. Richards
1984 J jnl
Toward optimal gossiping schemes with conference calls.
Discret. Appl. Math.
Arthur L. Liestman, Dana S. Richards
1979 J jnl
On a Theorem of Chorneyko and Mohanty.
J. Comb. Theory A
Dana S. Richards