Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York) - Austria
doi 10.1007/s00607-007-0230-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width

SIAM Journal on Computing
MathematicsComputer Science
2014English

Tight RMR Lower Bounds for Mutual Exclusion and Other Problems

2008English

Quantum Lower Bounds for the Collision and the Element Distinctness Problems

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2004English

A Computational Analysis of Lower Bounds for Big Bucket Production Planning Problems

Computational Optimization and Applications
ControlComputational MathematicsApplied MathematicsOptimization
2012English

Lower Bounds

2016English

Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Near-Optimal Bounds for Online Caching With Machine Learned Advice

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy