On the public citation graph
Thek-server dual and loose competitiveness for paging
0 signed · 241 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01294260openalex-snapshot
On the power of randomization in on-line algorithms
inferredcites →https://doi.org/10.1007/bf01759073openalex-snapshot
A strongly competitive randomized paging algorithm
inferredcites →https://doi.org/10.1016/0196-6774(90)90003-wopenalex-snapshot
Competitive algorithms for server problems
inferredcites →https://doi.org/10.1016/0196-6774(91)90041-vopenalex-snapshot
Competitive paging algorithms
inferredcites →https://doi.org/10.1109/isca.1988.5228openalex-snapshot
Multiprocessor cache analysis using ATUM
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0220008openalex-snapshot
An Optimal On-Line Algorithm for K Servers on Trees
inferredcites →https://doi.org/10.1137/s0097539792236353openalex-snapshot
Strongly Competitive Algorithms for Paging with Locality of Reference
inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot
A General Approximation Technique for Constrained Forest Problems
inferredcites →https://doi.org/10.1145/100216.100268openalex-snapshot
On the power of randomization in online algorithms
inferredcites →https://doi.org/10.1145/103418.103422openalex-snapshot
Competitive paging with locality of reference
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/28395.28435openalex-snapshot
An optimal online algorithm for metrical task systems
inferredcites →https://doi.org/10.1145/633625.52422openalex-snapshot
Multiprocessor cache analysis using ATUM
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.5555/127787.127832openalex-snapshot
On-line caching as cache size varies
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/dac.1036openalex-snapshot
An analytical model for the performance evaluation of stack‐based Web cache replacement algorithms
inferred← citeshttps://doi.org/10.1002/spe.2279openalex-snapshot
Profit data caching and hybrid disk-aware Completely Fair Queuing scheduling algorithms for hybrid disks
inferred← citeshttps://doi.org/10.1006/jagm.2000.1099openalex-snapshot
On-Line Paging Against Adversarially Biased Random Inputs
inferred← citeshttps://doi.org/10.1007/11561071_60openalex-snapshot
Online View Maintenance Under a Response-Time Constraint
inferred← citeshttps://doi.org/10.1007/11753810_28openalex-snapshot
A Feedback Control Approach to Mitigating Mistreatment in Distributed Caching Groups
inferred← citeshttps://doi.org/10.1007/11830924_12openalex-snapshot
Online Algorithms to Minimize Resource Reallocations and Network Communication
inferred← citeshttps://doi.org/10.1007/11970125_8openalex-snapshot
Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
inferred← citeshttps://doi.org/10.1007/3-540-36385-8_2openalex-snapshot
A Generalised Cost-Aware Caching Scheme for Caching Continuous Media Objects in Best-Effort Network Environments
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_4openalex-snapshot
A New Competitive Analysis of Randomized Caching
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_43openalex-snapshot
Paging on a RAM with Limited Resources
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_2openalex-snapshot
Online Algorithms: A Study of Graph-Theoretic Concepts
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_9openalex-snapshot
The Accomodating Function — A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_165openalex-snapshot
The online transportation problem
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_72openalex-snapshot
Competitive analysis of randomized paging algorithms
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_10openalex-snapshot
Competitive source routing on tori and meshes
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_267openalex-snapshot
Online Paging and Caching
inferred← citeshttps://doi.org/10.1007/978-0-387-77778-8_10openalex-snapshot
Online Vehicle Routing Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_13openalex-snapshot
Alternative Performance Measures in Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_267openalex-snapshot
Online Paging and Caching
inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_6openalex-snapshot
A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-28684-6_5openalex-snapshot
Tight Bounds for Double Coverage Against Weak Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-319-98355-4_13openalex-snapshot
Relative Worst-Order Analysis: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_11openalex-snapshot
Modeling Locality: A Probabilistic Analysis of LRU and FWF
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_29openalex-snapshot
Cost-Aware Caching Algorithms for Distributed Storage Servers
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_66openalex-snapshot
An Experimental Study of New and Known Online Packet Buffering Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_43openalex-snapshot
On the Relative Dominance of Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_21openalex-snapshot
How Much Information about the Future Is Needed?
inferred← citeshttps://doi.org/10.1007/978-3-540-77891-2_2openalex-snapshot
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-93980-1_15openalex-snapshot
Caching Content under Digital Rights Management
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_53openalex-snapshot
Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_10openalex-snapshot
Parameterized Analysis of Paging and List Update Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-18318-8_11openalex-snapshot
List Factoring and Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-20009-0_102openalex-snapshot
Online Optimization: Probabilistic Analysis and Algorithm Engineering
inferred← citeshttps://doi.org/10.1007/978-3-642-22006-7_17openalex-snapshot
On Variants of File Caching
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_13-2openalex-snapshot
Alternative Performance Measures in Online Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_267-2openalex-snapshot
Online Paging and Caching
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_28openalex-snapshot
Engineering Efficient Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_37openalex-snapshot
Approximating Sparse Covering Integer Programs Online
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_64openalex-snapshot
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_17openalex-snapshot
Relative Interval Analysis of Paging Algorithms on Access Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_3openalex-snapshot
Quantifying Competitiveness in Paging with Locality of Reference
inferred← citeshttps://doi.org/10.1007/978-3-662-54110-4_17openalex-snapshot
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship
inferred← citeshttps://doi.org/10.1007/bf01294264openalex-snapshot
A new measure for the study of on-line algorithms
inferred← citeshttps://doi.org/10.1007/bfb0054374openalex-snapshot
Randomized online multi-threaded paging
inferred← citeshttps://doi.org/10.1007/s00224-016-9703-3openalex-snapshot
Tight Bounds for Double Coverage Against Weak Adversaries
inferred← citeshttps://doi.org/10.1007/s00236-010-0123-6openalex-snapshot
A theoretical comparison of LRU and LRU-K
inferred← citeshttps://doi.org/10.1007/s00450-011-0149-1openalex-snapshot
Probabilistic alternatives for competitive analysis
inferred← citeshttps://doi.org/10.1007/s00453-001-0081-zopenalex-snapshot
Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach
inferred← citeshttps://doi.org/10.1007/s00453-001-0095-6openalex-snapshot
Randomized Weighted Caching with Two Page Weights
inferred← citeshttps://doi.org/10.1007/s00453-001-0125-4openalex-snapshot
Page Replacement with Multi-Size Pages and Applications to Web Caching
inferred← citeshttps://doi.org/10.1007/s00453-008-9230-yopenalex-snapshot
An Experimental Study of New and Known Online Packet Buffering Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-012-9629-3openalex-snapshot
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
inferred← citeshttps://doi.org/10.1007/s00453-012-9637-3openalex-snapshot
List Factoring and Relative Worst Order Analysis
inferred← citeshttps://doi.org/10.1007/s00453-013-9793-0openalex-snapshot
Online File Caching with Rejection Penalties
inferred← citeshttps://doi.org/10.1007/s00453-013-9800-5openalex-snapshot
Parameterized Analysis of Paging and List Update Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-018-0406-9openalex-snapshot
Quantifying Competitiveness in Paging with Locality of Reference
inferred← citeshttps://doi.org/10.1007/s00453-018-0461-2openalex-snapshot
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-019-00638-wopenalex-snapshot
Stochastic Dominance and the Bijective Ratio of Online Algorithms
inferred← citeshttps://doi.org/10.1007/s00778-020-00605-wopenalex-snapshot
Architecture of a distributed storage that combines file system, memory and computation in a single layer
inferred← citeshttps://doi.org/10.1007/s10100-016-0455-6openalex-snapshot
Evaluating the quality of online optimization algorithms by discrete event simulation
inferred← citeshttps://doi.org/10.1007/s10107-003-0436-0openalex-snapshot
Online algorithms: a survey
inferred← citeshttps://doi.org/10.1007/s10107-022-01902-8openalex-snapshot
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
inferred← citeshttps://doi.org/10.1007/s10766-016-0470-1openalex-snapshot
LCS: An Efficient Data Eviction Strategy for Spark
inferred← citeshttps://doi.org/10.1007/s11036-005-1559-8openalex-snapshot
Energy-Efficient Data Caching and Prefetching for Mobile Devices Based on Utility
inferred← citeshttps://doi.org/10.1007/s11227-022-04663-5openalex-snapshot
Memory management optimization strategy in Spark framework based on less contention
inferred← citeshttps://doi.org/10.1016/j.comnet.2006.11.030openalex-snapshot
Mistreatment-resilient distributed caching
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.11.013openalex-snapshot
Proxy caching for peer-to-peer live streaming
inferred← citeshttps://doi.org/10.1016/j.dss.2006.10.004openalex-snapshot
Periodic cache replacement policy for dynamic content at application server
inferred← citeshttps://doi.org/10.1016/j.dss.2008.10.004openalex-snapshot
An admission-control technique for delay reduction in proxy caching
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.05.034openalex-snapshot
Obtaining the optimal cache document replacement policy for the caching system of an EC website
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.001openalex-snapshot
The relative worst-order ratio applied to paging
inferred← citeshttps://doi.org/10.1016/j.jpdc.2022.05.004openalex-snapshot
POCache: Toward robust and configurable straggler tolerance with parity-only caching
inferred← citeshttps://doi.org/10.1016/j.jss.2013.01.014openalex-snapshot
Lifetime and QoS-aware energy-saving buffering schemes
inferred← citeshttps://doi.org/10.1016/j.omega.2019.06.006openalex-snapshot
A structuring review on multi-stage optimization under uncertainty: Aligning concepts from theory and practice
inferred← citeshttps://doi.org/10.1016/j.sysarc.2012.03.003openalex-snapshot
Power- and time-aware buffer cache management for real-time embedded databases
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.04.023openalex-snapshot
On the relative dominance of paging algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.027openalex-snapshot
The online knapsack problem: Advice and randomization
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.035openalex-snapshot
Relative interval analysis of paging algorithms on access graphs
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00041-2openalex-snapshot
Connection caching: model and algorithms
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00263-2openalex-snapshot
Online paging and file caching with expiration times
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00116-9openalex-snapshot
Competitive analysis of randomized paging algorithms
inferred← citeshttps://doi.org/10.1016/s1389-1286(99)00018-3openalex-snapshot
Managing TCP connections under persistent HTTP
inferred← citeshttps://doi.org/10.1051/ita/2009012openalex-snapshot
Measuring the problem-relevant information in input
inferred← citeshttps://doi.org/10.1051/ro/2020092openalex-snapshot
Analysis of threat based algorithm using different performance measures
inferred← citeshttps://doi.org/10.1080/10095020.2015.1123427openalex-snapshot
Distributed cache replacement method for geospatial data using spatiotemporal locality-based sequence
inferred← citeshttps://doi.org/10.1109/access.2021.3058769openalex-snapshot
A Novel Predictive-Collaborative-Replacement (PCR) Intelligent Caching Scheme for Multi-Access Edge Computing
inferred← citeshttps://doi.org/10.1109/aspdac.2002.994946openalex-snapshot
Hardware-software co-synthesis of low power real-time distributed embedded systems with dynamically reconfigurable FPGAs
inferred← citeshttps://doi.org/10.1109/ccgrid.2001.923190openalex-snapshot
Manageable storage via adaptation in WiND
inferred← citeshttps://doi.org/10.1109/comst.2004.5342239openalex-snapshot
An overview of web caching replacement algorithms
inferred← citeshttps://doi.org/10.1109/focs.2007.43openalex-snapshot
A primal-dual randomized algorithm for weighted paging
inferred← citeshttps://doi.org/10.1109/focs.2007.7openalex-snapshot
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
inferred← citeshttps://doi.org/10.1109/focs.2013.10openalex-snapshot
On Randomized Memoryless Algorithms for the Weighted K-Server Problem
inferred← citeshttps://doi.org/10.1109/focs.2017.52openalex-snapshot
Weighted k-Server Bounds via Combinatorial Dichotomies
inferred← citeshttps://doi.org/10.1109/fpga.2000.903390openalex-snapshot
Configuration caching management techniques for reconfigurable computing
inferred← citeshttps://doi.org/10.1109/hpca.2003.1183550openalex-snapshot
Cost-sensitive cache replacement algorithms
inferred← citeshttps://doi.org/10.1109/icdcs.2002.1022246openalex-snapshot
A new document placement scheme for cooperative caching on the Internet
inferred← citeshttps://doi.org/10.1109/icetas.2018.8629111openalex-snapshot
Disparity between Theory & Practice: Beyond the Worst-Case Competitive Analysis
inferred← citeshttps://doi.org/10.1109/iciiecs.2017.8276062openalex-snapshot
An efficacious page replacement technique for NAND flash memory
inferred← citeshttps://doi.org/10.1109/infocom.2006.131openalex-snapshot
Mistreatment in Distributed Caching Groups: Causes and Implications
inferred← citeshttps://doi.org/10.1109/infocom52122.2024.10621422openalex-snapshot
Dependency-Aware Online Caching
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302995openalex-snapshot
Energy-efficient caching and prefetching with data consistency in mobile distributed systems
inferred← citeshttps://doi.org/10.1109/isca.2006.5openalex-snapshot
A Case for MLP-Aware Cache Replacement
inferred← citeshttps://doi.org/10.1109/rivf.2019.8713680openalex-snapshot
An Enhanced Semantic-Based Cache Replacement Algorithm for Web Systems
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365677openalex-snapshot
Beyond competitive analysis [on-line algorithms]
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492476openalex-snapshot
A unified analysis of paging and caching
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492478openalex-snapshot
Speed is as powerful as clairvoyance [scheduling problems]
inferred← citeshttps://doi.org/10.1109/tc.2006.50openalex-snapshot
Cache replacement algorithms with nonuniform miss costs
inferred← citeshttps://doi.org/10.1109/tc.2013.61openalex-snapshot
LACS: A Locality-Aware Cost-Sensitive Cache Replacement Algorithm
inferred← citeshttps://doi.org/10.1109/tcad.2006.883909openalex-snapshot
SLOPES: Hardware–Software Cosynthesis of Low-Power Real-Time Distributed Embedded Systems With Dynamically Reconfigurable FPGAs
inferred← citeshttps://doi.org/10.1109/tsmcc.2007.900667openalex-snapshot
Linearized Model of Object Caching and Heuristic Solution
inferred← citeshttps://doi.org/10.1109/tvlsi.2002.1043324openalex-snapshot
Configuration relocation and defragmentation for run-time reconfigurable computing
inferred← citeshttps://doi.org/10.1109/wimob.2014.6962178openalex-snapshot
Local cooperative caching policies in multi-hop D2D networks
inferred← citeshttps://doi.org/10.1137/090779000openalex-snapshot
Randomized Competitive Algorithms for Generalized Caching
inferred← citeshttps://doi.org/10.1137/1.9781611973068.4openalex-snapshot
Approximation Algorithms for Restless Bandit Problems
inferred← citeshttps://doi.org/10.1137/1.9781611974782.65openalex-snapshot
The (h, k)-Server Problem on Bounded Depth Trees
inferred← citeshttps://doi.org/10.1137/1.9781611977073.4openalex-snapshot
Learning-Augmented Weighted Paging
inferred← citeshttps://doi.org/10.1137/s0097539700376159openalex-snapshot
Better Algorithms for Unfair Metrical Task Systems and Applications
inferred← citeshttps://doi.org/10.1137/s0097539796299540openalex-snapshot
Beyond Competitive Analysis
inferred← citeshttps://doi.org/10.1137/s0097539799361786openalex-snapshot
The Accommodating Function: A Generalization of the Competitive Ratio
inferred← citeshttps://doi.org/10.1137/s0895480198342310openalex-snapshot
The Online Transportation Problem
inferred← citeshttps://doi.org/10.1145/1027914.1027930openalex-snapshot
SIGACT news online algorithms column 4
inferred← citeshttps://doi.org/10.1145/1086649.1086670openalex-snapshot
SIGACT news online algorithms column 8
inferred← citeshttps://doi.org/10.1145/1150019.1136501openalex-snapshot
A Case for MLP-Aware Cache Replacement
inferred← citeshttps://doi.org/10.1145/1324215.1324233openalex-snapshot
Competitiveness via primal-dual
inferred← citeshttps://doi.org/10.1145/1374376.1374412openalex-snapshot
Randomized competitive algorithms for generalized caching
inferred← citeshttps://doi.org/10.1145/1620491.1620508openalex-snapshot
SIGACT news online algorithms column 14
inferred← citeshttps://doi.org/10.1145/1711475.1711499openalex-snapshot
Introduction to the SIGACT news online algorithms column
inferred← citeshttps://doi.org/10.1145/1711475.1714372openalex-snapshot
On Developing New Models, with Paging as a Case Study
inferred← citeshttps://doi.org/10.1145/1753171.1753194openalex-snapshot
SIGACT news online algorithms column 16
inferred← citeshttps://doi.org/10.1145/1870103.1870106openalex-snapshot
Approximation algorithms for restless bandit problems
inferred← citeshttps://doi.org/10.1145/1907450.1907547openalex-snapshot
SIGACT news online algorithms column 17
inferred← citeshttps://doi.org/10.1145/1998037.1998057openalex-snapshot
SIGACT news online algorithms column 19
inferred← citeshttps://doi.org/10.1145/2339123.2339126openalex-snapshot
A Primal-Dual Randomized Algorithm for Weighted Paging
inferred← citeshttps://doi.org/10.1145/2450142.2450143openalex-snapshot
Paging and list update under bijective analysis
inferred← citeshttps://doi.org/10.1145/2670127openalex-snapshot
Engineering Efficient Paging Algorithms
inferred← citeshttps://doi.org/10.1145/2755573.2755585openalex-snapshot
Online Caching with Convex Costs
inferred← citeshttps://doi.org/10.1145/3145813openalex-snapshot
Understanding Application-Level Caching in Web Applications
inferred← citeshttps://doi.org/10.1145/3301314openalex-snapshot
The ( h,k )-Server Problem on Bounded Depth Trees
inferred← citeshttps://doi.org/10.1145/3323165.3323169openalex-snapshot
Writeback-Aware Caching (Brief Announcement)
inferred← citeshttps://doi.org/10.1145/335305.335408openalex-snapshot
Better algorithms for unfair metrical task systems and applications
inferred← citeshttps://doi.org/10.1145/3357713.3384306openalex-snapshot
Unbounded lower bound for k-server against weak adversaries
inferred← citeshttps://doi.org/10.1145/3409964.3461801openalex-snapshot
Efficient Online Weighted Multi-Level Paging
inferred← citeshttps://doi.org/10.1145/3409964.3461814openalex-snapshot
Paging and the Address-Translation Problem
inferred← citeshttps://doi.org/10.1145/3445814.3446757openalex-snapshot
FaasCache: keeping serverless computing alive with greedy-dual caching
inferred← citeshttps://doi.org/10.1145/347476.347479openalex-snapshot
Speed is as powerful as clairvoyance
inferred← citeshttps://doi.org/10.1145/3490148.3538567openalex-snapshot
Competitive Algorithms for Block-Aware Caching
inferred← citeshttps://doi.org/10.1145/3543507.3583322openalex-snapshot
Atrapos: Real-time Evaluation of Metapath Query Workloads
inferred← citeshttps://doi.org/10.1145/3543507.3583432openalex-snapshot
Worst-Case Welfare of Item Pricing in the Tollbooth Problem
inferred← citeshttps://doi.org/10.1145/3552326.3587446openalex-snapshot
FrozenHot Cache: Rethinking Cache Management for Modern Hardware
inferred← citeshttps://doi.org/10.1145/3558481.3591084openalex-snapshot
An Associativity Threshold Phenomenon in Set-Associative Caches
inferred← citeshttps://doi.org/10.1145/3581784.3607057openalex-snapshot
Optimizing Reconfigurable Optical Datacenters: The Power of Randomization
inferred← citeshttps://doi.org/10.1145/3586165.3586177openalex-snapshot
SIGACT News Online Algorithms Column 40
inferred← citeshttps://doi.org/10.1145/3626183.3660259openalex-snapshot
Brief Announcement: Suffix Analysis
inferred← citeshttps://doi.org/10.1145/3694906.3743330openalex-snapshot
Brief Announcement: Improved Understanding of Landlord Under Suffix Analysis
inferred← citeshttps://doi.org/10.1145/3737700openalex-snapshot
Paging and the Address-Translation Problem
inferred← citeshttps://doi.org/10.1145/3816782.3819196openalex-snapshot
Tight Latency Guarantees for Weighted Caching with Delayed Hits
inferred← citeshttps://doi.org/10.1145/509907.509949openalex-snapshot
On paging with locality of reference
inferred← citeshttps://doi.org/10.1145/954092.954104openalex-snapshot
SIGACT news online algorithms column 1
inferred← citeshttps://doi.org/10.1177/0037549703037146openalex-snapshot
A Framework for the Design and Analysis of a Chaining Protocol, with Client-Centric Buffer Reservation, for Multimedia Streaming
inferred← citeshttps://doi.org/10.1184/r1/6603581openalex-snapshot
Approximating Sparse Covering Integer Programs Online
inferred← citeshttps://doi.org/10.12681/eadd/10816openalex-snapshot
On-Line Algorithms and the k-Server Conjecture
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0119openalex-snapshot
Optimization in Object Caching
inferred← citeshttps://doi.org/10.1287/mnsc.1080.0923openalex-snapshot
Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses
inferred← citeshttps://doi.org/10.1287/moor.2014.0652openalex-snapshot
Approximating Sparse Covering Integer Programs Online
inferred← citeshttps://doi.org/10.1287/opre.1070.0450openalex-snapshot
Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
inferred← citeshttps://doi.org/10.14288/1.0051240openalex-snapshot
On managing visibility of resources in social networking sites
inferred← citeshttps://doi.org/10.14778/2536354.2536355openalex-snapshot
Hybrid storage management for database systems
inferred← citeshttps://doi.org/10.14778/2752939.2752942openalex-snapshot
Sharing buffer pool memory in multi-tenant relational database-as-a-service
inferred← citeshttps://doi.org/10.1561/0100000104openalex-snapshot
Cache Optimization Models and Algorithms
inferred← citeshttps://doi.org/10.1561/9781601982179openalex-snapshot
The Design of Competitive Online Algorithms via a Primal—Dual Approach
inferred← citeshttps://doi.org/10.1631/bf02851602openalex-snapshot
LoColms: an innovative approach of enhancing traditional classroom form of education by promoting web-based distance learning in the poorer countries
inferred← citeshttps://doi.org/10.1631/jzus.2003.0630openalex-snapshot
LoColms: an innovative approach of enhancing traditional classroom form of education by promoting web-based distance learning in the poorer countries
inferred← citeshttps://doi.org/10.17559/tv-20180203105331openalex-snapshot
A Web Cache Replacement Strategy for Safety-Critical Systems
inferred← citeshttps://doi.org/10.26481/umamet.2009055openalex-snapshot
Simple optimality proofs for Least Recently Used in the presence of locality of reference
inferred← citeshttps://doi.org/10.3724/sp.j.1087.2008.02604openalex-snapshot
On-line algorithm of loose competitive caching
inferred← citeshttps://doi.org/10.4018/978-1-59140-035-6.ch008openalex-snapshot
Cache Management for Web-Powered Databases
showing the first 200 of 223 · page through all 223
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.