The following pages link to Joseph (Seffi) Naor (Q398847):
Displaying 50 items.
- Fair online load balancing (Q398848) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- (Q593024) (redirect page) (← links)
- Online time-constrained scheduling in linear and ring networks (Q616984) (← links)
- (Q808287) (redirect page) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- Building edge-failure resilient networks (Q818826) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- Efficient algorithms for shared backup allocation in networks with partial information (Q857776) (← links)
- Real-time scheduling with a budget (Q878439) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- A fast parallel coloring of planar graphs with five colors (Q1108037) (← links)
- On separating the EREW and CREW PRAM models (Q1124343) (← links)
- The greedy algorithm is optimal for on-line edge coloring (Q1209350) (← links)
- Approximating probability distributions using small sample spaces (Q1288906) (← links)
- Flow in planar graphs with vertex capacities (Q1317474) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- The probabilistic method yields deterministic parallel algorithms (Q1342858) (← links)
- (Q1386374) (redirect page) (← links)
- Approximating minimum feedback sets and multicuts in directed graphs (Q1386376) (← links)
- Competitive on-Line switching policies (Q1400895) (← links)
- New algorithms for related machines with temporary jobs. (Q1588054) (← links)
- The budgeted maximum coverage problem (Q1606925) (← links)
- A truthful mechanism for value-based scheduling in cloud computing (Q1678764) (← links)
- (Q1757774) (redirect page) (← links)
- Algorithms for dynamic NFV workload (Q1757775) (← links)
- Admission control in networks with advance reservations (Q1884772) (← links)
- An almost optimal approximation algorithm for monotone submodular multiple knapsack (Q2071828) (← links)
- Timing matters: online dynamics in broadcast games (Q2190382) (← links)
- Non-preemptive buffer management for latency sensitive packets (Q2400042) (← links)
- A greedy approximation algorithm for minimum-gap scheduling (Q2400437) (← links)
- Cut problems in graphs with a budget constraint (Q2457298) (← links)
- Approximating the advertisement placement problem (Q2464430) (← links)
- Traffic engineering of management flows by link augmentations on confluent trees (Q2471695) (← links)
- Invited talks (Q2692717) (← links)
- Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems (Q2755062) (← links)
- (Q2768268) (← links)
- (Q2768280) (← links)
- (Q2768299) (← links)
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling (Q2784456) (← links)
- A 2-Approximation Algorithm for the Directed Multiway Cut Problem (Q2784466) (← links)
- On-Line Load Balancing in a Hierarchical Server Topology (Q2784469) (← links)
- Equilibria in Online Games (Q2796211) (← links)
- Unified Algorithms for Online Learning and Competitive Analysis (Q2806821) (← links)
- Efficient recovery from power outage (extended abstract) (Q2819589) (← links)
- Approximating the throughput of multiple machines under real-time scheduling (Q2819592) (← links)
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (Q2843243) (← links)
- The load-distance balancing problem (Q2892142) (← links)
- Randomized Competitive Algorithms for Generalized Caching (Q2903523) (← links)
- Competitive Algorithms for Restricted Caching and Matroid Caching (Q2921406) (← links)
