Boaz Patt-Shamir

Orcid: 0000-0001-8398-8218

Affiliations:
  • Tel Aviv University, Israel
  • Massachusetts Institute of Technology, Cambridge, MA, USA (former)


According to our database1, Boaz Patt-Shamir authored at least 123 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distributed computing with the cloud.
Distributed Comput., March, 2024

2023
Non-Linear Ski Rental.
Theory Comput. Syst., October, 2023

Competitive Vertex Recoloring.
Algorithmica, July, 2023

2022
Proof-labeling schemes: Broadcast, unicast and in between.
Theor. Comput. Sci., 2022

2021
Selected articles from the 25th International Colloquium on Structural Information and Communication Complexity.
Theor. Comput. Sci., 2021

High Entropy Random Selection Protocols.
Algorithmica, 2021

2019
On-Line Path Computation and Function Placement in SDNs.
Theory Comput. Syst., 2019

Distributed distance computation and routing with small messages.
Distributed Comput., 2019

Randomized proof-labeling schemes.
Distributed Comput., 2019

Stable Secretaries.
Algorithmica, 2019

With Great Speed Come Small Buffers: Space-Bandwidth Tradeoffs for Routing.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2019 Principles of Distributed Computing Doctoral Dissertation Award.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Space-Optimal Packet Routing on Trees.
Proceedings of the 2019 IEEE Conference on Computer Communications, 2019

2018
Near-Optimal Distributed Maximum Flow.
SIAM J. Comput., 2018

Constant-Time Local Computation Algorithms.
Theory Comput. Syst., 2018

Distributed backup placement in networks.
Distributed Comput., 2018

2018 Edsger W. Dijkstra Prize in Distributed Computing.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

On the Probe Complexity of Local Computation Algorithms.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Scheduling multipacket frames with frame deadlines.
J. Sched., 2017

The Space Requirement of Local Forwarding on Acyclic Networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Clock Synchronization.
Encyclopedia of Algorithms, 2016

Comparison-based interactive collaborative filtering.
Theor. Comput. Sci., 2016

Clique Here: On the Distributed Complexity in Fully-Connected Networks.
Parallel Process. Lett., 2016

Competitive Path Computation and Function Placement in SDNs.
CoRR, 2016

Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems.
Algorithmica, 2016

Buffer Size for Routing Limited-Rate Adversarial Traffic.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015
Non-additive two-option ski rental.
Theor. Comput. Sci., 2015

Improved Distributed Approximate Matching.
J. ACM, 2015

Better Online Deterministic Packet Routing on Grids.
CoRR, 2015

Better Deterministic Online Packet Routing on Grids.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Fast Partial Distance Estimation and Applications.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Near-Optimal Distributed Maximum Flow: Extended Abstract.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014
Competitive router scheduling with structured data.
Theor. Comput. Sci., 2014

On Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Improved distributed steiner forest construction.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Competitive buffer management with packet dependencies.
Theor. Comput. Sci., 2013

Online Scheduling with Interval Conflicts.
Theory Comput. Syst., 2013

Fast routing table construction using small messages: extended abstract.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental.
SIAM J. Discret. Math., 2012

Online Set Packing.
SIAM J. Comput., 2012

Distributed approximation of cellular coverage.
J. Parallel Distributed Comput., 2012

Sparse reliable graph backbones.
Inf. Comput., 2012

Vector bin packing with multiple-choice.
Discret. Appl. Math., 2012

Fast Routing Table Construction Using Small Messages
CoRR, 2012

Overflow management with multipart packets.
Comput. Networks, 2012

2011
Video distribution under multiple constraints.
Theor. Comput. Sci., 2011

Finding Similar Users in Social Networks.
Theory Comput. Syst., 2011

Distributed discovery of large near-cliques.
Distributed Comput., 2011

Recommender systems with non-binary grades.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

The round complexity of distributed sorting: extended abstract.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Improved Collaborative Filtering.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Distributed error confinement.
ACM Trans. Algorithms, 2010

Foreword.
Theory Comput. Syst., 2010

Special issue on PODC 2008.
Distributed Comput., 2010

On the complexity of distributed stable matching with small messages.
Distributed Comput., 2010

Online set packing and competitive scheduling of multi-part tasks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Distributed Approximate Matching.
SIAM J. Comput., 2009

Tell Me Who I Am: An Interactive Recommendation System.
Theory Comput. Syst., 2009

Finding similar users in social networks: extended abstract.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Brief announcement: a note on distributed stable matching.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

A Note on Distributed Stable Matching.
Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

2008
Clock Synchronization.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Collaborate with Strangers to Find Own Preferences.
Theory Comput. Syst., 2008

Ski rental with two general options.
Inf. Process. Lett., 2008

