Follow
Vladimir Nikishkin
Vladimir Nikishkin
Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh
Verified email at sms.ed.ac.uk
Title
Cited by
Cited by
Year
Testing identity of structured distributions
I Diakonikolas, DM Kane, V Nikishkin
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
1082014
Optimal algorithms and lower bounds for testing closeness of structured distributions
I Diakonikolas, DM Kane, V Nikishkin
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1183-1202, 2015
432015
Near-optimal closeness testing of discrete histogram distributions
I Diakonikolas, DM Kane, V Nikishkin
arXiv preprint arXiv:1703.01913, 2017
252017
Amortized communication complexity of an equality predicate
V Nikishkin
International Computer Science Symposium in Russia, 212-223, 2013
22013
Solving SICP: An Experience Report on Solving the World's Most Famous Programming Problem Set.
V Nikishkin
Scheme@ ICFP, 14-50, 2020
2020
Algorithms and lower bounds for testing properties of structured distributions
V Nikishkin
The University of Edinburgh, 2016
2016
Amortized communication complexity of an equality predicate
V Nikishkin
arXiv preprint arXiv:1212.1941, 2012
2012
Amortized communication complexity of an equality predicate.(Beta version)
V Nikishkin
arXiv preprint arXiv:1212.1941, 2012
2012
The system can't perform the operation now. Try again later.
Articles 1–8