The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jeffrey S. Salowe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jeffrey S. Salowe, William L. Steiger
    Stable Unmerging in Linear Time and Constant Space. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:5, pp:285-294 [Journal]
  2. Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
    The Multi-Weighted Spanning Tree Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:141-150 [Conf]
  3. Gabriel Robins, Jeffrey S. Salowe
    On the Maximum Degree of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:250-258 [Conf]
  4. Jeffrey S. Salowe
    Construction of Multidimensional Spanner Graphs, with Applications to Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:256-261 [Conf]
  5. Jeffrey S. Salowe
    On Euclidean Spanner Graphs with Small Degree. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:186-191 [Conf]
  6. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
    Optimal Slope Selection. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:133-146 [Conf]
  7. Jeffrey S. Salowe, David M. Warme
    An Exact Rectilinear Steiner Tree Algorithm. [Citation Graph (0, 0)][DBLP]
    ICCD, 1993, pp:472-475 [Conf]
  8. Gautam Das, Giri Narasimhan, Jeffrey S. Salowe
    A New Way to Weigh Malnourished Euclidean Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:215-222 [Conf]
  9. Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
    Euclidean spanners: short, thin, and lanky. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:489-498 [Conf]
  10. 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]
  11. Jeffrey S. Salowe
    Selecting the kth Largest-Area Convex Polygon. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:243-250 [Conf]
  12. Jeffrey S. Salowe
    Shallow Interdistnace Selection and Interdistance Enumeration. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:117-128 [Conf]
  13. 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]
  14. 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]
  15. J. Ian Munro, Venkatesh Raman, Jeffrey S. Salowe
    Stable in Situ Sorting and Minimum Data Movement. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:2, pp:220-234 [Journal]
  16. Jeffrey S. Salowe
    Euclidean Spanner Graphs with Degree Four. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:1, pp:55-66 [Journal]
  17. Gabriel Robins, Jeffrey S. Salowe
    Low-Degree Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:2, pp:151-165 [Journal]
  18. 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]
  19. Jeffrey S. Salowe
    Constructing multidimensional spanner graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1991, v:1, n:2, pp:99-107 [Journal]
  20. Jeffrey S. Salowe
    Enumerating interdistances in space. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:1, pp:49-59 [Journal]
  21. Jeffrey S. Salowe
    L-Infinity Interdistance Selection by Parametric Search. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:1, pp:9-14 [Journal]
  22. Jeffrey S. Salowe
    A Note on Lower Bounds for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:3, pp:151-152 [Journal]
  23. Jeffrey S. Salowe, William L. Steiger
    Simplified Stable Merging Tasks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:4, pp:557-571 [Journal]
  24. Joseph L. Ganley, Jeffrey S. Salowe
    The Power-p Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1998, v:5, n:2, pp:115-127 [Journal]
  25. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
    An Optimal-Time Algorithm for Slope Selection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:792-810 [Journal]
  26. 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]
  27. Jeff Griffith, Gabriel Robins, Jeffrey S. Salowe, Tongtong Zhang
    Closing the gap: near-optimal Steiner trees in polynomial time. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1994, v:13, n:11, pp:1351-1365 [Journal]

Search in 0.004secs, Finished in 0.005secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002