Articles dans des revues sans comité de lecture (5)
  1. 4. Arora, A. S., Roland, J., Vlachou, C., & Weis, S. (2022). Solutions to quantum weak coin flipping. Cryptology ePrint Archive., 2022/1101.
  2. 5. Cardinal, J., Joret, G., & Roland, J. (2019). Information-theoretic lower bounds for quantum sorting. arXiv.org., 1902.06473.
    3.   Communications publiées lors de congrès ou colloques nationaux et internationaux (18)
  3. 1. Arora, A. S., Roland, J., & Vlachou, C. (2021). Analytic Quantum Weak Coin Flipping Protocols with Arbitrarily Small Bias. In Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (p. 919–938). (SODA '21). Society for Industrial and Applied Mathematics.
  4. 2. Arora, A. S., Roland, J., & Weis, S. (2019). Quantum Weak Coin Flipping. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (p. 205–216). (STOC 2019). Association for Computing Machinery. doi:10.1145/3313276.3316306
  5. 3. Laplante, S., Laurière, M., Nolin, A., Roland, J., & Senno, G. (2016). Robust Bell inequalities from communication complexity. 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016). Vol. 61 (pp. 5:1-5:24). doi:10.4230/LIPIcs.TQC.2016.5
  6. 4. Fontes, L., Jain, R., Kerenidis, I., Laplante, S., Lauri`ere, M., & Roland, J. (2015). Relative Discrepancy does not separate Information and Communication Complexity. 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) (pp. 506-516). doi:10.1007/978-3-662-47672-7_41
  7. 5. Brandeho, M., & Roland, J. (2015). A universal adiabatic quantum query algorithm. 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC'15). Vol. 44 (pp. 163-179). doi:10.4230/LIPIcs.TQC.2015.163
  8. 6. Magnin, L., & Roland, J. (2013). Explicit relation between all lower bound techniques for quantum query complexity. 30th International Symposium on Theoretical Aspects of Computer Science (STACS'13) (pp. 434-445). doi:10.4230/LIPIcs.STACS.2013.434
  9. 7. Ozols, M., Roetteler, M., & Roland, J. (2012). Quantum rejection sampling. In 3rd Conference on Innovations in Theoretical Computer Science (ITCS'12) (pp. 290-308) ACM Press. doi:10.1145/2090236.2090261
  10. 8. Kerenidis, I., Laplante, S., Lerays, V., Roland, J., & Xiao, D. (2012). Lower bounds on information complexity via zero-communication protocols and applications. 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12) (pp. 500-509). doi:10.1109/FOCS.2012.68
  11. 9. Laplante, S., Lerays, V., & Roland, J. (2012). Classical and quantum partition bound and detector inefficiency. In 39th International Colloquium on Automata, Languages and Programming (ICALP'12): Vol. 7391 (pp. 617-628). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-642-31594-7_52
  12. 10. Lee, T., & Roland, J. (2012). A strong direct product theorem for quantum query complexity. In 27th IEEE Conference on Computational Complexity (CCC'12) (pp. 236-246) IEEE. doi:10.1109/CCC.2012.17
    13. << Précédent 1 2 3 4 5 6 Suivant >>