2000 |
13 | EE | Kurt S. Silverman,
Michael R. Brenner,
Gregory E. Shannon:
Toward a vision for network and service management.
Bell Labs Technical Journal 5(4): 21-30 (2000) |
12 | | Jonathan W. Berry,
Nathaniel Dean,
Mark K. Goldberg,
Gregory E. Shannon,
Steven Skiena:
LINK: a system for graph computation.
Softw., Pract. Exper. 30(11): 1285-1302 (2000) |
1998 |
11 | | Phillip G. Bradford,
Gregory J. E. Rawlins,
Gregory E. Shannon:
Efficient Matrix Chain Ordering in Polylog Time.
SIAM J. Comput. 27(2): 466-490 (1998) |
1997 |
10 | | Jonathan W. Berry,
Nathaniel Dean,
Mark K. Goldberg,
Gregory E. Shannon,
Steven Skiena:
Graph Drawing and Manipulation with LINK.
Graph Drawing 1997: 425-437 |
1994 |
9 | | Phillip G. Bradford,
Gregory J. E. Rawlins,
Gregory E. Shannon:
Efficient Matrix Chain Ordering in Polylog Time.
IPPS 1994: 234-241 |
1993 |
8 | EE | Francine Berman,
Gregory E. Shannon:
Representing graph families with edge grammars.
Inf. Sci. 70(3): 241-269 (1993) |
7 | | Ming-Yang Kao,
Gregory E. Shannon:
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees.
SIAM J. Comput. 22(3): 460-481 (1993) |
1991 |
6 | | Fang Wan,
Gregory E. Shannon:
Using Separators Instead of Dynamic Programming in Approximation Algorithms for Planar Graphs.
ICPP (3) 1991: 298-299 |
1989 |
5 | EE | Gregory E. Shannon:
Optimal On-Line Load Balancing.
SPAA 1989: 235-245 |
4 | | Ming-Yang Kao,
Gregory E. Shannon:
Local Reorientation, Global Order, and Planar Topology (Preliminary Version)
STOC 1989: 286-296 |
1988 |
3 | | Gregory E. Shannon:
A Linear-Processor Algorithm for Depth-First Search in Planar Graphs.
Inf. Process. Lett. 29(3): 119-123 (1988) |
2 | | Andrew V. Goldberg,
Serge A. Plotkin,
Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs.
SIAM J. Discrete Math. 1(4): 434-446 (1988) |
1987 |
1 | | Andrew V. Goldberg,
Serge A. Plotkin,
Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs
STOC 1987: 315-324 |