Vladimir Nikishkin

According to our database, Vladimir Nikishkin authored at least 6 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Solving SICP: An Experience Report on Solving the World's Most Famous Programming Problem Set.

Vladimir Nikishkin

Proceedings of the 2020 Scheme and Functional Programming Workshop, 2020

2017

Near-Optimal Closeness Testing of Discrete Histogram Distributions.

Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Algorithms and lower bounds for testing properties of structured distributions.

Vladimir Nikishkin

PhD thesis, 2016

2015

Testing Identity of Structured Distributions.

Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Optimal Algorithms and Lower Bounds for Testing Closeness of Structured Distributions.

Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2013

Amortized Communication Complexity of an Equality Predicate.

Vladimir Nikishkin

Proceedings of the Computer Science - Theory and Applications, 2013