Dana S. Richards | Academic Influence

Dana S. Richards's AcademicInfluence.com Rankings

Dana S. Richards

Mathematics

#2755

World Rank

#4187

Historical Rank

Measure Theory

#3677

World Rank

#4338

Historical Rank

mathematics Degrees

Dana S. Richards

Computer Science

#7372

World Rank

#7763

Historical Rank

computer-science Degrees

Download Badge

Mathematics
Computer Science

Dana S. Richards's Degrees

PhD Computer Science Purdue University
Masters Computer Science Purdue University

Similar Degrees You Can Earn

Why Is Dana S. Richards Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Dana S. Richards is a writer, mathematics popularizer and Associate Professor in Computer Science at George Mason University. His research interests include comparisons of protein sequences, Steiner tree algorithms, information dissemination in networks, parallel heuristics, methodology for computationally intractable problems and parallel algorithms for median filters. He is the longtime bibliographer of polymath Martin Gardner.

(See a Problem?)

Dana S. Richards's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Steiner tree problems (1992) (447)
Punctuated Equilibria: A Parallel Genetic Algorithm (1987) (324)
The Steiner Tree Problem (2012) (220)
Distributed genetic algorithms for the floorplan design problem (1991) (215)
Modified Matrix Encoding Technique for Minimal Distortion Steganography (2006) (207)
VLSI median filters (1990) (171)
A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes (1991) (107)
Genetic Algorithms and Punctuated Equilibria in VLSI (1990) (64)
Statistical Geolocation of Internet Hosts (2009) (61)
Data Compression and Gray-Code Sorting (1986) (48)
Generalizations of broadcasting and gossiping (1988) (46)
Complexity of Single-Layer Routing (1984) (42)
Floorplan design using distributed genetic algorithms (1988) (42)
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle (1990) (36)
A platform for biological sequence comparison on parallel computers (1990) (33)
Degree-Constrained Pyramid Spanners (1995) (28)
Finding Short Cycles in Planar Graphs Using Separators (1986) (27)
Network Communication in Edge-Colored Graphs: Gossiping (1993) (24)
Broadcasting and Gossiping (2013) (23)
Multi-Source Spanning Tree Problems (2000) (23)
Optimal two-terminal α-β wire routing (1986) (22)
Finding Cycles of a Given Length (1985) (20)
Reliable broadcasting (1994) (19)
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle (1988) (14)
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees (1991) (12)
Fast heuristic algorithms for rectilinear steiner trees (1989) (11)
Perpetual Gossiping (1993) (10)
Logic and language models for computer science (2022) (9)
The Demarcation Problem (2017) (9)
Limited distortion in LSB steganography (2006) (8)
Sorting Under Forbidden Comparisons (2016) (8)
Long-term fairness with bounded worst-case losses (2009) (7)
New Results on Routing via Matchings on Graphs (2017) (7)
Structural and Syntactic Fault Correction Algorithms in Rule-Based Systems (2004) (6)
Mixed spanning trees: a technique for performance-driven routing (1993) (5)
On a "Counter - Example" (1980) (5)
An Introduction to Perpetual Gossiping (1993) (5)
Towards Lower Bounds on Embedding Distortion in Information Hiding (2006) (5)
Toward optimal gossiping schemes with conference calls (1984) (4)
Edge-Colored Graphs: Gossiping (1993) (4)
Minimizing the Statistical Impact of LSB Steganography (2005) (4)
Routing and Sorting Via Matchings On Graphs (2016) (4)
A Streaming Algorithm for the Convex Hull (2015) (3)
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition (1993) (3)
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets (1990) (3)
Broadcasting from multiple originators (2009) (3)
Sorting Networks On Restricted Topologies (2016) (3)
On a Theorem of Chorneyko and Mohanty (1979) (2)
Streaming clustering algorithms for foreground detection in color videos (2007) (2)
A linear-time algorithm to construct a rectilinear Steiner minimal tree fork-extremal point sets (1990) (2)
Let the games continue. (2014) (2)
Generalized Magic Cubes (1980) (2)
Problems in sorting and graph algorithms (1984) (2)
A Simple Convex Layers Algorithm (2017) (2)
Randomized Sorting as a Big Data Search Algorithm (2015) (1)
Structural and Syntactic Fault Correction Algorithms in Rule-Based System,” International Journal of Computing and Information Sciences (2004) (1)
Analysis of consensus sorting via the cycle metric (2018) (1)
UNIVERSAL TRAVERSAL SEQUENCES, GRAPH TRAVERSAL AND GRAPH IDENTIFICATION (1983) (1)
Mixed Spanning Trees in Theory and Practice (1999) (1)
Computing Maximal Layers of Points in Ef(n) (2015) (1)
The Structure of PEC Networks (2009) (1)
On the Inference of Strategies (1989) (1)
Studies of self-organizing placement algorithms for linear and finger lists (1992) (1)
On the Worst-Possible Analysis of Weighted Comparison-Based Algorithms (1988) (1)
Meeting of the puzzlers. (2014) (1)
The colossal book of short puzzles and problems : combinatorics, probability, algebra, geometry, topology, chess, logic, cryptarithms, wordplay, physics and other topics of recreational mathematics (2001) (1)
Distribution Of Maximal Layers Of Random Orders (2015) (1)
Proceedings of the international workshop on Broadcasting and gossiping 1990 (1994) (1)
Sorting with expensive comparands (1984) (1)
Existence of an Optimal Perpetual Gossiping Scheme for Arbitrary Networks (2019) (1)
On the file update problems (1981) (1)
Pushdown Automata and Parsing (2017) (0)
Martin Gardner (1914–2010) (2010) (0)
Logic and Language Models for Computer Science, Fourth Edition (2023) (0)
Minimum multiple originator broadcast graphs (2017) (0)
The application of Microsoft ® Active Server Page technology in the mining environment as a management information tool (2010) (0)
Routing Via Matchings And Optimal Sorting Network On Graphs (2016) (0)
Edge-Labelled Gossip in Rands (2012) (0)
A Sorting Network on Trees (2019) (0)
Language and Models (2017) (0)
On Maximal Layers Of Random Orders (2015) (0)
Generative Models of Regular Languages (2017) (0)
NSF Report: Theory of Computing Program (2000) (0)
The Most Fecund Consonyms (1986) (0)
Efficient algorithms for path partitions (1990) (0)
A Streaming Algorithm for 2-Center with Outliers in High Dimensions. (2015) (0)
D S ] 2 N ov 2 01 5 Sorting Under 1-∞ Cost Model (2015) (0)
Wordplay in Ancient Greece (1985) (0)
Oblivious Set-maxima for Intersection of Convex Polygons (2018) (0)
Once More: What Is a Word? (1980) (0)
Stacks, queues, and deques with order-statistic operations (1992) (0)
Finite Automata and Regular Languages (2017) (0)
Routing Number Of A Pyramid (2016) (0)
On the Inference of Strategies (revised) (2012) (0)
The Road to CSICOP (2017) (0)
Planet Packing Revisited (2001) (0)
Tree Open Ear Decomposition in Parallel Graph Algorithms (1995) (0)
On the distribution of comparisons in sorting algorithms (1988) (0)
The Set-Maxima Problem in a Geometric Setting (2018) (0)
Rules for Optimal Perpetual Gossiping Schemes (2020) (0)
Proofs by Deduction (2017) (0)
Sorting Under 1-$\infty$ Cost Model (2015) (0)
A Cryptic Puzzle from the London Times (2011) (0)
Return to Cordiality (2017) (0)
Note about: "On the file update problem" (1982) (0)
Dear Martin / Dear Marcello: Gardner and Truzzi on Skepticism (2017) (0)
Sorting Under Restrictions (2015) (0)
Teaching Nondeterminism (2021) (0)
Improved lower bounds on embedding distortion in information hiding (2008) (0)
D S ] 1 0 N ov 2 01 5 Sorting Under 1-∞ Cost Model (2015) (0)
Proving with Predicates (2017) (0)

This paper list is powered by the following services:

Other Resources About Dana S. Richards

en.wikipedia.org

What Schools Are Affiliated With Dana S. Richards?

Dana S. Richards is affiliated with the following schools: