default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKevin M. Greenan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j2]Mark W. Storer, Kevin M. Greenan, Ethan L. Miller, Kaladhar Voruganti:
POTSHARDS - a secure, recoverable, long-term archival storage system. ACM Trans. Storage 5(2): 5:1-5:35 (2009)- 2008
- [j1]Mark W. Storer, Kevin M. Greenan, Ethan L. Miller, Kaladhar Voruganti:
Pergamum: Energy-efficient Archival Storage with Disk Instead of Tape. login Usenix Mag. 33(3) (2008)
Conference and Workshop Papers
- 2013
- [c15]James S. Plank, Kevin M. Greenan, Ethan L. Miller:
Screaming fast Galois field arithmetic using intel SIMD instructions. FAST 2013: 299-306 - 2012
- [c14]Zhichao Li, Kevin M. Greenan, Andrew W. Leung, Erez Zadok:
Power consumption in enterprise-scale backup storage systems. FAST 2012: 6 - 2010
- [c13]Kevin M. Greenan, James S. Plank, Jay J. Wylie:
Mean Time to Meaningless: MTTDL, Markov Models, and Storage System Reliability. HotStorage 2010 - [c12]Kevin M. Greenan, Xiaozhou Li, Jay J. Wylie:
Flat XOR-based erasure codes in storage systems: Constructions, efficient recovery, and tradeoffs. MSST 2010: 1-14 - 2008
- [c11]Kevin M. Greenan, Ethan L. Miller, Jay J. Wylie:
Reliability of flat XOR-based erasure codes on heterogeneous devices. DSN 2008: 147-156 - [c10]Mark W. Storer, Kevin M. Greenan, Ethan L. Miller, Kaladhar Voruganti:
Pergamum: Replacing Tape with Energy Efficient, Reliable, Disk-Based Archival Storage. FAST 2008: 1-16 - [c9]Kevin M. Greenan, Darrell D. E. Long, Ethan L. Miller, Thomas J. E. Schwarz, Jay J. Wylie:
A Spin-Up Saved Is Energy Earned: Achieving Power-Efficient, Erasure-Coded Storage. HotDep 2008 - [c8]Kevin M. Greenan, Ethan L. Miller, Thomas J. E. Schwarz:
Optimizing Galois Field Arithmetic for Diverse Processor Architectures and Applications. MASCOTS 2008: 257-266 - [c7]Mark W. Storer, Kevin M. Greenan, Darrell D. E. Long, Ethan L. Miller:
Secure data deduplication. StorageSS 2008: 1-10 - 2007
- [c6]Kevin M. Greenan, Ethan L. Miller, Thomas J. E. Schwarz, Darrell D. E. Long:
Disaster recovery codes: increasing reliability with large-stripe erasure correcting codes. StorageSS 2007: 31-36 - [c5]Mark W. Storer, Kevin M. Greenan, Ethan L. Miller, Kaladhar Voruganti:
POTSHARDS: Secure Long-Term Storage Without Encryption. USENIX ATC 2007: 142-156 - 2006
- [c4]Kevin M. Greenan, Ethan L. Miller:
Reliability mechanisms for file systems using non-volatile memory as a metadata store. EMSOFT 2006: 178-187 - [c3]Mark W. Storer, Kevin M. Greenan, Ethan L. Miller:
Long-term threats to secure archives. StorageSS 2006: 9-16 - 2005
- [c2]Kevin M. Greenan, Mark W. Storer, Ethan L. Miller, Carlos Maltzahn:
POTSHARDS : Storing Data for the Long-term Without Encryption. IEEE Security in Storage Workshop 2005: 12-20 - 2003
- [c1]Thomas E. Portegys, Kevin M. Greenan:
Managing Flocking Objects with an Octree Spanning a Parallel Message-Passing Computer Cluster. PDPTA 2003: 683-687
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-07-17 21:29 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:
