Communications publiées lors de congrès ou colloques nationaux et internationaux (18)
  1. 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
  2. 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
  3. 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
  4. 7. 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
  5. 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
  6. 9. 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
  7. 10. 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
  8. 11. Gavinsky, D., Roetteler, M., & Roland, J. (2011). Quantum algorithm for the Boolean hidden shift problem. In 17th International Computing AND Combinatorics Conference (COCOON'11): Vol. 6842 (pp. 158-167). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-642-22685-4_14
  9. 12. Ambainis, A., Magnin, L., Roetteler, M., & Roland, J. (2011). Symmetry-assisted adversaries for quantum state generation. 26th IEEE Conference on Computational Complexity (CCC'11) (pp. 167-177). doi:10.1109/CCC.2011.24
  10. 13. Krovi, H., Magniez, F., Ozols, M., & Roland, J. (2010). Finding is as easy as detecting for quantum walks. In 37th International Colloquium on Automata, Languages and Programming (ICALP'10): Vol. 6198 (pp. 540-551). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-642-14165-2_46
  11. 14. Roland, J., & Szegedy, M. (2009). Amortized Communication Complexity of Distributions. In 36th International Colloquium on Automata, Languages and Programming (ICALP'09): Vol. 5555 (pp. 738-749). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-642-02927-1_61
  12. 15. Degorre, J., Kaplan, M., Laplante, S., & Roland, J. (2009). The communication complexity of non-signaling distributions. In 34th International Symposium on Mathematical Foundations of Computer Science (MFCS'09): Vol. 5734 (pp. 270-281). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-642-03816-7_24
    13. << Précédent 1 2 3 4 5 6 Suivant >>