| Deterministic Self-Adjusting Tree Networks Using Rotor Walks | 1 | 0.37 | 2022 |
| New Results On Multi-Level Aggregation | 0 | 0.34 | 2021 |
| A Nearly Optimal Deterministic Online Algorithm For Non-Metric Facility Location | 0 | 0.34 | 2021 |
| Online Algorithms for Multilevel Aggregation | 1 | 0.35 | 2020 |
| An Optimal Algorithm for Online Multiple Knapsack | 0 | 0.34 | 2020 |
| Dynamic Balanced Graph Partitioning | 0 | 0.34 | 2020 |
| Unbounded lower bound for k-server against weak adversaries | 0 | 0.34 | 2020 |
| An Improved Online Algorithm for the Traveling Repairperson Problem on a Line. | 0 | 0.34 | 2019 |
| Logarithmic price of buffer downscaling on line metrics. | 0 | 0.34 | 2018 |
| Online Service with Delay on a Line. | 0 | 0.34 | 2018 |
| Better Bounds for Online Line Chasing. | 0 | 0.34 | 2018 |
| Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics. | 0 | 0.34 | 2018 |
| Online Aggregation of the Forwarding Information Base: Accounting for Locality and Churn. | 1 | 0.34 | 2018 |
| Dynamic beats fixed: on phase-based algorithms for file migration. | 1 | 0.36 | 2017 |
| A Match in Time Saves Nine: Deterministic Online Matching With Delays. | 0 | 0.34 | 2017 |
| Online Tree Caching. | 2 | 0.37 | 2017 |
| A Deterministic Algorithm for Online Steiner Tree Leasing. | 0 | 0.34 | 2017 |
| Randomized mutual exclusion on a multiple access channel. | 2 | 0.37 | 2016 |
| Distributed Alarming in the On-Duty and Off-Duty Models. | 0 | 0.34 | 2016 |
| A Randomized Algorithm for Online Scheduling with Interval Conflicts. | 0 | 0.34 | 2015 |
| Online Algorithms for Multi-Level Aggregation | 3 | 0.44 | 2015 |
| Provable Fairness For Tdma Scheduling | 0 | 0.34 | 2015 |
| The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach | 7 | 0.47 | 2014 |
| Better approximation bounds for the joint replenishment problem | 7 | 0.50 | 2014 |
| Approximation algorithms for the joint replenishment problem with deadlines | 8 | 0.54 | 2013 |
| A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue. | 0 | 0.34 | 2013 |
| Online control message aggregation in chain networks | 4 | 0.43 | 2013 |
| Competitive FIB Aggregation for Independent Prefixes: Online Ski Rental on the Trie | 3 | 0.39 | 2013 |
| Collecting weighted items from a dynamic queue | 8 | 0.54 | 2013 |
| (1,2)-Hamiltonian Completion On A Matching | 1 | 0.36 | 2013 |
| The k-resource problem in uniform metric spaces | 0 | 0.34 | 2012 |
| Distributed online and stochastic queuing on a multiple access channel | 3 | 0.44 | 2012 |
| Migrating and replicating data in networks. | 5 | 0.52 | 2012 |
| An optimal lower bound for buffer management in multi-queue switches | 1 | 0.35 | 2011 |
| Online strategies for intra and inter provider service migration in virtual networks | 17 | 0.85 | 2011 |
| Randomized competitive algorithms for online buffer management in the adaptive adversary model | 5 | 0.45 | 2011 |
| Event Extent Estimation | 0 | 0.34 | 2010 |
| Online function tracking with generalized penalties | 6 | 0.54 | 2010 |
| Dynamic sharing of a multiple access channel | 11 | 0.49 | 2010 |
| SkewCCC+: a heterogeneous distributed hash table | 4 | 0.38 | 2010 |
| Competitive analysis for service migration in VNets | 25 | 1.21 | 2010 |
| Price fluctuations: to buy or to rent | 3 | 0.62 | 2009 |
| Optimal algorithms for page migration in dynamic networks | 5 | 0.47 | 2009 |
| Generalized Whac-a-Mole | 0 | 0.34 | 2008 |
| Degree 3 Suffices: A Large-Scale Overlay for P2P Networks | 2 | 0.37 | 2008 |
| Randomized Algorithms for Buffer Management with 2-Bounded Delay | 6 | 0.53 | 2008 |
| Geometric aspects of online packet buffering: an optimal randomized algorithm for two buffers | 5 | 0.43 | 2008 |
| The k-resource problem on uniform and on uniformly decomposable metric spaces | 0 | 0.34 | 2007 |
| Dynamic load balancing in distributed hash tables | 35 | 1.11 | 2005 |
| Dynamic page migration with stochastic requests | 2 | 0.37 | 2005 |
