( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Guide for New Program Committee Members at Theoretical Computer Science Conferences.

, , , , , и . CoRR, (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.

Ronald Wolf

Ronald Wolf

Ronald Michael Wolf

Ronald Keipert

Acmella ciliata (H.B.K.) Cassini: phytochemische und enzymatische Untersuchungen, galenische Präformulierungen. FU Berlin, (2009)

Amal Dé

 

Другие публикации лиц с тем же именем

Quantum symmetrically-private information retrieval., и . Inf. Process. Lett., 90 (3): 109-114 (2004)A Complete Method for Program Specialization Based on Unfolding., и . ECAI, стр. 438-442. John Wiley and Sons, Chichester, (1996)Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds., , , , и . STOC, стр. 95-106. ACM, (2012)Quantum lower bounds by polynomials., , , , и . J. ACM, 48 (4): 778-797 (2001)The non-adaptive query complexity of testing k-parities, , , и . CoRR, (2012)Improved Quantum Communication Complexity Bounds for Disjointness and Equality., и . STACS, том 2285 из Lecture Notes in Computer Science, стр. 299-310. Springer, (2002)Quantum Search on Bounded-Error Inputs., , и . ICALP, том 2719 из Lecture Notes in Computer Science, стр. 291-299. Springer, (2003)Bell Inequalities: What Do We Know about Them and Why Should Cryptographers Care? - (Invited Talk).. ICITS, том 6673 из Lecture Notes in Computer Science, стр. 117-119. Springer, (2011)Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error., и . CoRR, (2021)Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving., и . FOCS, стр. 637-648. IEEE, (2020)