Author image not provided
 Boaz Patt-Shamir

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article9.56
Citation Count994
Publication count104
Publication years1991-2017
Available for download49
Average downloads per article316.35
Downloads (cumulative)15,501
Downloads (12 Months)462
Downloads (6 Weeks)50
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


112 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 112
Result page: 1 2 3 4 5 6

Sort by:

1 published by ACM
July 2018 PODC '18: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8,   Downloads (12 Months): 53,   Downloads (Overall): 53

Full text available: PDFPDF
The Dijkstra Prize Committee has decided to grant the 2018 Edsger W. Dijkstra Prize in Distributed Computing to Bowen Alpern and Fred B. Schneider for their paper: B. Alpern, F.B. Schneider: Defining liveness, published in Information Processing Letters 21(4), October 1985, pages 181-185. The Prize is awarded for outstanding papers ...

2
April 2018 Distributed Computing: Volume 31 Issue 2, April 2018
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We consider the backup placement problem, defined as follows. Some nodes (processors) in a given network have objects (e.g., files, tasks) whose backups should be stored in additional nodes for increased fault resilience. To minimize the disturbance in case of a failure, it is required that a backup copy should ...

3
February 2018 Theory of Computing Systems: Volume 62 Issue 2, February 2018
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Local computation algorithms (LCAs) produce small parts of a single (possibly approximate) solution to a given search problem using time and space sublinear in the size of the input. In this work we present LCAs whose time complexity (and usually also space complexity) is independent of the input size. Specifically, ...
Keywords: Approximation algorithms, Sublinear algorithms, Local computation algorithms, Maximal weight forest

4
December 2017 Journal of Scheduling: Volume 20 Issue 6, December 2017
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

We consider scheduling information units called frames, each with a delivery deadline. Frames consist of packets, which arrive online in a roughly periodic fashion, and compete on allocation of transmission slots. A frame is deemed useful only if all its packets are delivered before its deadline. We focus on a ...
Keywords: Communication networks, Online algorithms, Scheduling

5 published by ACM
July 2017 PODC '17: Proceedings of the ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 4,   Downloads (12 Months): 58,   Downloads (Overall): 126

Full text available: PDFPDF
We consider packet forwarding in acyclic networks with bounded adversarial packet injections. We focus on the model of adversarial queuing theory, where each packet is injected into the network with a prescribed path to its destination, and both the long-range average rate and the short-range burst size are bounded. Each ...
Keywords: adversarial queuing theory, buffer size, distributed algorithms, network algorithms, odd even downhill, packet forwarding, queuing network, store and forward

6 published by ACM
June 2017 EC '17: Proceedings of the 2017 ACM Conference on Economics and Computation
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 32,   Downloads (Overall): 108

Full text available: PDFPDF
We define and study a new variant of the secretary problem. Whereas in the classic setting multiple secretaries compete for a single position, we study the case where the secretaries arrive one at a time and are assigned, in an on-line fashion, to one of multiple positions. Secretaries are ranked ...
Keywords: blocking pair, many-to-many matching, secretary problem

7
May 2016 Theoretical Computer Science: Volume 628 Issue C, May 2016
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

In this work we study the interactive model of comparison-based collaborative filtering. Each player prefers one object from each pair of objects. However, revealing what is a player's preference between two objects can be done only by asking the player specifically about that pair, an action called probing. The goal ...
Keywords: Parallel algorithms, Collaborative filtering, Social networks, Recommender systems

8
April 2016 Algorithmica: Volume 74 Issue 4, April 2016
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

We consider two new variants of online integer programs that are duals. In the packing problem we are given a set of items and a collection of knapsack constraints over these items that are revealed over time in an online fashion. Upon arrival of a constraint we may need to ...
Keywords: Competitive analysis, Online set packing, Prize-collecting multi-covering, Packing integer programs, Team formation, Randomized algorithm

9 published by ACM
November 2015 Journal of the ACM (JACM): Volume 62 Issue 5, November 2015
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 1,   Downloads (12 Months): 42,   Downloads (Overall): 273

Full text available: PDFPDF
We present distributed network algorithms to compute weighted and unweighted matchings with improved approximation ratios and running times. The computational model is a network of processors exchanging O (log n )-bit messages (the CONGEST model). For unweighted graphs, we give an algorithm providing (1-ε)-approximation in O (log n ) time ...
Keywords: network algorithms, CONGEST model

10 published by ACM
July 2015 PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 2,   Downloads (12 Months): 18,   Downloads (Overall): 156

