( en | de | ru )

 

Disambiguation of "Rosmanis, Ansis"

Author of the publication

copydeleteadd this publication to your clipboard
On the Power of Non-adaptive Learning Graphs.

, and . CCC, page 44-55. IEEE Computer Society, (2013)

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.

No persons found for author name Rosmanis, Ansis
add a person with the name Rosmanis, Ansis
 

Other publications of authors with the same name

Mixed States in Quantum Cryptography., and . FCS, page 214-218. CSREA Press, (2006)Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems., and . TQC, volume 111 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Multi-letter Reversible and Quantum Finite Automata., , and . Developments in Language Theory, volume 4588 of Lecture Notes in Computer Science, page 60-71. Springer, (2007)Fidelity of Quantum Strategies with Applications to Cryptography., , and . TQC, volume 73 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Power of Non-adaptive Learning Graphs., and . Comput. Complex., 23 (2): 323-354 (2014)Quantum and classical algorithms for approximate submodular function minimization., , , and . Quantum Inf. Comput., 19 (15&16): 1325-1349 (2019)Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model., and . CoRR, (2022)Quantum Coupon Collector., , , , , and . TQC, volume 158 of LIPIcs, page 10:1-10:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Adversary lower bounds for the collision and the set equality problems., and . Quantum Inf. Comput., 18 (3&4): 200-224 (2018)Tight Bounds for Inverting Permutations via Compressed Oracle Arguments.. CoRR, (2021)