Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Hide and seek: an introduction to steganography
2003837 citationsNiels Provos, Peter Honeymanprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Peter Honeyman
Since
Specialization
Citations
This map shows the geographic impact of Peter Honeyman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Peter Honeyman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Honeyman more than expected).
This network shows the impact of papers produced by Peter Honeyman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Peter Honeyman. The network helps show where Peter Honeyman may publish in the future.
Co-authorship network of co-authors of Peter Honeyman
This figure shows the co-authorship network connecting the top 25 collaborators of Peter Honeyman.
A scholar is included among the top collaborators of Peter Honeyman based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Peter Honeyman. Peter Honeyman is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Honeyman, Peter, et al.. (2007). Interdependence of Reliability and Security..9 indexed citations
2.
Hildebrand, Dean, et al.. (2007). PNFS and linux: Working towards a heterogeneous future. Deep Blue (University of Michigan).4 indexed citations
Zhang, Jiaying & Peter Honeyman. (2004). Replication Control in Distributed File Systems. Deep Blue (University of Michigan).3 indexed citations
5.
Provos, Niels, M. Friedl, & Peter Honeyman. (2003). Preventing privilege escalation. USENIX Security Symposium. 24(4). 16–16.199 indexed citations
6.
Provos, Niels & Peter Honeyman. (2002). Detecting Steganographic Content on the Internet. Deep Blue (University of Michigan).160 indexed citations
7.
Honeyman, Peter, et al.. (2002). Cryptographic wiretapping at 100 Megabits. Deep Blue (University of Michigan).1 indexed citations
8.
Honeyman, Peter, et al.. (2002). Linux NFS Client Write Performance. Deep Blue (University of Michigan). 29–40.8 indexed citations
9.
Honeyman, Peter, et al.. (2001). Scalable Linux Scheduling. Deep Blue (University of Michigan). 285–295.3 indexed citations
10.
Honeyman, Peter, et al.. (2001). Kerberized credential translation: a solution to web access control. Deep Blue (University of Michigan). 18–18.32 indexed citations
11.
Provos, Niels & Peter Honeyman. (2001). ScanSSH - Scanning the Internet for SSH Servers. Deep Blue (University of Michigan). 25–30.22 indexed citations
12.
McDaniel, Patrick, Atul Prakash, & Peter Honeyman. (1999). Antigone: a flexible framework for secure group communication. Deep Blue (University of Michigan). 9–9.48 indexed citations
13.
Honeyman, Peter, et al.. (1998). Pluggable authentication modules for Windows NT. 11–11.2 indexed citations
McDaniel, Patrick, Peter Honeyman, & Atul Prakash. (1998). Lightweight Secure Group Communication. Deep Blue (University of Michigan).5 indexed citations
16.
Huston, Larry & Peter Honeyman. (1995). Partially Connected Operation. Deep Blue (University of Michigan). 8(4). 365–379.12 indexed citations
17.
Honeyman, Peter, et al.. (1995). Joining security realms: a single login for netware and kerberos. Deep Blue (University of Michigan). 14–14.5 indexed citations
Rubin, Aviel D. & Peter Honeyman. (1993). Long Running Jobs in an Authenticated Environment. Deep Blue (University of Michigan).7 indexed citations
20.
Honeyman, Peter. (1980). Extension joins. Very Large Data Bases. 239–244.27 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.