A game of timing and visibility.
Games Econ. Behav., 2008

Approximate distributed top- <i>k</i> queries.
Distributed Comput., 2008

Reputation, Trust and Recommendation Systems in Peer-to-Peer Systems.
Proceedings of the Structural Information and Communication Complexity, 2008

Competitive analysis of buffer policies with SLA commitments.
Proceedings of the 16th annual IEEE International Conference on Network Protocols, 2008

2007
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock.
IEEE Trans. Dependable Secur. Comput., 2007

A note on efficient aggregate queries in sensor networks.
Theor. Comput. Sci., 2007

Asynchronous recommendation systems.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Asynchronous Active Recommendation Systems.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006
Jitter-approximation tradeoff for periodic scheduling.
Wirel. Networks, 2006

Distributed MST for constant diameter graphs.
Distributed Comput., 2006

General Perfectly Periodic Scheduling.
Algorithmica, 2006

Publish and perish: definition and analysis of an <i>n</i>-person publication impact game.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Approximate Top-k Queries in Sensor Networks.
Proceedings of the Structural Information and Communication Complexity, 2006

Communication-Efficient Probabilistic Quorum Systems for Sensor Networks.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

2005
Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds.
SIAM J. Comput., 2005

Timing Games and Shared Memory.
Proceedings of the Distributed Computing, 19th International Conference, 2005

Improved recommendation systems.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Asynchronous and Fully Self-stabilizing Time-Adaptive Majority Consensus.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Adaptive Collaboration in Peer-to-Peer Systems.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

2004
Broadcast Disks with Polynomial Cost Functions.
Wirel. Networks, 2004

Traversals of object structures: Specification and Efficient Implementation.
ACM Trans. Program. Lang. Syst., 2004

New stability results for adversarial queuing.
SIAM J. Comput., 2004

Buffer Overflow Management in QoS Switches.
SIAM J. Comput., 2004

Optimal smoothing schedules for real-time streams.
Distributed Comput., 2004

Efficient algorithms for periodic scheduling.
Comput. Networks, 2004

Collaboration of untrusting peers with changing interests.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Adaptive Stabilization of Reactive Protocols.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
Dispatching in perfectly-periodic schedules.
J. Algorithms, 2003

Nearly optimal FIFO buffer management for two packet classes.
Comput. Networks, 2003

MST construction in O(log log n) communication rounds.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

Buffer Overflows of Merging Streams.
Proceedings of the Algorithms, 2003

2002
Average-Case Analysis of Greedy Packet Scheduling.
Theory Comput. Syst., 2002

Nearly optimal perfectly periodic schedules.
Distributed Comput., 2002

Nearly optimal FIFO buffer management for DiffServ.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Efficient periodic scheduling by trees.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001
Jitter control in QoS networks.
IEEE/ACM Trans. Netw., 2001

2000
Exact Analysis of Exact Change: The <i>k</i>-Payment Problem.
SIAM J. Discret. Math., 2000

The Las-Vegas Processor Identity Problem (How and When to Be Unique).
J. Algorithms, 2000

Optimal smoothing schedules for real-time streams (extended abstract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Average-case analysis of greedy packet scheduling (extended astract).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

1999
Stabilizing Time-Adaptive Protocols.
Theor. Comput. Sci., 1999

A Note on Randomized Mutual Search.
Inf. Process. Lett., 1999

Optimal and Efficient Clock Synchronization Under Drifting Clocks.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Asynchronous Time-Adaptive Self Stabilization.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

The Refinement Relation of Graph-Based Generic Programs.
Proceedings of the Generic Programming, 1998

1997
A New Approach to Compiling Adaptive Programs.
Sci. Comput. Program., 1997

Time-Adaptive Self Stabilization.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
Self-stabilizing end-to-end communication.
J. High Speed Networks, 1996

1995
Many-to-one packet routing on grids (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
A theory of clock synchronization.
PhD thesis, 1994

Self-Stabilization by Local Checking and Global Reset (Extended Abstract).
Proceedings of the Distributed Algorithms, 8th International Workshop, 1994

A theory of clock synchronization (extended abstract).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Bounding the Unbounded.
Proceedings of the Proceedings IEEE INFOCOM '94, 1994

1993
Time-Space Tradeoffs for Set Operations.
Theor. Comput. Sci., 1993

Greedy Packet Scheduling on Shortest Paths.
J. Algorithms, 1993

Time optimal self-stabilizing synchronization.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

1992
Adapting to Asynchronous Dynamic Networks (Extended Abstract)
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
Greedy Packet Scheduling on Shortest Paths (Preliminary Version).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Self-Stabilization By Local Checking and Correction (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991


  Loading...