The following pages link to Boaz Patt-Shamir (Q266267):
Displayed 50 items.
- Improved distributed steiner forest construction (Q2943626) (← links)
- Improved Collaborative Filtering (Q3104637) (← links)
- (Q3113712) (← links)
- Online Set Packing (Q3143291) (← links)
- Improved Distributed Approximate Matching (Q3177747) (← links)
- Scheduling Multipacket Frames with Frame Deadlines (Q3460708) (← links)
- Comparison-Based Interactive Collaborative Filtering (Q3460733) (← links)
- Distributed Approximate Matching (Q3558010) (← links)
- Vector Bin Packing with Multiple-Choice (Q3569895) (← links)
- Sparse Reliable Graph Backbones (Q3587444) (← links)
- High Entropy Random Selection Protocols (Q3603478) (← links)
- Approximate Top-k Queries in Sensor Networks (Q3613661) (← links)
- Distributed Discovery of Large Near-Cliques (Q3646227) (← links)
- (Q4234072) (← links)
- Dispatching in perfectly-periodic schedules (Q4458866) (← links)
- The Las-Vegas Processor Identity Problem (How and When to Be Unique) (Q4521525) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- Clique Here: On the Distributed Complexity in Fully-Connected Networks (Q4598914) (← links)
- New Stability Results for Adversarial Queuing (Q4651464) (← links)
- Buffer Overflow Management in QoS Switches (Q4651481) (← links)
- Greedy Packet Scheduling on Shortest Paths (Q4696651) (← links)
- (Q4910746) (← links)
- (Q5002725) (← links)
- Proof-Labeling Schemes: Broadcast, Unicast and in Between (Q5045429) (← links)
- Nearly optimal perfectly periodic schedules (Q5138381) (← links)
- Optimal smoothing schedules for real-time streams (Q5138507) (← links)
- With Great Speed Come Small Buffers (Q5145189) (← links)
- Nearly optimal FIFO buffer management for DiffServ (Q5170874) (← links)
- General perfectly periodic scheduling (Q5170877) (← links)
- Buffer overflow management in QoS switches (Q5176010) (← links)
- Online set packing and competitive scheduling of multi-part tasks (Q5176219) (← links)
- Optimal smoothing schedules for real-time streams (extended abstract) (Q5176768) (← links)
- Average-case analysis of greedy packet scheduling (extended astract) (Q5176769) (← links)
- Time optimal self-stabilizing synchronization (Q5248536) (← links)
- Greedy packet scheduling on shortest paths (preliminary version) (Q5255817) (← links)
- Time-adaptive self stabilization (Q5361478) (← links)
- The Space Requirement of Local Forwarding on Acyclic Networks (Q5368936) (← links)
- Distributed Computing (Q5395166) (← links)
- Distributed approximate matching (Q5401409) (← links)
- Asynchronous recommendation systems (Q5401466) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465871) (← links)
- Fast routing table construction using small messages (Q5495808) (← links)
- A note on efficient aggregate queries in sensor networks (Q5501508) (← links)
- Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds (Q5700572) (← links)
- Distributed MST for constant diameter graphs (Q5890494) (← links)
- Distributed error confinement (Q5891892) (← links)
- Distributed error confinement (Q5892134) (← links)
- Algorithms - ESA 2003 (Q5897259) (← links)
- On-line path computation and function placement in SDNs (Q5918190) (← links)
- Distributed MST for constant diameter graphs (Q5919895) (← links)