On a Theorem of Chorneyko and Mohanty. - Dana S. Richards (J. Comb. Theory A, 1979)

On a "Counter - Example". - Dana Richards (SIGARCH Comput. Archit. News, 1980)

On the file update problems. - Dana Richards (ACM SIGCSE Bull., 1981)

Note about: "On the file update problem". - Dana Richards (ACM SIGCSE Bull., 1982)

Toward optimal gossiping schemes with conference calls. - Arthur L. Liestman; Dana S. Richards (Discret. Appl. Math., 1984)

Complexity of Single-Layer Routing. - Dana Richards (IEEE Trans. Computers, 1984)

Problems in Sorting and Graph Algorithms - Dana S. Richards (1984)

Data Compression and Gray-Code Sorting. - Dana S. Richards (Inf. Process. Lett., 1986)

Finding Short Cycles in Planar Graphs Using Separators. - Dana S. Richards (J. Algorithms, 1986)

Punctuated Equilibria: A Parallel Genetic Algorithm. - James P. Cohoon; Shailesh U. Hegde; Worthy N. Martin; Dana S. Richards (ICGA, 1987)

Floorplan design using distributed genetic algorithms. - James P. Cohoon; Shailesh U. Hegde; Worthy N. Martin; Dana Richards (ICCAD, 1988)

A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle. - James P. Cohoon; Dana S. Richards; Jeffrey S. Salowe (ICCAD, 1988)

On the Distribution of Comparisons in Sorting Algorithms. - Dana S. Richards; Pravin M. Vaidya (BIT, 1988)

Optimal two-terminal α-β wire routing. - James P. Cohoon; Dana S. Richards (Integr., 1988)

Generalizations of broadcasting and gossiping. - Dana Richards; Arthur L. Liestman (Networks, 1988)

Fast Heuristic Algorithms for Rectilinear Steiner Trees. - Dana S. Richards (Algorithmica, 1989)

On the Inference of Strategies. - Charles Swart; Dana S. Richards (Theor. Comput. Sci., 1989)

Genetic Algorithms and Punctuated Equilibria in VLSI. - James P. Cohoon; Worthy N. Martin; Dana S. Richards (PPSN, 1990)

A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. - Dana S. Richards; Jeffrey S. Salowe (SWAT, 1990)

Efficient algorithms for path partitions. - Craig Williams; Dana Richards (Discret. Appl. Math., 1990)

An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle. - James P. Cohoon; Dana S. Richards; Jeffrey S. Salowe (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1990)

VLSI median filters. - Dana S. Richards (IEEE Trans. Acoust. Speech Signal Process., 1990)

A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes. - James P. Cohoon; Worthy N. Martin; Dana S. Richards (ICGA, 1991)

A simple proof of Hwang's theorem for rectilinear Steiner minimal trees. - Dana S. Richards; Jeffrey S. Salowe (Ann. Oper. Res., 1991)

A platform for biological sequence comparison on parallel computers. - A. S. Deshpande; Dana S. Richards; William R. Pearson (Comput. Appl. Biosci., 1991)

Distributed genetic algorithms for the floorplan design problem. - James P. Cohoon; Shailesh U. Hegde; Worthy N. Martin; Dana S. Richards (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1991)

Stacks, Queues, and Deques with Order-Statistic Operations. - Dana S. Richards; Jeffrey S. Salowe (Acta Informatica, 1992)

A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets. - Dana S. Richards; Jeffrey S. Salowe (Algorithmica, 1992)

Studies of self-organizing placement algorithms for linear and finger lists. - Dana S. Richards (Inf. Sci., 1992)

Steiner tree problems. - Frank K. Hwang; Dana S. Richards (Networks, 1992)

Mixed spanning trees: a technique for performance-driven routing. - Jeffrey S. Salowe; Dana S. Richards; Dallas E. Wrege (Great Lakes Symposium on VLSI, 1993)

An Introduction to Perpetual Gossiping. - Arthur L. Liestman; Dana S. Richards (ISAAC, 1993)

Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. - Louis Ibarra; Dana S. Richards (Parallel Comput., 1993)

Perpetual Gossiping. - Arthur L. Liestman; Dana S. Richards (Parallel Process. Lett., 1993)

Network Communication in Edge-Colored Graphs: Gossiping. - Arthur L. Liestman; Dana S. Richards (IEEE Trans. Parallel Distributed Syst., 1993)

Reliable broadcasting. - Luisa Gargano; Arthur L. Liestman; Joseph G. Peters; Dana S. Richards (Discret. Appl. Math., 1994)

