Gregory E. Shannon

19 papers A* 2A 1B 1Journal 8Unranked 4
YearRankTypeTitle / Venue / Authors
2022 J jnl
PURE Biomanufacturing: Secure, Pandemic-Adaptive Biomanufacturing.
IEEE Secur. Priv.
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
2021 — ch.
BioSecure Digital Twin: Manufacturing Innovation and Cybersecurity Resilience.
Engineering Artificially Intelligent Systems
Michael Mylrea, Charles Fracchia, Howard D. Grimes, Wayne Austad, Gregory E. Shannon, Bill Reid, Nathan Case
2016 — conf
SafeConfig'16: Testing and Evaluation for Active & Resilient Cyber Systems Panel Verification of Active and Resilient Systems: Practical or Utopian?
SafeConfig@CCS
Nicholas J. Multari, Anoop Singhal, David O. Manz, Robert Cowles, Jorge Cuéllar, Christopher S. Oehmen, Gregory E. Shannon
2000 J jnl
LINK: a system for graph computation.
Softw. Pract. Exp.
Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena
2000 J jnl
Toward a vision for network and service management.
Bell Labs Tech. J.
Kurt S. Silverman, Michael R. Brenner, Gregory E. Shannon
1998 J jnl
Efficient Matrix Chain Ordering in Polylog Time.
SIAM J. Comput.
Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon
1997 A conf
Graph Drawing and Manipulation with
GD
Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena
1994 — ed.
Computational Support for Discrete Mathematics, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 12-14, 1992
Computational Support for Discrete Mathematics
Nathaniel Dean, Gregory E. Shannon
1994 — conf
Efficient Matrix Chain Ordering in Polylog Time.
IPPS
Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon
1993 J jnl
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees.
SIAM J. Comput.
Ming-Yang Kao, Gregory E. Shannon
1993 J jnl
Representing graph families with edge grammars.
Inf. Sci.
Francine Berman, Gregory E. Shannon
1991 — conf
A Case Study in Algorithm Animation: Maximum Flow Algorithms.
Network Flows And Matching
Gregory E. Shannon, John MacCuish, Elisabeth Johnson
1991 — conf
Using Separators Instead of Dynamic Programming in Approximation Algorithms for Planar Graphs.
ICPP (3)
Fang Wan, Gregory E. Shannon
1989 A* conf
Local Reorientation, Global Order, and Planar Topology (Preliminary Version)
STOC
Ming-Yang Kao, Gregory E. Shannon
1989 B conf
Optimal On-Line Load Balancing.
SPAA
Gregory E. Shannon
1988 J jnl
A Linear-Processor Algorithm for Depth-First Search in Planar Graphs.
Inf. Process. Lett.
Gregory E. Shannon
1988 — —
Designing efficient parallel algorithms: Techniques and applications
Gregory E. Shannon
1988 J jnl
Parallel Symmetry-Breaking in Sparse Graphs.
SIAM J. Discret. Math.
Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon
1987 A* conf
Parallel Symmetry-Breaking in Sparse Graphs
STOC
Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon