Dana S. Richards
According to our database^{1},
Dana S. Richards
authored at least 55 papers
between 1979 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2019
Sorting Networks on Restricted Topologies.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019
2018
Analysis of Consensus Sorting via the Cycle Metric.
Proceedings of the Combinatorial Optimization and Applications, 2018
2017
Minimum multiple originator broadcast graphs.
Discrete Applied Mathematics, 2017
New Results on Routing via Matchings on Graphs.
Proceedings of the Fundamentals of Computation Theory  21st International Symposium, 2017
2016
Sorting Under Forbidden Comparisons.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
Computing Maximal Layers of Points in E^{f(n)}.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016
2015
A Streaming Algorithm for the Convex Hull.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015
2011
Longterm fairness with bounded worstcase losses.
Autonomous Agents and MultiAgent Systems, 2011
2009
The Structure of PEC Networks.
Internet Mathematics, 2009
Broadcasting from multiple originators.
Discrete Applied Mathematics, 2009
Statistical Geolocation of Internet Hosts.
Proceedings of the 18th International Conference on Computer Communications and Networks, 2009
2008
Improved lower bounds on embedding distortion in information hiding.
Proceedings of the Security, 2008
2007
Streaming clustering algorithms for foreground detection in color videos.
Proceedings of the VISAPP 2007: Proceedings of the Second International Conference on Computer Vision Theory and Applications, Barcelona, Spain, March 811, 2007, 2007
2006
Limited distortion in LSB steganography.
Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents VIII, 2006
Towards Lower Bounds on Embedding Distortion in Information Hiding.
Proceedings of the Digital Watermarking, 5th International Workshop, 2006
Modified Matrix Encoding Technique for Minimal Distortion Steganography.
Proceedings of the Information Hiding, 8th International Workshop, 2006
2005
Minimizing the Statistical Impact of LSB Steganography.
Proceedings of the Image Analysis and Recognition, Second International Conference, 2005
2002
Logic and language models for computer science.
SIGACT News, 2002
2000
NSF Report: Theory of Computing Program.
SIGACT News, 2000
1999
Mixed Spanning Trees in Theory and Practice.
Int. J. Comput. Geometry Appl., 1999
MultiSource Spanning Tree Problems.
Proceedings of the SIROCCO'99, 1999
1995
Tree Open Ear Decomposition in Parallel Graph Algorithms.
Parallel Processing Letters, 1995
DegreeConstrained Pyramid Spanners.
J. Parallel Distrib. Comput., 1995
1994
Reliable broadcasting.
Discrete Applied Mathematics, 1994
1993
Network Communication in EdgeColored Graphs: Gossiping.
IEEE Trans. Parallel Distrib. Syst., 1993
Perpetual Gossiping.
Parallel Processing Letters, 1993
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
An Introduction to Perpetual Gossiping.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993
Mixed spanning trees: a technique for performancedriven routing.
Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993
1992
Steiner tree problems.
Networks, 1992
Studies of selforganizing placement algorithms for linear and finger lists.
Inf. Sci., 1992
A LinearTime Algorithm To Construct a Rectilinear Steiner Minimal Tree for kExtremal Point Sets.
Algorithmica, 1992
Stacks, Queues, and Deques with OrderStatistic Operations.
Acta Inf., 1992
1991
Distributed genetic algorithms for the floorplan design problem.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1991
A platform for biological sequence comparison on parallel computers.
Computer Applications in the Biosciences, 1991
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees.
Annals OR, 1991
A MultiPopulation Genetic Algorithm for Solving the KPartition Problem on HyperCubes.
Proceedings of the 4th International Conference on Genetic Algorithms, 1991
1990
VLSI median filters.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1990
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, 1990
Efficient algorithms for path partitions.
Discrete Applied Mathematics, 1990
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets.
Proceedings of the SWAT 90, 1990
Genetic Algorithms and Punctuated Equilibria in VLSI.
Proceedings of the Parallel Problem Solving from Nature, 1st Workshop, 1990
1989
On the Inference of Strategies.
Theor. Comput. Sci., 1989
Fast Heuristic Algorithms for Rectilinear Steiner Trees.
Algorithmica, 1989
1988
Generalizations of broadcasting and gossiping.
Networks, 1988
Optimal twoterminal αβ wire routing.
Integration, 1988
On the Distribution of Comparisons in Sorting Algorithms.
BIT, 1988
A lineartime Steiner tree routing algorithm for terminals on the boundary of a rectangle.
Proceedings of the 1988 IEEE International Conference on ComputerAided Design, 1988
Floorplan design using distributed genetic algorithms.
Proceedings of the 1988 IEEE International Conference on ComputerAided Design, 1988
1987
Punctuated Equilibria: A Parallel Genetic Algorithm.
Proceedings of the 2nd International Conference on Genetic Algorithms, 1987
1986
Finding Short Cycles in Planar Graphs Using Separators.
J. Algorithms, 1986
Data Compression and GrayCode Sorting.
Inf. Process. Lett., 1986
1984
Complexity of SingleLayer Routing.
IEEE Trans. Computers, 1984
Toward optimal gossiping schemes with conference calls.
Discrete Applied Mathematics, 1984
1979
On a Theorem of Chorneyko and Mohanty.
J. Comb. Theory, Ser. A, 1979