Degree-Constrained Pyramid Spanners. - Dana S. Richards; Arthur L. Liestman (J. Parallel Distributed Comput., 1995)

Tree Open Ear Decomposition in Parallel Graph Algorithms. - Louis Ibarra; Dana S. Richards (Parallel Process. Lett., 1995)

Mixed Spanning Trees in Theory and Practice. - Dana S. Richards; Jeffrey S. Salowe (Int. J. Comput. Geom. Appl., 1999)

Multi-Source Spanning Tree Problems. - Arthur M. Farley; Paraskevi Fragopoulou; David W. Krumme; Andrzej Proskurowski; Dana Richards (J. Interconnect. Networks, 2000)

NSF Report: Theory of Computing Program. - Dana Richards (SIGACT News, 2000)

Logic and language models for computer science. - Henry Hamburger; Dana Richards (SIGACT News, 2002)

Minimizing the Statistical Impact of LSB Steganography. - Zoran Duric; Dana Richards; Younhee Kim (ICIAR, 2005)

Modified Matrix Encoding Technique for Minimal Distortion Steganography. - Younhee Kim; Zoran Duric; Dana Richards (Information Hiding, 2006)

Towards Lower Bounds on Embedding Distortion in Information Hiding. - Younhee Kim; Zoran Duric; Dana Richards (IWDW, 2006)

Limited distortion in LSB steganography. - Younhee Kim; Zoran Duric; Dana Richards (Security, Steganography, and Watermarking of Multimedia Contents, 2006)

Streaming clustering algorithms for foreground detection in color videos. - Zoran Duric; Wallace E. Lawson; Dana Richards (VISAPP (2), 2007)

Improved lower bounds on embedding distortion in information hiding. - Younhee Kim; Zoran Duric; Dana Richards (Security, Forensics, Steganography, and Watermarking of Multimedia Contents, 2008)

Statistical Geolocation of Internet Hosts. - Inja Youn; Brian L. Mark; Dana Richards (ICCCN, 2009)

Broadcasting from multiple originators. - Arthur L. Liestman; Dana S. Richards; Ladislav Stacho (Discret. Appl. Math., 2009)

The Structure of PEC Networks. - Dana Richards; Zhenlei Jia (Internet Math., 2009)

Long-term fairness with bounded worst-case losses. - Gabriel Catalin Balan; Dana Richards; Sean Luke (Auton. Agents Multi Agent Syst., 2011)

A Streaming Algorithm for the Convex Hull. - Raimi Ayinde Rufai; Dana Richards (CCCG, 2015)

On Maximal Layers Of Random Orders. - Indranil Banerjee; Dana Richards (CoRR, 2015)

Sorting Under Restrictions. - Indranil Banerjee; Dana Richards (CoRR, 2015)

Computing Maximal Layers of Points in Ef(n). - Indranil Banerjee; Dana Richards (LATIN, 2016)

Sorting Under Forbidden Comparisons. - Indranil Banerjee; Dana S. Richards (SWAT, 2016)

Routing and Sorting Via Matchings On Graphs. - Indranil Banerjee; Dana S. Richards (CoRR, 2016)

Routing Number Of A Pyramid. - Indranil Banerjee; Dana S. Richards (CoRR, 2016)

Logic and Language Models for Computer Science, Third Edition - Dana Richards; Henry Hamburger (Logic and Language Models for Computer Science (3rd Ed.), 2017)

New Results on Routing via Matchings on Graphs. - Indranil Banerjee; Dana Richards (FCT, 2017)

A Simple Convex Layers Algorithm. - Raimi A. Rufai; Dana S. Richards (CoRR, 2017)

Minimum multiple originator broadcast graphs. - Arthur L. Liestman; Dana Richards (Discret. Appl. Math., 2017)

The Set-Maxima Problem in a Geometric Setting. - Indranil Banerjee; Dana Richards (CoRR, 2018)

Sorting Networks on Restricted Topologies. - Indranil Banerjee; Dana Richards; Igor Shinkar (SOFSEM, 2019)

A Sorting Network on Trees. - Avah Banerjee; Dana Richards (Parallel Process. Lett., 2019)

Teaching Nondeterminism. - Dana Richards (SIGACT News, 2021)

Analysis of consensus sorting via the cycle metric. - Ivan Avramovic; Dana S. Richards (J. Comb. Optim., 2022)

Logic and Language Models for Computer Science, Fourth Edition - Dana Richards; Henry Hamburger (Logic and Language Models for Computer Science, 4th Ed., 2023)