default search action
Dana S. Richards
Person information
- affiliation: George Mason University, Fairfax VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b3]Dana Richards, Henry Hamburger:
Logic and Language Models for Computer Science, Fourth Edition. WorldScientific 2023, ISBN 9789811260667, pp. 1-496 - 2022
- [j40]Ivan Avramovic
, Dana S. Richards:
Analysis of consensus sorting via the cycle metric. J. Comb. Optim. 44(3): 1831-1847 (2022) - 2021
- [j39]Dana Richards:
Teaching Nondeterminism. SIGACT News 52(2): 85-90 (2021)
2010 – 2019
- 2019
- [j38]Avah Banerjee, Dana Richards:
A Sorting Network on Trees. Parallel Process. Lett. 29(4): 1950015:1-1950015:12 (2019) - [c23]Indranil Banerjee
Sorting Networks on Restricted Topologies. SOFSEM 2019: 54-66 - 2018
- [c22]Ivan Avramovic
Analysis of Consensus Sorting via the Cycle Metric. COCOA 2018: 552-565 - [i8]Indranil Banerjee, Dana Richards:
The Set-Maxima Problem in a Geometric Setting. CoRR abs/1811.02676 (2018) - 2017
- [b2]Dana Richards, Henry Hamburger:
Logic and Language Models for Computer Science, Third Edition. WorldScientific 2017, ISBN 9789813229204, pp. 1-468 - [j37]Arthur L. Liestman, Dana Richards:
Minimum multiple originator broadcast graphs. Discret. Appl. Math. 216: 646-661 (2017) - [c21]Indranil Banerjee, Dana Richards:
New Results on Routing via Matchings on Graphs. FCT 2017: 69-81 - [i7]Raimi A. Rufai, Dana S. Richards:
A Simple Convex Layers Algorithm. CoRR abs/1702.06829 (2017) - [i6]Indranil Banerjee, Dana S. Richards:
New Results On Routing Via Matchings On Graphs. CoRR abs/1706.09355 (2017) - 2016
- [c20]Indranil Banerjee, Dana Richards:
Computing Maximal Layers of Points in Ef(n). LATIN 2016: 138-151 - [c19]Indranil Banerjee, Dana S. Richards:
Sorting Under Forbidden Comparisons. SWAT 2016: 22:1-22:13 - [i5]Indranil Banerjee, Dana S. Richards:
Routing and Sorting Via Matchings On Graphs. CoRR abs/1604.04978 (2016) - [i4]Indranil Banerjee, Dana S. Richards:
Routing Number Of A Pyramid. CoRR abs/1611.07933 (2016) - [i3]Indranil Banerjee, Dana Richards, Igor Shinkar:
Sorting Networks On Restricted Topologies. CoRR abs/1612.06473 (2016) - 2015
- [c18]Raimi Ayinde Rufai, Dana Richards:
A Streaming Algorithm for the Convex Hull. CCCG 2015 - [i2]Indranil Banerjee, Dana Richards:
On Maximal Layers Of Random Orders. CoRR abs/1508.02477 (2015) - [i1]Indranil Banerjee, Dana Richards:
Sorting Under Restrictions. CoRR abs/1508.03698 (2015) - 2011
- [j36]Gabriel Catalin Balan, Dana Richards, Sean Luke:
Long-term fairness with bounded worst-case losses. Auton. Agents Multi Agent Syst. 22(1): 43-63 (2011)
2000 – 2009
- 2009
- [j35]Arthur L. Liestman, Dana S. Richards, Ladislav Stacho:
Broadcasting from multiple originators. Discret. Appl. Math. 157(13): 2886-2891 (2009) - [j34]Dana Richards, Zhenlei Jia:
The Structure of PEC Networks. Internet Math. 6(1): 3-17 (2009) - [c17]Inja Youn, Brian L. Mark
Statistical Geolocation of Internet Hosts. ICCCN 2009: 1-6 - 2008
- [c16]Younhee Kim, Zoran Duric, Dana Richards:
Improved lower bounds on embedding distortion in information hiding. Security, Forensics, Steganography, and Watermarking of Multimedia Contents 2008: 681908 - 2007
- [c15]Zoran Duric, Wallace E. Lawson, Dana Richards:
Streaming clustering algorithms for foreground detection in color videos. VISAPP (2) 2007: 486-491 - 2006
- [c14]Younhee Kim, Zoran Duric, Dana Richards:
Modified Matrix Encoding Technique for Minimal Distortion Steganography. Information Hiding 2006: 314-327 - [c13]Younhee Kim, Zoran Duric, Dana Richards:
Towards Lower Bounds on Embedding Distortion in Information Hiding. IWDW 2006: 362-376 - [c12]Younhee Kim, Zoran Duric, Dana Richards:
Limited distortion in LSB steganography. Security, Steganography, and Watermarking of Multimedia Contents 2006: 60720N - 2005
- [c11]Zoran Duric, Dana Richards, Younhee Kim:
Minimizing the Statistical Impact of LSB Steganography. ICIAR 2005: 1175-1183 - 2002
- [j33]Henry Hamburger, Dana Richards:
Logic and language models for computer science. SIGACT News 33(1): 67-70 (2002) - 2000
- [j32]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. J. Interconnect. Networks 1(1): 61-71 (2000) - [j31]Dana Richards:
NSF Report: Theory of Computing Program. SIGACT News 31(4): 37-38 (2000)
1990 – 1999
- 1999
- [j30]Dana S. Richards, Jeffrey S. Salowe:
Mixed Spanning Trees in Theory and Practice. Int. J. Comput. Geom. Appl. 9(3): 277-292 (1999) - [c10]Arthur M. Farley, Paraskevi Fragopoulou, David W. Krumme, Andrzej Proskurowski, Dana Richards:
Multi-Source Spanning Tree Problems. SIROCCO 1999: 126-136 - 1995
- [j29]Dana S. Richards, Arthur L. Liestman:
Degree-Constrained Pyramid Spanners. J. Parallel Distributed Comput. 25(1): 1-6 (1995) - [j28]Louis Ibarra, Dana S. Richards:
Tree Open Ear Decomposition in Parallel Graph Algorithms. Parallel Process. Lett. 5: 129-138 (1995) - 1994
- [j27]Luisa Gargano
Reliable broadcasting. Discret. Appl. Math. 53(1-3): 135-148 (1994) - 1993
- [j26]Louis Ibarra
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. Parallel Comput. 19(8): 873-886 (1993) - [j25]Arthur L. Liestman, Dana S. Richards:
Perpetual Gossiping. Parallel Process. Lett. 3: 347-355 (1993) - [j24]Arthur L. Liestman, Dana S. Richards:
Network Communication in Edge-Colored Graphs: Gossiping. IEEE Trans. Parallel Distributed Syst. 4(4): 438-445 (1993) - [c9]Jeffrey S. Salowe, Dana S. Richards, Dallas E. Wrege:
Mixed spanning trees: a technique for performance-driven routing. Great Lakes Symposium on VLSI 1993: 62-66 - [c8]Arthur L. Liestman, Dana S. Richards:
An Introduction to Perpetual Gossiping. ISAAC 1993: 259-266 - [c7]Louis Ibarra
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. MFCS 1993: 506-516 - 1992
- [j23]Dana S. Richards, Jeffrey S. Salowe:
Stacks, Queues, and Deques with Order-Statistic Operations. Acta Informatica 29(5): 395-414 (1992) - [j22]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) - [j21]Dana S. Richards:
Studies of self-organizing placement algorithms for linear and finger lists. Inf. Sci. 63(1-2): 153-172 (1992) - [j20]Frank K. Hwang, Dana S. Richards:
Steiner tree problems. Networks 22(1): 55-89 (1992) - 1991
- [j19]Dana S. Richards, Jeffrey S. Salowe:
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees. Ann. Oper. Res. 33(7): 549-556 (1991) - [j18]A. S. Deshpande, Dana S. Richards, William R. Pearson
A platform for biological sequence comparison on parallel computers. Comput. Appl. Biosci. 7(2): 237-247 (1991) - [j17]James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards:
Distributed genetic algorithms for the floorplan design problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(4): 483-492 (1991) - [c6]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 - 1990
- [j16]Craig Williams, Dana Richards:
Efficient algorithms for path partitions. Discret. Appl. Math. 27(3): 267-276 (1990) - [j15]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. Comput. Aided Des. Integr. Circuits Syst. 9(4): 398-407 (1990) - [j14]Dana S. Richards:
VLSI median filters. IEEE Trans. Acoust. Speech Signal Process. 38(1): 145-153 (1990) - [c5]James P. Cohoon, Worthy N. Martin, Dana S. Richards:
Genetic Algorithms and Punctuated Equilibria in VLSI. PPSN 1990: 134-144 - [c4]Dana S. Richards, Jeffrey S. Salowe:
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. SWAT 1990: 201-212
1980 – 1989
- 1989
- [j13]Dana S. Richards:
Fast Heuristic Algorithms for Rectilinear Steiner Trees. Algorithmica 4(2): 191-207 (1989) - [j12]Charles Swart, Dana S. Richards:
On the Inference of Strategies. Theor. Comput. Sci. 67(1): 5-18 (1989) - 1988
- [j11]Dana S. Richards, Pravin M. Vaidya:
On the Distribution of Comparisons in Sorting Algorithms. BIT 28(4): 764-774 (1988) - [j10]James P. Cohoon, Dana S. Richards:
Optimal two-terminal α-β wire routing. Integr. 6(1): 35-57 (1988) - [j9]Dana Richards, Arthur L. Liestman:
Generalizations of broadcasting and gossiping. Networks 18(2): 125-138 (1988) - [c3]James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe:
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle. ICCAD 1988: 402-405 - [c2]James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana Richards:
Floorplan design using distributed genetic algorithms. ICCAD 1988: 452-455 - 1987
- [c1]James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards:
Punctuated Equilibria: A Parallel Genetic Algorithm. ICGA 1987: 148-154 - 1986
- [j8]Dana S. Richards:
Data Compression and Gray-Code Sorting. Inf. Process. Lett. 22(4): 201-205 (1986) - [j7]Dana S. Richards:
Finding Short Cycles in Planar Graphs Using Separators. J. Algorithms 7(3): 382-394 (1986) - 1984
- [b1]Dana S. Richards:
Problems in Sorting and Graph Algorithms. University of Illinois Urbana-Champaign, USA, 1984 - [j6]Arthur L. Liestman, Dana S. Richards:
Toward optimal gossiping schemes with conference calls. Discret. Appl. Math. 7(2): 183-189 (1984) - [j5]Dana Richards:
Complexity of Single-Layer Routing. IEEE Trans. Computers 33(3): 286-288 (1984) - 1982
- [j4]Dana Richards:
Note about: "On the file update problem". ACM SIGCSE Bull. 14(2): 31 (1982) - 1981
- [j3]Dana Richards:
On the file update problems. ACM SIGCSE Bull. 13(3): 38-39 (1981) - 1980
- [j2]Dana Richards:
On a "Counter - Example". SIGARCH Comput. Archit. News 8(2): 2-3 (1980)
1970 – 1979
- 1979
- [j1]Dana S. Richards:
On a Theorem of Chorneyko and Mohanty. J. Comb. Theory A 27(3): 392-393 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: