Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Ravi Kannan
@inproceedings{DBLP:conf/innovations/DeyKRS23,
author = {Papri Dey and
Ravi Kannan and
Nick Ryder and
Nikhil Srivastava},
editor = {Yael Tauman Kalai},
title = {Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {42:1--42:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.42},
doi = {10.4230/LIPICS.ITCS.2023.42},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DeyKRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-11371,
author = {Chiranjib Bhattacharyya and
Ravindran Kannan and
Amit Kumar},
title = {Random Separating Hyperplane Theorem and Learning Polytopes},
journal = {CoRR},
volume = {abs/2307.11371},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.11371},
doi = {10.48550/ARXIV.2307.11371},
eprinttype = {arXiv},
eprint = {2307.11371},
timestamp = {Wed, 26 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-11371.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattacharyyaKK22,
author = {Chiranjib Bhattacharyya and
Ravindran Kannan and
Amit Kumar},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {How many Clusters? - An algorithmic answer},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2607--2640},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.102},
doi = {10.1137/1.9781611977073.102},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/BhattacharyyaKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcde/KannanSPZWB21,
author = {Ravindran Kannan and
Narender Singh and
Andrzej Przekwas and
Xianlian Zhou and
Ross Walenga and
Andrew Babiskin},
title = {A quasi-3D model of the whole lung: airway extension to the tracheobronchial
limit using the constrained constructive optimization and alveolar
modeling, using a sac-trumpet model},
journal = {J. Comput. Des. Eng.},
volume = {8},
number = {2},
pages = {691--704},
year = {2021},
url = {https://doi.org/10.1093/jcde/qwab008},
doi = {10.1093/JCDE/QWAB008},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcde/KannanSPZWB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iclr/BakshiBKWZ21,
author = {Ainesh Bakshi and
Chiranjib Bhattacharyya and
Ravi Kannan and
David P. Woodruff and
Samson Zhou},
title = {Learning a Latent Simplex in Input Sparsity Time},
booktitle = {9th International Conference on Learning Representations, {ICLR} 2021,
Virtual Event, Austria, May 3-7, 2021},
publisher = {OpenReview.net},
year = {2021},
url = {https://openreview.net/forum?id=04LZCAxMSco},
timestamp = {Wed, 23 Jun 2021 17:36:39 +0200},
biburl = {https://dblp.org/rec/conf/iclr/BakshiBKWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BhattacharyyaK021,
author = {Chiranjib Bhattacharyya and
Ravindran Kannan and
Amit Kumar},
editor = {Marina Meila and
Tong Zhang},
title = {Finding k in Latent k- polytope},
booktitle = {Proceedings of the 38th International Conference on Machine Learning,
{ICML} 2021, 18-24 July 2021, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {139},
pages = {894--903},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v139/bhattacharyya21a.html},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/BhattacharyyaK021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-08005,
author = {Ainesh Bakshi and
Chiranjib Bhattacharyya and
Ravi Kannan and
David P. Woodruff and
Samson Zhou},
title = {Learning a Latent Simplex in Input-Sparsity Time},
journal = {CoRR},
volume = {abs/2105.08005},
year = {2021},
url = {https://arxiv.org/abs/2105.08005},
eprinttype = {arXiv},
eprint = {2105.08005},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-08005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-13956,
author = {Papri Dey and
Ravi Kannan and
Nick Ryder and
Nikhil Srivastava},
title = {Bit Complexity of Jordan Normal Form and Spectral Factorization},
journal = {CoRR},
volume = {abs/2109.13956},
year = {2021},
url = {https://arxiv.org/abs/2109.13956},
eprinttype = {arXiv},
eprint = {2109.13956},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-13956.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BhattacharyyaK20,
author = {Chiranjib Bhattacharyya and
Ravindran Kannan},
title = {Near-optimal sample complexity bounds for learning Latent k-polytopes
and applications to Ad-Mixtures},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {854--863},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/bhattacharyya20b.html},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/BhattacharyyaK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BhattacharyyaK20,
author = {Chiranjib Bhattacharyya and
Ravindran Kannan},
editor = {Shuchi Chawla},
title = {Finding a latent \emph{k}-simplex in \emph{O}* (\emph{k} {\(\cdot\)}
nnz(data)) time via Subset Smoothing},
booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
pages = {122--140},
publisher = {{SIAM}},
year = {2020},
url = {https://doi.org/10.1137/1.9781611975994.8},
doi = {10.1137/1.9781611975994.8},
timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
biburl = {https://dblp.org/rec/conf/soda/BhattacharyyaK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-04388,
author = {Chiranjib Bhattacharyya and
Ravindran Kannan and
Amit Kumar},
title = {Algorithms for finding k in k-means},
journal = {CoRR},
volume = {abs/2012.04388},
year = {2020},
url = {https://arxiv.org/abs/2012.04388},
eprinttype = {arXiv},
eprint = {2012.04388},
timestamp = {Wed, 09 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-04388.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-06738,
author = {Chiranjib Bhattacharyya and
Ravindran Kannan},
title = {Finding a latent k-simplex in O(k . nnz(data)) time via Subset Smoothing},
journal = {CoRR},
volume = {abs/1904.06738},
year = {2019},
url = {http://arxiv.org/abs/1904.06738},
eprinttype = {arXiv},
eprint = {1904.06738},
timestamp = {Thu, 25 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-06738.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/actanum/KannanV17,
author = {Ravindran Kannan and
Santosh S. Vempala},
title = {Randomized algorithms in numerical linear algebra},
journal = {Acta Numer.},
volume = {26},
pages = {95--135},
year = {2017},
url = {https://doi.org/10.1017/S0962492917000058},
doi = {10.1017/S0962492917000058},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actanum/KannanV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KannanV17,
author = {Ravindran Kannan and
Santosh S. Vempala},
editor = {Satyen Kale and
Ohad Shamir},
title = {The Hidden Hubs Problem},
booktitle = {Proceedings of the 30th Conference on Learning Theory, {COLT} 2017,
Amsterdam, The Netherlands, 7-10 July 2017},
series = {Proceedings of Machine Learning Research},
volume = {65},
pages = {1190--1213},
publisher = {{PMLR}},
year = {2017},
url = {http://proceedings.mlr.press/v65/kannan17a.html},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KannanV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AroraGKM16,
author = {Sanjeev Arora and
Rong Ge and
Ravi Kannan and
Ankur Moitra},
title = {Computing a Nonnegative Matrix Factorization - Provably},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {4},
pages = {1582--1611},
year = {2016},
url = {https://doi.org/10.1137/130913869},
doi = {10.1137/130913869},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AroraGKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/BhattacharyaGKP16,
author = {Chiranjib Bhattacharyya and
Navin Goyal and
Ravindran Kannan and
Jagdeep Pani},
editor = {Maria{-}Florina Balcan and
Kilian Q. Weinberger},
title = {Non-negative Matrix Factorization under Heavy Noise},
booktitle = {Proceedings of the 33nd International Conference on Machine Learning,
{ICML} 2016, New York City, NY, USA, June 19-24, 2016},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {48},
pages = {1426--1434},
publisher = {JMLR.org},
year = {2016},
url = {http://proceedings.mlr.press/v48/bhattacharya16.html},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/conf/icml/BhattacharyaGKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KannanV16,
author = {Ravi Kannan and
Santosh S. Vempala},
title = {Beyond Spectral: Tight Bounds for Planted Gaussians},
journal = {CoRR},
volume = {abs/1608.03643},
year = {2016},
url = {http://arxiv.org/abs/1608.03643},
eprinttype = {arXiv},
eprint = {1608.03643},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KannanV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/shonan-reports/KannanMW16,
author = {Ravindran Kannan and
Michael W. Mahoney and
David P. Woodruff},
title = {Recent Advances in Randomized Numerical Linear Algebra {(NII} Shonan
Meeting 2016-10)},
journal = {{NII} Shonan Meet. Rep.},
volume = {2016},
year = {2016},
url = {https://shonan.nii.ac.jp/seminars/080/},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/shonan-reports/KannanMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/GargK15,
author = {Jugal Garg and
Ravi Kannan},
editor = {Tim Roughgarden and
Michal Feldman and
Michael Schwarz},
title = {Markets with Production: {A} Polynomial Time Algorithm and a Reduction
to Pure Exchange},
booktitle = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation,
{EC} '15, Portland, OR, USA, June 15-19, 2015},
pages = {733--749},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2764468.2764517},
doi = {10.1145/2764468.2764517},
timestamp = {Fri, 02 Jun 2023 16:54:30 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/GargK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/EDKS14,
author = {Martin E. Dyer and
Ravi Kannan and
Leen Stougie},
title = {A simple randomised algorithm for convex optimisation - Application
to two-stage stochastic programming},
journal = {Math. Program.},
volume = {147},
number = {1-2},
pages = {207--229},
year = {2014},
url = {https://doi.org/10.1007/s10107-013-0718-0},
doi = {10.1007/S10107-013-0718-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/EDKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Kannan14,
author = {Ravindran Kannan},
title = {14th Knuth prize: call for nominations},
journal = {{SIGACT} News},
volume = {45},
number = {1},
pages = {7--8},
year = {2014},
url = {https://doi.org/10.1145/2596583.2596585},
doi = {10.1145/2596583.2596585},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Kannan14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KannanVW14,
author = {Ravi Kannan and
Santosh S. Vempala and
David P. Woodruff},
editor = {Maria{-}Florina Balcan and
Vitaly Feldman and
Csaba Szepesv{\'{a}}ri},
title = {Principal Component Analysis and Higher Correlations for Distributed
Data},
booktitle = {Proceedings of The 27th Conference on Learning Theory, {COLT} 2014,
Barcelona, Spain, June 13-15, 2014},
series = {{JMLR} Workshop and Conference Proceedings},
volume = {35},
pages = {1040--1057},
publisher = {JMLR.org},
year = {2014},
url = {http://proceedings.mlr.press/v35/kannan14.html},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KannanVW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbdullahAKK14,
author = {Amirali Abdullah and
Alexandr Andoni and
Ravindran Kannan and
Robert Krauthgamer},
title = {Spectral Approaches to Nearest Neighbor Search},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {581--590},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.68},
doi = {10.1109/FOCS.2014.68},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AbdullahAKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BansalBK14,
author = {Trapit Bansal and
Chiranjib Bhattacharyya and
Ravindran Kannan},
editor = {Zoubin Ghahramani and
Max Welling and
Corinna Cortes and
Neil D. Lawrence and
Kilian Q. Weinberger},
title = {A provable SVD-based algorithm for learning topics in dominant admixture
corpus},
booktitle = {Advances in Neural Information Processing Systems 27: Annual Conference
on Neural Information Processing Systems 2014, December 8-13 2014,
Montreal, Quebec, Canada},
pages = {1997--2005},
year = {2014},
url = {https://proceedings.neurips.cc/paper/2014/hash/b1563a78ec59337587f6ab6397699afc-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/BansalBK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AbdullahAKK14,
author = {Amirali Abdullah and
Alexandr Andoni and
Ravindran Kannan and
Robert Krauthgamer},
title = {Spectral Approaches to Nearest Neighbor Search},
journal = {CoRR},
volume = {abs/1408.0751},
year = {2014},
url = {http://arxiv.org/abs/1408.0751},
eprinttype = {arXiv},
eprint = {1408.0751},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AbdullahAKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BansalBK14,
author = {Trapit Bansal and
Chiranjib Bhattacharyya and
Ravindran Kannan},
title = {A provable SVD-based algorithm for learning topics in dominant admixture
corpus},
journal = {CoRR},
volume = {abs/1410.6991},
year = {2014},
url = {http://arxiv.org/abs/1410.6991},
eprinttype = {arXiv},
eprint = {1410.6991},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BansalBK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-3162,
author = {Ravindran Kannan and
Santosh S. Vempala},
title = {Nimble Algorithms for Cloud Computing},
journal = {CoRR},
volume = {abs/1304.3162},
year = {2013},
url = {http://arxiv.org/abs/1304.3162},
eprinttype = {arXiv},
eprint = {1304.3162},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-3162.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KannanN12,
author = {Ravindran Kannan and
Hariharan Narayanan},
title = {Random Walks on Polytopes and an Affine Interior Point Method for
Linear Programming},
journal = {Math. Oper. Res.},
volume = {37},
number = {1},
pages = {1--20},
year = {2012},
url = {https://doi.org/10.1287/moor.1110.0519},
doi = {10.1287/MOOR.1110.0519},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/KannanN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DeshpandeKS12,
author = {Amit Deshpande and
Ravindran Kannan and
Nikhil Srivastava},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Zero-One Rounding of Singular Vectors},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {278--289},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_24},
doi = {10.1007/978-3-642-31594-7\_24},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DeshpandeKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraGKM12,
author = {Sanjeev Arora and
Rong Ge and
Ravindran Kannan and
Ankur Moitra},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Computing a nonnegative matrix factorization - provably},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {145--162},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2213994},
doi = {10.1145/2213977.2213994},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AroraGKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigarch/Kannan11,
author = {Ravi Kannan},
title = {Algorithms: Recent Highlights and Challenges},
journal = {{SIGARCH} Comput. Archit. News},
volume = {39},
number = {3},
year = {2011},
url = {https://doi.org/10.1145/2024723.2019526},
doi = {10.1145/2024723.2019526},
timestamp = {Thu, 30 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigarch/Kannan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0952,
author = {Sanjeev Arora and
Rong Ge and
Ravi Kannan and
Ankur Moitra},
title = {Computing a Nonnegative Matrix Factorization -- Provably},
journal = {CoRR},
volume = {abs/1111.0952},
year = {2011},
url = {http://arxiv.org/abs/1111.0952},
eprinttype = {arXiv},
eprint = {1111.0952},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0952.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KumarK10,
author = {Amit Kumar and
Ravindran Kannan},
title = {Clustering with Spectral Norm and the k-Means Algorithm},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {299--308},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.35},
doi = {10.1109/FOCS.2010.35},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KumarK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kannan10,
author = {Ravindran Kannan},
editor = {Leonard J. Schulman},
title = {Spectral methods for matrices and tensors},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {1--12},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806691},
doi = {10.1145/1806689.1806691},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kannan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-1253,
author = {Ravindran Kannan},
title = {Spectral Methods for Matrices and Tensors},
journal = {CoRR},
volume = {abs/1004.1253},
year = {2010},
url = {http://arxiv.org/abs/1004.1253},
eprinttype = {arXiv},
eprint = {1004.1253},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-1253.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-1823,
author = {Amit Kumar and
Ravindran Kannan},
title = {Clustering with Spectral Norm and the k-means Algorithm},
journal = {CoRR},
volume = {abs/1004.1823},
year = {2010},
url = {http://arxiv.org/abs/1004.1823},
eprinttype = {arXiv},
eprint = {1004.1823},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-1823.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/KannanV09,
author = {Ravi Kannan and
Santosh S. Vempala},
title = {Spectral Algorithms},
journal = {Found. Trends Theor. Comput. Sci.},
volume = {4},
number = {3-4},
pages = {157--288},
year = {2009},
url = {https://doi.org/10.1561/0400000025},
doi = {10.1561/0400000025},
timestamp = {Thu, 20 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fttcs/KannanV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/KannanR09,
author = {Ravi Kannan and
Luis Rademacher},
title = {Optimization of a convex program with a polynomial perturbation},
journal = {Oper. Res. Lett.},
volume = {37},
number = {6},
pages = {384--386},
year = {2009},
url = {https://doi.org/10.1016/j.orl.2009.07.002},
doi = {10.1016/J.ORL.2009.07.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/KannanR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChangK09,
author = {Kevin L. Chang and
Ravi Kannan},
title = {Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {3},
pages = {783--812},
year = {2009},
url = {https://doi.org/10.1137/060678890},
doi = {10.1137/060678890},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChangK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/AggarwalDK09,
author = {Ankit Aggarwal and
Amit Deshpande and
Ravi Kannan},
editor = {Irit Dinur and
Klaus Jansen and
Joseph Naor and
Jos{\'{e}} D. P. Rolim},
title = {Adaptive Sampling for k-Means Clustering},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 12th International Workshop, {APPROX} 2009, and 13th
International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5687},
pages = {15--28},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03685-9\_2},
doi = {10.1007/978-3-642-03685-9\_2},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/AggarwalDK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eacl/MukherjeeCK09,
author = {Animesh Mukherjee and
Monojit Choudhury and
Ravi Kannan},
editor = {Alex Lascarides and
Claire Gardent and
Joakim Nivre},
title = {Discovering Global Patterns in Linguistic Networks through Spectral
Analysis: {A} Case Study of the Consonant Inventories},
booktitle = {{EACL} 2009, 12th Conference of the European Chapter of the Association
for Computational Linguistics, Proceedings of the Conference, Athens,
Greece, March 30 - April 3, 2009},
pages = {585--593},
publisher = {The Association for Computer Linguistics},
year = {2009},
url = {https://aclanthology.org/E09-1067/},
timestamp = {Fri, 06 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eacl/MukherjeeCK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kannan09,
author = {Ravindran Kannan},
title = {A New Probability Inequality Using Typical Moments and Concentration
Results},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {211--220},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.20},
doi = {10.1109/FOCS.2009.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kannan09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KannanK09,
author = {Ravi Kannan and
K. Narayan Kumar},
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {Preface -- {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science {(2009)}},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},
series = {LIPIcs},
volume = {4},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2341},
doi = {10.4230/LIPICS.FSTTCS.2009.2341},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/KannanK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KannanN09,
author = {Ravi Kannan and
Hariharan Narayanan},
editor = {Michael Mitzenmacher},
title = {Random walks on polytopes and an affine interior point method for
linear programming},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {561--570},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536491},
doi = {10.1145/1536414.1536491},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KannanN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/waoa/SarmaDK09,
author = {Atish Das Sarma and
Amit Deshpande and
Ravi Kannan},
editor = {Evripidis Bampis and
Klaus Jansen},
title = {Finding Dense Subgraphs in \emph{G}(\emph{n}, 1/2)},
booktitle = {Approximation and Online Algorithms, 7th International Workshop, {WAOA}
2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5893},
pages = {98--103},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-12450-1\_9},
doi = {10.1007/978-3-642-12450-1\_9},
timestamp = {Thu, 23 Sep 2021 11:48:40 +0200},
biburl = {https://dblp.org/rec/conf/waoa/SarmaDK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2009,
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},
series = {LIPIcs},
volume = {4},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
isbn = {978-3-939897-13-2},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0901-2216,
author = {Animesh Mukherjee and
Monojit Choudhury and
Ravi Kannan},
title = {Discovering Global Patterns in Linguistic Networks through Spectral
Analysis: {A} Case Study of the Consonant Inventories},
journal = {CoRR},
volume = {abs/0901.2216},
year = {2009},
url = {http://arxiv.org/abs/0901.2216},
eprinttype = {arXiv},
eprint = {0901.2216},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0901-2216.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DrineasKM08,
author = {Petros Drineas and
Ravi Kannan and
Michael W. Mahoney},
title = {Sampling subproblems of heterogeneous Max-Cut problems and approximation
algorithms},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {307--333},
year = {2008},
url = {https://doi.org/10.1002/rsa.20196},
doi = {10.1002/RSA.20196},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DrineasKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KannanSV08,
author = {Ravindran Kannan and
Hadi Salmasian and
Santosh S. Vempala},
title = {The Spectral Method for General Mixture Models},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {1141--1156},
year = {2008},
url = {https://doi.org/10.1137/S0097539704445925},
doi = {10.1137/S0097539704445925},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KannanSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DevanurK08,
author = {Nikhil R. Devanur and
Ravi Kannan},
title = {Market Equilibria in Polynomial Time for Fixed Number of Goods or
Agents},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {45--53},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.30},
doi = {10.1109/FOCS.2008.30},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DevanurK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FriezeK08,
author = {Alan M. Frieze and
Ravi Kannan},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {A new approach to the planted clique problem},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {187--198},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1752},
doi = {10.4230/LIPICS.FSTTCS.2008.1752},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/FriezeK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0807-5111,
author = {Atish Das Sarma and
Amit Deshpande and
Ravi Kannan},
title = {Finding Dense Subgraphs in G(n,1/2)},
journal = {CoRR},
volume = {abs/0807.5111},
year = {2008},
url = {http://arxiv.org/abs/0807.5111},
eprinttype = {arXiv},
eprint = {0807.5111},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0807-5111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DasguptaHKM07,
author = {Anirban Dasgupta and
John E. Hopcroft and
Ravi Kannan and
Pradipta Prometheus Mitra},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Spectral clustering with limited independence},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1036--1045},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283495},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/DasguptaHKM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KannanT07,
author = {Ravi Kannan and
Thorsten Theobald},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Games of fixed rank: a hierarchy of bimatrix games},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {1124--1132},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283504},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KannanT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KannanLM06,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Ravi Montenegro},
title = {Blocking Conductance and Mixing in Random Walks},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {4},
pages = {541--570},
year = {2006},
url = {https://doi.org/10.1017/S0963548306007504},
doi = {10.1017/S0963548306007504},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KannanLM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DrineasKM06,
author = {Petros Drineas and
Ravi Kannan and
Michael W. Mahoney},
title = {Fast Monte Carlo Algorithms for Matrices {I:} Approximating Matrix
Multiplication},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {1},
pages = {132--157},
year = {2006},
url = {https://doi.org/10.1137/S0097539704442684},
doi = {10.1137/S0097539704442684},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DrineasKM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DrineasKM06a,
author = {Petros Drineas and
Ravi Kannan and
Michael W. Mahoney},
title = {Fast Monte Carlo Algorithms for Matrices {II:} Computing a Low-Rank
Approximation to a Matrix},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {1},
pages = {158--183},
year = {2006},
url = {https://doi.org/10.1137/S0097539704442696},
doi = {10.1137/S0097539704442696},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DrineasKM06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DrineasKM06b,
author = {Petros Drineas and
Ravi Kannan and
Michael W. Mahoney},
title = {Fast Monte Carlo Algorithms for Matrices {III:} Computing a Compressed
Approximate Matrix Decomposition},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {1},
pages = {184--206},
year = {2006},
url = {https://doi.org/10.1137/S0097539704442702},
doi = {10.1137/S0097539704442702},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DrineasKM06b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/ChengKVW06,
author = {David Cheng and
Ravi Kannan and
Santosh S. Vempala and
Grant Wang},
title = {A divide-and-merge methodology for clustering},
journal = {{ACM} Trans. Database Syst.},
volume = {31},
number = {4},
pages = {1499--1525},
year = {2006},
url = {https://doi.org/10.1145/1189769.1189779},
doi = {10.1145/1189769.1189779},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tods/ChengKVW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DasguptaHKM06,
author = {Anirban Dasgupta and
John E. Hopcroft and
Ravi Kannan and
Pradipta Prometheus Mitra},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Spectral Clustering by Recursive Partitioning},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {256--267},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_25},
doi = {10.1007/11841036\_25},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DasguptaHKM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChangK06,
author = {Kevin L. Chang and
Ravi Kannan},
title = {The space complexity of pass-efficient algorithms for clustering},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {1157--1166},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109685},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChangK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/VegaKK06,
author = {Wenceslas Fernandez de la Vega and
Ravi Kannan and
Marek Karpinski},
title = {Approximation of Global {MAX-CSP} Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-124}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-124/index.html},
eprinttype = {ECCC},
eprint = {TR06-124},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/VegaKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/KannanSV05,
author = {Ravindran Kannan and
Hadi Salmasian and
Santosh S. Vempala},
editor = {Peter Auer and
Ron Meir},
title = {The Spectral Method for General Mixture~Models},
booktitle = {Learning Theory, 18th Annual Conference on Learning Theory, {COLT}
2005, Bertinoro, Italy, June 27-30, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3559},
pages = {444--457},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11503415\_30},
doi = {10.1007/11503415\_30},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/KannanSV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/ChengVKW05,
author = {David Cheng and
Santosh S. Vempala and
Ravi Kannan and
Grant Wang},
editor = {Chen Li},
title = {A divide-and-merge methodology for clustering},
booktitle = {Proceedings of the Twenty-fourth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 13-15, 2005, Baltimore, Maryland,
{USA}},
pages = {196--205},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1065167.1065192},
doi = {10.1145/1065167.1065192},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/ChengVKW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DrineasKM05,
author = {Petros Drineas and
Ravi Kannan and
Michael W. Mahoney},
editor = {Volker Diekert and
Bruno Durand},
title = {Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation
Algorithms},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {57--68},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_5},
doi = {10.1007/978-3-540-31856-9\_5},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DrineasKM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/VegaKKV05,
author = {Wenceslas Fernandez de la Vega and
Marek Karpinski and
Ravi Kannan and
Santosh S. Vempala},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Tensor decomposition and approximation schemes for constraint satisfaction
problems},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {747--754},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060701},
doi = {10.1145/1060590.1060701},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/VegaKKV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0511021,
author = {Ravi Kannan and
Thorsten Theobald},
title = {Games of fixed rank: {A} hierarchy of bimatrix games},
journal = {CoRR},
volume = {abs/cs/0511021},
year = {2005},
url = {http://arxiv.org/abs/cs/0511021},
eprinttype = {arXiv},
eprint = {cs/0511021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0511021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KannanVV04,
author = {Ravi Kannan and
Santosh S. Vempala and
Adrian Vetta},
title = {On clusterings: Good, bad and spectral},
journal = {J. {ACM}},
volume = {51},
number = {3},
pages = {497--515},
year = {2004},
url = {https://doi.org/10.1145/990308.990313},
doi = {10.1145/990308.990313},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KannanVV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FriezeKV04,
author = {Alan M. Frieze and
Ravi Kannan and
Santosh S. Vempala},
title = {Fast monte-carlo algorithms for finding low-rank approximations},
journal = {J. {ACM}},
volume = {51},
number = {6},
pages = {1025--1041},
year = {2004},
url = {https://doi.org/10.1145/1039488.1039494},
doi = {10.1145/1039488.1039494},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FriezeKV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/DrineasFKVV04,
author = {Petros Drineas and
Alan M. Frieze and
Ravi Kannan and
Santosh S. Vempala and
V. Vinay},
title = {Clustering Large Graphs via the Singular Value Decomposition},
journal = {Mach. Learn.},
volume = {56},
number = {1-3},
pages = {9--33},
year = {2004},
url = {https://doi.org/10.1023/B:MACH.0000033113.59016.96},
doi = {10.1023/B:MACH.0000033113.59016.96},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ml/DrineasFKVV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-067,
author = {Hadi Salmasian and
Ravindran Kannan and
Santosh S. Vempala},
title = {The Spectral Method for Mixture Models},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-067}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-067/index.html},
eprinttype = {ECCC},
eprint = {TR04-067},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-067.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AlonVKK03,
author = {Noga Alon and
Wenceslas Fernandez de la Vega and
Ravi Kannan and
Marek Karpinski},
title = {Random sampling and approximation of MAX-CSPs},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {2},
pages = {212--243},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00008-4},
doi = {10.1016/S0022-0000(03)00008-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AlonVKK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KannanMM03,
author = {Ravi Kannan and
Michael W. Mahoney and
Ravi Montenegro},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {Rapid Mixing of Several Markov Chains for a Hard-Core Model},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {663--675},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_68},
doi = {10.1007/978-3-540-24587-2\_68},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KannanMM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DrineasK03,
author = {Petros Drineas and
Ravi Kannan},
title = {Pass efficient algorithms for approximating large matrices},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {223--232},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644147},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DrineasK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DantsinGHKKPRS02,
author = {Evgeny Dantsin and
Andreas Goerdt and
Edward A. Hirsch and
Ravi Kannan and
Jon M. Kleinberg and
Christos H. Papadimitriou and
Prabhakar Raghavan and
Uwe Sch{\"{o}}ning},
title = {A deterministic (2-2/(k+1))\({}^{\mbox{n}}\) algorithm for k-SAT based
on local search},
journal = {Theor. Comput. Sci.},
volume = {289},
number = {1},
pages = {69--83},
year = {2002},
url = {https://doi.org/10.1016/S0304-3975(01)00174-8},
doi = {10.1016/S0304-3975(01)00174-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DantsinGHKKPRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonVKK02,
author = {Noga Alon and
Wenceslas Fernandez de la Vega and
Ravi Kannan and
Marek Karpinski},
editor = {John H. Reif},
title = {Random sampling and approximation of {MAX-CSP} problems},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {232--239},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509945},
doi = {10.1145/509907.509945},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlonVKK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DrineasK01,
author = {Petros Drineas and
Ravi Kannan},
title = {Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {452--459},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959921},
doi = {10.1109/SFCS.2001.959921},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DrineasK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SanjeevK01,
author = {Sanjeev Arora and
Ravi Kannan},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Learning mixtures of arbitrary gaussians},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {247--257},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380808},
doi = {10.1145/380752.380808},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SanjeevK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-100,
author = {Noga Alon and
Wenceslas Fernandez de la Vega and
Ravi Kannan and
Marek Karpinski},
title = {Random Sampling and Approximation of {MAX-CSP} Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-100}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-100/index.html},
eprinttype = {ECCC},
eprint = {TR01-100},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-100.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/VempalaV00,
author = {Ravi Kannan and
Santosh S. Vempala and
Adrian Vetta},
title = {On Clusterings - Good, Bad and Spectral},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {367--377},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892125},
doi = {10.1109/SFCS.2000.892125},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/VempalaV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FriezeK99,
author = {Alan M. Frieze and
Ravi Kannan},
title = {Quick Approximation to Matrices and Applications},
journal = {Comb.},
volume = {19},
number = {2},
pages = {175--220},
year = {1999},
url = {https://doi.org/10.1007/s004930050052},
doi = {10.1007/S004930050052},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FriezeK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FriezeK99,
author = {Alan M. Frieze and
Ravi Kannan},
title = {A Simple Algorithm for Constructing Szemere'di's Regularity Partition},
journal = {Electron. J. Comb.},
volume = {6},
year = {1999},
url = {https://doi.org/10.37236/1449},
doi = {10.37236/1449},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FriezeK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KannanTV99,
author = {Ravi Kannan and
Prasad Tetali and
Santosh S. Vempala},
title = {Simple Markov-chain algorithms for generating bipartite graphs and
tournaments},
journal = {Random Struct. Algorithms},
volume = {14},
number = {4},
pages = {293--308},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1098-2418(199907)14:4\&\#60;293::AID-RSA1\&\#62;3.0.CO;2-G},
doi = {10.1002/(SICI)1098-2418(199907)14:4\&\#60;293::AID-RSA1\&\#62;3.0.CO;2-G},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KannanTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DrineasFKVV99,
author = {Petros Drineas and
Alan M. Frieze and
Ravi Kannan and
Santosh S. Vempala and
V. Vinay},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {Clustering in Large Graphs and Matrices},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {291--299},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314576},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/DrineasFKVV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LovaszK99,
author = {L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Ravi Kannan},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Faster Mixing via Average Conductance},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {282--287},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301317},
doi = {10.1145/301250.301317},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LovaszK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlumFKV98,
author = {Avrim Blum and
Alan M. Frieze and
Ravi Kannan and
Santosh S. Vempala},
title = {A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions},
journal = {Algorithmica},
volume = {22},
number = {1/2},
pages = {35--52},
year = {1998},
url = {https://doi.org/10.1007/PL00013833},
doi = {10.1007/PL00013833},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BlumFKV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KannanN98,
author = {Ravi Kannan and
Andreas Nolte},
editor = {Gianfranco Bilardi and
Giuseppe F. Italiano and
Andrea Pietracaprina and
Geppino Pucci},
title = {A Fast Random Greedy Algorithm for the Component Commonality Problem},
booktitle = {Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy,
August 24-26, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1461},
pages = {223--234},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68530-8\_19},
doi = {10.1007/3-540-68530-8\_19},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KannanN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KannanN98,
author = {Ravi Kannan and
Andreas Nolte},
title = {Local Search in Smooth Convex Sets},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {218--226},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743446},
doi = {10.1109/SFCS.1998.743446},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KannanN98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BriedenGKKLS98,
author = {Andreas Brieden and
Peter Gritzmann and
Ravi Kannan and
Victor Klee and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {Approximation of Diameters: Randomization Doesn't Help},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {244--251},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743451},
doi = {10.1109/SFCS.1998.743451},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BriedenGKKLS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FriezeKV98,
author = {Alan M. Frieze and
Ravi Kannan and
Santosh S. Vempala},
title = {Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {370--378},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743487},
doi = {10.1109/SFCS.1998.743487},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FriezeKV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BlumK97,
author = {Avrim Blum and
Ravindran Kannan},
title = {Learning an Intersection of a Constant Number of Halfspaces over a
Uniform Distribution},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {2},
pages = {371--380},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1475},
doi = {10.1006/JCSS.1997.1475},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BlumK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DyerK97,
author = {Martin E. Dyer and
Ravi Kannan},
title = {On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension},
journal = {Math. Oper. Res.},
volume = {22},
number = {3},
pages = {545--549},
year = {1997},
url = {https://doi.org/10.1287/moor.22.3.545},
doi = {10.1287/MOOR.22.3.545},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/DyerK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerKM97,
author = {Martin E. Dyer and
Ravi Kannan and
John Mount},
title = {Sampling contingency tables},
journal = {Random Struct. Algorithms},
volume = {10},
number = {4},
pages = {487--506},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199707)10:4\&\#60;487::AID-RSA4\&\#62;3.0.CO;2-Q},
doi = {10.1002/(SICI)1098-2418(199707)10:4\&\#60;487::AID-RSA4\&\#62;3.0.CO;2-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DyerKM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KannanLS97,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {Random walks and an O\({}^{\mbox{*}}\)(n\({}^{\mbox{5}}\)) volume
algorithm for convex bodies},
journal = {Random Struct. Algorithms},
volume = {11},
number = {1},
pages = {1--50},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199708)11:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-X},
doi = {10.1002/(SICI)1098-2418(199708)11:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-X},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KannanLS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KannanTV97,
author = {Ravi Kannan and
Prasad Tetali and
Santosh S. Vempala},
editor = {Michael E. Saks},
title = {Simple Markov-Chain Algorithms for Generating Bipartite Graphs and
Tournaments (Extended Abstract)},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {193--200},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314256},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KannanTV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KannanV97,
author = {Ravi Kannan and
Santosh S. Vempala},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Sampling Lattice Points},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {696--700},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258665},
doi = {10.1145/258533.258665},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KannanV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FriezeK96,
author = {Alan M. Frieze and
Ravi Kannan},
title = {The Regularity Lemma and Approximation Schemes for Dense Problems},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {12--20},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548459},
doi = {10.1109/SFCS.1996.548459},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FriezeK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KannanL96,
author = {Ravi Kannan and
Guangxing Li},
title = {Sampling According to the Multivariate Normal Density},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {204--212},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548479},
doi = {10.1109/SFCS.1996.548479},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KannanL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlumFKV96,
author = {Avrim Blum and
Alan M. Frieze and
Ravi Kannan and
Santosh S. Vempala},
title = {A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {330--338},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548492},
doi = {10.1109/SFCS.1996.548492},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlumFKV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FriezeJK96,
author = {Alan M. Frieze and
Mark Jerrum and
Ravi Kannan},
title = {Learning Linear Transformations},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {359--368},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548495},
doi = {10.1109/SFCS.1996.548495},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FriezeJK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/KannanLS95,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Mikl{\'{o}}s Simonovits},
title = {Isoperimetric Problems for Convex Bodies and a Localization Lemama},
journal = {Discret. Comput. Geom.},
volume = {13},
pages = {541--559},
year = {1995},
url = {https://doi.org/10.1007/BF02574061},
doi = {10.1007/BF02574061},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/KannanLS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KannanMT95,
author = {Ravi Kannan and
John Mount and
Sridhar R. Tayur},
title = {A Randomized Algorithm to Optimize Over Certain Convex Sets},
journal = {Math. Oper. Res.},
volume = {20},
number = {3},
pages = {529--549},
year = {1995},
url = {https://doi.org/10.1287/moor.20.3.529},
doi = {10.1287/MOOR.20.3.529},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/KannanMT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kannan94,
author = {Ravi Kannan},
title = {Markov Chains and Polynomial Time Algorithms},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {656--671},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365726},
doi = {10.1109/SFCS.1994.365726},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kannan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DyerFKKPV93,
author = {Martin E. Dyer and
Alan M. Frieze and
Ravi Kannan and
Ajai Kapoor and
Ljubomir Perkovic and
Umesh V. Vazirani},
title = {A Mildly Exponential Time Algorithm for Approximating the Number of
Solutions to a Multidimensional Knapsack Problem},
journal = {Comb. Probab. Comput.},
volume = {2},
pages = {271--284},
year = {1993},
url = {https://doi.org/10.1017/S0963548300000675},
doi = {10.1017/S0963548300000675},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DyerFKKPV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KannanVVY93,
author = {Ravi Kannan and
H. Venkateswaran and
V. Vinay and
Andrew Chi{-}Chih Yao},
title = {A Circuit-Based Proof of Toda's Theorem},
journal = {Inf. Comput.},
volume = {104},
number = {2},
pages = {271--276},
year = {1993},
url = {https://doi.org/10.1006/inco.1993.1033},
doi = {10.1006/INCO.1993.1033},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KannanVVY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlumK93,
author = {Avrim Blum and
Ravi Kannan},
title = {Learning an Intersection of k Halfspaces over a Uniform Distribution},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {312--320},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366856},
doi = {10.1109/SFCS.1993.366856},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlumK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Kannan93,
author = {Ravi Kannan},
editor = {Giovanni Rinaldi and
Laurence A. Wolsey},
title = {Optimal solution and value of parametric integer programs},
booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
Conference, Erice, Italy, April 29 - May 1, 1993},
pages = {11--21},
publisher = {{CIACO}},
year = {1993},
timestamp = {Wed, 09 Oct 2002 11:26:33 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Kannan93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CookHKM92,
author = {William J. Cook and
Mark Hartmann and
Ravi Kannan and
Colin McDiarmid},
title = {On integer points in polyhedra},
journal = {Comb.},
volume = {12},
number = {1},
pages = {27--37},
year = {1992},
url = {https://doi.org/10.1007/BF01191202},
doi = {10.1007/BF01191202},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/CookHKM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kannan92,
author = {Ravi Kannan},
title = {Lattice translates of a polytope and the Frobenius problem},
journal = {Comb.},
volume = {12},
number = {2},
pages = {161--177},
year = {1992},
url = {https://doi.org/10.1007/BF01204720},
doi = {10.1007/BF01204720},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Kannan92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ipco/1992,
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/1992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerFK91,
author = {Martin E. Dyer and
Alan M. Frieze and
Ravi Kannan},
title = {A Random Polynomial Time Algorithm for Approximating the Volume of
Convex Bodies},
journal = {J. {ACM}},
volume = {38},
number = {1},
pages = {1--17},
year = {1991},
url = {https://doi.org/10.1145/102782.102783},
doi = {10.1145/102782.102783},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DyerFK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ApplegateK91,
author = {David L. Applegate and
Ravi Kannan},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Sampling and Integration of Near Log-Concave functions},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {156--163},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103439},
doi = {10.1145/103418.103439},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ApplegateK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/KannanLS90,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Herbert E. Scarf},
title = {The Shapes of Polyhedra},
journal = {Math. Oper. Res.},
volume = {15},
number = {2},
pages = {364--380},
year = {1990},
url = {https://doi.org/10.1287/moor.15.2.364},
doi = {10.1287/MOOR.15.2.364},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/KannanLS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/CookKS90,
author = {William J. Cook and
Ravi Kannan and
Alexander Schrijver},
title = {Chv{\'{a}}tal Closures for mixed Integer Programming Problems},
journal = {Math. Program.},
volume = {47},
pages = {155--174},
year = {1990},
url = {https://doi.org/10.1007/BF01580858},
doi = {10.1007/BF01580858},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/CookKS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Kannan90,
author = {Ravi Kannan},
editor = {William J. Cook and
Paul D. Seymour},
title = {Test Sets for Integer Programs, 0{\_} Sentences},
booktitle = {Polyhedral Combinatorics, Proceedings of a {DIMACS} Workshop, Morristown,
New Jersey, USA, June 12-16, 1989},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {1},
pages = {39--48},
publisher = {{DIMACS/AMS}},
year = {1990},
url = {https://doi.org/10.1090/dimacs/001/05},
doi = {10.1090/DIMACS/001/05},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Kannan90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ipco/1990,
editor = {Ravi Kannan and
William R. Pulleyblank},
title = {Proceedings of the 1st Integer Programming and Combinatorial Optimization
Conference, Waterloo, Ontorio, Canada, May 28-30 1990},
publisher = {University of Waterloo Press},
year = {1990},
isbn = {0-88898-099-X},
timestamp = {Wed, 09 Oct 2002 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/1990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GalilKS89,
author = {Zvi Galil and
Ravi Kannan and
Endre Szemer{\'{e}}di},
title = {On 3-pushdown graphs with large separators},
journal = {Comb.},
volume = {9},
number = {1},
pages = {9--19},
year = {1989},
url = {https://doi.org/10.1007/BF02122679},
doi = {10.1007/BF02122679},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GalilKS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GalilKS89,
author = {Zvi Galil and
Ravi Kannan and
Endre Szemer{\'{e}}di},
title = {On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic
One-Tape Turing Machines},
journal = {J. Comput. Syst. Sci.},
volume = {38},
number = {1},
pages = {134--149},
year = {1989},
url = {https://doi.org/10.1016/0022-0000(89)90036-6},
doi = {10.1016/0022-0000(89)90036-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GalilKS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FurstK89,
author = {Merrick L. Furst and
Ravi Kannan},
title = {Succinct Certificates for Almost All Subset Sum Problems},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {3},
pages = {550--558},
year = {1989},
url = {https://doi.org/10.1137/0218037},
doi = {10.1137/0218037},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FurstK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Kannan89,
author = {Ravi Kannan},
editor = {C. E. Veni Madhavan},
title = {The Frobenius Problem},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {405},
pages = {242--251},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-52048-1\_47},
doi = {10.1007/3-540-52048-1\_47},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Kannan89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DyerFK89,
author = {Martin E. Dyer and
Alan M. Frieze and
Ravi Kannan},
editor = {David S. Johnson},
title = {A Random Polynomial Time Algorithm for Approximating the Volume of
Convex Bodies},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {375--381},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73043},
doi = {10.1145/73007.73043},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DyerFK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeHKLS88,
author = {Alan M. Frieze and
Johan H{\aa}stad and
Ravi Kannan and
J. C. Lagarias and
Adi Shamir},
title = {Reconstructing Truncated Integer Variables Satisfying Linear Congruences},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {2},
pages = {262--280},
year = {1988},
url = {https://doi.org/10.1137/0217016},
doi = {10.1137/0217016},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FriezeHKLS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Kannan87,
author = {Ravi Kannan},
title = {Minkowski's Convex Body Theorem and Integer Programming},
journal = {Math. Oper. Res.},
volume = {12},
number = {3},
pages = {415--440},
year = {1987},
url = {https://doi.org/10.1287/moor.12.3.415},
doi = {10.1287/MOOR.12.3.415},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Kannan87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KannanMR87,
author = {Ravindran Kannan and
Gary L. Miller and
Larry Rudolph},
title = {Sublinear Parallel Algorithm for Computing the Greatest Common Divisor
of Two Integers},
journal = {{SIAM} J. Comput.},
volume = {16},
number = {1},
pages = {7--16},
year = {1987},
url = {https://doi.org/10.1137/0216002},
doi = {10.1137/0216002},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KannanMR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/paa/DwyerK87,
author = {Rex A. Dwyer and
Ravi Kannan},
editor = {Andreas Alexander Albrecht and
Hermann Jung and
Kurt Mehlhorn},
title = {Convex Hull of Randomly Chosen Points from {A} Polytope},
booktitle = {Parallel Algorithms and Architectures, International Workshop, Suhl,
GDR, May 25-30, 1987, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {269},
pages = {16--24},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-18099-0\_25},
doi = {10.1007/3-540-18099-0\_25},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/paa/DwyerK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KannanL86,
author = {Ravindran Kannan and
Richard J. Lipton},
title = {Polynomial-time algorithm for the orbit problem},
journal = {J. {ACM}},
volume = {33},
number = {4},
pages = {808--821},
year = {1986},
url = {https://doi.org/10.1145/6490.6496},
doi = {10.1145/6490.6496},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KannanL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KannanL86,
author = {Ravi Kannan and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Kesav V. Nori},
title = {Covering Minima and Lattice Point Free Convex Bodies},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {241},
pages = {193--213},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17179-7\_12},
doi = {10.1007/3-540-17179-7\_12},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/KannanL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Kannan86,
author = {Ravi Kannan},
editor = {Kesav V. Nori},
title = {Basis Reduction and Evidence for Transcendence of Certain Numbers},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {241},
pages = {263--269},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17179-7\_16},
doi = {10.1007/3-540-17179-7\_16},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Kannan86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GalilKS86,
author = {Zvi Galil and
Ravi Kannan and
Endre Szemer{\'{e}}di},
editor = {Juris Hartmanis},
title = {On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic
One-Tape Turing Machines},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {39--49},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12135},
doi = {10.1145/12130.12135},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GalilKS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Kannan85,
author = {Ravi Kannan},
title = {Unraveling k-page graphs},
journal = {Inf. Control.},
volume = {66},
number = {1/2},
pages = {1--5},
year = {1985},
url = {https://doi.org/10.1016/S0019-9958(85)80008-5},
doi = {10.1016/S0019-9958(85)80008-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Kannan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kannan85,
author = {Ravindran Kannan},
title = {Solving Systems of Linear Equations over Polynomials},
journal = {Theor. Comput. Sci.},
volume = {39},
pages = {69--88},
year = {1985},
url = {https://doi.org/10.1016/0304-3975(85)90131-8},
doi = {10.1016/0304-3975(85)90131-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kannan85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Kannan84,
author = {Ravindran Kannan},
title = {Towards Separating Nondeterminism from Determinism},
journal = {Math. Syst. Theory},
volume = {17},
number = {1},
pages = {29--45},
year = {1984},
url = {https://doi.org/10.1007/BF01744432},
doi = {10.1007/BF01744432},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Kannan84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KannanMR84,
author = {Ravindran Kannan and
Gary L. Miller and
Larry Rudolph},
title = {Sublinear Parallel Algorithm for Computing the Greatest Common Divisor
of Two Integers},
booktitle = {25th Annual Symposium on Foundations of Computer Science, West Palm
Beach, Florida, USA, 24-26 October 1984},
pages = {7--11},
publisher = {{IEEE} Computer Society},
year = {1984},
url = {https://doi.org/10.1109/SFCS.1984.715895},
doi = {10.1109/SFCS.1984.715895},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KannanMR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FriezeKL84,
author = {Alan M. Frieze and
Ravi Kannan and
J. C. Lagarias},
title = {Linear Congruential Generators Do Not Produce Random Sequences},
booktitle = {25th Annual Symposium on Foundations of Computer Science, West Palm
Beach, Florida, USA, 24-26 October 1984},
pages = {480--484},
publisher = {{IEEE} Computer Society},
year = {1984},
url = {https://doi.org/10.1109/SFCS.1984.715950},
doi = {10.1109/SFCS.1984.715950},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FriezeKL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KannanLL84,
author = {Ravindran Kannan and
Arjen K. Lenstra and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
editor = {Richard A. DeMillo},
title = {Polynomial Factorization and Nonrandomness of Bits of Algebraic and
Some Transcendental Numbers},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {191--200},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808681},
doi = {10.1145/800057.808681},
timestamp = {Tue, 06 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KannanLL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kannan83,
author = {Ravindran Kannan},
title = {Polynomial-Time Aggregation of Integer Programming Problems},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {133--145},
year = {1983},
url = {https://doi.org/10.1145/322358.322368},
doi = {10.1145/322358.322368},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kannan83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kannan83,
author = {Ravi Kannan},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Improved Algorithms for Integer Programming and Related Lattice Problems},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {193--206},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808749},
doi = {10.1145/800061.808749},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kannan83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kannan83a,
author = {Ravi Kannan},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {Alternation and the Power of Nondeterminism},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {344--346},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808764},
doi = {10.1145/800061.808764},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kannan83a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Kannan82,
author = {Ravi Kannan},
title = {Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets},
journal = {Inf. Control.},
volume = {55},
number = {1-3},
pages = {40--56},
year = {1982},
url = {https://doi.org/10.1016/S0019-9958(82)90382-5},
doi = {10.1016/S0019-9958(82)90382-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Kannan82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/HausmannKK81,
author = {Dirk Hausmann and
Ravindran Kannan and
Bernhard Korte},
title = {Exponential Lower Bounds on a Class of Knapsack Algorithms},
journal = {Math. Oper. Res.},
volume = {6},
number = {2},
pages = {225--232},
year = {1981},
url = {https://doi.org/10.1287/moor.6.2.225},
doi = {10.1287/MOOR.6.2.225},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/HausmannKK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kannan81a,
author = {Ravi Kannan},
title = {Towards Separating Nondeterministic Time from Deterministic Time},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {235--243},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.51},
doi = {10.1109/SFCS.1981.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kannan81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kannan81b,
author = {Ravi Kannan},
title = {A Circuit-Size Lower Bound},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {304--309},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.1},
doi = {10.1109/SFCS.1981.1},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kannan81b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GilesK80,
author = {Rick Giles and
Ravindran Kannan},
title = {A characterization of threshold matroids},
journal = {Discret. Math.},
volume = {30},
number = {2},
pages = {181--184},
year = {1980},
url = {https://doi.org/10.1016/0012-365X(80)90119-3},
doi = {10.1016/0012-365X(80)90119-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GilesK80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kannan80,
author = {Ravindran Kannan},
title = {A Polynomial Algorithm for the Two-Variable Integer Programming Problem},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {118--122},
year = {1980},
url = {https://doi.org/10.1145/322169.322179},
doi = {10.1145/322169.322179},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kannan80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KannanL80,
author = {Ravindran Kannan and
Richard J. Lipton},
editor = {Raymond E. Miller and
Seymour Ginsburg and
Walter A. Burkhard and
Richard J. Lipton},
title = {The Orbit Problem is Decidable},
booktitle = {Proceedings of the 12th Annual {ACM} Symposium on Theory of Computing,
April 28-30, 1980, Los Angeles, California, {USA}},
pages = {252--261},
publisher = {{ACM}},
year = {1980},
url = {https://doi.org/10.1145/800141.804673},
doi = {10.1145/800141.804673},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KannanL80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/KannanB79,
author = {Ravindran Kannan and
Achim Bachem},
title = {Polynomial Algorithms for Computing the Smith and Hermite Normal Forms
of an Integer Matrix},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {4},
pages = {499--507},
year = {1979},
url = {https://doi.org/10.1137/0208040},
doi = {10.1137/0208040},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/KannanB79.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-04-25 02:07 CEST 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:
