Author image not provided
 Sepehr Assadi

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.87
Citation Count13
Publication count15
Publication years2014-2018
Available for download11
Average downloads per article82.55
Downloads (cumulative)908
Downloads (12 Months)610
Downloads (6 Weeks)76
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author




BOOKMARK & SHARE


15 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 15 of 15
Sort by:

1
January 2018 SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 6,   Downloads (12 Months): 6,   Downloads (Overall): 6

Full text available: PDFPDF
We study the maximum k -set coverage problem in the following distributed setting. A collection of input sets S 1 , ..., S m over a universe [ n ] is partitioned across p machines and the goal is to find k sets whose union covers the most number of ...

2 published by ACM
December 2017 ACM Transactions on Economics and Computation (TEAC) - Special Issue on Wine'15: Volume 5 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 5,   Downloads (Overall): 5

Full text available: PDFPDF
A classical trading experiment consists of a set of unit demand buyers and unit supply sellers with identical items. Each agent’s value or opportunity cost for the item is his private information, and preferences are quasilinear. Trade between agents employs a double oral auction (DOA) in which both buyers and ...
Keywords: Double oral auction

3 published by ACM
December 2017 ACM SIGACT News: Volume 48 Issue 4, December 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 13,   Downloads (12 Months): 13,   Downloads (Overall): 13

Full text available: PDFPDF

4
August 2017 Theoretical Computer Science: Volume 689 Issue C, August 2017
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 0

Motivated by the bus escape routing problem in printed circuit boards, we study the following rectangle escape problem: given a set S of n axis-aligned rectangles inside an axis-aligned rectangular region R, extend each rectangle in S toward one of the four borders of R so that the maximum density ...
Keywords: NP-completeness, Inapproximability, Approximation algorithms, Randomized rounding, Rectangle escape

5 published by ACM
July 2017 SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 10,   Downloads (12 Months): 45,   Downloads (Overall): 45

Full text available: PDFPDF
A common approach for designing scalable algorithms for massive data sets is to distribute the computation across, say k , machines and process the data using limited communication between them. A particularly appealing framework here is the simultaneous communication model whereby each machine constructs a small representative summary of its ...
Keywords: matching, simultaneous communication complexity, randomized composable coresets, vertex cover, distributed computing, mapreduce algorithms

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): 5,   Downloads (12 Months): 43,   Downloads (Overall): 43

Full text available: PDFPDF
We study the necessity of interaction for obtaining efficient allocations in combinatorial auctions with subadditive bidders . This problem was originally introduced by Dobzinski, Nisan, and Oren (STOC'14) as the following simple market scenario: m items are to be allocated among n bidders in a distributed setting where bidders valuations ...
Keywords: combinatorial auctions, round-approximation tradeoff, multi-party communication complexity

7 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): 5,   Downloads (12 Months): 58,   Downloads (Overall): 58

Full text available: PDFPDF
In the stochastic matching problem, we are given a general (not necessarily bipartite) graph G ( V , E ), where each edge in E is realized with some constant probability p > 0 and the goal is to compute a bounded-degree (bounded by a function depending only on p ...
Keywords: kidney exchange, stochastic matching

8 published by ACM
May 2017 PODS '17: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 7,   Downloads (12 Months): 201,   Downloads (Overall): 201

Full text available: PDFPDF
We study the classic set cover problem in the streaming model: the sets that comprise the instance are revealed one by one in a stream and the goal is to solve the problem by making one or few passes over the stream while maintaining a sublinear space o ( mn ...
Keywords: set cover, maximum coverage, streaming algorithms, communication complexity

9
January 2017 SODA '17: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 36,   Downloads (Overall): 36

Full text available: PDFPDF
We study the problem of estimating the maximum matching size in graphs whose edges are revealed in a streaming manner. We consider both insertion-only streams, which only contain edge insertions, and dynamic streams that allow both insertions and deletions of the edges, and present new upper and lower bound results ...

10 published by ACM
July 2016 EC '16: Proceedings of the 2016 ACM Conference on Economics and Computation
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 9,   Downloads (12 Months): 65,   Downloads (Overall): 144

Full text available: PDFPDF
Motivated by an application in kidney exchange , we study the following stochastic matching problem: we are given a graph G ( V,E ) (not necessarily bipartite), where each edge in E is realized with some constant probability p > 0 and the goal is to find a maximum matching ...
Keywords: kidney exchange, stochastic matching

11 published by ACM
June 2016 STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 5,   Downloads (12 Months): 52,   Downloads (Overall): 117

Full text available: PDFPDF
We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem. For finding an α-approximate set cover (for α= o (√ n )) via a single-pass streaming algorithm, we show that Θ( mn /α) space is both sufficient and necessary (up to an O (log ...
Keywords: communication complexity, covering integer programs, Streaming algorithms, set cover

12
January 2016 SODA '16: Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 4,   Downloads (12 Months): 43,   Downloads (Overall): 53

Full text available: PDFPDF
We study the problem of finding an approximate maximum matching in two closely related computational models, namely, the dynamic graph streaming model and the simultaneous multi-party communication model. In the dynamic graph streaming model, the input graph is revealed as a stream of edge insertions and deletions, and the goal ...

13 published by ACM
January 2016 ACM Transactions on Architecture and Code Optimization (TACO): Volume 12 Issue 4, January 2016
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 5,   Downloads (12 Months): 48,   Downloads (Overall): 162

Full text available: PDFPDF
Compile-time optimizations play an important role in the efficient design of real-time embedded systems. Usually, compile-time optimizations are designed to reduce average-case execution time (ACET). While ACET is a main concern in high-performance computing systems, in real-time embedded systems, concerns are different and worst-case execution time (WCET) is much more ...
Keywords: Compile-time optimization, hyperblock, WCET

14
December 2015 WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

A classical trading experiment consists of a set of unit demand buyers and unit supply sellers with identical items. Each agent's value or opportunity cost for the item is their private information and preferences are quasi-linear. Trade between agents employs a double oral auction DOA in which both buyers and ...

15
December 2014 Algorithmica: Volume 70 Issue 4, December 2014
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

We revisit the problem of finding $$k$$k paths with a minimum number of shared edges between two vertices of a graph. An edge is called shared if it is used in more than one of the $$k$$k paths. We provide a $${\lfloor {k/2}\rfloor }$$�k/2�-approximation algorithm for this problem, improving the ...
Keywords: Approximation algorithms, Shared edges, Inapproximability, Network design



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