Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Seshadhri Comandur
@article{DBLP:journals/dcg/RaichelC23,
author = {Benjamin Raichel and
Seshadhri Comandur},
title = {Correction to: Avoiding the Global Sort: {A} Faster Contour Tree Algorithm},
journal = {Discret. Comput. Geom.},
volume = {69},
number = {1},
pages = {1--3},
year = {2023},
url = {https://doi.org/10.1007/s00454-022-00417-5},
doi = {10.1007/S00454-022-00417-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/RaichelC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KumarSS23,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Random Walks and Forbidden Minors {I:} An {\textdollar}n{\^{}}\{1/2+o(1)\}{\textdollar}-Query
One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {6},
pages = {S18--216},
year = {2023},
url = {https://doi.org/10.1137/19m1245463},
doi = {10.1137/19M1245463},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/KumarSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlackC023,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
title = {A d\({}^{\mbox{1/2+o(1)}}\) Monotonicity Tester for Boolean Functions
on d-Dimensional Hypergrids},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1796--1821},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00110},
doi = {10.1109/FOCS57990.2023.00110},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlackC023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/000123,
author = {C. Seshadhri},
editor = {Floris Geerts and
Brecht Vandevoort},
title = {Some Vignettes on Subgraph Counting Using Graph Orientations (Invited
Talk)},
booktitle = {26th International Conference on Database Theory, {ICDT} 2023, March
28-31, 2023, Ioannina, Greece},
series = {LIPIcs},
volume = {255},
pages = {3:1--3:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICDT.2023.3},
doi = {10.4230/LIPICS.ICDT.2023.3},
timestamp = {Fri, 17 Mar 2023 15:19:25 +0100},
biburl = {https://dblp.org/rec/conf/icdt/000123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/Huang0G23,
author = {Yufan Huang and
C. Seshadhri and
David F. Gleich},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Theoretical Bounds on the Network Community Profile from Low-rank
Semi-definite Programming},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {13976--13992},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/huang23l.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/Huang0G23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlackC023,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid
and an {\~{O}}(n{\(\surd\)}d) Monotonicity Tester},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {233--241},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585167},
doi = {10.1145/3564246.3585167},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlackC023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-01416,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
title = {A d\({}^{\mbox{1/2+o(1)}}\) Monotonicity Tester for Boolean Functions
on d-Dimensional Hypergrids},
journal = {CoRR},
volume = {abs/2304.01416},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.01416},
doi = {10.48550/ARXIV.2304.01416},
eprinttype = {arXiv},
eprint = {2304.01416},
timestamp = {Mon, 17 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-01416.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-09584,
author = {Daniel Paul{-}Pena and
C. Seshadhri},
title = {A Dichotomy Hierarchy Characterizing Linear Time Subgraph Counting
in Bounded Degeneracy Graphs},
journal = {CoRR},
volume = {abs/2311.09584},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2311.09584},
doi = {10.48550/ARXIV.2311.09584},
eprinttype = {arXiv},
eprint = {2311.09584},
timestamp = {Tue, 21 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2311-09584.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlackC023,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
title = {A d\({}^{\mbox{1/2+o(1)}}\) Monotonicity Tester for Boolean Functions
on {\textdollar}d{\textdollar}-Dimensional Hypergrids},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-048}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/048},
eprinttype = {ECCC},
eprint = {TR23-048},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlackC023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeraGLSS22,
author = {Suman K. Bera and
Lior Gishboliner and
Yevgeny Levanzov and
C. Seshadhri and
Asaf Shapira},
title = {Counting Subgraphs in Degenerate Graphs},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {23:1--23:21},
year = {2022},
url = {https://doi.org/10.1145/3520240},
doi = {10.1145/3520240},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BeraGLSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeheraH0RS22,
author = {Balaram Behera and
Edin Husic and
Shweta Jain and
Tim Roughgarden and
C. Seshadhri},
editor = {Mark Braverman},
title = {{FPT} Algorithms for Finding Near-Cliques in c-Closed Graphs},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {17:1--17:24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.17},
doi = {10.4230/LIPICS.ITCS.2022.17},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BeheraH0RS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sdm/StolmanL0S22,
author = {Andrew Stolman and
Caleb Levy and
C. Seshadhri and
Aneesh Sharma},
editor = {Arindam Banerjee and
Zhi{-}Hua Zhou and
Evangelos E. Papalexakis and
Matteo Riondato},
title = {Classic Graph Structural Features Outperform Factorization-Based Graph
Embedding Methods on Community Labeling},
booktitle = {Proceedings of the 2022 {SIAM} International Conference on Data Mining,
{SDM} 2022, Alexandria, VA, USA, April 28-30, 2022},
pages = {388--396},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977172.44},
doi = {10.1137/1.9781611977172.44},
timestamp = {Sat, 30 Sep 2023 09:55:58 +0200},
biburl = {https://dblp.org/rec/conf/sdm/StolmanL0S22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BasuKS22,
author = {Sabyasachi Basu and
Akash Kumar and
C. Seshadhri},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {The complexity of testing all properties of planar graphs, and the
role of isomorphism},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {1702--1714},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.69},
doi = {10.1137/1.9781611977073.69},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BasuKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-08481,
author = {Andrew Stolman and
Caleb Levy and
C. Seshadhri and
Aneesh Sharma},
title = {Classic Graph Structural Features Outperform Factorization-Based Graph
Embedding Methods on Community Labeling},
journal = {CoRR},
volume = {abs/2201.08481},
year = {2022},
url = {https://arxiv.org/abs/2201.08481},
eprinttype = {arXiv},
eprint = {2201.08481},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-08481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-05281,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
title = {Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid
and an O{\~}(n{\(\surd\)}d) Monotonicity Tester},
journal = {CoRR},
volume = {abs/2211.05281},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.05281},
doi = {10.48550/ARXIV.2211.05281},
eprinttype = {arXiv},
eprint = {2211.05281},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-05281.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-06352,
author = {Sabyasachi Basu and
Suman Kalyan Bera and
C. Seshadhri},
title = {Spectral Triadic Decompositions of Real-World Networks},
journal = {CoRR},
volume = {abs/2211.06352},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.06352},
doi = {10.48550/ARXIV.2211.06352},
eprinttype = {arXiv},
eprint = {2211.06352},
timestamp = {Tue, 15 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-06352.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-08605,
author = {Daniel Paul{-}Pena and
C. Seshadhri},
title = {A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in
Bounded Degeneracy Graphs},
journal = {CoRR},
volume = {abs/2211.08605},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.08605},
doi = {10.48550/ARXIV.2211.08605},
eprinttype = {arXiv},
eprint = {2211.08605},
timestamp = {Wed, 23 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-08605.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BlackC022,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
title = {Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid
and an {\textdollar}{\textbackslash}widetilde\{O\}(n{\textbackslash}sqrt\{d\}){\textdollar}
Monotonicity Tester},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-162}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/162},
eprinttype = {ECCC},
eprint = {TR22-162},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BlackC022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0003SS21,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Random walks and forbidden minors {III:} {\textdollar}{\textbackslash}text\{poly\}{\textbackslash}left(d{\textbackslash}varepsilon
{\^{}}\{-1\}{\textbackslash}right){\textdollar}-time partition oracles
for minor-free graph classes},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {257--268},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00034},
doi = {10.1109/FOCS52979.2021.00034},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0003SS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/PashanasangiS21,
author = {Noujan Pashanasangi and
C. Seshadhri},
editor = {Feida Zhu and
Beng Chin Ooi and
Chunyan Miao},
title = {Faster and Generalized Temporal Triangle Counting, via Degeneracy
Ordering},
booktitle = {{KDD} '21: The 27th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, Virtual Event, Singapore, August 14-18, 2021},
pages = {1319--1328},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3447548.3467374},
doi = {10.1145/3447548.3467374},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/PashanasangiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BeraPS21,
author = {Suman K. Bera and
Noujan Pashanasangi and
C. Seshadhri},
editor = {D{\'{a}}niel Marx},
title = {Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs:
The Barrier of Long Induced Cycles},
booktitle = {Proceedings of the 2021 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2021, Virtual Conference, January 10 - 13, 2021},
pages = {2315--2332},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976465.138},
doi = {10.1137/1.9781611976465.138},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BeraPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-00556,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Random walks and forbidden minors {III:} poly(d/{\(\epsilon\)})-time
partition oracles for minor-free graph classes},
journal = {CoRR},
volume = {abs/2102.00556},
year = {2021},
url = {https://arxiv.org/abs/2102.00556},
eprinttype = {arXiv},
eprint = {2102.00556},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-00556.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-11079,
author = {Aydin Bulu{\c{c}} and
Tamara G. Kolda and
Stefan M. Wild and
Mihai Anitescu and
Anthony M. DeGennaro and
John Jakeman and
Chandrika Kamath and
Ramakrishnan Kannan and
Miles E. Lopes and
Per{-}Gunnar Martinsson and
Kary L. Myers and
Jelani Nelson and
Juan M. Restrepo and
C. Seshadhri and
Draguna L. Vrabie and
Brendt Wohlberg and
Stephen J. Wright and
Chao Yang and
Peter Zwart},
title = {Randomized Algorithms for Scientific Computing {(RASC)}},
journal = {CoRR},
volume = {abs/2104.11079},
year = {2021},
url = {https://arxiv.org/abs/2104.11079},
eprinttype = {arXiv},
eprint = {2104.11079},
timestamp = {Fri, 06 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-11079.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-02762,
author = {Noujan Pashanasangi and
C. Seshadhri},
title = {Faster and Generalized Temporal Triangle Counting, via Degeneracy
Ordering},
journal = {CoRR},
volume = {abs/2106.02762},
year = {2021},
url = {https://arxiv.org/abs/2106.02762},
eprinttype = {arXiv},
eprint = {2106.02762},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-02762.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-10547,
author = {Sabyasachi Basu and
Akash Kumar and
C. Seshadhri},
title = {The complexity of testing all properties of planar graphs, and the
role of isomorphism},
journal = {CoRR},
volume = {abs/2108.10547},
year = {2021},
url = {https://arxiv.org/abs/2108.10547},
eprinttype = {arXiv},
eprint = {2108.10547},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-10547.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BasuKS21,
author = {Sabyasachi Basu and
Akash Kumar and
C. Seshadhri},
title = {The complexity of testing all properties of planar graphs, and the
role of isomorphism},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-122}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/122},
eprinttype = {ECCC},
eprint = {TR21-122},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BasuKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarSS21,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Random walks and forbidden minors {III:} poly(d/?)-time partition
oracles for minor-free graph classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-008}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/008},
eprinttype = {ECCC},
eprint = {TR21-008},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pnas/SeshadhriSSG20,
author = {C. Seshadhri and
Aneesh Sharma and
Andrew Stolman and
Ashish Goel},
title = {The impossibility of low-rank representations for triangle-rich complex
networks},
journal = {Proc. Natl. Acad. Sci. {USA}},
volume = {117},
number = {11},
pages = {5631--5637},
year = {2020},
url = {https://doi.org/10.1073/pnas.1911030117},
doi = {10.1073/PNAS.1911030117},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pnas/SeshadhriSSG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FoxRSWW20,
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 = {{SIAM} J. Comput.},
volume = {49},
number = {2},
pages = {448--464},
year = {2020},
url = {https://doi.org/10.1137/18M1210459},
doi = {10.1137/18M1210459},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FoxRSWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EdenRS20,
author = {Talya Eden and
Dana Ron and
C. Seshadhri},
title = {On Approximating the Number of k-Cliques in Sublinear Time},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {4},
pages = {747--771},
year = {2020},
url = {https://doi.org/10.1137/18M1176701},
doi = {10.1137/18M1176701},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EdenRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BaleshzarCPRS20,
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 = {Theory Comput.},
volume = {16},
pages = {1--36},
year = {2020},
url = {https://doi.org/10.4086/toc.2020.v016a003},
doi = {10.4086/TOC.2020.V016A003},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BaleshzarCPRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeraPS20,
author = {Suman K. Bera and
Noujan Pashanasangi and
C. Seshadhri},
editor = {Thomas Vidick},
title = {Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at
Size Six},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {38:1--38:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.38},
doi = {10.4230/LIPICS.ITCS.2020.38},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeraPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/BeraS20,
author = {Suman K. Bera and
C. Seshadhri},
editor = {Rajesh Gupta and
Yan Liu and
Jiliang Tang and
B. Aditya Prakash},
title = {How to Count Triangles, without Seeing the Whole Graph},
booktitle = {{KDD} '20: The 26th {ACM} {SIGKDD} Conference on Knowledge Discovery
and Data Mining, Virtual Event, CA, USA, August 23-27, 2020},
pages = {306--316},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3394486.3403073},
doi = {10.1145/3394486.3403073},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/BeraS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/BeraS20,
author = {Suman K. Bera and
C. Seshadhri},
editor = {Dan Suciu and
Yufei Tao and
Zhewei Wei},
title = {How the Degeneracy Helps for Triangle Counting in Graph Streams},
booktitle = {Proceedings of the 39th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium on Principles
of Database Systems, {PODS} 2020, Portland, OR, USA, June 14-19, 2020},
pages = {457--467},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3375395.3387665},
doi = {10.1145/3375395.3387665},
timestamp = {Thu, 29 Sep 2022 08:01:46 +0200},
biburl = {https://dblp.org/rec/conf/pods/BeraS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EdenRS20,
author = {Talya Eden and
Dana Ron and
C. Seshadhri},
editor = {Shuchi Chawla},
title = {Faster sublinear approximation of the number of \emph{k}-cliques in
low-arboricity graphs},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1467--1478},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.89},
doi = {10.1137/1.9781611975994.89},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/EdenRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlackCS20,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Shuchi Chawla},
title = {Domain Reduction for Monotonicity Testing: {A} \emph{o}(\emph{d})
Tester for Boolean Functions in \emph{d}-Dimensions},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {1975--1994},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.122},
doi = {10.1137/1.9781611975994.122},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BlackCS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/0003S20,
author = {Shweta Jain and
C. Seshadhri},
editor = {James Caverlee and
Xia (Ben) Hu and
Mounia Lalmas and
Wei Wang},
title = {The Power of Pivoting for Exact Clique Counting},
booktitle = {{WSDM} '20: The Thirteenth {ACM} International Conference on Web Search
and Data Mining, Houston, TX, USA, February 3-7, 2020},
pages = {268--276},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3336191.3371839},
doi = {10.1145/3336191.3371839},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/0003S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wsdm/PashanasangiS20,
author = {Noujan Pashanasangi and
C. Seshadhri},
editor = {James Caverlee and
Xia (Ben) Hu and
Mounia Lalmas and
Wei Wang},
title = {Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by {EVOKE}},
booktitle = {{WSDM} '20: The Thirteenth {ACM} International Conference on Web Search
and Data Mining, Houston, TX, USA, February 3-7, 2020},
pages = {447--455},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3336191.3371773},
doi = {10.1145/3336191.3371773},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wsdm/PashanasangiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/0003S20,
author = {Shweta Jain and
C. Seshadhri},
editor = {Yennun Huang and
Irwin King and
Tie{-}Yan Liu and
Maarten van Steen},
title = {Provably and Efficiently Approximating Near-cliques using the Tur{\'{a}}n
Shadow: {PEANUTS}},
booktitle = {{WWW} '20: The Web Conference 2020, Taipei, Taiwan, April 20-24, 2020},
pages = {1966--1976},
publisher = {{ACM} / {IW3C2}},
year = {2020},
url = {https://doi.org/10.1145/3366423.3380264},
doi = {10.1145/3366423.3380264},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/0003S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/cu/20/Seshadhri20,
author = {C. Seshadhri},
editor = {Tim Roughgarden},
title = {Self-Improving Algorithms},
booktitle = {Beyond the Worst-Case Analysis of Algorithms},
pages = {259--282},
publisher = {Cambridge University Press},
year = {2020},
url = {https://doi.org/10.1017/9781108637435.016},
doi = {10.1017/9781108637435.016},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/cu/20/Seshadhri20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/cu/20/RoughgardenS20,
author = {Tim Roughgarden and
C. Seshadhri},
editor = {Tim Roughgarden},
title = {Distribution-Free Models of Social Networks},
booktitle = {Beyond the Worst-Case Analysis of Algorithms},
pages = {606--625},
publisher = {Cambridge University Press},
year = {2020},
url = {https://doi.org/10.1017/9781108637435.035},
doi = {10.1017/9781108637435.035},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/cu/20/RoughgardenS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2001-06784,
author = {Shweta Jain and
C. Seshadhri},
title = {The Power of Pivoting for Exact Clique Counting},
journal = {CoRR},
volume = {abs/2001.06784},
year = {2020},
url = {https://arxiv.org/abs/2001.06784},
eprinttype = {arXiv},
eprint = {2001.06784},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2001-06784.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-12635,
author = {C. Seshadhri and
Aneesh Sharma and
Andrew Stolman and
Ashish Goel},
title = {The impossibility of low rank representations for triangle-rich complex
networks},
journal = {CoRR},
volume = {abs/2003.12635},
year = {2020},
url = {https://arxiv.org/abs/2003.12635},
eprinttype = {arXiv},
eprint = {2003.12635},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-12635.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2003-13151,
author = {Suman K. Bera and
C. Seshadhri},
title = {How the Degeneracy Helps for Triangle Counting in Graph Streams},
journal = {CoRR},
volume = {abs/2003.13151},
year = {2020},
url = {https://arxiv.org/abs/2003.13151},
eprinttype = {arXiv},
eprint = {2003.13151},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-13151.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-11947,
author = {Suman K. Bera and
C. Seshadhri},
title = {How to Count Triangles, without Seeing the Whole Graph},
journal = {CoRR},
volume = {abs/2006.11947},
year = {2020},
url = {https://arxiv.org/abs/2006.11947},
eprinttype = {arXiv},
eprint = {2006.11947},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-11947.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-13483,
author = {Shweta Jain and
C. Seshadhri},
title = {Provably and Efficiently Approximating Near-cliques using the Tur{\'{a}}n
Shadow: {PEANUTS}},
journal = {CoRR},
volume = {abs/2006.13483},
year = {2020},
url = {https://arxiv.org/abs/2006.13483},
eprinttype = {arXiv},
eprint = {2006.13483},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-13483.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-15743,
author = {Tim Roughgarden and
C. Seshadhri},
title = {Distribution-Free Models of Social Networks},
journal = {CoRR},
volume = {abs/2007.15743},
year = {2020},
url = {https://arxiv.org/abs/2007.15743},
eprinttype = {arXiv},
eprint = {2007.15743},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-15743.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-08083,
author = {Suman K. Bera and
Noujan Pashanasangi and
C. Seshadhri},
title = {Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs:
The Barrier of Long Induced Cycles},
journal = {CoRR},
volume = {abs/2010.08083},
year = {2020},
url = {https://arxiv.org/abs/2010.08083},
eprinttype = {arXiv},
eprint = {2010.08083},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-08083.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EdenRS19,
author = {Talya Eden and
Dana Ron and
C. Seshadhri},
title = {Sublinear Time Estimation of Degree Distribution Moments: The Arboricity
Connection},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {4},
pages = {2267--2285},
year = {2019},
url = {https://doi.org/10.1137/17M1159014},
doi = {10.1137/17M1159014},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EdenRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChakrabartyS19,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Avrim Blum},
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}},
series = {LIPIcs},
volume = {124},
pages = {20:1--20:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.20},
doi = {10.4230/LIPICS.ITCS.2019.20},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ChakrabartyS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0003SS19,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
editor = {Moses Charikar and
Edith Cohen},
title = {Random walks and forbidden minors {II:} a poly(\emph{d {\(\epsilon\)}}\({}^{\mbox{-1}}\))-query
tester for minor-closed properties of bounded degree graphs},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {559--567},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316330},
doi = {10.1145/3313276.3316330},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0003SS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/SeshadhriT19,
author = {Seshadhri Comandur and
Srikanta Tirthapura},
editor = {Sihem Amer{-}Yahia and
Mohammad Mahdian and
Ashish Goel and
Geert{-}Jan Houben and
Kristina Lerman and
Julian J. McAuley and
Ricardo Baeza{-}Yates and
Leila Zia},
title = {Scalable Subgraph Counting: The Methods Behind The Madness},
booktitle = {Companion of The 2019 World Wide Web Conference, {WWW} 2019, San Francisco,
CA, USA, May 13-17, 2019},
pages = {1317--1318},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3308560.3320092},
doi = {10.1145/3308560.3320092},
timestamp = {Sat, 11 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/www/SeshadhriT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-01055,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Random walks and forbidden minors {II:} {A} poly(d{\(\epsilon\)}\({}^{\mbox{-1}}\))-query
tester for minor-closed properties of bounded-degree graphs},
journal = {CoRR},
volume = {abs/1904.01055},
year = {2019},
url = {http://arxiv.org/abs/1904.01055},
eprinttype = {arXiv},
eprint = {1904.01055},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-01055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-05896,
author = {Suman K. Bera and
Noujan Pashanasangi and
C. Seshadhri},
title = {Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at
Size Six},
journal = {CoRR},
volume = {abs/1911.05896},
year = {2019},
url = {http://arxiv.org/abs/1911.05896},
eprinttype = {arXiv},
eprint = {1911.05896},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-05896.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-10616,
author = {Noujan Pashanasangi and
C. Seshadhri},
title = {Efficiently Counting Vertex Orbits of All 5-vertex Subgraphs, by {EVOKE}},
journal = {CoRR},
volume = {abs/1911.10616},
year = {2019},
url = {http://arxiv.org/abs/1911.10616},
eprinttype = {arXiv},
eprint = {1911.10616},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-10616.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarSS19,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {andom walks and forbidden minors {II:} {A} poly(d{\(\epsilon\)}\({}^{\mbox{-1}}\)){\textdollar}-query
tester for minor-closed properties of bounded degree graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-046}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/046},
eprinttype = {ECCC},
eprint = {TR19-046},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarSS19.bib},
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 = {Proc. {VLDB} Endow.},
volume = {12},
number = {1},
pages = {43--56},
year = {2018},
url = {http://www.vldb.org/pvldb/vol12/p43-sariyuce.pdf},
doi = {10.14778/3275536.3275540},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/SariyuceSP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0003SS18,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
editor = {Mikkel Thorup},
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},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00055},
doi = {10.1109/FOCS.2018.00055},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0003SS18.bib},
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},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
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},
series = {LIPIcs},
volume = {107},
pages = {55:1--55:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.55},
doi = {10.4230/LIPICS.ICALP.2018.55},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FoxRSWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BlackCS18,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Artur Czumaj},
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},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.139},
doi = {10.1137/1.9781611975031.139},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BlackCS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EdenRS18,
author = {Talya Eden and
Dana Ron and
C. Seshadhri},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
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},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188810},
doi = {10.1145/3188745.3188810},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EdenRS18.bib},
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},
editor = {Pierre{-}Antoine Champin and
Fabien Gandon and
Mounia Lalmas and
Panagiotis G. Ipeirotis},
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},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3178876.3186111},
doi = {10.1145/3178876.3186111},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/EdenJPRS18.bib},
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},
eprinttype = {arXiv},
eprint = {1801.02816},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-02816.bib},
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},
eprinttype = {arXiv},
eprint = {1804.07431},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-07431.bib},
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},
eprinttype = {arXiv},
eprint = {1805.08187},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-08187.bib},
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},
eprinttype = {arXiv},
eprint = {1811.01427},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01427.bib},
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},
eprinttype = {arXiv},
eprint = {1811.04425},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-04425.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-148}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/148},
eprinttype = {ECCC},
eprint = {TR18-148},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0003SS18.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-187}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/187},
eprinttype = {ECCC},
eprint = {TR18-187},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlackCS18.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-005}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/005},
eprinttype = {ECCC},
eprint = {TR18-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS18.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-101}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/101},
eprinttype = {ECCC},
eprint = {TR18-101},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarSS18.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/compnet/SeshadhriPDK17.bib},
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 = {Discret. Comput. Geom.},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/RaichelS17.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SaksS17.bib},
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 = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EdenLRS17.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/ChakrabartyDJS17.bib},
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 = {{ACM} Trans. Web},
volume = {11},
number = {3},
pages = {16:1--16:27},
year = {2017},
url = {https://doi.org/10.1145/3057742},
doi = {10.1145/3057742},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tweb/SariyuceSPC17.bib},
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},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
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},
series = {LIPIcs},
volume = {80},
pages = {5:1--5:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.5},
doi = {10.4230/LIPICS.ICALP.2017.5},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BaleshzarCPRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EdenRS17,
author = {Talya Eden and
Dana Ron and
C. Seshadhri},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
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},
series = {LIPIcs},
volume = {80},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.7},
doi = {10.4230/LIPICS.ICALP.2017.7},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EdenRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/NaumovitzSS17,
author = {Timothy Naumovitz and
Michael E. Saks and
C. Seshadhri},
editor = {Philip N. Klein},
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},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.131},
doi = {10.1137/1.9781611974782.131},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/NaumovitzSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/SharmaSG17,
author = {Aneesh Sharma and
C. Seshadhri and
Ashish Goel},
editor = {Rick Barrett and
Rick Cummings and
Eugene Agichtein and
Evgeniy Gabrilovich},
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},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3038912.3052633},
doi = {10.1145/3038912.3052633},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/SharmaSG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/JainS17,
author = {Shweta Jain and
C. Seshadhri},
editor = {Rick Barrett and
Rick Cummings and
Eugene Agichtein and
Evgeniy Gabrilovich},
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},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3038912.3052636},
doi = {10.1145/3038912.3052636},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/JainS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/PinarSV17,
author = {Ali Pinar and
C. Seshadhri and
Vaidyanathan Vishal},
editor = {Rick Barrett and
Rick Cummings and
Eugene Agichtein and
Evgeniy Gabrilovich},
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},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3038912.3052597},
doi = {10.1145/3038912.3052597},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/PinarSV17.bib},
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},
eprinttype = {arXiv},
eprint = {1703.01054},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SharmaSG17.bib},
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},
eprinttype = {arXiv},
eprint = {1703.05199},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaleshzarCPRS17.bib},
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},
eprinttype = {arXiv},
eprint = {1704.00386},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SariyuceSP17.bib},
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},
eprinttype = {arXiv},
eprint = {1706.00053},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BaleshzarCPRS17a.bib},
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},
eprinttype = {arXiv},
eprint = {1707.04858},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EdenRS17.bib},
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},
eprinttype = {arXiv},
eprint = {1710.08607},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-08607.bib},
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},
eprinttype = {arXiv},
eprint = {1710.10545},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-10545.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-049}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/049},
eprinttype = {ECCC},
eprint = {TR17-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BaleshzarCPRS17.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-111}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/111},
eprinttype = {ECCC},
eprint = {TR17-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BaleshzarCPRS17a.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-159}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/159},
eprinttype = {ECCC},
eprint = {TR17-159},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BlackCS17.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuptaRS16.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChakrabartyS16.bib},
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. Sci. Comput.},
volume = {38},
number = {5},
year = {2016},
url = {https://doi.org/10.1137/15M1027942},
doi = {10.1137/15M1027942},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/BennettBCPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/RaichelS16,
author = {Benjamin Raichel and
C. Seshadhri},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
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}},
series = {LIPIcs},
volume = {51},
pages = {57:1--57:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.57},
doi = {10.4230/LIPICS.SOCG.2016.57},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/RaichelS16.bib},
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/reference/algo/Comandur16.bib},
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},
eprinttype = {arXiv},
eprint = {1604.03661},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EdenRS16.bib},
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},
eprinttype = {arXiv},
eprint = {1608.06980},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChakrabartyS16a.bib},
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},
eprinttype = {arXiv},
eprint = {1610.09411},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/PinarSV16.bib},
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},
eprinttype = {arXiv},
eprint = {1611.05561},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JainS16a.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-133}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/133},
eprinttype = {ECCC},
eprint = {TR16-133},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS16.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/compnet/RayPS15.bib},
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 Math.},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/BerryFNPSW15.bib},
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 = {{ACM} Trans. Knowl. Discov. Data},
volume = {9},
number = {3},
pages = {15:1--15:21},
year = {2015},
url = {https://doi.org/10.1145/2700395},
doi = {10.1145/2700395},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tkdd/JhaSP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acssc/JhaPS15,
author = {Madhav Jha and
Ali Pinar and
C. Seshadhri},
editor = {Michael B. Matthews},
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},
publisher = {{IEEE}},
year = {2015},
url = {https://doi.org/10.1109/ACSSC.2015.7421397},
doi = {10.1109/ACSSC.2015.7421397},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acssc/JhaPS15.bib},
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},
editor = {Venkatesan Guruswami},
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},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.44},
doi = {10.1109/FOCS.2015.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EdenLRS15.bib},
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},
editor = {Charu C. Aggarwal and
Zhi{-}Hua Zhou and
Alexander Tuzhilin and
Hui Xiong and
Xindong Wu},
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},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/ICDM.2015.46},
doi = {10.1109/ICDM.2015.46},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/BallardKPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/SimpsonSM15,
author = {Olivia Simpson and
C. Seshadhri and
Andrew McGregor},
editor = {Charu C. Aggarwal and
Zhi{-}Hua Zhou and
Alexander Tuzhilin and
Hui Xiong and
Xindong Wu},
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},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/ICDM.2015.47},
doi = {10.1109/ICDM.2015.47},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/SimpsonSM15.bib},
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},
editor = {Piotr Indyk},
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},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.121},
doi = {10.1137/1.9781611973730.121},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChakrabartyDJS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/www/JhaSP15,
author = {Madhav Jha and
C. Seshadhri and
Ali Pinar},
editor = {Aldo Gangemi and
Stefano Leonardi and
Alessandro Panconesi},
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},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2736277.2741101},
doi = {10.1145/2736277.2741101},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/www/JhaSP15.bib},
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},
editor = {Aldo Gangemi and
Stefano Leonardi and
Alessandro Panconesi},
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},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2736277.2741640},
doi = {10.1145/2736277.2741640},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/www/SariyuceSPC15.bib},
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},
editor = {Coral Calero and
Mario Piattini},
title = {Sublinear Algorithms for Extreme-Scale Data Analysis},
booktitle = {Green in Software Engineering},
pages = {39--54},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-44900-4\_3},
doi = {10.1007/978-3-662-44900-4\_3},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/p/SeshadhriPTB15.bib},
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},
eprinttype = {arXiv},
eprint = {1505.01927},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Seshadhri15.bib},
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},
eprinttype = {arXiv},
eprint = {1506.02574},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SimpsonSM15.bib},
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},
eprinttype = {arXiv},
eprint = {1506.03872},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BallardPKS15.bib},
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},
eprinttype = {arXiv},
eprint = {1506.08258},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BennettBCSPS15.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/SeshadhriV14.bib},
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 = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CzumajGRSSS14.bib},
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 = {Stat. Anal. Data Min.},
volume = {7},
number = {4},
pages = {294--307},
year = {2014},
url = {https://doi.org/10.1002/sam.11224},
doi = {10.1002/SAM.11224},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sadm/SeshadhriPK14.bib},
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, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ClarksonMS14.bib},
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. Sci. Comput.},
volume = {36},
number = {5},
year = {2014},
url = {https://doi.org/10.1137/130914218},
doi = {10.1137/130914218},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/KoldaPPS14.bib},
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. Sci. Comput.},
volume = {36},
number = {5},
year = {2014},
url = {https://doi.org/10.1137/13090729X},
doi = {10.1137/13090729X},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamsc/KoldaPPST14.bib},
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 Comput.},
volume = {10},
pages = {453--464},
year = {2014},
url = {https://doi.org/10.4086/toc.2014.v010a017},
doi = {10.4086/TOC.2014.V010A017},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/ChakrabartyS14.bib},
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},
editor = {Moni Naor},
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},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554819},
doi = {10.1145/2554797.2554819},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BerryFNPSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuptaRS14,
author = {Rishi Gupta and
Tim Roughgarden and
C. Seshadhri},
editor = {Moni Naor},
title = {Decompositions of triangle-dense graphs},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {471--482},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554840},
doi = {10.1145/2554797.2554840},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GuptaRS14.bib},
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},
editor = {Sofus A. Macskassy and
Claudia Perlich and
Jure Leskovec and
Wei Wang and
Rayid Ghani},
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},
publisher = {{ACM}},
year = {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/conf/kdd/LofgrenBGC14.bib},
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},
eprinttype = {arXiv},
eprint = {1404.0718},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChakrabartyDJS14.bib},
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},
eprinttype = {arXiv},
eprint = {1404.3181},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/LofgrenBGS14.bib},
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},
eprinttype = {arXiv},
eprint = {1407.1116},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BerryFNPSW14.bib},
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 R. 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},
eprinttype = {arXiv},
eprint = {1409.4360},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SeshadhriSVMA14.bib},
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},
eprinttype = {arXiv},
eprint = {1411.2689},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RaichelS14.bib},
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},
eprinttype = {arXiv},
eprint = {1411.3312},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SariyuceSPC14.bib},
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},
eprinttype = {arXiv},
eprint = {1411.4942},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JhaSP14.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-042}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/042},
eprinttype = {ECCC},
eprint = {TR14-042},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyDJS14.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SeshadhriPK13.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SaxenaS13.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KalePS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChakrabartyS13,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
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},
series = {Lecture Notes in Computer Science},
volume = {8096},
pages = {425--435},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6\_30},
doi = {10.1007/978-3-642-40328-6\_30},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChakrabartyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/JhaSP13,
author = {Madhav Jha and
C. Seshadhri and
Ali Pinar},
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 = {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},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2487575.2487678},
doi = {10.1145/2487575.2487678},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/JhaSP13.bib},
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},
editor = {Berk Geveci and
Hanspeter Pfister and
Venkatram Vishwanath},
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},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/LDAV.2013.6675161},
doi = {10.1109/LDAV.2013.6675161},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ldav/ThompsonBSP13.bib},
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},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/NSW.2013.6609190},
doi = {10.1109/NSW.2013.6609190},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nsw/DurakKPS13.bib},
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},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611972832.2},
doi = {10.1137/1.9781611972832.2},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sdm/KoldaPS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SaksS13,
author = {Michael E. Saks and
C. Seshadhri},
editor = {Sanjeev Khanna},
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},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.122},
doi = {10.1137/1.9781611973105.122},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/SaksS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyS13,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
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},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488660},
doi = {10.1145/2488608.2488660},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChakrabartyS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyS13a,
author = {Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
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},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488661},
doi = {10.1145/2488608.2488661},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChakrabartyS13a.bib},
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},
eprinttype = {arXiv},
eprint = {1301.5887},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-5887.bib},
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},
eprinttype = {arXiv},
eprint = {1302.4536},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-4536.bib},
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},
eprinttype = {arXiv},
eprint = {1302.6220},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6220.bib},
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},
eprinttype = {arXiv},
eprint = {1302.6636},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6636.bib},
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},
eprinttype = {arXiv},
eprint = {1304.5264},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5264.bib},
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},
eprinttype = {arXiv},
eprint = {1308.0626},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SaksS13.bib},
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},
eprinttype = {arXiv},
eprint = {1309.3321},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SeshadhriPK13.bib},
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},
eprinttype = {arXiv},
eprint = {1309.7440},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuptaRS13.bib},
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},
eprinttype = {arXiv},
eprint = {1310.7665},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JhaSP13.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-029}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/029},
eprinttype = {ECCC},
eprint = {TR13-029},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS13.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-062}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/062},
eprinttype = {ECCC},
eprint = {TR13-062},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS13a.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SaxenaS12.bib},
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},
editor = {Xue{-}wen Chen and
Guy Lebanon and
Haixun Wang and
Mohammed J. Zaki},
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},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2396761.2398503},
doi = {10.1145/2396761.2398503},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/DurakPKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ClarksonMS12,
author = {Kenneth L. Clarkson and
Wolfgang Mulzer and
C. Seshadhri},
editor = {Tamal K. Dey and
Sue Whitesides},
title = {Self-improving algorithms for coordinate-wise maxima},
booktitle = {Proceedings of the 28th {ACM} Symposium on Computational Geometry,
Chapel Hill, NC, USA, June 17-20, 2012},
pages = {277--286},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2261250.2261291},
doi = {10.1145/2261250.2261291},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ClarksonMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/kdd/GleichS12,
author = {David F. Gleich and
C. Seshadhri},
editor = {Qiang Yang and
Deepak Agarwal and
Jian Pei},
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},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2339530.2339628},
doi = {10.1145/2339530.2339628},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/kdd/GleichS12.bib},
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},
publisher = {{SIAM} / Omnipress},
year = {2012},
url = {https://doi.org/10.1137/1.9781611972825.92},
doi = {10.1137/1.9781611972825.92},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sdm/SeshadhriPK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waw/RayPS12,
author = {Jaideep Ray and
Ali Pinar and
C. Seshadhri},
editor = {Anthony Bonato and
Jeannette C. M. Janssen},
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},
series = {Lecture Notes in Computer Science},
volume = {7323},
pages = {153--164},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30541-2\_12},
doi = {10.1007/978-3-642-30541-2\_12},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waw/RayPS12.bib},
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},
eprinttype = {arXiv},
eprint = {1202.3473},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-3473.bib},
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},
eprinttype = {arXiv},
eprint = {1202.5230},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-5230.bib},
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},
eprinttype = {arXiv},
eprint = {1204.0824},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-0824.bib},
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},
eprinttype = {arXiv},
eprint = {1204.0849},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-0849.bib},
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},
eprinttype = {arXiv},
eprint = {1204.1098},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-1098.bib},
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},
eprinttype = {arXiv},
eprint = {1207.7125},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-7125.bib},
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},
eprinttype = {arXiv},
eprint = {1210.5288},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-5288.bib},
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},
eprinttype = {arXiv},
eprint = {1210.8184},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-8184.bib},
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},
eprinttype = {arXiv},
eprint = {1211.0952},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-0952.bib},
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},
eprinttype = {arXiv},
eprint = {1212.2264},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-2264.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-030}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/030},
eprinttype = {ECCC},
eprint = {TR12-030},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabartyS12.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-035}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/035},
eprinttype = {ECCC},
eprint = {TR12-035},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/CzumajGRSSS12.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChazelleS11.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SaxenaS11.bib},
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, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AilonCCLMS11.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KaleS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/SeshadhriPK11,
author = {C. Seshadhri and
Ali Pinar and
Tamara G. Kolda},
editor = {Diane J. Cook and
Jian Pei and
Wei Wang and
Osmar R. Za{\"{\i}}ane and
Xindong Wu},
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},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/ICDM.2011.23},
doi = {10.1109/ICDM.2011.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/SeshadhriPK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/SeshadhriV11,
author = {C. Seshadhri and
Jan Vondr{\'{a}}k},
editor = {Bernard Chazelle},
title = {Is Submodularity Testable?},
booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University,
Beijing, China, January 7-9, 2011. Proceedings},
pages = {195--210},
publisher = {Tsinghua University Press},
year = {2011},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/21.html},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/SeshadhriV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KaleS11,
author = {Satyen Kale and
C. Seshadhri},
editor = {Bernard Chazelle},
title = {Combinatorial Approximation Algorithms for MaxCut using Random Walks},
booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University,
Beijing, China, January 7-9, 2011. Proceedings},
pages = {367--388},
publisher = {Tsinghua University Press},
year = {2011},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/20.html},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/KaleS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SaxenaS11,
author = {Nitin Saxena and
C. Seshadhri},
editor = {Lance Fortnow and
Salil P. Vadhan},
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},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993694},
doi = {10.1145/1993636.1993694},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SaxenaS11.bib},
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},
eprinttype = {arXiv},
eprint = {1102.5046},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-5046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1107-3792,
author = {C. Seshadhri and
Yevgeniy Vorobeychik and
Jackson R. 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},
eprinttype = {arXiv},
eprint = {1107.3792},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1107-3792.bib},
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},
eprinttype = {arXiv},
eprint = {1110.4925},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-4925.bib},
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},
eprinttype = {arXiv},
eprint = {1112.0031},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-0031.bib},
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},
eprinttype = {arXiv},
eprint = {1112.3644},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-3644.bib},
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 = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SaksS10.bib},
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},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.9},
doi = {10.1109/FOCS.2010.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SaxenaS10.bib},
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},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.51},
doi = {10.1109/FOCS.2010.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SaksS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ClarksonMS10,
author = {Kenneth L. Clarkson and
Wolfgang Mulzer and
C. Seshadhri},
editor = {Moses Charikar},
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},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.126},
doi = {10.1137/1.9781611973075.126},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ClarksonMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/propertytesting/SaksS10,
author = {Michael E. Saks and
C. Seshadhri},
editor = {Oded Goldreich},
title = {Local Property Reconstruction and Monotonicity},
booktitle = {Property Testing - Current Research and Surveys},
series = {Lecture Notes in Computer Science},
volume = {6390},
pages = {346--354},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16367-8\_29},
doi = {10.1007/978-3-642-16367-8\_29},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/propertytesting/SaksS10.bib},
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},
eprinttype = {arXiv},
eprint = {1002.0145},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-0145.bib},
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},
eprinttype = {arXiv},
eprint = {1007.4230},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1007-4230.bib},
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},
eprinttype = {arXiv},
eprint = {1008.0831},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-0831.bib},
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},
eprinttype = {arXiv},
eprint = {1008.3938},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-3938.bib},
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},
eprinttype = {arXiv},
eprint = {1011.3234},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-3234.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-013}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/013},
eprinttype = {ECCC},
eprint = {TR10-013},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SaxenaS10.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-167}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/167},
eprinttype = {ECCC},
eprint = {TR10-167},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SaxenaS10a.bib},
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},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.20},
doi = {10.1109/CCC.2009.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/SaxenaS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/HazanS09,
author = {Elad Hazan and
C. Seshadhri},
editor = {Andrea Pohoreckyj Danyluk and
L{\'{e}}on Bottou and
Michael L. Littman},
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},
series = {{ACM} International Conference Proceeding Series},
volume = {382},
pages = {393--400},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1553374.1553425},
doi = {10.1145/1553374.1553425},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/HazanS09.bib},
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},
eprinttype = {arXiv},
eprint = {0906.5010},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0906-5010.bib},
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},
eprinttype = {arXiv},
eprint = {0907.0884},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-0884.bib},
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/journals/algorithmica/AilonCCL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ClarksonS08,
author = {Kenneth L. Clarkson and
C. Seshadhri},
editor = {Monique Teillaud},
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},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1377676.1377700},
doi = {10.1145/1377676.1377700},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ClarksonS08.bib},
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},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.65},
doi = {10.1109/FOCS.2008.65},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KalePS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KaleS08,
author = {Satyen Kale and
C. Seshadhri},
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 = {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},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {527--538},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_43},
doi = {10.1007/978-3-540-70575-8\_43},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KaleS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SaksS08,
author = {Michael E. Saks and
C. Seshadhri},
editor = {Shang{-}Hua Teng},
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},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347187},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/SaksS08.bib},
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},
eprinttype = {arXiv},
eprint = {0811.3161},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-3161.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-108}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-108/index.html},
eprinttype = {ECCC},
eprint = {TR08-108},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SaxenaS08.bib},
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. Informaticae},
volume = {77},
number = {1-2},
pages = {175--185},
year = {2007},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi77-1-2-07},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/ComandurSB07.bib},
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/journals/rsa/AilonCCL07.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-088}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-088/index.html},
eprinttype = {ECCC},
eprint = {TR07-088},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HazanS07.bib},
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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-076}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-076/index.html},
eprinttype = {ECCC},
eprint = {TR07-076},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KaleS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/ChazelleS06,
author = {Bernard Chazelle and
C. Seshadhri},
editor = {Nina Amenta and
Otfried Cheong},
title = {Online geometric reconstruction},
booktitle = {Proceedings of the 22nd {ACM} Symposium on Computational Geometry,
Sedona, Arizona, USA, June 5-7, 2006},
pages = {386--394},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1137856.1137912},
doi = {10.1145/1137856.1137912},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/ChazelleS06.bib},
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},
publisher = {{ACM} Press},
year = {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/conf/soda/AilonCCL06.bib},
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},
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/conf/asm/ComandurSB05.bib},
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},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
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},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {229--236},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_21},
doi = {10.1007/978-3-540-27821-4\_21},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AilonCCL04.bib},
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},
editor = {Rudolf Fleischer and
Gerhard Trippen},
title = {Property-Preserving Data Reconstruction},
booktitle = {Algorithms and Computation, 15th International Symposium, {ISAAC}
2004, Hong Kong, China, December 20-22, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3341},
pages = {16--27},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30551-4\_4},
doi = {10.1007/978-3-540-30551-4\_4},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/AilonCCL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-01-17 05:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
