( en | de | ru )

 

Disambiguation of "Vereshchagin, Nikolai K."

Author of the publication

copydeleteadd this publication to your clipboard
High Entropy Random Selection Protocols.

, , , , , and . Algorithmica, 83 (2): 667-694 (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nikolai Roskamm

Nikolai Klein

Nikolai Mette

Nikolai Zerf

Nikolai Wihksninsch

 

Other publications of authors with the same name

A new class of non-Shannon-type inequalities for entropies., , , and . Commun. Inf. Syst., 2 (2): 147-166 (2002)Half-duplex communication complexity with adversary? can be less than the classical communication complexity., and . Electron. Colloquium Comput. Complex., (2023)Logical operations and Kolmogorov complexity., and . Theor. Comput. Sci., 271 (1-2): 125-129 (2002)Arthur-Merlin Games in Boolean Decision Trees., , , and . J. Comput. Syst. Sci., 59 (2): 346-372 (1999)Proofs of conservation inequalities for Levin's notion of mutual information of 1974.. Theor. Comput. Sci., (2021)Variants of Realizability for Propositional Formulas and the Logic of the Weak Law of Excluded Middle., , , and . CSL, volume 2471 of Lecture Notes in Computer Science, page 74-88. Springer, (2002)Inverting Onto Functions and Polynomial Hierarchy., , , , and . CSR, volume 4649 of Lecture Notes in Computer Science, page 92-103. Springer, (2007)Randomised Individual Communication Complexity., , and . CCC, page 321-331. IEEE Computer Society, (2008)Kolmogorov complexity of enumerating finite sets.. Inf. Process. Lett., 103 (1): 34-39 (2007)Kolmogorov's structure functions and model selection., and . IEEE Trans. Inf. Theory, 50 (12): 3265-3290 (2004)