The following pages link to Adi Rosén (Q289906):
Displaying 50 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- Online computation with advice (Q541670) (← links)
- Online time-constrained scheduling in linear and ring networks (Q616984) (← links)
- Connectivity guarantees for wireless networks with directional antennas (Q654284) (← links)
- Approximation algorithms for time-constrained scheduling on line networks (Q693767) (← links)
- On delivery times in packet networks under adversarial traffic (Q863190) (← links)
- Characterizing linear size circuits in terms of privacy (Q1305927) (← links)
- Time-constrained scheduling of weighted packets on trees and meshes (Q1400890) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- On the additive constant of the \(k\)-server work function algorithm (Q1675878) (← links)
- Reordering buffer management with advice (Q1707821) (← links)
- (Q1818268) (redirect page) (← links)
- On capital investment. (Q1818269) (← links)
- A note on models for non-probabilistic analysis of packet switching networks. (Q1853146) (← links)
- Randomness versus fault-tolerance (Q1976006) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Lower and upper bounds on the randomness complexity of private computations of AND (Q2175947) (← links)
- Paid exchanges are worth the price (Q2182321) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- On online algorithms with advice for the \(k\)-server problem (Q2344207) (← links)
- On-line Randomized Call Control Revisited (Q2719132) (← links)
- Amortizing randomness in private multiparty computations (Q2790103) (← links)
- A theorem on sensitivity and applications in private computation (Q2819565) (← links)
- Space-Constrained Interval Selection (Q2843257) (← links)
- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems (Q2851855) (← links)
- On Online Algorithms with Advice for the k-Server Problem (Q2896390) (← links)
- (Q2921742) (← links)
- Competitive weighted throughput analysis of greedy protocols on DAGs (Q2930332) (← links)
- (Q2955029) (← links)
- Tight bounds for the performance of Longest In System on DAGs (Q3022748) (← links)
- Competitive queue policies for differentiated services (Q3022750) (← links)
- Slide—The Key to Polynomial End-to-End Communication (Q3125223) (← links)
- (Q3128890) (← links)
- A Theorem on Sensitivity and Applications in Private Computation (Q3149875) (← links)
- Reordering Buffer Management with Advice (Q3188872) (← links)
- Rate vs. buffer size--greedy information gathering on the line (Q3189015) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- Distributed Approximate Matching (Q3558010) (← links)
- On the Additive Constant of the k-Server Work Function Algorithm (Q3558920) (← links)
- Lower bounds on the amount of randomness in private computation (Q3581281) (← links)
- Online Computation with Advice (Q3638053) (← links)
- Log-Space Polynomial End-to-End Communication (Q4210121) (← links)
- (Q4228509) (← links)
- (Q4230358) (← links)
- (Q4234105) (← links)
- (Q4250198) (← links)
- (Q4252724) (← links)
- The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms (Q4339003) (← links)
- A Randomness-Rounds Tradeoff in Private Computation (Q4388979) (← links)
