Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nathaniel Leibowitz

dblp:91/68 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein structure analysis
0.011999
Multiple Structural Alignment and Core Detection by Geometric Hashing · ISMB 1999
Bioinformatics and computational biology › protein structure analysis
structural alignment
0.011999
Multiple Structural Alignment and Core Detection by Geometric Hashing · ISMB 1999

Methods — techniques the papers use, named apart from their topics

geometric hashing · 0.0
YearPublicationVenuePosition
2004 Cache replacement policies revisited: the case of P2P traffic
abstract
Peer-to-peer (P2P) file-sharing applications generate a large part if not most of today's Internet traffic. The large volume of this traffic (thus the high potential benefits of caching) and the large cache sizes required (thus nontrivial costs associated with caching) only underline that efficient cache replacement policies are important in this case. P2P file-sharing traffic has several characteristics that distinguish it from well studied Web traffic and that require a focused study of efficient cache management policies. This paper uses trace driven simulations to compare traditional cache replacement policies with new policies that try to exploit characteristics of the P2P file-sharing traffic generated by applications using the FastTrack protocol.
Adam Wierzbicki, Nathaniel Leibowitz, Matei Ripeanu, Rafal Wozniak
CCGRID2
1999 Multiple Structural Alignment and Core Detection by Geometric Hashing
Nathaniel Leibowitz, Zipora Y. Fligelman, Ruth Nussinov, Haim J. Wolfson
ISMB1