A New Web Cache Replacement Algorithm: Perfect-Time-Size Least Frequently Used. | NobleID

Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

A New Web Cache Replacement Algorithm: Perfect-Time-Size Least Frequently Used.

Identifier:nobleid.org/w1/20260515/C5CB5DF7

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/C5CB5DF7.svg?ark=w1%2F20260515%2FC5CB5DF7)](https://nobleid.org/work/w1/20260515/C5CB5DF7)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Tarik Kapetanovic

Mansur H. Samadzadeh

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy Pricing