Gregory E. Shannon

According to our database, Gregory E. Shannon authored at least 16 papers between 1988 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

PURE Biomanufacturing: Secure, Pandemic-Adaptive Biomanufacturing.

Howard 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

IEEE Secur. Priv., 2022

2021

BioSecure Digital Twin: Manufacturing Innovation and Cybersecurity Resilience.

Michael Mylrea, Charles Fracchia, Howard D. Grimes, Wayne Austad, Gregory E. Shannon, Bill Reid, Nathan Case

Proceedings of the Engineering Artificially Intelligent Systems, 2021

2016

SafeConfig'16: Testing and Evaluation for Active & Resilient Cyber Systems Panel Verification of Active and Resilient Systems: Practical or Utopian?

Nicholas J. Multari, Anoop Singhal, David O. Manz, Robert Cowles, Jorge Cuéllar, Christopher S. Oehmen, Gregory E. Shannon

Proceedings of the 2016 ACM Workshop on Automated Decision Making for Active Cyber Defense, 2016

2000

LINK: a system for graph computation.

Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena

Softw. Pract. Exp., 2000

Toward a vision for network and service management.

Kurt S. Silverman, Michael R. Brenner, Gregory E. Shannon

Bell Labs Tech. J., 2000

1998

Efficient Matrix Chain Ordering in Polylog Time.

Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon

SIAM J. Comput., 1998

1997

Graph Drawing and Manipulation with <i>LINK</i>.

Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena

Proceedings of the Graph Drawing, 5th International Symposium, 1997

1993

Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees.

Ming-Yang Kao, Gregory E. Shannon

SIAM J. Comput., 1993

Representing graph families with edge grammars.

Francine Berman, Gregory E. Shannon

Inf. Sci., 1993

1991

Using Separators Instead of Dynamic Programming in Approximation Algorithms for Planar Graphs.

Fang Wan, Gregory E. Shannon

Proceedings of the International Conference on Parallel Processing, 1991

A Case Study in Algorithm Animation: Maximum Flow Algorithms.

Gregory E. Shannon, John MacCuish, Elisabeth Johnson

Proceedings of the Network Flows And Matching, 1991

1989

Local Reorientation, Global Order, and Planar Topology (Preliminary Version)

Ming-Yang Kao, Gregory E. Shannon

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Optimal On-Line Load Balancing.

Gregory E. Shannon

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1988

Designing efficient parallel algorithms: Techniques and applications

Gregory E. Shannon

PhD thesis, 1988

Parallel Symmetry-Breaking in Sparse Graphs.

Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon

SIAM J. Discret. Math., 1988

A Linear-Processor Algorithm for Depth-First Search in Planar Graphs.

Gregory E. Shannon

Inf. Process. Lett., 1988