The following pages link to Boaz Patt-Shamir (Q266267):
Displaying 50 items.
- Comparison-based interactive collaborative filtering (Q266268) (← links)
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Competitive buffer management with packet dependencies (Q388119) (← links)
- Sparse reliable graph backbones (Q418121) (← links)
- Vector bin packing with multiple-choice (Q427903) (← links)
- Distributed approximation of cellular coverage (Q433421) (← links)
- Video distribution under multiple constraints (Q551203) (← links)
- On the complexity of distributed stable matching with small messages (Q660987) (← links)
- Distributed discovery of large near-cliques (Q661050) (← links)
- Finding similar users in social networks (Q693756) (← links)
- Tell me who I am: An interactive recommendation system (Q733719) (← links)
- A note on efficient aggregate queries in sensor networks (Q868957) (← links)
- Ski rental with two general options (Q975492) (← links)
- Time-space tradeoffs for set operations (Q1210542) (← links)
- Stabilizing time-adaptive protocols (Q1292427) (← links)
- A new approach to compiling adaptive programs (Q1370156) (← links)
- Nearly optimal FIFO buffer management for two packet classes. (Q1398880) (← links)
- A note on randomized mutual search. (Q1606991) (← links)
- Buffer size for routing limited-rate adversarial traffic (Q1660943) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- Distributed backup placement in networks (Q1741963) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Average-case analysis of greedy packet scheduling (Q1871776) (← links)
- Efficient algorithms for periodic scheduling (Q1886514) (← links)
- Stable secretaries (Q1999964) (← links)
- Randomized proof-labeling schemes (Q2002054) (← links)
- Non-additive two-option ski rental (Q2345456) (← links)
- Approximate distributed top-\(k\) queries (Q2377247) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- A game of timing and visibility (Q2427134) (← links)
- Competitive router scheduling with structured data (Q2440162) (← links)
- Collaborate with strangers to find own preferences (Q2471699) (← links)
- General perfectly periodic scheduling (Q2498929) (← links)
- High entropy random selection protocols (Q2659776) (← links)
- Proof-labeling schemes: broadcast, unicast and in between (Q2672621) (← links)
- Exact Analysis of Exact Change: The<i>k</i>-Payment Problem (Q2706177) (← links)
- Nearly optimal perfectly-periodic schedules (Q2787671) (← links)
- Constant-Time Local Computation Algorithms (Q2788995) (← links)
- Near-Optimal Distributed Maximum Flow (Q2796244) (← links)
- Fast Partial Distance Estimation and Applications (Q2796252) (← links)
- Randomized Proof-Labeling Schemes (Q2796267) (← links)
- A theory of clock synchronization (extended abstract) (Q2817677) (← links)
- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems (Q2851855) (← links)
- Non-Additive Two-Option Ski Rental (Q2868633) (← links)
- Competitive Router Scheduling with Structured Data (Q2896392) (← links)
- Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental (Q2910946) (← links)
- (Q2921791) (← links)
- Optimal and efficient clock synchronization under drifting clocks (Q2942746) (← links)
- The round complexity of distributed sorting (Q2943403) (← links)
