BibTeX records: Seshadhri Comandur

download as .bib file

@inproceedings{DBLP:conf/innovations/ChakrabartyS19,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Adaptive Boolean Monotonicity Testing in Total Influence Time},
  booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS}
               2019, January 10-12, 2019, San Diego, California, {USA}},
  pages     = {20:1--20:7},
  year      = {2019},
  crossref  = {DBLP:conf/innovations/2019},
  url       = {https://doi.org/10.4230/LIPIcs.ITCS.2019.20},
  doi       = {10.4230/LIPIcs.ITCS.2019.20},
  timestamp = {Wed, 09 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/ChakrabartyS19},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/SariyuceSP18,
  author    = {Ahmet Erdem Sariy{\"{u}}ce and
               C. Seshadhri and
               Ali Pinar},
  title     = {Local Algorithms for Hierarchical Dense Subgraph Discovery},
  journal   = {{PVLDB}},
  volume    = {12},
  number    = {1},
  pages     = {43--56},
  year      = {2018},
  url       = {http://www.vldb.org/pvldb/vol12/p43-sariyuce.pdf},
  timestamp = {Tue, 16 Oct 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/pvldb/SariyuceSP18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0003SS18,
  author    = {Akash Kumar and
               C. Seshadhri and
               Andrew Stolman},
  title     = {Finding Forbidden Minors in Sublinear Time: {A} n{\^{}}1/2+o(1)-Query
               One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs},
  booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2018, Paris, France, October 7-9, 2018},
  pages     = {509--520},
  year      = {2018},
  crossref  = {DBLP:conf/focs/2018},
  url       = {https://doi.org/10.1109/FOCS.2018.00055},
  doi       = {10.1109/FOCS.2018.00055},
  timestamp = {Sun, 23 Dec 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/0003SS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FoxRSWW18,
  author    = {Jacob Fox and
               Tim Roughgarden and
               C. Seshadhri and
               Fan Wei and
               Nicole Wein},
  title     = {Finding Cliques in Social Networks: {A} New Distribution-Free Model},
  booktitle = {45th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
  pages     = {55:1--55:15},
  year      = {2018},
  crossref  = {DBLP:conf/icalp/2018},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2018.55},
  doi       = {10.4230/LIPIcs.ICALP.2018.55},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/FoxRSWW18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlackCS18,
  author    = {Hadley Black and
               Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A \emph{o}(\emph{d}) {\(\cdot\)} polylog \emph{n} Monotonicity Tester
               for Boolean Functions over the Hypergrid [\emph{n}]\({}^{\mbox{\emph{d}}}\)},
  booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
  pages     = {2133--2151},
  year      = {2018},
  crossref  = {DBLP:conf/soda/2018},
  url       = {https://doi.org/10.1137/1.9781611975031.139},
  doi       = {10.1137/1.9781611975031.139},
  timestamp = {Thu, 04 Jan 2018 13:32:12 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/BlackCS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EdenRS18,
  author    = {Talya Eden and
               Dana Ron and
               C. Seshadhri},
  title     = {On approximating the number of k-cliques in sublinear 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     = {722--734},
  year      = {2018},
  crossref  = {DBLP:conf/stoc/2018},
  url       = {https://doi.org/10.1145/3188745.3188810},
  doi       = {10.1145/3188745.3188810},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/EdenRS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/EdenJPRS18,
  author    = {Talya Eden and
               Shweta Jain and
               Ali Pinar and
               Dana Ron and
               C. Seshadhri},
  title     = {Provable and Practical Approximations for the Degree Distribution
               using Sublinear Graph Samples},
  booktitle = {Proceedings of the 2018 World Wide Web Conference on World Wide Web,
               {WWW} 2018, Lyon, France, April 23-27, 2018},
  pages     = {449--458},
  year      = {2018},
  crossref  = {DBLP:conf/www/2018},
  url       = {https://doi.org/10.1145/3178876.3186111},
  doi       = {10.1145/3178876.3186111},
  timestamp = {Wed, 21 Nov 2018 12:44:11 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/EdenJPRS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-02816,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Adaptive Boolean Monotonicity Testing in Total Influence Time},
  journal   = {CoRR},
  volume    = {abs/1801.02816},
  year      = {2018},
  url       = {http://arxiv.org/abs/1801.02816},
  archivePrefix = {arXiv},
  eprint    = {1801.02816},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1801-02816},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-07431,
  author    = {Jacob Fox and
               Tim Roughgarden and
               C. Seshadhri and
               Fan Wei and
               Nicole Wein},
  title     = {Finding Cliques in Social Networks: {A} New Distribution-Free Model},
  journal   = {CoRR},
  volume    = {abs/1804.07431},
  year      = {2018},
  url       = {http://arxiv.org/abs/1804.07431},
  archivePrefix = {arXiv},
  eprint    = {1804.07431},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1804-07431},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-08187,
  author    = {Akash Kumar and
               C. Seshadhri and
               Andrew Stolman},
  title     = {Fiding forbidden minors in sublinear time: a O(n\({}^{\mbox{1/2 +
               o(1)}}\))-query one-sided tester for minor closed properties on bounded
               degree graphs},
  journal   = {CoRR},
  volume    = {abs/1805.08187},
  year      = {2018},
  url       = {http://arxiv.org/abs/1805.08187},
  archivePrefix = {arXiv},
  eprint    = {1805.08187},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1805-08187},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01427,
  author    = {Hadley Black and
               Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Domain Reduction for Monotonicity Testing: {A} o(d) Tester for Boolean
               Functions on Hypergrids},
  journal   = {CoRR},
  volume    = {abs/1811.01427},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.01427},
  archivePrefix = {arXiv},
  eprint    = {1811.01427},
  timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1811-01427},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04425,
  author    = {Talya Eden and
               Dana Ron and
               C. Seshadhri},
  title     = {Faster sublinear approximations of k-cliques for low arboricity graphs},
  journal   = {CoRR},
  volume    = {abs/1811.04425},
  year      = {2018},
  url       = {http://arxiv.org/abs/1811.04425},
  archivePrefix = {arXiv},
  eprint    = {1811.04425},
  timestamp = {Fri, 23 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1811-04425},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS18,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Adaptive Boolean Monotonicity Testing in Total Influence Time},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {5},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/005},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ChakrabartyS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarSS18,
  author    = {Akash Kumar and
               C. Seshadhri and
               Andrew Stolman},
  title     = {Finding forbidden minors in sublinear time: a O(n\({}^{\mbox{1/2+o(1)}}\))-query
               one-sided tester for minor closed properties on bounded degree graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {101},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/101},
  timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/KumarSS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0003SS18,
  author    = {Akash Kumar and
               C. Seshadhri and
               Andrew Stolman},
  title     = {Finding forbidden minors in sublinear time: a n\({}^{\mbox{1/2+o(1)}}\)-query
               one-sided tester for minor closed properties on bounded degree graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {148},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/148},
  timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/0003SS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlackCS18,
  author    = {Hadley Black and
               Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Domain Reduction for Monotonicity Testing: {A} {\textdollar}o(d){\textdollar}
               Tester for Boolean Functions on Hypergrids},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {25},
  pages     = {187},
  year      = {2018},
  url       = {https://eccc.weizmann.ac.il/report/2018/187},
  timestamp = {Tue, 11 Dec 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BlackCS18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/compnet/SeshadhriPDK17,
  author    = {C. Seshadhri and
               Ali Pinar and
               Nurcan Durak and
               Tamara G. Kolda},
  title     = {Directed closure measures for networks with reciprocity},
  journal   = {J. Complex Networks},
  volume    = {5},
  number    = {1},
  pages     = {32--47},
  year      = {2017},
  url       = {https://doi.org/10.1093/comnet/cnv032},
  doi       = {10.1093/comnet/cnv032},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/compnet/SeshadhriPDK17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/RaichelS17,
  author    = {Benjamin Raichel and
               C. Seshadhri},
  title     = {Avoiding the Global Sort: {A} Faster Contour Tree Algorithm},
  journal   = {Discrete {\&} Computational Geometry},
  volume    = {58},
  number    = {4},
  pages     = {946--985},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00454-017-9901-z},
  doi       = {10.1007/s00454-017-9901-z},
  timestamp = {Tue, 21 Nov 2017 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/dcg/RaichelS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaksS17,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Estimating the Longest Increasing Sequence in Polylogarithmic Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {2},
  pages     = {774--823},
  year      = {2017},
  url       = {https://doi.org/10.1137/130942152},
  doi       = {10.1137/130942152},
  timestamp = {Tue, 02 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/SaksS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EdenLRS17,
  author    = {Talya Eden and
               Amit Levi and
               Dana Ron and
               C. Seshadhri},
  title     = {Approximately Counting Triangles in Sublinear Time},
  journal   = {{SIAM} J. Comput.},
  volume    = {46},
  number    = {5},
  pages     = {1603--1646},
  year      = {2017},
  url       = {https://doi.org/10.1137/15M1054389},
  doi       = {10.1137/15M1054389},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/EdenLRS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ChakrabartyDJS17,
  author    = {Deeparnab Chakrabarty and
               Kashyap Dixit and
               Madhav Jha and
               C. Seshadhri},
  title     = {Property Testing on Product Distributions: Optimal Testers for Bounded
               Derivative Properties},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {13},
  number    = {2},
  pages     = {20:1--20:30},
  year      = {2017},
  url       = {https://doi.org/10.1145/3039241},
  doi       = {10.1145/3039241},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/talg/ChakrabartyDJS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tweb/SariyuceSPC17,
  author    = {Ahmet Erdem Sariy{\"{u}}ce and
               C. Seshadhri and
               Ali Pinar and
               {\"{U}}mit V. {\c{C}}ataly{\"{u}}rek},
  title     = {Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs},
  journal   = {{TWEB}},
  volume    = {11},
  number    = {3},
  pages     = {16:1--16:27},
  year      = {2017},
  url       = {https://doi.org/10.1145/3057742},
  doi       = {10.1145/3057742},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tweb/SariyuceSPC17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BaleshzarCPRS17,
  author    = {Roksana Baleshzar and
               Deeparnab Chakrabarty and
               Ramesh Krishnan S. Pallavoor and
               Sofya Raskhodnikova and
               C. Seshadhri},
  title     = {Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  pages     = {5:1--5:14},
  year      = {2017},
  crossref  = {DBLP:conf/icalp/2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.5},
  doi       = {10.4230/LIPIcs.ICALP.2017.5},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/BaleshzarCPRS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EdenRS17,
  author    = {Talya Eden and
               Dana Ron and
               C. Seshadhri},
  title     = {Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy
               Connection},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  pages     = {7:1--7:13},
  year      = {2017},
  crossref  = {DBLP:conf/icalp/2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.7},
  doi       = {10.4230/LIPIcs.ICALP.2017.7},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/EdenRS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NaumovitzSS17,
  author    = {Timothy Naumovitz and
               Michael E. Saks and
               C. Seshadhri},
  title     = {Accurate and Nearly Optimal Sublinear Approximations to Ulam Distance},
  booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
               16-19},
  pages     = {2012--2031},
  year      = {2017},
  crossref  = {DBLP:conf/soda/2017},
  url       = {https://doi.org/10.1137/1.9781611974782.131},
  doi       = {10.1137/1.9781611974782.131},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/NaumovitzSS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/SharmaSG17,
  author    = {Aneesh Sharma and
               C. Seshadhri and
               Ashish Goel},
  title     = {When Hashes Met Wedges: {A} Distributed Algorithm for Finding High
               Similarity Vectors},
  booktitle = {Proceedings of the 26th International Conference on World Wide Web,
               {WWW} 2017, Perth, Australia, April 3-7, 2017},
  pages     = {431--440},
  year      = {2017},
  crossref  = {DBLP:conf/www/2017},
  url       = {https://doi.org/10.1145/3038912.3052633},
  doi       = {10.1145/3038912.3052633},
  timestamp = {Tue, 06 Nov 2018 16:57:07 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/SharmaSG17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/JainS17,
  author    = {Shweta Jain and
               C. Seshadhri},
  title     = {A Fast and Provable Method for Estimating Clique Counts Using Tur{\'{a}}n's
               Theorem},
  booktitle = {Proceedings of the 26th International Conference on World Wide Web,
               {WWW} 2017, Perth, Australia, April 3-7, 2017},
  pages     = {441--449},
  year      = {2017},
  crossref  = {DBLP:conf/www/2017},
  url       = {https://doi.org/10.1145/3038912.3052636},
  doi       = {10.1145/3038912.3052636},
  timestamp = {Tue, 06 Nov 2018 16:57:07 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/JainS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/PinarSV17,
  author    = {Ali Pinar and
               C. Seshadhri and
               Vaidyanathan Vishal},
  title     = {{ESCAPE:} Efficiently Counting All 5-Vertex Subgraphs},
  booktitle = {Proceedings of the 26th International Conference on World Wide Web,
               {WWW} 2017, Perth, Australia, April 3-7, 2017},
  pages     = {1431--1440},
  year      = {2017},
  crossref  = {DBLP:conf/www/2017},
  url       = {https://doi.org/10.1145/3038912.3052597},
  doi       = {10.1145/3038912.3052597},
  timestamp = {Tue, 06 Nov 2018 16:57:07 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/PinarSV17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SharmaSG17,
  author    = {Aneesh Sharma and
               C. Seshadhri and
               Ashish Goel},
  title     = {When Hashes Met Wedges: {A} Distributed Algorithm for Finding High
               Similarity Vectors},
  journal   = {CoRR},
  volume    = {abs/1703.01054},
  year      = {2017},
  url       = {http://arxiv.org/abs/1703.01054},
  archivePrefix = {arXiv},
  eprint    = {1703.01054},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SharmaSG17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaleshzarCPRS17,
  author    = {Roksana Baleshzar and
               Deeparnab Chakrabarty and
               Ramesh Krishnan S. Pallavoor and
               Sofya Raskhodnikova and
               C. Seshadhri},
  title     = {Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps},
  journal   = {CoRR},
  volume    = {abs/1703.05199},
  year      = {2017},
  url       = {http://arxiv.org/abs/1703.05199},
  archivePrefix = {arXiv},
  eprint    = {1703.05199},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BaleshzarCPRS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SariyuceSP17,
  author    = {Ahmet Erdem Sariy{\"{u}}ce and
               C. Seshadhri and
               Ali Pinar},
  title     = {Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions},
  journal   = {CoRR},
  volume    = {abs/1704.00386},
  year      = {2017},
  url       = {http://arxiv.org/abs/1704.00386},
  archivePrefix = {arXiv},
  eprint    = {1704.00386},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SariyuceSP17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BaleshzarCPRS17a,
  author    = {Roksana Baleshzar and
               Deeparnab Chakrabarty and
               Ramesh Krishnan S. Pallavoor and
               Sofya Raskhodnikova and
               C. Seshadhri},
  title     = {A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness
               of Boolean Functions over the Hypercube},
  journal   = {CoRR},
  volume    = {abs/1706.00053},
  year      = {2017},
  url       = {http://arxiv.org/abs/1706.00053},
  archivePrefix = {arXiv},
  eprint    = {1706.00053},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BaleshzarCPRS17a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EdenRS17,
  author    = {Talya Eden and
               Dana Ron and
               C. Seshadhri},
  title     = {On Approximating the Number of {\textdollar}k{\textdollar}-cliques
               in Sublinear Time},
  journal   = {CoRR},
  volume    = {abs/1707.04858},
  year      = {2017},
  url       = {http://arxiv.org/abs/1707.04858},
  archivePrefix = {arXiv},
  eprint    = {1707.04858},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/EdenRS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-08607,
  author    = {Talya Eden and
               Shweta Jain and
               Ali Pinar and
               Dana Ron and
               C. Seshadhri},
  title     = {Provable and practical approximations for the degree distribution
               using sublinear graph samples},
  journal   = {CoRR},
  volume    = {abs/1710.08607},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.08607},
  archivePrefix = {arXiv},
  eprint    = {1710.08607},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1710-08607},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-10545,
  author    = {Hadley Black and
               Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A {\textdollar}o(d) {\textbackslash}cdot {\textbackslash}text\{polylog\}{\textasciitilde}n{\textdollar}
               Monotonicity Tester for Boolean Functions over the Hypergrid [n]\({}^{\mbox{d}}\)},
  journal   = {CoRR},
  volume    = {abs/1710.10545},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.10545},
  archivePrefix = {arXiv},
  eprint    = {1710.10545},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1710-10545},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BaleshzarCPRS17,
  author    = {Roksana Baleshzar and
               Deeparnab Chakrabarty and
               Ramesh Krishnan S. Pallavoor and
               Sofya Raskhodnikova and
               C. Seshadhri},
  title     = {Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {49},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/049},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BaleshzarCPRS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BaleshzarCPRS17a,
  author    = {Roksana Baleshzar and
               Deeparnab Chakrabarty and
               Ramesh Krishnan S. Pallavoor and
               Sofya Raskhodnikova and
               C. Seshadhri},
  title     = {A Lower Bound for Nonadaptive, One-Sided Error Testing of Unateness
               of Boolean Functions over the Hypercube},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {111},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/111},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BaleshzarCPRS17a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlackCS17,
  author    = {Hadley Black and
               Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A o(d) {\(\cdot\)} polylog n Monotonicity Tester for Boolean Functions
               over the Hypergrid [n]\({}^{\mbox{d}}\)},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {159},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/159},
  timestamp = {Wed, 12 Sep 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/BlackCS17},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuptaRS16,
  author    = {Rishi Gupta and
               Tim Roughgarden and
               C. Seshadhri},
  title     = {Decompositions of Triangle-Dense Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {197--215},
  year      = {2016},
  url       = {https://doi.org/10.1137/140955331},
  doi       = {10.1137/140955331},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/GuptaRS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChakrabartyS16,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {An o(n) Monotonicity Tester for Boolean Functions over the Hypercube},
  journal   = {{SIAM} J. Comput.},
  volume    = {45},
  number    = {2},
  pages     = {461--472},
  year      = {2016},
  url       = {https://doi.org/10.1137/13092770X},
  doi       = {10.1137/13092770X},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/ChakrabartyS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/BennettBCPSS16,
  author    = {Janine C. Bennett and
               Ankit Bhagatwala and
               Jacqueline H. Chen and
               Ali Pinar and
               Maher Salloum and
               C. Seshadhri},
  title     = {Trigger Detection for Adaptive Scientific Workflows Using Percentile
               Sampling},
  journal   = {{SIAM} J. Scientific Computing},
  volume    = {38},
  number    = {5},
  year      = {2016},
  url       = {https://doi.org/10.1137/15M1027942},
  doi       = {10.1137/15M1027942},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamsc/BennettBCPSS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/RaichelS16,
  author    = {Benjamin Raichel and
               C. Seshadhri},
  title     = {Avoiding the Global Sort: {A} Faster Contour Tree Algorithm},
  booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
               June 14-18, 2016, Boston, MA, {USA}},
  pages     = {57:1--57:14},
  year      = {2016},
  crossref  = {DBLP:conf/compgeom/2016},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2016.57},
  doi       = {10.4230/LIPIcs.SoCG.2016.57},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/RaichelS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Comandur16,
  author    = {Seshadhri Comandur},
  title     = {Local Reconstruction},
  booktitle = {Encyclopedia of Algorithms},
  pages     = {1136--1139},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-1-4939-2864-4\_698},
  doi       = {10.1007/978-1-4939-2864-4\_698},
  timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/reference/algo/Comandur16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EdenRS16,
  author    = {Talya Eden and
               Dana Ron and
               C. Seshadhri},
  title     = {Sublinear Time Estimation of Degree Distribution Moments: The Arboricity
               Connection},
  journal   = {CoRR},
  volume    = {abs/1604.03661},
  year      = {2016},
  url       = {http://arxiv.org/abs/1604.03661},
  archivePrefix = {arXiv},
  eprint    = {1604.03661},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/EdenRS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChakrabartyS16a,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A {\textdollar}{\textbackslash}widetilde\{O\}(n){\textdollar} Non-Adaptive
               Tester for Unateness},
  journal   = {CoRR},
  volume    = {abs/1608.06980},
  year      = {2016},
  url       = {http://arxiv.org/abs/1608.06980},
  archivePrefix = {arXiv},
  eprint    = {1608.06980},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/ChakrabartyS16a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PinarSV16,
  author    = {Ali Pinar and
               C. Seshadhri and
               Vaidyanathan Vishal},
  title     = {{ESCAPE:} Efficiently Counting All 5-Vertex Subgraphs},
  journal   = {CoRR},
  volume    = {abs/1610.09411},
  year      = {2016},
  url       = {http://arxiv.org/abs/1610.09411},
  archivePrefix = {arXiv},
  eprint    = {1610.09411},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/PinarSV16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JainS16a,
  author    = {Shweta Jain and
               C. Seshadhri},
  title     = {A Fast and Provable Method for Estimating Clique Counts Using Tur{\'{a}}n's
               Theorem},
  journal   = {CoRR},
  volume    = {abs/1611.05561},
  year      = {2016},
  url       = {http://arxiv.org/abs/1611.05561},
  archivePrefix = {arXiv},
  eprint    = {1611.05561},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/JainS16a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS16,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A {\~{O}}(n) Non-Adaptive Tester for Unateness},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {133},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/133},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ChakrabartyS16},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/compnet/RayPS15,
  author    = {Jaideep Ray and
               Ali Pinar and
               C. Seshadhri},
  title     = {A stopping criterion for Markov chains when generating independent
               random graphs},
  journal   = {J. Complex Networks},
  volume    = {3},
  number    = {2},
  pages     = {204--220},
  year      = {2015},
  url       = {https://doi.org/10.1093/comnet/cnu041},
  doi       = {10.1093/comnet/cnu041},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/compnet/RayPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/BerryFNPSW15,
  author    = {Jonathan W. Berry and
               Luke A. Fostvedt and
               Daniel J. Nordman and
               Cynthia A. Phillips and
               C. Seshadhri and
               Alyson G. Wilson},
  title     = {Why Do Simple Algorithms for Triangle Enumeration Work in the Real
               World?},
  journal   = {Internet Mathematics},
  volume    = {11},
  number    = {6},
  pages     = {555--571},
  year      = {2015},
  url       = {https://doi.org/10.1080/15427951.2015.1037030},
  doi       = {10.1080/15427951.2015.1037030},
  timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/im/BerryFNPSW15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tkdd/JhaSP15,
  author    = {Madhav Jha and
               C. Seshadhri and
               Ali Pinar},
  title     = {A Space-Efficient Streaming Algorithm for Estimating Transitivity
               and Triangle Counts Using the Birthday Paradox},
  journal   = {{TKDD}},
  volume    = {9},
  number    = {3},
  pages     = {15:1--15:21},
  year      = {2015},
  url       = {https://doi.org/10.1145/2700395},
  doi       = {10.1145/2700395},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tkdd/JhaSP15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acssc/JhaPS15,
  author    = {Madhav Jha and
               Ali Pinar and
               C. Seshadhri},
  title     = {Counting triangles in real-world graph streams: Dealing with repeated
               edges and time windows},
  booktitle = {49th Asilomar Conference on Signals, Systems and Computers, {ACSSC}
               2015, Pacific Grove, CA, USA, November 8-11, 2015},
  pages     = {1507--1514},
  year      = {2015},
  crossref  = {DBLP:conf/acssc/2015},
  url       = {https://doi.org/10.1109/ACSSC.2015.7421397},
  doi       = {10.1109/ACSSC.2015.7421397},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/acssc/JhaPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EdenLRS15,
  author    = {Talya Eden and
               Amit Levi and
               Dana Ron and
               C. Seshadhri},
  title     = {Approximately Counting Triangles in Sublinear Time},
  booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  pages     = {614--633},
  year      = {2015},
  crossref  = {DBLP:conf/focs/2015},
  url       = {https://doi.org/10.1109/FOCS.2015.44},
  doi       = {10.1109/FOCS.2015.44},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/EdenLRS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/BallardKPS15,
  author    = {Grey Ballard and
               Tamara G. Kolda and
               Ali Pinar and
               C. Seshadhri},
  title     = {Diamond Sampling for Approximate Maximum All-Pairs Dot-Product {(MAD)}
               Search},
  booktitle = {2015 {IEEE} International Conference on Data Mining, {ICDM} 2015,
               Atlantic City, NJ, USA, November 14-17, 2015},
  pages     = {11--20},
  year      = {2015},
  crossref  = {DBLP:conf/icdm/2015},
  url       = {https://doi.org/10.1109/ICDM.2015.46},
  doi       = {10.1109/ICDM.2015.46},
  timestamp = {Mon, 07 Jan 2019 17:17:42 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icdm/BallardKPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/SimpsonSM15,
  author    = {Olivia Simpson and
               C. Seshadhri and
               Andrew McGregor},
  title     = {Catching the Head, Tail, and Everything in Between: {A} Streaming
               Algorithm for the Degree Distribution},
  booktitle = {2015 {IEEE} International Conference on Data Mining, {ICDM} 2015,
               Atlantic City, NJ, USA, November 14-17, 2015},
  pages     = {979--984},
  year      = {2015},
  crossref  = {DBLP:conf/icdm/2015},
  url       = {https://doi.org/10.1109/ICDM.2015.47},
  doi       = {10.1109/ICDM.2015.47},
  timestamp = {Mon, 07 Jan 2019 17:17:42 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icdm/SimpsonSM15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChakrabartyDJS15,
  author    = {Deeparnab Chakrabarty and
               Kashyap Dixit and
               Madhav Jha and
               C. Seshadhri},
  title     = {Property Testing on Product Distributions: Optimal Testers for Bounded
               Derivative Properties},
  booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages     = {1809--1828},
  year      = {2015},
  crossref  = {DBLP:conf/soda/2015},
  url       = {https://doi.org/10.1137/1.9781611973730.121},
  doi       = {10.1137/1.9781611973730.121},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/ChakrabartyDJS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/JhaSP15,
  author    = {Madhav Jha and
               C. Seshadhri and
               Ali Pinar},
  title     = {Path Sampling: {A} Fast and Provable Method for Estimating 4-Vertex
               Subgraph Counts},
  booktitle = {Proceedings of the 24th International Conference on World Wide Web,
               {WWW} 2015, Florence, Italy, May 18-22, 2015},
  pages     = {495--505},
  year      = {2015},
  crossref  = {DBLP:conf/www/2015},
  url       = {https://doi.org/10.1145/2736277.2741101},
  doi       = {10.1145/2736277.2741101},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/JhaSP15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/SariyuceSPC15,
  author    = {Ahmet Erdem Sariy{\"{u}}ce and
               C. Seshadhri and
               Ali Pinar and
               {\"{U}}mit V. {\c{C}}ataly{\"{u}}rek},
  title     = {Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions},
  booktitle = {Proceedings of the 24th International Conference on World Wide Web,
               {WWW} 2015, Florence, Italy, May 18-22, 2015},
  pages     = {927--937},
  year      = {2015},
  crossref  = {DBLP:conf/www/2015},
  url       = {https://doi.org/10.1145/2736277.2741640},
  doi       = {10.1145/2736277.2741640},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/SariyuceSPC15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/daglib/p/SeshadhriPTB15,
  author    = {C. Seshadhri and
               Ali Pinar and
               David C. Thompson and
               Janine C. Bennett},
  title     = {Sublinear Algorithms for Extreme-Scale Data Analysis},
  booktitle = {Green in Software Engineering},
  pages     = {39--54},
  year      = {2015},
  crossref  = {DBLP:books/daglib/0036990},
  url       = {https://doi.org/10.1007/978-3-662-44900-4\_3},
  doi       = {10.1007/978-3-662-44900-4\_3},
  timestamp = {Tue, 15 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/books/daglib/p/SeshadhriPTB15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Seshadhri15,
  author    = {C. Seshadhri},
  title     = {A simpler sublinear algorithm for approximating the triangle count},
  journal   = {CoRR},
  volume    = {abs/1505.01927},
  year      = {2015},
  url       = {http://arxiv.org/abs/1505.01927},
  archivePrefix = {arXiv},
  eprint    = {1505.01927},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/Seshadhri15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SimpsonSM15,
  author    = {Olivia Simpson and
               C. Seshadhri and
               Andrew McGregor},
  title     = {Catching the head, the tail, and everything in between: a streaming
               algorithm for the degree distribution},
  journal   = {CoRR},
  volume    = {abs/1506.02574},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.02574},
  archivePrefix = {arXiv},
  eprint    = {1506.02574},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SimpsonSM15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BallardPKS15,
  author    = {Grey Ballard and
               Ali Pinar and
               Tamara G. Kolda and
               C. Seshadhri},
  title     = {Diamond Sampling for Approximate Maximum All-pairs Dot-product {(MAD)}
               Search},
  journal   = {CoRR},
  volume    = {abs/1506.03872},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.03872},
  archivePrefix = {arXiv},
  eprint    = {1506.03872},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BallardPKS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BennettBCSPS15,
  author    = {Janine C. Bennett and
               Ankit Bhagatwala and
               Jacqueline H. Chen and
               C. Seshadhri and
               Ali Pinar and
               Maher Salloum},
  title     = {Trigger detection for adaptive scientific workflows using percentile
               sampling},
  journal   = {CoRR},
  volume    = {abs/1506.08258},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.08258},
  archivePrefix = {arXiv},
  eprint    = {1506.08258},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BennettBCSPS15},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/SeshadhriV14,
  author    = {C. Seshadhri and
               Jan Vondr{\'{a}}k},
  title     = {Is Submodularity Testable?},
  journal   = {Algorithmica},
  volume    = {69},
  number    = {1},
  pages     = {1--25},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00453-012-9719-2},
  doi       = {10.1007/s00453-012-9719-2},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/SeshadhriV14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CzumajGRSSS14,
  author    = {Artur Czumaj and
               Oded Goldreich and
               Dana Ron and
               C. Seshadhri and
               Asaf Shapira and
               Christian Sohler},
  title     = {Finding cycles and trees in sublinear time},
  journal   = {Random Struct. Algorithms},
  volume    = {45},
  number    = {2},
  pages     = {139--184},
  year      = {2014},
  url       = {https://doi.org/10.1002/rsa.20462},
  doi       = {10.1002/rsa.20462},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/rsa/CzumajGRSSS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sadm/SeshadhriPK14,
  author    = {C. Seshadhri and
               Ali Pinar and
               Tamara G. Kolda},
  title     = {Wedge sampling for computing clustering coefficients and triangle
               counts on large graphs},
  journal   = {Statistical Analysis and Data Mining},
  volume    = {7},
  number    = {4},
  pages     = {294--307},
  year      = {2014},
  url       = {https://doi.org/10.1002/sam.11224},
  doi       = {10.1002/sam.11224},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/sadm/SeshadhriPK14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ClarksonMS14,
  author    = {Kenneth L. Clarkson and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls},
  journal   = {{SIAM} J. Comput.},
  volume    = {43},
  number    = {2},
  pages     = {617--653},
  year      = {2014},
  url       = {https://doi.org/10.1137/12089702X},
  doi       = {10.1137/12089702X},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/ClarksonMS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/KoldaPPS14,
  author    = {Tamara G. Kolda and
               Ali Pinar and
               Todd D. Plantenga and
               C. Seshadhri},
  title     = {A Scalable Generative Graph Model with Community Structure},
  journal   = {{SIAM} J. Scientific Computing},
  volume    = {36},
  number    = {5},
  year      = {2014},
  url       = {https://doi.org/10.1137/130914218},
  doi       = {10.1137/130914218},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamsc/KoldaPPS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamsc/KoldaPPST14,
  author    = {Tamara G. Kolda and
               Ali Pinar and
               Todd D. Plantenga and
               C. Seshadhri and
               Christine Task},
  title     = {Counting Triangles in Massive Graphs with MapReduce},
  journal   = {{SIAM} J. Scientific Computing},
  volume    = {36},
  number    = {5},
  year      = {2014},
  url       = {https://doi.org/10.1137/13090729X},
  doi       = {10.1137/13090729X},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamsc/KoldaPPST14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ChakrabartyS14,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {An Optimal Lower Bound for Monotonicity Testing over Hypergrids},
  journal   = {Theory of Computing},
  volume    = {10},
  pages     = {453--464},
  year      = {2014},
  url       = {https://doi.org/10.4086/toc.2014.v010a017},
  doi       = {10.4086/toc.2014.v010a017},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/toc/ChakrabartyS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BerryFNPSW14,
  author    = {Jonathan W. Berry and
               Luke K. Fostvedt and
               Daniel J. Nordman and
               Cynthia A. Phillips and
               C. Seshadhri and
               Alyson G. Wilson},
  title     = {Why do simple algorithms for triangle enumeration work in the real
               world?},
  booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  pages     = {225--234},
  year      = {2014},
  crossref  = {DBLP:conf/innovations/2014},
  url       = {https://doi.org/10.1145/2554797.2554819},
  doi       = {10.1145/2554797.2554819},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/BerryFNPSW14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuptaRS14,
  author    = {Rishi Gupta and
               Tim Roughgarden and
               C. Seshadhri},
  title     = {Decompositions of triangle-dense graphs},
  booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  pages     = {471--482},
  year      = {2014},
  crossref  = {DBLP:conf/innovations/2014},
  url       = {https://doi.org/10.1145/2554797.2554840},
  doi       = {10.1145/2554797.2554840},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/GuptaRS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/LofgrenBGC14,
  author    = {Peter Lofgren and
               Siddhartha Banerjee and
               Ashish Goel and
               Seshadhri Comandur},
  title     = {{FAST-PPR:} scaling personalized pagerank estimation for large graphs},
  booktitle = {The 20th {ACM} {SIGKDD} International Conference on Knowledge Discovery
               and Data Mining, {KDD} '14, New York, NY, {USA} - August 24 - 27,
               2014},
  pages     = {1436--1445},
  year      = {2014},
  crossref  = {DBLP:conf/kdd/2014},
  url       = {https://doi.org/10.1145/2623330.2623745},
  doi       = {10.1145/2623330.2623745},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/kdd/LofgrenBGC14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChakrabartyDJS14,
  author    = {Deeparnab Chakrabarty and
               Kashyap Dixit and
               Madhav Jha and
               C. Seshadhri},
  title     = {Property Testing on Product Distributions: Optimal Testers for Bounded
               Derivative Properties},
  journal   = {CoRR},
  volume    = {abs/1404.0718},
  year      = {2014},
  url       = {http://arxiv.org/abs/1404.0718},
  archivePrefix = {arXiv},
  eprint    = {1404.0718},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/ChakrabartyDJS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LofgrenBGS14,
  author    = {Peter Lofgren and
               Siddhartha Banerjee and
               Ashish Goel and
               C. Seshadhri},
  title     = {{FAST-PPR:} Scaling Personalized PageRank Estimation for Large Graphs},
  journal   = {CoRR},
  volume    = {abs/1404.3181},
  year      = {2014},
  url       = {http://arxiv.org/abs/1404.3181},
  archivePrefix = {arXiv},
  eprint    = {1404.3181},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/LofgrenBGS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerryFNPSW14,
  author    = {Jonathan W. Berry and
               Luke A. Fostvedt and
               Daniel J. Nordman and
               Cynthia A. Phillips and
               C. Seshadhri and
               Alyson G. Wilson},
  title     = {Why do simple algorithms for triangle enumeration work in the real
               world?},
  journal   = {CoRR},
  volume    = {abs/1407.1116},
  year      = {2014},
  url       = {http://arxiv.org/abs/1407.1116},
  archivePrefix = {arXiv},
  eprint    = {1407.1116},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/BerryFNPSW14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SeshadhriSVMA14,
  author    = {C. Seshadhri and
               Andrew M. Smith and
               Yevgeniy Vorobeychik and
               Jackson Mayo and
               Robert C. Armstrong},
  title     = {Characterizing short-term stability for Boolean networks over any
               distribution of transfer functions},
  journal   = {CoRR},
  volume    = {abs/1409.4360},
  year      = {2014},
  url       = {http://arxiv.org/abs/1409.4360},
  archivePrefix = {arXiv},
  eprint    = {1409.4360},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SeshadhriSVMA14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RaichelS14,
  author    = {Benjamin Raichel and
               C. Seshadhri},
  title     = {A Mountaintop View Requires Minimal Sorting: {A} Faster Contour Tree
               Algorithm},
  journal   = {CoRR},
  volume    = {abs/1411.2689},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.2689},
  archivePrefix = {arXiv},
  eprint    = {1411.2689},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/RaichelS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SariyuceSPC14,
  author    = {Ahmet Erdem Sariy{\"{u}}ce and
               C. Seshadhri and
               Ali Pinar and
               {\"{U}}mit V. {\c{C}}ataly{\"{u}}rek},
  title     = {Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions},
  journal   = {CoRR},
  volume    = {abs/1411.3312},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.3312},
  archivePrefix = {arXiv},
  eprint    = {1411.3312},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SariyuceSPC14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JhaSP14,
  author    = {Madhav Jha and
               C. Seshadhri and
               Ali Pinar},
  title     = {Path Sampling: {A} Fast and Provable Method for Estimating 4-Vertex
               Subgraph Counts},
  journal   = {CoRR},
  volume    = {abs/1411.4942},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.4942},
  archivePrefix = {arXiv},
  eprint    = {1411.4942},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/JhaSP14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyDJS14,
  author    = {Deeparnab Chakrabarty and
               Kashyap Dixit and
               Madhav Jha and
               C. Seshadhri},
  title     = {Property Testing on Product Distributions: Optimal Testers for Bounded
               Derivative Properties},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {42},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/042},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ChakrabartyDJS14},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SeshadhriPK13,
  author    = {C. Seshadhri and
               Ali Pinar and
               Tamara G. Kolda},
  title     = {An in-depth analysis of stochastic Kronecker graphs},
  journal   = {J. {ACM}},
  volume    = {60},
  number    = {2},
  pages     = {13:1--13:32},
  year      = {2013},
  url       = {https://doi.org/10.1145/2450142.2450149},
  doi       = {10.1145/2450142.2450149},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jacm/SeshadhriPK13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SaxenaS13,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {From sylvester-gallai configurations to rank bounds: Improved blackbox
               identity test for depth-3 circuits},
  journal   = {J. {ACM}},
  volume    = {60},
  number    = {5},
  pages     = {33:1--33:33},
  year      = {2013},
  url       = {https://doi.org/10.1145/2528403},
  doi       = {10.1145/2528403},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jacm/SaxenaS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KalePS13,
  author    = {Satyen Kale and
               Yuval Peres and
               C. Seshadhri},
  title     = {Noise Tolerance of Expanders and Sublinear Expansion Reconstruction},
  journal   = {{SIAM} J. Comput.},
  volume    = {42},
  number    = {1},
  pages     = {305--323},
  year      = {2013},
  url       = {https://doi.org/10.1137/110837863},
  doi       = {10.1137/110837863},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/KalePS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChakrabartyS13,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {An Optimal Lower Bound for Monotonicity Testing over Hypergrids},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
               International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
               2013. Proceedings},
  pages     = {425--435},
  year      = {2013},
  crossref  = {DBLP:conf/approx/2013},
  url       = {https://doi.org/10.1007/978-3-642-40328-6\_30},
  doi       = {10.1007/978-3-642-40328-6\_30},
  timestamp = {Tue, 23 May 2017 01:10:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/ChakrabartyS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/JhaSP13,
  author    = {Madhav Jha and
               C. Seshadhri and
               Ali Pinar},
  title     = {A space efficient streaming algorithm for triangle counting using
               the birthday paradox},
  booktitle = {The 19th {ACM} {SIGKDD} International Conference on Knowledge Discovery
               and Data Mining, {KDD} 2013, Chicago, IL, USA, August 11-14, 2013},
  pages     = {589--597},
  year      = {2013},
  crossref  = {DBLP:conf/kdd/2013},
  url       = {https://doi.org/10.1145/2487575.2487678},
  doi       = {10.1145/2487575.2487678},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/kdd/JhaSP13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ldav/ThompsonBSP13,
  author    = {David C. Thompson and
               Janine Bennett and
               C. Seshadhri and
               Ali Pinar},
  title     = {A provably-robust sampling method for generating colormaps of large
               data},
  booktitle = {{IEEE} Symposium on Large-Scale Data Analysis and Visualization, {LDAV}
               2013, 13-14 October, 2013, Atlanta, Georgia, {USA}},
  pages     = {77--84},
  year      = {2013},
  crossref  = {DBLP:conf/ldav/2013},
  url       = {https://doi.org/10.1109/LDAV.2013.6675161},
  doi       = {10.1109/LDAV.2013.6675161},
  timestamp = {Wed, 13 Feb 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/ldav/ThompsonBSP13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nsw/DurakKPS13,
  author    = {Nurcan Durak and
               Tamara G. Kolda and
               Ali Pinar and
               C. Seshadhri},
  title     = {A scalable null model for directed graphs matching all degree distributions:
               In, out, and reciprocal},
  booktitle = {Proceedings of the 2nd {IEEE} Network Science Workshop, {NSW} 2013,
               April 29 - May 1, 2013, Thayer Hotel, West Point, NY, {USA}},
  pages     = {23--30},
  year      = {2013},
  crossref  = {DBLP:conf/nsw/2013},
  url       = {https://doi.org/10.1109/NSW.2013.6609190},
  doi       = {10.1109/NSW.2013.6609190},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/nsw/DurakKPS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/KoldaPS13,
  author    = {Tamara G. Kolda and
               Ali Pinar and
               C. Seshadhri},
  title     = {Triadic Measures on Graphs: The Power of Wedge Sampling},
  booktitle = {Proceedings of the 13th {SIAM} International Conference on Data Mining,
               May 2-4, 2013. Austin, Texas, {USA.}},
  pages     = {10--18},
  year      = {2013},
  crossref  = {DBLP:conf/sdm/2013},
  url       = {https://doi.org/10.1137/1.9781611972832.2},
  doi       = {10.1137/1.9781611972832.2},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sdm/KoldaPS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SaksS13,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Space efficient streaming algorithms for the distance to monotonicity
               and asymmetric edit distance},
  booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
               2013},
  pages     = {1698--1709},
  year      = {2013},
  crossref  = {DBLP:conf/soda/2013},
  url       = {https://doi.org/10.1137/1.9781611973105.122},
  doi       = {10.1137/1.9781611973105.122},
  timestamp = {Wed, 24 May 2017 08:31:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/SaksS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyS13,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A o(n) monotonicity tester for boolean functions over the hypercube},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  pages     = {411--418},
  year      = {2013},
  crossref  = {DBLP:conf/stoc/2013},
  url       = {https://doi.org/10.1145/2488608.2488660},
  doi       = {10.1145/2488608.2488660},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/ChakrabartyS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyS13a,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Optimal bounds for monotonicity and lipschitz testing over hypercubes
               and hypergrids},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  pages     = {419--428},
  year      = {2013},
  crossref  = {DBLP:conf/stoc/2013},
  url       = {https://doi.org/10.1145/2488608.2488661},
  doi       = {10.1145/2488608.2488661},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/ChakrabartyS13a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-5887,
  author    = {Tamara G. Kolda and
               Ali Pinar and
               Todd D. Plantenga and
               C. Seshadhri and
               Christine Task},
  title     = {Counting Triangles in Massive Graphs with MapReduce},
  journal   = {CoRR},
  volume    = {abs/1301.5887},
  year      = {2013},
  url       = {http://arxiv.org/abs/1301.5887},
  archivePrefix = {arXiv},
  eprint    = {1301.5887},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1301-5887},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-4536,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A o(n) monotonicity tester for Boolean functions over the hypercube},
  journal   = {CoRR},
  volume    = {abs/1302.4536},
  year      = {2013},
  url       = {http://arxiv.org/abs/1302.4536},
  archivePrefix = {arXiv},
  eprint    = {1302.4536},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1302-4536},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6220,
  author    = {C. Seshadhri and
               Ali Pinar and
               Nurcan Durak and
               Tamara G. Kolda},
  title     = {The importance of directed triangles with reciprocity: patterns and
               algorithms},
  journal   = {CoRR},
  volume    = {abs/1302.6220},
  year      = {2013},
  url       = {http://arxiv.org/abs/1302.6220},
  archivePrefix = {arXiv},
  eprint    = {1302.6220},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1302-6220},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6636,
  author    = {Tamara G. Kolda and
               Ali Pinar and
               Todd D. Plantenga and
               C. Seshadhri},
  title     = {A Scalable Generative Graph Model with Community Structure},
  journal   = {CoRR},
  volume    = {abs/1302.6636},
  year      = {2013},
  url       = {http://arxiv.org/abs/1302.6636},
  archivePrefix = {arXiv},
  eprint    = {1302.6636},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1302-6636},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5264,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {An optimal lower bound for monotonicity testing over hypergrids},
  journal   = {CoRR},
  volume    = {abs/1304.5264},
  year      = {2013},
  url       = {http://arxiv.org/abs/1304.5264},
  archivePrefix = {arXiv},
  eprint    = {1304.5264},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1304-5264},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SaksS13,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Estimating the longest increasing sequence in polylogarithmic time},
  journal   = {CoRR},
  volume    = {abs/1308.0626},
  year      = {2013},
  url       = {http://arxiv.org/abs/1308.0626},
  archivePrefix = {arXiv},
  eprint    = {1308.0626},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SaksS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SeshadhriPK13,
  author    = {C. Seshadhri and
               Ali Pinar and
               Tamara G. Kolda},
  title     = {Wedge Sampling for Computing Clustering Coefficients and Triangle
               Counts on Large Graphs},
  journal   = {CoRR},
  volume    = {abs/1309.3321},
  year      = {2013},
  url       = {http://arxiv.org/abs/1309.3321},
  archivePrefix = {arXiv},
  eprint    = {1309.3321},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/SeshadhriPK13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuptaRS13,
  author    = {Rishi Gupta and
               Tim Roughgarden and
               C. Seshadhri},
  title     = {Decompositions of Triangle-Dense Graphs},
  journal   = {CoRR},
  volume    = {abs/1309.7440},
  year      = {2013},
  url       = {http://arxiv.org/abs/1309.7440},
  archivePrefix = {arXiv},
  eprint    = {1309.7440},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/GuptaRS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JhaSP13,
  author    = {Madhav Jha and
               C. Seshadhri and
               Ali Pinar},
  title     = {When a Graph is not so Simple: Counting Triangles in Multigraph Streams},
  journal   = {CoRR},
  volume    = {abs/1310.7665},
  year      = {2013},
  url       = {http://arxiv.org/abs/1310.7665},
  archivePrefix = {arXiv},
  eprint    = {1310.7665},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/JhaSP13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS13,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {A o(n) monotonicity tester for Boolean functions over the hypercube},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {29},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/029},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ChakrabartyS13},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS13a,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {An optimal lower bound for monotonicity testing over hypergrids},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {62},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/062},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ChakrabartyS13a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaxenaS12,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits:
               The Field Doesn't Matter},
  journal   = {{SIAM} J. Comput.},
  volume    = {41},
  number    = {5},
  pages     = {1285--1298},
  year      = {2012},
  url       = {https://doi.org/10.1137/10848232},
  doi       = {10.1137/10848232},
  timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/SaxenaS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/DurakPKS12,
  author    = {Nurcan Durak and
               Ali Pinar and
               Tamara G. Kolda and
               C. Seshadhri},
  title     = {Degree relations of triangles in real-world networks and graph models},
  booktitle = {21st {ACM} International Conference on Information and Knowledge Management,
               CIKM'12, Maui, HI, USA, October 29 - November 02, 2012},
  pages     = {1712--1716},
  year      = {2012},
  crossref  = {DBLP:conf/cikm/2012},
  url       = {https://doi.org/10.1145/2396761.2398503},
  doi       = {10.1145/2396761.2398503},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/cikm/DurakPKS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ClarksonMS12,
  author    = {Kenneth L. Clarkson and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-improving algorithms for coordinate-wise maxima},
  booktitle = {Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC,
               USA, June 17-20, 2012},
  pages     = {277--286},
  year      = {2012},
  crossref  = {DBLP:conf/compgeom/2012},
  url       = {https://doi.org/10.1145/2261250.2261291},
  doi       = {10.1145/2261250.2261291},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/ClarksonMS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/GleichS12,
  author    = {David F. Gleich and
               C. Seshadhri},
  title     = {Vertex neighborhoods, low conductance cuts, and good seeds for local
               community methods},
  booktitle = {The 18th {ACM} {SIGKDD} International Conference on Knowledge Discovery
               and Data Mining, {KDD} '12, Beijing, China, August 12-16, 2012},
  pages     = {597--605},
  year      = {2012},
  crossref  = {DBLP:conf/kdd/2012},
  url       = {https://doi.org/10.1145/2339530.2339628},
  doi       = {10.1145/2339530.2339628},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/kdd/GleichS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/SeshadhriPK12,
  author    = {C. Seshadhri and
               Ali Pinar and
               Tamara G. Kolda},
  title     = {The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models},
  booktitle = {Proceedings of the Twelfth {SIAM} International Conference on Data
               Mining, Anaheim, California, USA, April 26-28, 2012.},
  pages     = {1071--1082},
  year      = {2012},
  crossref  = {DBLP:conf/sdm/2012},
  url       = {https://doi.org/10.1137/1.9781611972825.92},
  doi       = {10.1137/1.9781611972825.92},
  timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/sdm/SeshadhriPK12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/RayPS12,
  author    = {Jaideep Ray and
               Ali Pinar and
               C. Seshadhri},
  title     = {Are We There Yet? When to Stop a Markov Chain while Generating Random
               Graphs},
  booktitle = {Algorithms and Models for the Web Graph - 9th International Workshop,
               {WAW} 2012, Halifax, NS, Canada, June 22-23, 2012. Proceedings},
  pages     = {153--164},
  year      = {2012},
  crossref  = {DBLP:conf/waw/2012},
  url       = {https://doi.org/10.1007/978-3-642-30541-2\_12},
  doi       = {10.1007/978-3-642-30541-2\_12},
  timestamp = {Wed, 24 May 2017 08:31:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waw/RayPS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-3473,
  author    = {Jaideep Ray and
               Ali Pinar and
               C. Seshadhri},
  title     = {Are we there yet? When to stop a Markov chain while generating random
               graphs},
  journal   = {CoRR},
  volume    = {abs/1202.3473},
  year      = {2012},
  url       = {http://arxiv.org/abs/1202.3473},
  archivePrefix = {arXiv},
  eprint    = {1202.3473},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1202-3473},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-5230,
  author    = {C. Seshadhri and
               Ali Pinar and
               Tamara G. Kolda},
  title     = {Fast Triangle Counting through Wedge Sampling},
  journal   = {CoRR},
  volume    = {abs/1202.5230},
  year      = {2012},
  url       = {http://arxiv.org/abs/1202.5230},
  archivePrefix = {arXiv},
  eprint    = {1202.5230},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1202-5230},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0824,
  author    = {Kenneth L. Clarkson and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-improving Algorithms for Coordinate-wise Maxima},
  journal   = {CoRR},
  volume    = {abs/1204.0824},
  year      = {2012},
  url       = {http://arxiv.org/abs/1204.0824},
  archivePrefix = {arXiv},
  eprint    = {1204.0824},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1204-0824},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-0849,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Optimal bounds for monotonicity and Lipschitz testing over the hypercube},
  journal   = {CoRR},
  volume    = {abs/1204.0849},
  year      = {2012},
  url       = {http://arxiv.org/abs/1204.0849},
  archivePrefix = {arXiv},
  eprint    = {1204.0849},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1204-0849},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-1098,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Space efficient streaming algorithms for the distance to monotonicity
               and asymmetric edit distance},
  journal   = {CoRR},
  volume    = {abs/1204.1098},
  year      = {2012},
  url       = {http://arxiv.org/abs/1204.1098},
  archivePrefix = {arXiv},
  eprint    = {1204.1098},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1204-1098},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-7125,
  author    = {Nurcan Durak and
               Ali Pinar and
               Tamara G. Kolda and
               C. Seshadhri},
  title     = {Degree Relations of Triangles in Real-world Networks and Models},
  journal   = {CoRR},
  volume    = {abs/1207.7125},
  year      = {2012},
  url       = {http://arxiv.org/abs/1207.7125},
  archivePrefix = {arXiv},
  eprint    = {1207.7125},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1207-7125},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-5288,
  author    = {Nurcan Durak and
               Tamara G. Kolda and
               Ali Pinar and
               C. Seshadhri},
  title     = {A scalable directed graph model with reciprocal edges},
  journal   = {CoRR},
  volume    = {abs/1210.5288},
  year      = {2012},
  url       = {http://arxiv.org/abs/1210.5288},
  archivePrefix = {arXiv},
  eprint    = {1210.5288},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1210-5288},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-8184,
  author    = {Jaideep Ray and
               Ali Pinar and
               C. Seshadhri},
  title     = {A stopping criterion for Markov chains when generating independent
               random graphs},
  journal   = {CoRR},
  volume    = {abs/1210.8184},
  year      = {2012},
  url       = {http://arxiv.org/abs/1210.8184},
  archivePrefix = {arXiv},
  eprint    = {1210.8184},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1210-8184},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-0952,
  author    = {Kenneth L. Clarkson and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls},
  journal   = {CoRR},
  volume    = {abs/1211.0952},
  year      = {2012},
  url       = {http://arxiv.org/abs/1211.0952},
  archivePrefix = {arXiv},
  eprint    = {1211.0952},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1211-0952},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-2264,
  author    = {Madhav Jha and
               C. Seshadhri and
               Ali Pinar},
  title     = {From the Birthday Paradox to a Practical Sublinear Space Streaming
               Algorithm for Triangle Counting},
  journal   = {CoRR},
  volume    = {abs/1212.2264},
  year      = {2012},
  url       = {http://arxiv.org/abs/1212.2264},
  archivePrefix = {arXiv},
  eprint    = {1212.2264},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1212-2264},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabartyS12,
  author    = {Deeparnab Chakrabarty and
               C. Seshadhri},
  title     = {Optimal bounds for monotonicity and Lipschitz testing over the hypercube},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {30},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/030},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ChakrabartyS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/CzumajGRSSS12,
  author    = {Artur Czumaj and
               Oded Goldreich and
               Dana Ron and
               C. Seshadhri and
               Asaf Shapira and
               Christian Sohler},
  title     = {Finding Cycles and Trees in Sublinear Time},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {19},
  pages     = {35},
  year      = {2012},
  url       = {http://eccc.hpi-web.de/report/2012/035},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/CzumajGRSSS12},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChazelleS11,
  author    = {Bernard Chazelle and
               C. Seshadhri},
  title     = {Online geometric reconstruction},
  journal   = {J. {ACM}},
  volume    = {58},
  number    = {4},
  pages     = {14:1--14:32},
  year      = {2011},
  url       = {https://doi.org/10.1145/1989727.1989728},
  doi       = {10.1145/1989727.1989728},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/jacm/ChazelleS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaxenaS11,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {An Almost Optimal Rank Bound for Depth-3 Identities},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {1},
  pages     = {200--224},
  year      = {2011},
  url       = {https://doi.org/10.1137/090770679},
  doi       = {10.1137/090770679},
  timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/SaxenaS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AilonCCLMS11,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Kenneth L. Clarkson and
               Ding Liu and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-Improving Algorithms},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {2},
  pages     = {350--375},
  year      = {2011},
  url       = {https://doi.org/10.1137/090766437},
  doi       = {10.1137/090766437},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/AilonCCLMS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KaleS11,
  author    = {Satyen Kale and
               C. Seshadhri},
  title     = {An Expansion Tester for Bounded Degree Graphs},
  journal   = {{SIAM} J. Comput.},
  volume    = {40},
  number    = {3},
  pages     = {709--720},
  year      = {2011},
  url       = {https://doi.org/10.1137/100802980},
  doi       = {10.1137/100802980},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/KaleS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/SeshadhriPK11,
  author    = {C. Seshadhri and
               Ali Pinar and
               Tamara G. Kolda},
  title     = {An In-depth Study of Stochastic Kronecker Graphs},
  booktitle = {11th {IEEE} International Conference on Data Mining, {ICDM} 2011,
               Vancouver, BC, Canada, December 11-14, 2011},
  pages     = {587--596},
  year      = {2011},
  crossref  = {DBLP:conf/icdm/2011},
  url       = {https://doi.org/10.1109/ICDM.2011.23},
  doi       = {10.1109/ICDM.2011.23},
  timestamp = {Mon, 07 Jan 2019 17:17:42 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icdm/SeshadhriPK11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/SeshadhriV11,
  author    = {C. Seshadhri and
               Jan Vondr{\'{a}}k},
  title     = {Is Submodularity Testable?},
  booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  pages     = {195--210},
  year      = {2011},
  crossref  = {DBLP:conf/innovations/2011},
  url       = {http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/21.html},
  timestamp = {Wed, 19 Oct 2011 15:40:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/SeshadhriV11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KaleS11,
  author    = {Satyen Kale and
               C. Seshadhri},
  title     = {Combinatorial Approximation Algorithms for MaxCut using Random Walks},
  booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  pages     = {367--388},
  year      = {2011},
  crossref  = {DBLP:conf/innovations/2011},
  url       = {http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/20.html},
  timestamp = {Wed, 19 Oct 2011 15:40:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/KaleS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SaxenaS11,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {Blackbox identity testing for bounded top fanin depth-3 circuits:
               the field doesn't matter},
  booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  pages     = {431--440},
  year      = {2011},
  crossref  = {DBLP:conf/stoc/2011},
  url       = {https://doi.org/10.1145/1993636.1993694},
  doi       = {10.1145/1993636.1993694},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/SaxenaS11},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5046,
  author    = {C. Seshadhri and
               Ali Pinar and
               Tamara G. Kolda},
  title     = {A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker
               Graphs},
  journal   = {CoRR},
  volume    = {abs/1102.5046},
  year      = {2011},
  url       = {http://arxiv.org/abs/1102.5046},
  archivePrefix = {arXiv},
  eprint    = {1102.5046},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1102-5046},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3792,
  author    = {C. Seshadhri and
               Yevgeniy Vorobeychik and
               Jackson Mayo and
               Robert C. Armstrong and
               Joseph R. Ruthruff},
  title     = {Influence and Dynamic Behavior in Random Boolean Networks},
  journal   = {CoRR},
  volume    = {abs/1107.3792},
  year      = {2011},
  url       = {http://arxiv.org/abs/1107.3792},
  archivePrefix = {arXiv},
  eprint    = {1107.3792},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1107-3792},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-4925,
  author    = {Ali Pinar and
               C. Seshadhri and
               Tamara G. Kolda},
  title     = {The Similarity between Stochastic Kronecker and Chung-Lu Graph Models},
  journal   = {CoRR},
  volume    = {abs/1110.4925},
  year      = {2011},
  url       = {http://arxiv.org/abs/1110.4925},
  archivePrefix = {arXiv},
  eprint    = {1110.4925},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1110-4925},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-0031,
  author    = {David F. Gleich and
               C. Seshadhri},
  title     = {Neighborhoods are good communities},
  journal   = {CoRR},
  volume    = {abs/1112.0031},
  year      = {2011},
  url       = {http://arxiv.org/abs/1112.0031},
  archivePrefix = {arXiv},
  eprint    = {1112.0031},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1112-0031},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-3644,
  author    = {C. Seshadhri and
               Tamara G. Kolda and
               Ali Pinar},
  title     = {Community structure and scale-free collections of Erd{\"{o}}s-R{\'{e}}nyi
               graphs},
  journal   = {CoRR},
  volume    = {abs/1112.3644},
  year      = {2011},
  url       = {http://arxiv.org/abs/1112.3644},
  archivePrefix = {arXiv},
  eprint    = {1112.3644},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1112-3644},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SaksS10,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Local Monotonicity Reconstruction},
  journal   = {{SIAM} J. Comput.},
  volume    = {39},
  number    = {7},
  pages     = {2897--2926},
  year      = {2010},
  url       = {https://doi.org/10.1137/080728561},
  doi       = {10.1137/080728561},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/siamcomp/SaksS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SaxenaS10,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box
               Identity Test for Depth-3 Circuits},
  booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  pages     = {21--29},
  year      = {2010},
  crossref  = {DBLP:conf/focs/2010},
  url       = {https://doi.org/10.1109/FOCS.2010.9},
  doi       = {10.1109/FOCS.2010.9},
  timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/SaxenaS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SaksS10,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Estimating the Longest Increasing Sequence in Polylogarithmic Time},
  booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  pages     = {458--467},
  year      = {2010},
  crossref  = {DBLP:conf/focs/2010},
  url       = {https://doi.org/10.1109/FOCS.2010.51},
  doi       = {10.1109/FOCS.2010.51},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/SaksS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ClarksonMS10,
  author    = {Kenneth L. Clarkson and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-improving Algorithms for Convex Hulls},
  booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  pages     = {1546--1565},
  year      = {2010},
  crossref  = {DBLP:conf/soda/2010},
  url       = {https://doi.org/10.1137/1.9781611973075.126},
  doi       = {10.1137/1.9781611973075.126},
  timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/ClarksonMS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/propertytesting/SaksS10,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Local Property Reconstruction and Monotonicity},
  booktitle = {Property Testing - Current Research and Surveys},
  pages     = {346--354},
  year      = {2010},
  crossref  = {DBLP:conf/propertytesting/2010},
  url       = {https://doi.org/10.1007/978-3-642-16367-8\_29},
  doi       = {10.1007/978-3-642-16367-8\_29},
  timestamp = {Wed, 01 Aug 2018 17:20:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/propertytesting/SaksS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-0145,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box
               Identity Test for Depth-3 Circuits},
  journal   = {CoRR},
  volume    = {abs/1002.0145},
  year      = {2010},
  url       = {http://arxiv.org/abs/1002.0145},
  archivePrefix = {arXiv},
  eprint    = {1002.0145},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1002-0145},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1007-4230,
  author    = {Artur Czumaj and
               Oded Goldreich and
               Dana Ron and
               C. Seshadhri and
               Asaf Shapira and
               Christian Sohler},
  title     = {Finding Cycles and Trees in Sublinear Time},
  journal   = {CoRR},
  volume    = {abs/1007.4230},
  year      = {2010},
  url       = {http://arxiv.org/abs/1007.4230},
  archivePrefix = {arXiv},
  eprint    = {1007.4230},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1007-4230},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-0831,
  author    = {C. Seshadhri and
               Jan Vondr{\'{a}}k},
  title     = {Is submodularity testable?},
  journal   = {CoRR},
  volume    = {abs/1008.0831},
  year      = {2010},
  url       = {http://arxiv.org/abs/1008.0831},
  archivePrefix = {arXiv},
  eprint    = {1008.0831},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1008-0831},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-3938,
  author    = {Satyen Kale and
               C. Seshadhri},
  title     = {Combinatorial Approximation Algorithms for MaxCut using Random Walks},
  journal   = {CoRR},
  volume    = {abs/1008.3938},
  year      = {2010},
  url       = {http://arxiv.org/abs/1008.3938},
  archivePrefix = {arXiv},
  eprint    = {1008.3938},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1008-3938},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-3234,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {Blackbox identity testing for bounded top fanin depth-3 circuits:
               the field doesn't matter},
  journal   = {CoRR},
  volume    = {abs/1011.3234},
  year      = {2010},
  url       = {http://arxiv.org/abs/1011.3234},
  archivePrefix = {arXiv},
  eprint    = {1011.3234},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-1011-3234},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SaxenaS10,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-box
               Identity Test for Depth-3 Circuits},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {13},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/013},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/SaxenaS10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SaxenaS10a,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {Blackbox identity testing for bounded top fanin depth-3 circuits:
               the field doesn't matter},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {167},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/167},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/SaxenaS10a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SaxenaS09,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {An Almost Optimal Rank Bound for Depth-3 Identities},
  booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages     = {137--148},
  year      = {2009},
  crossref  = {DBLP:conf/coco/2009},
  url       = {https://doi.org/10.1109/CCC.2009.20},
  doi       = {10.1109/CCC.2009.20},
  timestamp = {Tue, 16 Jan 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/coco/SaxenaS09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/HazanS09,
  author    = {Elad Hazan and
               C. Seshadhri},
  title     = {Efficient learning algorithms for changing environments},
  booktitle = {Proceedings of the 26th Annual International Conference on Machine
               Learning, {ICML} 2009, Montreal, Quebec, Canada, June 14-18, 2009},
  pages     = {393--400},
  year      = {2009},
  crossref  = {DBLP:conf/icml/2009},
  url       = {https://doi.org/10.1145/1553374.1553425},
  doi       = {10.1145/1553374.1553425},
  timestamp = {Tue, 06 Nov 2018 16:58:29 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icml/HazanS09},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0906-5010,
  author    = {C. Seshadhri},
  title     = {Testing cycle-freeness: Finding a certificate},
  journal   = {CoRR},
  volume    = {abs/0906.5010},
  year      = {2009},
  url       = {http://arxiv.org/abs/0906.5010},
  archivePrefix = {arXiv},
  eprint    = {0906.5010},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0906-5010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-0884,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Kenneth L. Clarkson and
               Ding Liu and
               Wolfgang Mulzer and
               C. Seshadhri},
  title     = {Self-Improving Algorithms},
  journal   = {CoRR},
  volume    = {abs/0907.0884},
  year      = {2009},
  url       = {http://arxiv.org/abs/0907.0884},
  archivePrefix = {arXiv},
  eprint    = {0907.0884},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0907-0884},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AilonCCL08,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Seshadhri Comandur and
               Ding Liu},
  title     = {Property-Preserving Data Reconstruction},
  journal   = {Algorithmica},
  volume    = {51},
  number    = {2},
  pages     = {160--182},
  year      = {2008},
  url       = {https://doi.org/10.1007/s00453-007-9075-9},
  doi       = {10.1007/s00453-007-9075-9},
  timestamp = {Wed, 17 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/algorithmica/AilonCCL08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ClarksonS08,
  author    = {Kenneth L. Clarkson and
               C. Seshadhri},
  title     = {Self-improving algorithms for delaunay triangulations},
  booktitle = {Proceedings of the 24th {ACM} Symposium on Computational Geometry,
               College Park, MD, USA, June 9-11, 2008},
  pages     = {148--155},
  year      = {2008},
  crossref  = {DBLP:conf/compgeom/2008},
  url       = {https://doi.org/10.1145/1377676.1377700},
  doi       = {10.1145/1377676.1377700},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/ClarksonS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KalePS08,
  author    = {Satyen Kale and
               Yuval Peres and
               C. Seshadhri},
  title     = {Noise Tolerance of Expanders and Sublinear Expander Reconstruction},
  booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  pages     = {719--728},
  year      = {2008},
  crossref  = {DBLP:conf/focs/2008},
  url       = {https://doi.org/10.1109/FOCS.2008.65},
  doi       = {10.1109/FOCS.2008.65},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/focs/KalePS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KaleS08,
  author    = {Satyen Kale and
               C. Seshadhri},
  title     = {An Expansion Tester for Bounded Degree Graphs},
  booktitle = {Automata, Languages and Programming, 35th International Colloquium,
               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  pages     = {527--538},
  year      = {2008},
  crossref  = {DBLP:conf/icalp/2008-1},
  url       = {https://doi.org/10.1007/978-3-540-70575-8\_43},
  doi       = {10.1007/978-3-540-70575-8\_43},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/KaleS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SaksS08,
  author    = {Michael E. Saks and
               C. Seshadhri},
  title     = {Parallel monotonicity reconstruction},
  booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  pages     = {962--971},
  year      = {2008},
  crossref  = {DBLP:conf/soda/2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082.1347187},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/SaksS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-3161,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {An Almost Optimal Rank Bound for Depth-3 Identities},
  journal   = {CoRR},
  volume    = {abs/0811.3161},
  year      = {2008},
  url       = {http://arxiv.org/abs/0811.3161},
  archivePrefix = {arXiv},
  eprint    = {0811.3161},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/corr/abs-0811-3161},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SaxenaS08,
  author    = {Nitin Saxena and
               C. Seshadhri},
  title     = {An Almost Optimal Rank Bound for Depth-3 Identities},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {108},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-108/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/SaxenaS08},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/ComandurSB07,
  author    = {Seshadhri Comandur and
               Anil Seth and
               Somenath Biswas},
  title     = {{RAM} Simulation of {BGS} Model of Abstract-state Machines},
  journal   = {Fundam. Inform.},
  volume    = {77},
  number    = {1-2},
  pages     = {175--185},
  year      = {2007},
  url       = {http://content.iospress.com/articles/fundamenta-informaticae/fi77-1-2-07},
  timestamp = {Mon, 18 May 2015 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/fuin/ComandurSB07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AilonCCL07,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Seshadhri Comandur and
               Ding Liu},
  title     = {Estimating the distance to a monotone function},
  journal   = {Random Struct. Algorithms},
  volume    = {31},
  number    = {3},
  pages     = {371--383},
  year      = {2007},
  url       = {https://doi.org/10.1002/rsa.20167},
  doi       = {10.1002/rsa.20167},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/rsa/AilonCCL07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KaleS07,
  author    = {Satyen Kale and
               C. Seshadhri},
  title     = {Testing Expansion in Bounded Degree Graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {076},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-076/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/KaleS07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HazanS07,
  author    = {Elad Hazan and
               C. Seshadhri},
  title     = {Adaptive Algorithms for Online Decision Problems},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {088},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-088/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/HazanS07},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChazelleS06,
  author    = {Bernard Chazelle and
               C. Seshadhri},
  title     = {Online geometric reconstruction},
  booktitle = {Proceedings of the 22nd {ACM} Symposium on Computational Geometry,
               Sedona, Arizona, USA, June 5-7, 2006},
  pages     = {386--394},
  year      = {2006},
  crossref  = {DBLP:conf/compgeom/2006},
  url       = {https://doi.org/10.1145/1137856.1137912},
  doi       = {10.1145/1137856.1137912},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/ChazelleS06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AilonCCL06,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Seshadhri Comandur and
               Ding Liu},
  title     = {Self-improving algorithms},
  booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  pages     = {261--270},
  year      = {2006},
  crossref  = {DBLP:conf/soda/2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557.1109587},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/AilonCCL06},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asm/ComandurSB05,
  author    = {Seshadhri Comandur and
               Anil Seth and
               Somenath Biswas},
  title     = {{RAM} Simulation of {BGS} Model of Abstract State Machines},
  booktitle = {Proceedings of the 12th International Workshop on Abstract State Machines,
               {ASM} 2005, March 8-11, 2005, Paris, France},
  pages     = {377--386},
  year      = {2005},
  crossref  = {DBLP:conf/asm/2005},
  url       = {http://www.univ-paris12.fr/lacl/dima/asm05/seshadhri.ps},
  timestamp = {Thu, 26 Jul 2007 15:03:11 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/asm/ComandurSB05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AilonCCL04,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Seshadhri Comandur and
               Ding Liu},
  title     = {Estimating the Distance to a Monotone Function},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
               and Techniques, 7th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
               Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
               MA, USA, August 22-24, 2004, Proceedings},
  pages     = {229--236},
  year      = {2004},
  crossref  = {DBLP:conf/approx/2004},
  url       = {https://doi.org/10.1007/978-3-540-27821-4\_21},
  doi       = {10.1007/978-3-540-27821-4\_21},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/AilonCCL04},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/AilonCCL04,
  author    = {Nir Ailon and
               Bernard Chazelle and
               Seshadhri Comandur and
               Ding Liu},
  title     = {Property-Preserving Data Reconstruction},
  booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
               2004, Hong Kong, China, December 20-22, 2004, Proceedings},
  pages     = {16--27},
  year      = {2004},
  crossref  = {DBLP:conf/isaac/2004},
  url       = {https://doi.org/10.1007/978-3-540-30551-4\_4},
  doi       = {10.1007/978-3-540-30551-4\_4},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/AilonCCL04},
  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/focs/2018,
  editor    = {Mikkel Thorup},
  title     = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
               2018, Paris, France, October 7-9, 2018},
  publisher = {{IEEE} Computer Society},
  year      = {2018},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8554191},
  isbn      = {978-1-5386-4230-6},
  timestamp = {Tue, 04 Dec 2018 10:32:10 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2018,
  editor    = {Ioannis Chatzigiannakis and
               Christos Kaklamanis and
               D{\'{a}}niel Marx and
               Donald Sannella},
  title     = {45th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
  series    = {LIPIcs},
  volume    = {107},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-076-7},
  isbn      = {978-3-95977-076-7},
  timestamp = {Sat, 28 Jul 2018 14:39:07 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2018},
  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/www/2018,
  editor    = {Pierre{-}Antoine Champin and
               Fabien L. Gandon and
               Mounia Lalmas and
               Panagiotis G. Ipeirotis},
  title     = {Proceedings of the 2018 World Wide Web Conference on World Wide Web,
               {WWW} 2018, Lyon, France, April 23-27, 2018},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3178876},
  doi       = {10.1145/3178876},
  timestamp = {Wed, 21 Nov 2018 12:44:11 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/2018},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2017,
  editor    = {Ioannis Chatzigiannakis and
               Piotr Indyk and
               Fabian Kuhn and
               Anca Muscholl},
  title     = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series    = {LIPIcs},
  volume    = {80},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2017},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-041-5},
  isbn      = {978-3-95977-041-5},
  timestamp = {Mon, 17 Jul 2017 16:47:29 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/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/www/2017,
  editor    = {Rick Barrett and
               Rick Cummings and
               Eugene Agichtein and
               Evgeniy Gabrilovich},
  title     = {Proceedings of the 26th International Conference on World Wide Web,
               {WWW} 2017, Perth, Australia, April 3-7, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3038912},
  doi       = {10.1145/3038912},
  isbn      = {978-1-4503-4913-0},
  timestamp = {Tue, 06 Nov 2018 16:57:07 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/www/2017},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2016,
  editor    = {S{\'{a}}ndor P. Fekete and
               Anna Lubiw},
  title     = {32nd International Symposium on Computational Geometry, SoCG 2016,
               June 14-18, 2016, Boston, MA, {USA}},
  series    = {LIPIcs},
  volume    = {51},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2016},
  url       = {http://www.dagstuhl.de/dagpub/978-3-95977-009-5},
  isbn      = {978-3-95977-009-5},
  timestamp = {Wed, 15 Jun 2016 18:15:24 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2016},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/acssc/2015,
  editor    = {Michael B. Matthews},
  title     = {49th Asilomar Conference on Signals, Systems and Computers, {ACSSC}
               2015, Pacific Grove, CA, USA, November 8-11, 2015},
  publisher = {{IEEE}},
  year      = {2015},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7405775},
  isbn      = {978-1-4673-8576-3},
  timestamp = {Sun, 06 Mar 2016 10:48:42 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/acssc/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2015,
  editor    = {Venkatesan Guruswami},
  title     = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
               2015, Berkeley, CA, USA, 17-20 October, 2015},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7352273},
  isbn      = {978-1-4673-8191-8},
  timestamp = {Mon, 04 Jan 2016 11:39:48 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icdm/2015,
  editor    = {Charu C. Aggarwal and
               Zhi{-}Hua Zhou and
               Alexander Tuzhilin and
               Hui Xiong and
               Xindong Wu},
  title     = {2015 {IEEE} International Conference on Data Mining, {ICDM} 2015,
               Atlantic City, NJ, USA, November 14-17, 2015},
  publisher = {{IEEE} Computer Society},
  year      = {2015},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7373198},
  isbn      = {978-1-4673-9504-5},
  timestamp = {Mon, 07 Jan 2019 17:17:42 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icdm/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2015,
  editor    = {Piotr Indyk},
  title     = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  publisher = {{SIAM}},
  year      = {2015},
  url       = {https://doi.org/10.1137/1.9781611973730},
  doi       = {10.1137/1.9781611973730},
  isbn      = {978-1-61197-374-7},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/www/2015,
  editor    = {Aldo Gangemi and
               Stefano Leonardi and
               Alessandro Panconesi},
  title     = {Proceedings of the 24th International Conference on World Wide Web,
               {WWW} 2015, Florence, Italy, May 18-22, 2015},
  publisher = {{ACM}},
  year      = {2015},
  url       = {http://dl.acm.org/citation.cfm?id=2736277},
  isbn      = {978-1-4503-3469-3},
  timestamp = {Mon, 25 May 2015 17:03:01 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/www/2015},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0036990,
  editor    = {Coral Calero and
               Mario Piattini},
  title     = {Green in Software Engineering},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-319-08581-4},
  doi       = {10.1007/978-3-319-08581-4},
  isbn      = {978-3-319-08580-7},
  timestamp = {Wed, 14 Nov 2018 10:12:20 +0100},
  biburl    = {https://dblp.org/rec/bib/books/daglib/0036990},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2014,
  editor    = {Moni Naor},
  title     = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
               USA, January 12-14, 2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {http://dl.acm.org/citation.cfm?id=2554797},
  isbn      = {978-1-4503-2698-8},
  timestamp = {Fri, 14 Feb 2014 17:36:37 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/kdd/2014,
  editor    = {Sofus A. Macskassy and
               Claudia Perlich and
               Jure Leskovec and
               Wei Wang and
               Rayid Ghani},
  title     = {The 20th {ACM} {SIGKDD} International Conference on Knowledge Discovery
               and Data Mining, {KDD} '14, New York, NY, {USA} - August 24 - 27,
               2014},
  publisher = {{ACM}},
  year      = {2014},
  url       = {http://dl.acm.org/citation.cfm?id=2623330},
  isbn      = {978-1-4503-2956-9},
  timestamp = {Wed, 24 Sep 2014 12:28:09 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/kdd/2014},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2013,
  editor    = {Prasad Raghavendra and
               Sofya Raskhodnikova and
               Klaus Jansen and
               Jos{\'{e}} D. P. Rolim},
  title     = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
               International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
               2013. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8096},
  publisher = {Springer},
  year      = {2013},
  url       = {https://doi.org/10.1007/978-3-642-40328-6},
  doi       = {10.1007/978-3-642-40328-6},
  isbn      = {978-3-642-40327-9},
  timestamp = {Tue, 23 May 2017 01:10:59 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/kdd/2013,
  editor    = {Inderjit S. Dhillon and
               Yehuda Koren and
               Rayid Ghani and
               Ted E. Senator and
               Paul Bradley and
               Rajesh Parekh and
               Jingrui He and
               Robert L. Grossman and
               Ramasamy Uthurusamy},
  title     = {The 19th {ACM} {SIGKDD} International Conference on Knowledge Discovery
               and Data Mining, {KDD} 2013, Chicago, IL, USA, August 11-14, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2487575},
  isbn      = {978-1-4503-2174-7},
  timestamp = {Tue, 10 Sep 2013 09:40:37 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/kdd/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ldav/2013,
  editor    = {Berk Geveci and
               Hanspeter Pfister and
               Venkatram Vishwanath},
  title     = {{IEEE} Symposium on Large-Scale Data Analysis and Visualization, {LDAV}
               2013, 13-14 October, 2013, Atlanta, Georgia, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6664714},
  isbn      = {978-1-4799-1659-7},
  timestamp = {Fri, 11 Dec 2015 11:47:17 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/ldav/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/nsw/2013,
  title     = {Proceedings of the 2nd {IEEE} Network Science Workshop, {NSW} 2013,
               April 29 - May 1, 2013, Thayer Hotel, West Point, NY, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2013},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6596017},
  isbn      = {978-1-4799-0436-5},
  timestamp = {Fri, 23 Dec 2016 13:06:39 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/nsw/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sdm/2013,
  title     = {Proceedings of the 13th {SIAM} International Conference on Data Mining,
               May 2-4, 2013. Austin, Texas, {USA}},
  publisher = {{SIAM}},
  year      = {2013},
  url       = {https://doi.org/10.1137/1.9781611972832},
  doi       = {10.1137/1.9781611972832},
  isbn      = {978-1-61197-262-7},
  timestamp = {Wed, 17 May 2017 14:24:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sdm/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2013,
  editor    = {Sanjeev Khanna},
  title     = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
               2013},
  publisher = {{SIAM}},
  year      = {2013},
  url       = {https://doi.org/10.1137/1.9781611973105},
  doi       = {10.1137/1.9781611973105},
  isbn      = {978-1-61197-251-1},
  timestamp = {Wed, 24 May 2017 08:31:20 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2013,
  editor    = {Dan Boneh and
               Tim Roughgarden and
               Joan Feigenbaum},
  title     = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
               USA, June 1-4, 2013},
  publisher = {{ACM}},
  year      = {2013},
  url       = {http://dl.acm.org/citation.cfm?id=2488608},
  isbn      = {978-1-4503-2029-0},
  timestamp = {Sun, 26 May 2013 10:30:47 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2013},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cikm/2012,
  editor    = {Xue{-}wen Chen and
               Guy Lebanon and
               Haixun Wang and
               Mohammed J. Zaki},
  title     = {21st {ACM} International Conference on Information and Knowledge Management,
               CIKM'12, Maui, HI, USA, October 29 - November 02, 2012},
  publisher = {{ACM}},
  year      = {2012},
  url       = {http://dl.acm.org/citation.cfm?id=2396761},
  isbn      = {978-1-4503-1156-4},
  timestamp = {Fri, 08 Jul 2016 07:22:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cikm/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2012,
  editor    = {Tamal K. Dey and
               Sue Whitesides},
  title     = {Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC,
               USA, June 17-20, 2012},
  publisher = {{ACM}},
  year      = {2012},
  url       = {https://doi.org/10.1145/2261250},
  doi       = {10.1145/2261250},
  isbn      = {978-1-4503-1299-8},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/kdd/2012,
  editor    = {Qiang Yang and
               Deepak Agarwal and
               Jian Pei},
  title     = {The 18th {ACM} {SIGKDD} International Conference on Knowledge Discovery
               and Data Mining, {KDD} '12, Beijing, China, August 12-16, 2012},
  publisher = {{ACM}},
  year      = {2012},
  url       = {http://dl.acm.org/citation.cfm?id=2339530},
  isbn      = {978-1-4503-1462-6},
  timestamp = {Wed, 11 Dec 2013 16:46:50 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/kdd/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sdm/2012,
  title     = {Proceedings of the Twelfth {SIAM} International Conference on Data
               Mining, Anaheim, California, USA, April 26-28, 2012},
  publisher = {{SIAM} / Omnipress},
  year      = {2012},
  url       = {https://doi.org/10.1137/1.9781611972825},
  doi       = {10.1137/1.9781611972825},
  isbn      = {978-1-61197-232-0},
  timestamp = {Wed, 17 May 2017 14:24:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/sdm/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/waw/2012,
  editor    = {Anthony Bonato and
               Jeannette C. M. Janssen},
  title     = {Algorithms and Models for the Web Graph - 9th International Workshop,
               {WAW} 2012, Halifax, NS, Canada, June 22-23, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7323},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-30541-2},
  doi       = {10.1007/978-3-642-30541-2},
  isbn      = {978-3-642-30540-5},
  timestamp = {Wed, 24 May 2017 08:31:10 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/waw/2012},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icdm/2011,
  editor    = {Diane J. Cook and
               Jian Pei and
               Wei Wang and
               Osmar R. Za{\"{\i}}ane and
               Xindong Wu},
  title     = {11th {IEEE} International Conference on Data Mining, {ICDM} 2011,
               Vancouver, BC, Canada, December 11-14, 2011},
  publisher = {{IEEE} Computer Society},
  year      = {2011},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6135855},
  isbn      = {978-0-7695-4408-3},
  timestamp = {Mon, 07 Jan 2019 17:17:42 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icdm/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2011,
  editor    = {Bernard Chazelle},
  title     = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
               Beijing, China, January 7-9, 2011. Proceedings},
  publisher = {Tsinghua University Press},
  year      = {2011},
  isbn      = {978-7-302-24517-9},
  timestamp = {Wed, 19 Oct 2011 15:40:50 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/innovations/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2011,
  editor    = {Lance Fortnow and
               Salil P. Vadhan},
  title     = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
               2011, San Jose, CA, USA, 6-8 June 2011},
  publisher = {{ACM}},
  year      = {2011},
  isbn      = {978-1-4503-0691-1},
  timestamp = {Tue, 22 May 2012 21:36:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stoc/2011},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2010,
  title     = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2010},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5669376},
  isbn      = {978-0-7695-4244-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2010,
  editor    = {Moses Charikar},
  title     = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  publisher = {{SIAM}},
  year      = {2010},
  url       = {https://doi.org/10.1137/1.9781611973075},
  doi       = {10.1137/1.9781611973075},
  isbn      = {978-0-89871-701-3},
  timestamp = {Wed, 24 May 2017 08:31:21 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:conf/propertytesting/2010,
  editor    = {Oded Goldreich},
  title     = {Property Testing - Current Research and Surveys},
  series    = {Lecture Notes in Computer Science},
  volume    = {6390},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-16367-8},
  doi       = {10.1007/978-3-642-16367-8},
  isbn      = {978-3-642-16366-1},
  timestamp = {Wed, 01 Aug 2018 17:20:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/propertytesting/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2009,
  title     = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  publisher = {{IEEE} Computer Society},
  year      = {2009},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5231175},
  isbn      = {978-0-7695-3717-7},
  timestamp = {Fri, 13 May 2016 10:27:38 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icml/2009,
  editor    = {Andrea Pohoreckyj Danyluk and
               L{\'{e}}on Bottou and
               Michael L. Littman},
  title     = {Proceedings of the 26th Annual International Conference on Machine
               Learning, {ICML} 2009, Montreal, Quebec, Canada, June 14-18, 2009},
  series    = {{ACM} International Conference Proceeding Series},
  volume    = {382},
  publisher = {{ACM}},
  year      = {2009},
  url       = {https://doi.org/10.1145/1553374},
  doi       = {10.1145/1553374},
  isbn      = {978-1-60558-516-1},
  timestamp = {Tue, 06 Nov 2018 16:58:29 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/icml/2009},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2008,
  editor    = {Monique Teillaud},
  title     = {Proceedings of the 24th {ACM} Symposium on Computational Geometry,
               College Park, MD, USA, June 9-11, 2008},
  publisher = {{ACM}},
  year      = {2008},
  url       = {https://doi.org/10.1145/1377676},
  doi       = {10.1145/1377676},
  isbn      = {978-1-60558-071-5},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2008,
  title     = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
               2008, October 25-28, 2008, Philadelphia, PA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2008},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4690923},
  isbn      = {978-0-7695-3436-7},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/focs/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2008-1,
  editor    = {Luca Aceto and
               Ivan Damg{\aa}rd and
               Leslie Ann Goldberg and
               Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Anna Ing{\'{o}}lfsd{\'{o}}ttir and
               Igor Walukiewicz},
  title     = {Automata, Languages and Programming, 35th International Colloquium,
               {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
               {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series    = {Lecture Notes in Computer Science},
  volume    = {5125},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-70575-8},
  doi       = {10.1007/978-3-540-70575-8},
  isbn      = {978-3-540-70574-1},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/icalp/2008-1},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2008,
  editor    = {Shang{-}Hua Teng},
  title     = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
               2008},
  publisher = {{SIAM}},
  year      = {2008},
  url       = {http://dl.acm.org/citation.cfm?id=1347082},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/compgeom/2006,
  editor    = {Nina Amenta and
               Otfried Cheong},
  title     = {Proceedings of the 22nd {ACM} Symposium on Computational Geometry,
               Sedona, Arizona, USA, June 5-7, 2006},
  publisher = {{ACM}},
  year      = {2006},
  url       = {https://doi.org/10.1145/1137856},
  doi       = {10.1145/1137856},
  isbn      = {1-59593-340-9},
  timestamp = {Tue, 06 Nov 2018 16:57:04 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/compgeom/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2006,
  title     = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
  publisher = {{ACM} Press},
  year      = {2006},
  url       = {http://dl.acm.org/citation.cfm?id=1109557},
  isbn      = {0-89871-605-5},
  timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl    = {https://dblp.org/rec/bib/conf/soda/2006},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/asm/2005,
  title     = {Proceedings of the 12th International Workshop on Abstract State Machines,
               {ASM} 2005, March 8-11, 2005, Paris, France},
  year      = {2005},
  timestamp = {Thu, 26 Jul 2007 15:03:11 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/asm/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/approx/2004,
  editor    = {Klaus Jansen and
               Sanjeev Khanna and
               Jos{\'{e}} D. P. Rolim and
               Dana Ron},
  title     = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
               and Techniques, 7th International Workshop on Approximation Algorithms
               for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
               Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
               MA, USA, August 22-24, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3122},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b99805},
  doi       = {10.1007/b99805},
  isbn      = {3-540-22894-2},
  timestamp = {Tue, 30 May 2017 12:57:44 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/approx/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/isaac/2004,
  editor    = {Rudolf Fleischer and
               Gerhard Trippen},
  title     = {Algorithms and Computation, 15th International Symposium, {ISAAC}
               2004, Hong Kong, China, December 20-22, 2004, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3341},
  publisher = {Springer},
  year      = {2004},
  url       = {https://doi.org/10.1007/b104582},
  doi       = {10.1007/b104582},
  isbn      = {3-540-24131-0},
  timestamp = {Tue, 30 May 2017 16:36:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/isaac/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier