The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ronald I. Greenberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ronald I. Greenberg
    Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:528-536 [Conf]
  2. Ronald I. Greenberg, Charles E. Leiserson
    Randomized Routing on Fat-Trees (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:241-249 [Conf]
  3. Ronald I. Greenberg, Lee Guan
    An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees. [Citation Graph (0, 0)][DBLP]
    ICPP, 1997, pp:44-48 [Conf]
  4. Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih
    Parallel Algorithms for Single-Layer Channel Routing. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:456-465 [Conf]
  5. Ronald I. Greenberg, Jau-Der Shih
    Feasible Offset an Optimal Offset for Single-Layer Channel Routing. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1993, pp:193-201 [Conf]
  6. Ronald I. Greenberg
    Finding Connected Components on a Scan Line Array Processor. [Citation Graph (0, 0)][DBLP]
    SPAA, 1995, pp:195-202 [Conf]
  7. Ronald I. Greenberg, Hyeong-Cheol Oh
    Universal Wormhole Routing. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:56-63 [Conf]
  8. Ronald I. Greenberg, Jau-Der Shih
    Minimizing Channel Density with Movable Terminals. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:2, pp:89-99 [Journal]
  9. Ronald I. Greenberg, Lee Guan
    On the Area of Hypercube Layouts [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  10. Ronald I. Greenberg
    Bounds on the Number of Longest Common Subsequences [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  11. Ronald I. Greenberg
    Fast and Simple Computation of All Longest Common Subsequences [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  12. Ronald I. Greenberg
    Computing the Number of Longest Common Subsequences [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  13. M. J. Foster, Ronald I. Greenberg
    Lower Bounds on the Area of Finite-State Machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:1, pp:1-7 [Journal]
  14. Ronald I. Greenberg, Lee Guan
    On the area of hypercube layouts. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:1, pp:41-46 [Journal]
  15. Ronald I. Greenberg, Joseph JáJá, Sridhar Krishnamurthy
    On the Difficulty of Manhattan Channel Routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:281-284 [Journal]
  16. Ronald I. Greenberg, F. Miller Maley
    Minimum Separation for Single-Layer Channel Routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:4, pp:210-205 [Journal]
  17. Ronald I. Greenberg, Hyeong-Cheol Oh
    Packet Routing in Networks with Long Wires. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1995, v:31, n:2, pp:153-158 [Journal]
  18. Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih
    Parallel Algorithms for Single-Layer Channel Routing. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1997, v:7, n:3, pp:267-277 [Journal]
  19. Ronald I. Greenberg, Jau-Der Shih
    Feasible Offset and Optimal Offset for General Single-LayerChannel Routing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:543-554 [Journal]
  20. Ronald I. Greenberg
    The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:12, pp:1358-1364 [Journal]
  21. Ronald I. Greenberg, Hyeong-Cheol Oh
    Universal Wormhole Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:3, pp:254-262 [Journal]

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