default search action
Gregory E. Shannon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j8]Howard D. Grimes, Gabriela F. Ciocarlie
, Bo Yu, Duminda Wijesekera
PURE Biomanufacturing: Secure, Pandemic-Adaptive Biomanufacturing. IEEE Secur. Priv. 20(6): 53-65 (2022) - 2021
- [p1]Michael Mylrea, Charles Fracchia, Howard D. Grimes, Wayne Austad, Gregory E. Shannon, Bill Reid, Nathan Case:
BioSecure Digital Twin: Manufacturing Innovation and Cybersecurity Resilience. Engineering Artificially Intelligent Systems 2021: 53-72
2010 – 2019
- 2016
- [c8]Nicholas J. Multari, Anoop Singhal, David O. Manz, Robert Cowles, Jorge Cuéllar, Christopher S. Oehmen, Gregory E. Shannon:
SafeConfig'16: Testing and Evaluation for Active & Resilient Cyber Systems Panel Verification of Active and Resilient Systems: Practical or Utopian? SafeConfig@CCS 2016: 53
2000 – 2009
- 2000
- [j7]Kurt S. Silverman, Michael R. Brenner, Gregory E. Shannon:
Toward a vision for network and service management. Bell Labs Tech. J. 5(4): 21-30 (2000) - [j6]Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena:
LINK: a system for graph computation. Softw. Pract. Exp. 30(11): 1285-1302 (2000)
1990 – 1999
- 1998
- [j5]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
- [c7]Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena
Graph Drawing and Manipulation with LINK. GD 1997: 425-437 - 1994
- [c6]Phillip G. Bradford, Gregory J. E. Rawlins, Gregory E. Shannon:
Efficient Matrix Chain Ordering in Polylog Time. IPPS 1994: 234-241 - [e1]Nathaniel Dean, Gregory E. Shannon:
Computational Support for Discrete Mathematics, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 12-14, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15, DIMACS/AMS 1994, ISBN 978-0-8218-6605-4 [contents] - 1993
- [j4]Francine Berman, Gregory E. Shannon:
Representing graph families with edge grammars. Inf. Sci. 70(3): 241-269 (1993) - [j3]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
- [c5]Gregory E. Shannon, John MacCuish, Elisabeth Johnson:
A Case Study in Algorithm Animation: Maximum Flow Algorithms. Network Flows And Matching 1991: 97-118 - [c4]Fang Wan, Gregory E. Shannon:
Using Separators Instead of Dynamic Programming in Approximation Algorithms for Planar Graphs. ICPP (3) 1991: 298-299
1980 – 1989
- 1989
- [c3]Gregory E. Shannon:
Optimal On-Line Load Balancing. SPAA 1989: 235-245 - [c2]Ming-Yang Kao, Gregory E. Shannon:
Local Reorientation, Global Order, and Planar Topology (Preliminary Version). STOC 1989: 286-296 - 1988
- [b1]Gregory E. Shannon:
Designing efficient parallel algorithms: Techniques and applications. Purdue University, USA, 1988 - [j2]Gregory E. Shannon:
A Linear-Processor Algorithm for Depth-First Search in Planar Graphs. Inf. Process. Lett. 29(3): 119-123 (1988) - [j1]Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs. SIAM J. Discret. Math. 1(4): 434-446 (1988) - 1987
- [c1]Andrew V. Goldberg, Serge A. Plotkin, Gregory E. Shannon:
Parallel Symmetry-Breaking in Sparse Graphs. STOC 1987: 315-324
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: