BibTeX records: Sepehr Assadi

download as .bib file

@inproceedings{DBLP:conf/innovations/AssadiKK19,
  author    = {Sepehr Assadi and
               Michael Kapralov and
               Sanjeev Khanna},
  title     = {A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs
               via Edge Sampling},
  booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
               2019, January 10-12, 2019, San Diego, California, {USA}},
  pages     = {6:1--6:20},
  year      = {2019},
  crossref  = {DBLP:conf/innovations/2019},
  url       = {https://doi.org/10.4230/LIPIcs.ITCS.2019.6},
  doi       = {10.4230/LIPIcs.ITCS.2019.6},
  timestamp = {Wed, 09 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/AssadiKK19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiB19,
  author    = {Sepehr Assadi and
               Aaron Bernstein},
  title     = {Towards a Unified Theory of Sparsification for Matching Problems},
  booktitle = {2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January
               8-9, 2019 - San Diego, CA, {USA}},
  pages     = {11:1--11:20},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019sosa},
  url       = {https://doi.org/10.4230/OASIcs.SOSA.2019.11},
  doi       = {10.4230/OASIcs.SOSA.2019.11},
  timestamp = {Wed, 09 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AssadiB19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AgarwalAK19,
  author    = {Arpit Agarwal and
               Sepehr Assadi and
               Sanjeev Khanna},
  title     = {Stochastic Submodular Cover with Limited Adaptivity},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {323--342},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.21},
  doi       = {10.1137/1.9781611975482.21},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AgarwalAK19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiCK19,
  author    = {Sepehr Assadi and
               Yu Chen and
               Sanjeev Khanna},
  title     = {Sublinear Algorithms for ({\(\Delta\)} + 1) Vertex Coloring},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {767--786},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.48},
  doi       = {10.1137/1.9781611975482.48},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AssadiCK19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiBBMS19,
  author    = {Sepehr Assadi and
               MohammadHossein Bateni and
               Aaron Bernstein and
               Vahab S. Mirrokni and
               Cliff Stein},
  title     = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
               Massive Graphs},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {1616--1635},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.98},
  doi       = {10.1137/1.9781611975482.98},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AssadiBBMS19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiOSS19,
  author    = {Sepehr Assadi and
               Krzysztof Onak and
               Baruch Schieber and
               Shay Solomon},
  title     = {Fully Dynamic Maximal Independent Set with Sublinear in n Update Time},
  booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  pages     = {1919--1936},
  year      = {2019},
  crossref  = {DBLP:conf/soda/2019},
  url       = {https://doi.org/10.1137/1.9781611975482.116},
  doi       = {10.1137/1.9781611975482.116},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AssadiOSS19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiK18,
  author    = {Sepehr Assadi and
               Sanjeev Khanna},
  title     = {Tight Bounds on the Round Complexity of the Distributed Maximum Coverage
               Problem},
  booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages     = {2412--2431},
  year      = {2018},
  crossref  = {DBLP:conf/soda/2018},
  url       = {https://doi.org/10.1137/1.9781611975031.155},
  doi       = {10.1137/1.9781611975031.155},
  timestamp = {Thu, 04 Jan 2018 13:32:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AssadiK18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiOSS18,
  author    = {Sepehr Assadi and
               Krzysztof Onak and
               Baruch Schieber and
               Shay Solomon},
  title     = {Fully dynamic maximal independent set with sublinear update time},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {815--826},
  year      = {2018},
  crossref  = {DBLP:conf/stoc/2018},
  url       = {https://doi.org/10.1145/3188745.3188922},
  doi       = {10.1145/3188745.3188922},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/AssadiOSS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-02793,
  author    = {Sepehr Assadi and
               Sanjeev Khanna},
  title     = {Tight Bounds on the Round Complexity of the Distributed Maximum Coverage
               Problem},
  journal   = {CoRR},
  volume    = {abs/1801.02793},
  year      = {2018},
  url       = {http://arxiv.org/abs/1801.02793},
  archivePrefix = {arXiv},
  eprint    = {1801.02793},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1801-02793},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-09709,
  author    = {Sepehr Assadi and
               Krzysztof Onak and
               Baruch Schieber and
               Shay Solomon},
  title     = {Fully Dynamic Maximal Independent Set with Sublinear Update Time},
  journal   = {CoRR},
  volume    = {abs/1802.09709},
  year      = {2018},
  url       = {http://arxiv.org/abs/1802.09709},
  archivePrefix = {arXiv},
  eprint    = {1802.09709},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1802-09709},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02974,
  author    = {Sepehr Assadi and
               Xiaorui Sun and
               Omri Weinstein},
  title     = {Massively Parallel Algorithms for Finding Well-Connected Components
               in Sparse Graphs},
  journal   = {CoRR},
  volume    = {abs/1805.02974},
  year      = {2018},
  url       = {http://arxiv.org/abs/1805.02974},
  archivePrefix = {arXiv},
  eprint    = {1805.02974},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1805-02974},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-10051,
  author    = {Sepehr Assadi and
               Krzysztof Onak and
               Baruch Schieber and
               Shay Solomon},
  title     = {Fully Dynamic Maximal Independent Set with Sublinear in n Update Time},
  journal   = {CoRR},
  volume    = {abs/1806.10051},
  year      = {2018},
  url       = {http://arxiv.org/abs/1806.10051},
  archivePrefix = {arXiv},
  eprint    = {1806.10051},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1806-10051},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-08886,
  author    = {Sepehr Assadi and
               Yu Chen and
               Sanjeev Khanna},
  title     = {Sublinear Algorithms for ({\(\Delta\)}+ 1) Vertex Coloring},
  journal   = {CoRR},
  volume    = {abs/1807.08886},
  year      = {2018},
  url       = {http://arxiv.org/abs/1807.08886},
  archivePrefix = {arXiv},
  eprint    = {1807.08886},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1807-08886},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-13351,
  author    = {Arpit Agarwal and
               Sepehr Assadi and
               Sanjeev Khanna},
  title     = {Stochastic Submodular Cover with Limited Adaptivity},
  journal   = {CoRR},
  volume    = {abs/1810.13351},
  year      = {2018},
  url       = {http://arxiv.org/abs/1810.13351},
  archivePrefix = {arXiv},
  eprint    = {1810.13351},
  timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1810-13351},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-02009,
  author    = {Sepehr Assadi and
               Aaron Bernstein},
  title     = {Towards a Unified Theory of Sparsification for Matching Problems},
  journal   = {CoRR},
  volume    = {abs/1811.02009},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.02009},
  archivePrefix = {arXiv},
  eprint    = {1811.02009},
  timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1811-02009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-06444,
  author    = {Sepehr Assadi and
               Eric Balkanski and
               Renato Paes Leme},
  title     = {Secretary Ranking with Minimal Inversions},
  journal   = {CoRR},
  volume    = {abs/1811.06444},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.06444},
  archivePrefix = {arXiv},
  eprint    = {1811.06444},
  timestamp = {Sun, 25 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1811-06444},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-07780,
  author    = {Sepehr Assadi and
               Michael Kapralov and
               Sanjeev Khanna},
  title     = {A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs
               via Edge Sampling},
  journal   = {CoRR},
  volume    = {abs/1811.07780},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.07780},
  archivePrefix = {arXiv},
  eprint    = {1811.07780},
  timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1811-07780},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Assadi17,
  author    = {Sepehr Assadi},
  title     = {{SPAA} 2017 Review},
  journal   = {{SIGACT} News},
  volume    = {48},
  number    = {4},
  pages     = {87--90},
  year      = {2017},
  url       = {https://doi.org/10.1145/3173127.3173142},
  doi       = {10.1145/3173127.3173142},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/sigact/Assadi17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AhmadinejadAEYZ17,
  author    = {AmirMahdi Ahmadinejad and
               Sepehr Assadi and
               Ehsan Emamjomeh{-}Zadeh and
               Sadra Yazdanbod and
               Hamid Zarrabi{-}Zadeh},
  title     = {On the rectangle escape problem},
  journal   = {Theor. Comput. Sci.},
  volume    = {689},
  pages     = {126--136},
  year      = {2017},
  url       = {https://doi.org/10.1016/j.tcs.2017.05.040},
  doi       = {10.1016/j.tcs.2017.05.040},
  timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/AhmadinejadAEYZ17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/AssadiKLV17,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Rakesh Vohra},
  title     = {Fast Convergence in the Double Oral Auction},
  journal   = {{ACM} Trans. Economics and Comput.},
  volume    = {5},
  number    = {4},
  pages     = {20:1--20:18},
  year      = {2017},
  url       = {https://doi.org/10.1145/3084358},
  doi       = {10.1145/3084358},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/teco/AssadiKLV17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/Agarwal0AK17,
  author    = {Arpit Agarwal and
               Shivani Agarwal and
               Sepehr Assadi and
               Sanjeev Khanna},
  title     = {Learning with Limited Rounds of Adaptivity: Coin Tossing, Multi-Armed
               Bandits, and Ranking from Pairwise Comparisons},
  booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
               Amsterdam, The Netherlands, 7-10 July 2017},
  pages     = {39--75},
  year      = {2017},
  crossref  = {DBLP:conf/colt/2017},
  url       = {http://proceedings.mlr.press/v65/agarwal17c.html},
  timestamp = {Wed, 16 Aug 2017 11:08:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/Agarwal0AK17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Assadi17,
  author    = {Sepehr Assadi},
  title     = {Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set
               Cover Problem},
  booktitle = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
               of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
  pages     = {321--335},
  year      = {2017},
  crossref  = {DBLP:conf/pods/2017},
  url       = {https://doi.org/10.1145/3034786.3056116},
  doi       = {10.1145/3034786.3056116},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/pods/Assadi17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AssadiKL17,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {The Stochastic Matching Problem: Beating Half with a Non-Adaptive
               Algorithm},
  booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
               {EC} '17, Cambridge, MA, USA, June 26-30, 2017},
  pages     = {99--116},
  year      = {2017},
  crossref  = {DBLP:conf/sigecom/2017},
  url       = {https://doi.org/10.1145/3033274.3085146},
  doi       = {10.1145/3033274.3085146},
  timestamp = {Tue, 06 Nov 2018 16:57:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sigecom/AssadiKL17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/Assadi17,
  author    = {Sepehr Assadi},
  title     = {Combinatorial Auctions Do Need Modest Interaction},
  booktitle = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
               {EC} '17, Cambridge, MA, USA, June 26-30, 2017},
  pages     = {145--162},
  year      = {2017},
  crossref  = {DBLP:conf/sigecom/2017},
  url       = {https://doi.org/10.1145/3033274.3085121},
  doi       = {10.1145/3033274.3085121},
  timestamp = {Tue, 06 Nov 2018 16:57:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sigecom/Assadi17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiKL17,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {On Estimating Maximum Matching Size in Graph Streams},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  pages     = {1723--1742},
  year      = {2017},
  crossref  = {DBLP:conf/soda/2017},
  url       = {https://doi.org/10.1137/1.9781611974782.113},
  doi       = {10.1137/1.9781611974782.113},
  timestamp = {Sun, 15 Jul 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AssadiKL17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/AssadiK17,
  author    = {Sepehr Assadi and
               Sanjeev Khanna},
  title     = {Randomized Composable Coresets for Matching and Vertex Cover},
  booktitle = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms
               and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},
  pages     = {3--12},
  year      = {2017},
  crossref  = {DBLP:conf/spaa/2017},
  url       = {https://doi.org/10.1145/3087556.3087581},
  doi       = {10.1145/3087556.3087581},
  timestamp = {Tue, 06 Nov 2018 16:59:33 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/spaa/AssadiK17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL17,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {On Estimating Maximum Matching Size in Graph Streams},
  journal   = {CoRR},
  volume    = {abs/1701.04364},
  year      = {2017},
  url       = {http://arxiv.org/abs/1701.04364},
  archivePrefix = {arXiv},
  eprint    = {1701.04364},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiKL17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Assadi17,
  author    = {Sepehr Assadi},
  title     = {Tight Space-Approximation Tradeoff for the Multi-Pass Streaming Set
               Cover Problem},
  journal   = {CoRR},
  volume    = {abs/1703.01847},
  year      = {2017},
  url       = {http://arxiv.org/abs/1703.01847},
  archivePrefix = {arXiv},
  eprint    = {1703.01847},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Assadi17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Assadi17a,
  author    = {Sepehr Assadi},
  title     = {Combinatorial Auctions Do Need Modest Interaction},
  journal   = {CoRR},
  volume    = {abs/1705.01644},
  year      = {2017},
  url       = {http://arxiv.org/abs/1705.01644},
  archivePrefix = {arXiv},
  eprint    = {1705.01644},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Assadi17a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL17a,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {The Stochastic Matching Problem: Beating Half with a Non-Adaptive
               Algorithm},
  journal   = {CoRR},
  volume    = {abs/1705.02280},
  year      = {2017},
  url       = {http://arxiv.org/abs/1705.02280},
  archivePrefix = {arXiv},
  eprint    = {1705.02280},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiKL17a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiK17,
  author    = {Sepehr Assadi and
               Sanjeev Khanna},
  title     = {Randomized Composable Coresets for Matching and Vertex Cover},
  journal   = {CoRR},
  volume    = {abs/1705.08242},
  year      = {2017},
  url       = {http://arxiv.org/abs/1705.08242},
  archivePrefix = {arXiv},
  eprint    = {1705.08242},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiK17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-04599,
  author    = {Sepehr Assadi},
  title     = {Simple Round Compression for Parallel Vertex Cover},
  journal   = {CoRR},
  volume    = {abs/1709.04599},
  year      = {2017},
  url       = {http://arxiv.org/abs/1709.04599},
  archivePrefix = {arXiv},
  eprint    = {1709.04599},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1709-04599},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03076,
  author    = {Sepehr Assadi and
               MohammadHossein Bateni and
               Aaron Bernstein and
               Vahab S. Mirrokni and
               Cliff Stein},
  title     = {Coresets Meet {EDCS:} Algorithms for Matching and Vertex Cover on
               Massive Graphs},
  journal   = {CoRR},
  volume    = {abs/1711.03076},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.03076},
  archivePrefix = {arXiv},
  eprint    = {1711.03076},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1711-03076},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/taco/KafshdoozTAE16,
  author    = {Morteza Mohajjel Kafshdooz and
               Mohammadkazem Taram and
               Sepehr Assadi and
               Alireza Ejlali},
  title     = {A Compile-Time Optimization Method for {WCET} Reduction in Real-Time
               Embedded Systems through Block Formation},
  journal   = {{TACO}},
  volume    = {12},
  number    = {4},
  pages     = {66:1--66:25},
  year      = {2016},
  url       = {https://doi.org/10.1145/2845083},
  doi       = {10.1145/2845083},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/taco/KafshdoozTAE16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/AssadiKLT16,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Val Tannen},
  title     = {Algorithms for Provisioning Queries and Analytics},
  booktitle = {19th International Conference on Database Theory, {ICDT} 2016, Bordeaux,
               France, March 15-18, 2016},
  pages     = {18:1--18:18},
  year      = {2016},
  crossref  = {DBLP:conf/icdt/2016},
  url       = {https://doi.org/10.4230/LIPIcs.ICDT.2016.18},
  doi       = {10.4230/LIPIcs.ICDT.2016.18},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icdt/AssadiKLT16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/AssadiKL16,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {The Stochastic Matching Problem with (Very) Few Queries},
  booktitle = {Proceedings of the 2016 {ACM} Conference on Economics and Computation,
               {EC} '16, Maastricht, The Netherlands, July 24-28, 2016},
  pages     = {43--60},
  year      = {2016},
  crossref  = {DBLP:conf/sigecom/2016},
  url       = {https://doi.org/10.1145/2940716.2940769},
  doi       = {10.1145/2940716.2940769},
  timestamp = {Tue, 06 Nov 2018 16:57:13 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sigecom/AssadiKL16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AssadiKLY16,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Grigory Yaroslavtsev},
  title     = {Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication
               Model},
  booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages     = {1345--1364},
  year      = {2016},
  crossref  = {DBLP:conf/soda/2016},
  url       = {https://doi.org/10.1137/1.9781611974331.ch93},
  doi       = {10.1137/1.9781611974331.ch93},
  timestamp = {Sun, 15 Jul 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AssadiKLY16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKL16,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {Tight bounds for single-pass streaming complexity of the set cover
               problem},
  booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  pages     = {698--711},
  year      = {2016},
  crossref  = {DBLP:conf/stoc/2016},
  url       = {https://doi.org/10.1145/2897518.2897576},
  doi       = {10.1145/2897518.2897576},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/AssadiKL16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKL16,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li},
  title     = {Tight Bounds for Single-Pass Streaming Complexity of the Set Cover
               Problem},
  journal   = {CoRR},
  volume    = {abs/1603.05715},
  year      = {2016},
  url       = {http://arxiv.org/abs/1603.05715},
  archivePrefix = {arXiv},
  eprint    = {1603.05715},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiKL16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AssadiKLT15,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Val Tannen},
  title     = {Dynamic Sketching for Graph Optimization Problems with Applications
               to Cut-Preserving Sketches},
  booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
               and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
               Bangalore, India},
  pages     = {52--68},
  year      = {2015},
  crossref  = {DBLP:conf/fsttcs/2015},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.52},
  doi       = {10.4230/LIPIcs.FSTTCS.2015.52},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/AssadiKLT15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hcomp/AssadiHJ15,
  author    = {Sepehr Assadi and
               Justin Hsu and
               Shahin Jabbari},
  title     = {Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets},
  booktitle = {Proceedings of the Third {AAAI} Conference on Human Computation and
               Crowdsourcing, {HCOMP} 2015, November 8-11, 2015, San Diego, California,
               {USA.}},
  pages     = {12--21},
  year      = {2015},
  crossref  = {DBLP:conf/hcomp/2015},
  url       = {http://www.aaai.org/ocs/index.php/HCOMP/HCOMP15/paper/view/11598},
  timestamp = {Wed, 20 Jun 2018 17:42:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/hcomp/AssadiHJ15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/AssadiKLV15,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Rakesh V. Vohra},
  title     = {Fast Convergence in the Double Oral Auction},
  booktitle = {Web and Internet Economics - 11th International Conference, {WINE}
               2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
  pages     = {60--73},
  year      = {2015},
  crossref  = {DBLP:conf/wine/2015},
  url       = {https://doi.org/10.1007/978-3-662-48995-6\_5},
  doi       = {10.1007/978-3-662-48995-6\_5},
  timestamp = {Sun, 15 Jul 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wine/AssadiKLV15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLY15,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Grigory Yaroslavtsev},
  title     = {Tight Bounds for Linear Sketches of Approximate Matchings},
  journal   = {CoRR},
  volume    = {abs/1505.01467},
  year      = {2015},
  url       = {http://arxiv.org/abs/1505.01467},
  archivePrefix = {arXiv},
  eprint    = {1505.01467},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiKLY15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiHJ15,
  author    = {Sepehr Assadi and
               Justin Hsu and
               Shahin Jabbari},
  title     = {Online Assignment of Heterogeneous Tasks in Crowdsourcing Markets},
  journal   = {CoRR},
  volume    = {abs/1508.03593},
  year      = {2015},
  url       = {http://arxiv.org/abs/1508.03593},
  archivePrefix = {arXiv},
  eprint    = {1508.03593},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiHJ15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLV15,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Rakesh Vohra},
  title     = {Fast Convergence in the Double Oral Auction},
  journal   = {CoRR},
  volume    = {abs/1510.00086},
  year      = {2015},
  url       = {http://arxiv.org/abs/1510.00086},
  archivePrefix = {arXiv},
  eprint    = {1510.00086},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiKLV15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLT15,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Val Tannen},
  title     = {Dynamic Sketching for Graph Optimization Problems with Applications
               to Cut-Preserving Sketches},
  journal   = {CoRR},
  volume    = {abs/1510.03252},
  year      = {2015},
  url       = {http://arxiv.org/abs/1510.03252},
  archivePrefix = {arXiv},
  eprint    = {1510.03252},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiKLT15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AssadiKLT15a,
  author    = {Sepehr Assadi and
               Sanjeev Khanna and
               Yang Li and
               Val Tannen},
  title     = {Algorithms for Provisioning Queries and Analytics},
  journal   = {CoRR},
  volume    = {abs/1512.06143},
  year      = {2015},
  url       = {http://arxiv.org/abs/1512.06143},
  archivePrefix = {arXiv},
  eprint    = {1512.06143},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/AssadiKLT15a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AssadiENYZ14,
  author    = {Sepehr Assadi and
               Ehsan Emamjomeh{-}Zadeh and
               Ashkan Norouzi{-}Fard and
               Sadra Yazdanbod and
               Hamid Zarrabi{-}Zadeh},
  title     = {The Minimum Vulnerability Problem},
  journal   = {Algorithmica},
  volume    = {70},
  number    = {4},
  pages     = {718--731},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00453-014-9927-z},
  doi       = {10.1007/s00453-014-9927-z},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/AssadiENYZ14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/AssadiEYZ13,
  author    = {Sepehr Assadi and
               Ehsan Emamjomeh{-}Zadeh and
               Sadra Yazdanbod and
               Hamid Zarrabi{-}Zadeh},
  title     = {On the Rectangle Escape Problem},
  booktitle = {Proceedings of the 25th Canadian Conference on Computational Geometry,
               {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
  year      = {2013},
  crossref  = {DBLP:conf/cccg/2013},
  url       = {http://cccg.ca/proceedings/2013/papers/paper\_78.pdf},
  timestamp = {Thu, 14 Nov 2013 17:30:48 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/AssadiEYZ13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AssadiENYZ12,
  author    = {Sepehr Assadi and
               Ehsan Emamjomeh{-}Zadeh and
               Ashkan Norouzi{-}Fard and
               Sadra Yazdanbod and
               Hamid Zarrabi{-}Zadeh},
  title     = {The Minimum Vulnerability Problem},
  booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
               2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
  pages     = {382--391},
  year      = {2012},
  crossref  = {DBLP:conf/isaac/2012},
  url       = {https://doi.org/10.1007/978-3-642-35261-4\_41},
  doi       = {10.1007/978-3-642-35261-4\_41},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/AssadiENYZ12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2019,
  editor    = {Avrim Blum},
  title     = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
               2019, January 10-12, 2019, San Diego, California, {USA}},
  series    = {LIPIcs},
  volume    = {124},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-095-8},
  isbn      = {978-3-95977-095-8},
  timestamp = {Tue, 08 Jan 2019 13:39:45 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2019sosa,
  editor    = {Jeremy T. Fineman and
               Michael Mitzenmacher},
  title     = {2nd Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January
               8-9, 2019 - San Diego, CA, {USA}},
  series    = {{OASICS}},
  volume    = {69},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-099-6},
  isbn      = {978-3-95977-099-6},
  timestamp = {Tue, 08 Jan 2019 13:49:49 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2019sosa},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2019,
  editor    = {Timothy M. Chan},
  title     = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
               2019},
  publisher = {{SIAM}},
  year      = {2019},
  url       = {https://doi.org/10.1137/1.9781611975482},
  doi       = {10.1137/1.9781611975482},
  isbn      = {978-1-61197-548-2},
  timestamp = {Tue, 12 Mar 2019 15:52:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2019},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2018,
  editor    = {Artur Czumaj},
  title     = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  publisher = {{SIAM}},
  year      = {2018},
  url       = {https://doi.org/10.1137/1.9781611975031},
  doi       = {10.1137/1.9781611975031},
  isbn      = {978-1-61197-503-1},
  timestamp = {Thu, 04 Jan 2018 13:32:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2018,
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  publisher = {{ACM}},
  year      = {2018},
  url       = {http://dl.acm.org/citation.cfm?id=3188745},
  timestamp = {Thu, 21 Jun 2018 08:21:03 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/colt/2017,
  editor    = {Satyen Kale and
               Ohad Shamir},
  title     = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
               Amsterdam, The Netherlands, 7-10 July 2017},
  series    = {Proceedings of Machine Learning Research},
  volume    = {65},
  publisher = {{PMLR}},
  year      = {2017},
  url       = {http://jmlr.org/proceedings/papers/v65/},
  timestamp = {Wed, 16 Aug 2017 11:08:55 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/colt/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/pods/2017,
  editor    = {Emanuel Sallinger and
               Jan Van den Bussche and
               Floris Geerts},
  title     = {Proceedings of the 36th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
               of Database Systems, {PODS} 2017, Chicago, IL, USA, May 14-19, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {http://dl.acm.org/citation.cfm?id=3034786},
  isbn      = {978-1-4503-4198-1},
  timestamp = {Wed, 10 May 2017 22:15:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pods/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2017,
  editor    = {Constantinos Daskalakis and
               Moshe Babaioff and
               Herv{\'{e}} Moulin},
  title     = {Proceedings of the 2017 {ACM} Conference on Economics and Computation,
               {EC} '17, Cambridge, MA, USA, June 26-30, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3033274},
  doi       = {10.1145/3033274},
  isbn      = {978-1-4503-4527-9},
  timestamp = {Tue, 06 Nov 2018 16:57:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sigecom/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2017,
  editor    = {Philip N. Klein},
  title     = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  publisher = {{SIAM}},
  year      = {2017},
  url       = {https://doi.org/10.1137/1.9781611974782},
  doi       = {10.1137/1.9781611974782},
  isbn      = {978-1-61197-478-2},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/spaa/2017,
  editor    = {Christian Scheideler and
               Mohammad Taghi Hajiaghayi},
  title     = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms
               and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3087556},
  doi       = {10.1145/3087556},
  isbn      = {978-1-4503-4593-4},
  timestamp = {Tue, 06 Nov 2018 16:59:33 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/spaa/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icdt/2016,
  editor    = {Wim Martens and
               Thomas Zeume},
  title     = {19th International Conference on Database Theory, {ICDT} 2016, Bordeaux,
               France, March 15-18, 2016},
  series    = {LIPIcs},
  volume    = {48},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-002-6},
  isbn      = {978-3-95977-002-6},
  timestamp = {Wed, 23 Mar 2016 10:09:18 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icdt/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sigecom/2016,
  editor    = {Vincent Conitzer and
               Dirk Bergemann and
               Yiling Chen},
  title     = {Proceedings of the 2016 {ACM} Conference on Economics and Computation,
               {EC} '16, Maastricht, The Netherlands, July 24-28, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {https://doi.org/10.1145/2940716},
  doi       = {10.1145/2940716},
  isbn      = {978-1-4503-3936-0},
  timestamp = {Tue, 06 Nov 2018 16:57:13 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sigecom/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2016,
  editor    = {Robert Krauthgamer},
  title     = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  publisher = {{SIAM}},
  year      = {2016},
  url       = {https://doi.org/10.1137/1.9781611974331},
  doi       = {10.1137/1.9781611974331},
  isbn      = {978-1-61197-433-1},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2016,
  editor    = {Daniel Wichs and
               Yishay Mansour},
  title     = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2897518},
  isbn      = {978-1-4503-4132-5},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2015,
  editor    = {Prahladh Harsha and
               G. Ramalingam},
  title     = {35th {IARCS} Annual Conference on Foundation of Software Technology
               and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
               Bangalore, India},
  series    = {LIPIcs},
  volume    = {45},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2015},
  url       = {http://www.dagstuhl.de/dagpub/978-3-939897-97-2},
  isbn      = {978-3-939897-97-2},
  timestamp = {Wed, 29 Mar 2017 16:45:26 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/fsttcs/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/hcomp/2015,
  editor    = {Elizabeth Gerber and
               Panos Ipeirotis},
  title     = {Proceedings of the Third {AAAI} Conference on Human Computation and
               Crowdsourcing, {HCOMP} 2015, November 8-11, 2015, San Diego, California,
               {USA}},
  publisher = {{AAAI} Press},
  year      = {2015},
  url       = {http://www.aaai.org/Library/HCOMP/hcomp15contents.php},
  isbn      = {978-1-57735-741-4},
  timestamp = {Wed, 20 Jun 2018 17:42:18 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/hcomp/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wine/2015,
  editor    = {Evangelos Markakis and
               Guido Sch{\"{a}}fer},
  title     = {Web and Internet Economics - 11th International Conference, {WINE}
               2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9470},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-48995-6},
  doi       = {10.1007/978-3-662-48995-6},
  isbn      = {978-3-662-48994-9},
  timestamp = {Fri, 26 May 2017 00:49:40 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/wine/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cccg/2013,
  title     = {Proceedings of the 25th Canadian Conference on Computational Geometry,
               {CCCG} 2013, Waterloo, Ontario, Canada, August 8-10, 2013},
  publisher = {Carleton University, Ottawa, Canada},
  year      = {2013},
  url       = {http://cccg.ca/proceedings/2013/},
  timestamp = {Thu, 14 Nov 2013 17:30:48 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/cccg/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2012,
  editor    = {Kun{-}Mao Chao and
               Tsan{-}sheng Hsu and
               Der{-}Tsai Lee},
  title     = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
               2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7676},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-35261-4},
  doi       = {10.1007/978-3-642-35261-4},
  isbn      = {978-3-642-35260-7},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier