Gregory E. Shannon - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2022

PURE Biomanufacturing: Secure, Pandemic-Adaptive BiomanufacturingHoward D. Grimes, Gabriela F. Ciocarlie, Bo Yu, Duminda Wijesekera, Gregory E. Shannon, Wayne Austad, Charles Fracchia, Dongyan Xu, Thomas R. Kurfess, Lisa Strama, Michael Mylrea, Bill Reid. ieeesp, 20(6):53-65, 2022. [doi]

2021

BioSecure Digital Twin: Manufacturing Innovation and Cybersecurity ResilienceMichael Mylrea, Charles Fracchia, Howard D. Grimes, Wayne Austad, Gregory E. Shannon, Bill Reid, Nathan Case. In William F. Lawless, James Llinas, Donald A. Sofge, Ranjeev Mittu, editors, Engineering Artificially Intelligent Systems - A Systems Engineering Approach to Realizing Synergistic Capabilities. Volume 13000 of Lecture Notes in Computer Science, pages 53-72, Springer, 2021. [doi]

2000

LINK: a system for graph computationJonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena. SPE, 30(11):1285-1302, 2000.

Toward a vision for network and service managementKurt S. Silverman, Michael R. Brenner, Gregory E. Shannon. bell, 5(4):21-30, 2000. [doi]

1998

Efficient Matrix Chain Ordering in Polylog TimePhillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon. SICOMP, 27(2):466-490, 1998.

1997

Graph Drawing and Manipulation with ::::LINK::::Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena. gd 1997: 425-437

1994

Efficient Matrix Chain Ordering in Polylog TimePhillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon. ipps 1994: 234-241

1993

Representing graph families with edge grammarsFrancine Berman, Gregory E. Shannon. isci, 70(3):241-269, 1993. [doi]

Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning TreesMing-Yang Kao, Gregory E. Shannon. SICOMP, 22(3):460-481, 1993.

1991

A Case Study in Algorithm Animation: Maximum Flow AlgorithmsGregory E. Shannon, John MacCuish, Elisabeth Johnson. dimacs 1993: 97-118

Using Separators Instead of Dynamic Programming in Approximation Algorithms for Planar GraphsFang Wan, Gregory E. Shannon. icpp 1991: 298-299

1989

Local Reorientation, Global Order, and Planar Topology (Preliminary Version)Ming-Yang Kao, Gregory E. Shannon. stoc 1989: 286-296

Optimal On-Line Load BalancingGregory E. Shannon. spaa 1989: 235-245 [doi]

1988

Parallel Symmetry-Breaking in Sparse GraphsAndrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon. siamdm, 1(4):434-446, 1988.

Designing efficient parallel algorithms: Techniques and applicationsGregory E. Shannon. PhD thesis, Purdue University, USA, 1988. [doi]

A Linear-Processor Algorithm for Depth-First Search in Planar GraphsGregory E. Shannon. ipl, 29(3):119-123, 1988.

1987

Parallel Symmetry-Breaking in Sparse GraphsAndrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon. stoc 1987: 315-324

Sign in or sign up to see more results.

runs on WebDSL