The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dana S. Richards: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards
    Punctuated Equilibria: A Parallel Genetic Algorithm. [Citation Graph (0, 0)][DBLP]
    ICGA, 1987, pp:148-154 [Conf]
  2. James P. Cohoon, Worthy N. Martin, Dana S. Richards
    A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes. [Citation Graph (0, 0)][DBLP]
    ICGA, 1991, pp:244-248 [Conf]
  3. Arthur L. Liestman, Dana S. Richards
    An Introduction to Perpetual Gossiping. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:259-266 [Conf]
  4. Louis Ibarra, Dana S. Richards
    Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:506-516 [Conf]
  5. James P. Cohoon, Worthy N. Martin, Dana S. Richards
    Genetic Algorithms and Punctuated Equilibria in VLSI. [Citation Graph (0, 0)][DBLP]
    PPSN, 1990, pp:134-144 [Conf]
  6. Dana S. Richards, Jeffrey S. Salowe
    A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:201-212 [Conf]
  7. Dana S. Richards, Jeffrey S. Salowe
    Stacks, Queues, and Deques with Order-Statistic Operations. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:5, pp:395-414 [Journal]
  8. Dana S. Richards
    Fast Heuristic Algorithms for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:2, pp:191-207 [Journal]
  9. Dana S. Richards, Jeffrey S. Salowe
    A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:2&3, pp:247-276 [Journal]
  10. Dana S. Richards, Pravin M. Vaidya
    On the Distribution of Comparisons in Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    BIT, 1988, v:28, n:4, pp:764-774 [Journal]
  11. Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards
    Reliable broadcasting. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:135-148 [Journal]
  12. Dana S. Richards, Jeffrey S. Salowe
    Mixed Spanning Trees in Theory and Practice. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:3, pp:277-292 [Journal]
  13. Dana S. Richards
    Data Compression and Gray-Code Sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:4, pp:201-205 [Journal]
  14. Dana S. Richards
    Studies of self-organizing placement algorithms for linear and finger lists. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1992, v:63, n:1-2, pp:153-172 [Journal]
  15. Dana S. Richards
    Finding Short Cycles in Planar Graphs Using Separators. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1986, v:7, n:3, pp:382-394 [Journal]
  16. Dana S. Richards
    On a Theorem of Chorneyko and Mohanty. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:27, n:3, pp:392-393 [Journal]
  17. Dana S. Richards, Arthur L. Liestman
    Degree-Constrained Pyramid Spanners. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:25, n:1, pp:1-6 [Journal]
  18. Louis Ibarra, Dana S. Richards
    Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1993, v:19, n:8, pp:873-886 [Journal]
  19. Louis Ibarra, Dana S. Richards
    Tree Open Ear Decomposition in Parallel Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:129-138 [Journal]
  20. Arthur L. Liestman, Dana S. Richards
    Perpetual Gossiping. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:347-355 [Journal]
  21. James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards
    Distributed genetic algorithms for the floorplan design problem. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1991, v:10, n:4, pp:483-492 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1990, v:9, n:4, pp:398-407 [Journal]
  23. Charles Swart, Dana S. Richards
    On the Inference of Strategies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:1, pp:5-18 [Journal]
  24. Arthur L. Liestman, Dana S. Richards
    Network Communication in Edge-Colored Graphs: Gossiping. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:4, pp:438-445 [Journal]

  25. Broadcasting from multiple originators. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002