Full text available: PDFPDF
We study approximate distributed solutions to the weighted all-pairs shortest-paths (APSP) problem in the CONGEST model. We obtain the following results. A deterministic (1+epsilon)-approximation to APSP with running time O(ε -2 n log n) rounds. The best previously known algorithm was randomized and slower by a Theta(log n) factor. In ...
Keywords: Steiner forests, congest model, routing table construction, source detection, weighted all-pairs shortest paths

11 published by ACM
July 2015 PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1,   Downloads (12 Months): 22,   Downloads (Overall): 166

Full text available: PDFPDF
We present a near-optimal distributed algorithm for (1+o(1))-approximation of single-commodity maximum flow in undirected weighted networks that runs in (D+ √n)⋅ n o(1) communication rounds in the Congest model. Here, n and D denote the number of nodes and the network diameter, respectively. This is the first improvement over the ...
Keywords: congest model, distributed computing, distributed congestion approximator, gradient descent, maximum flow

12 published by ACM
July 2015 PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 126

Full text available: PDFPDF
Proof-labeling schemes, introduced by Korman, Kutten and Peleg [PODC 2005], are a mechanism to certify that a network configuration satisfies a given boolean predicate. Such mechanisms find applications in many contexts, e.g., the design of fault-tolerant distributed algorithms. In a proof-labeling scheme, predicate verification consists of neighbors exchanging labels, whose ...
Keywords: communication complexity, distributed verfification

13 published by ACM
June 2015 SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 15,   Downloads (Overall): 140

Full text available: PDFPDF
We consider the backup placement problem, defined as follows. Some nodes (processors) in a given network have objects (e.g., files, tasks) whose backups should be stored in additional nodes for increased fault resilience. To minimize the disturbance in case of a failure, it is required that a backup copy should ...
Keywords: approximation algorithms, distributed algorithms, f-matching, load balancing

14 published by ACM
June 2015 SPAA '15: Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Downloads (Overall): 93

Full text available: PDFPDF
We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link capacities and buffer sizes, and packets may be dropped at any time. The goal of the routing algorithm is to maximize throughput, i.e., route as ...
Keywords: admission control, bounded buffers, grid networks, online algorithms, packet routing

15 published by ACM
July 2014 PODC '14: Proceedings of the 2014 ACM symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 1,   Downloads (12 Months): 8,   Downloads (Overall): 138

Full text available: PDFPDF
We present new distributed algorithms for constructing a Steiner Forest in the CONGEST model. Our deterministic algorithm finds, for any given constant ε>0, a (2+ε)-approximation in ~O(sk+√{min(st,n)}) rounds, where s is the shortest path diameter, t is the number of terminals, k is the number of terminal components in the ...
Keywords: congest model, minimum spanning tree}, network algorithms, steiner tree

16 published by ACM
June 2013 STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 18
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Downloads (Overall): 189

Full text available: PDFPDF
We describe a distributed randomized algorithm to construct routing tables. Given 0< ε <= 1/2, the algorithm runs in time ~O(n 1/2+ε + HD), where n is the number of nodes and HD denotes the diameter of the network in hops (i.e., as if the network is unweighted). The weighted ...
Keywords: approximate shortest paths, routing, small messages

17
July 2012 Discrete Applied Mathematics: Volume 160 Issue 10-11, July, 2012
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 3

We consider a variant of bin packing called multiple-choice vector bin packing. In this problem, we are given a set of n items, where each item can be selected in one of several D-dimensional incarnations. We are also given T bin types, each with its own cost andD-dimensional size. Our ...
Keywords: Multiple-choice vector bin packing, Approximation algorithms, Multiple-choice multidimensional knapsack

18
March 2012 Journal of Parallel and Distributed Computing: Volume 72 Issue 3, March, 2012
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 3

We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered by a specific subset of the base stations, and its profit is obtained only if its demand is provided in full. ...
Keywords: Cellular networks, Assignment problem, Distributed algorithms

19
January 2012 Information and Computation: Volume 210, January, 2012
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 2

Given a connected graph G and a failure probability p(e) for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independently with probability p(e). In this paper it is shown that every n-vertex graph contains a sparse ...
Keywords: Tutte polynomial, Network reliability, Sparse subgraphs

20
December 2011 ISAAC'11: Proceedings of the 22nd international conference on Algorithms and Computation
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We consider the interactive model of collaborative filtering, where each member of a given set of users has a grade for each object in a given set of objects. The users do not know the grades at start, but a user can <em>probe</em> any object, thereby learning her grade for ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us