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