Recent

Refereed Articles
[2017] Improved quantum query algorithms for triangle finding and associativity testing (T. Lee, F. Magniez, M. Santha), In Algorithmica, volume 77, 2017. [bib] [pdf]
[2016] Improved bounds for the randomized decision tree complexity of recursive majority (F. Magniez, A. Nayak, M. Santha, J. Sherman, G. Tardos, D. Xiao), In Random Structures & Algorithms, volume 48, 2016. [bib] [pdf]
[2016] Quantum walks can find a marked element on any graph (H. Krovi, F. Magniez, M. Ozols, J. Roland), In Algorithmica, volume 74, 2016. [bib] [pdf]
[2016] Optimal parallel quantum query algorithms (S. Jeffery, F. Magniez, R. de Wolf), In Algorithmica, 2016. (To appear) [bib] [pdf]
[2016] Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (S. Jeffery, R. Kothari, F. Le Gall, F. Magniez), In Algorithmica, volume 76, 2016. [bib] [pdf]
Refereed Conference Papers
[2017] Extended Learning Graphs for Triangle Finding (T. Carette, M. Laurière, F. Magniez), In Proceedings of 34th International Symposium on Theoretical Aspects of Computer Science, 2017. [bib] [pdf]
[2017] Streaming Communication Protocols (L. Boczkowski, I. Kerenidis, F. Magniez), In Proceedings of 44th International Colloquium on Automata, Languages, and Programming, 2017. (To appear) [bib] [pdf]
[2016] Stable Matching with Evolving Preferences (V. Kanade, N. Leonardos, F. Magniez), In Proceedings of 20th International Workshop on Randomization and Computation, 2016. [bib] [pdf]
[2016] Streaming Property Testing of Visibly Pushdown Languages (N. François, F. Magniez, M. de Rougemont, O. Serre), In Proceedings of 24rd European Symposium on Algorithms, 2016. [bib] [pdf]
Powered by bibtexbrowser

All

Refereed Articles
[2017] Improved quantum query algorithms for triangle finding and associativity testing (T. Lee, F. Magniez, M. Santha), In Algorithmica, volume 77, 2017. [bib] [pdf]
[2016] Improved bounds for the randomized decision tree complexity of recursive majority (F. Magniez, A. Nayak, M. Santha, J. Sherman, G. Tardos, D. Xiao), In Random Structures & Algorithms, volume 48, 2016. [bib] [pdf]
[2016] Quantum walks can find a marked element on any graph (H. Krovi, F. Magniez, M. Ozols, J. Roland), In Algorithmica, volume 74, 2016. [bib] [pdf]
[2016] Optimal parallel quantum query algorithms (S. Jeffery, F. Magniez, R. de Wolf), In Algorithmica, 2016. (To appear) [bib] [pdf]
[2016] Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (S. Jeffery, R. Kothari, F. Le Gall, F. Magniez), In Algorithmica, volume 76, 2016. [bib] [pdf]
Refereed Conference Papers
[2017] Extended Learning Graphs for Triangle Finding (T. Carette, M. Laurière, F. Magniez), In Proceedings of 34th International Symposium on Theoretical Aspects of Computer Science, 2017. [bib] [pdf]
[2017] Streaming Communication Protocols (L. Boczkowski, I. Kerenidis, F. Magniez), In Proceedings of 44th International Colloquium on Automata, Languages, and Programming, 2017. (To appear) [bib] [pdf]
[2016] Stable Matching with Evolving Preferences (V. Kanade, N. Leonardos, F. Magniez), In Proceedings of 20th International Workshop on Randomization and Computation, 2016. [bib] [pdf]
[2016] Streaming Property Testing of Visibly Pushdown Languages (N. François, F. Magniez, M. de Rougemont, O. Serre), In Proceedings of 24rd European Symposium on Algorithms, 2016. [bib] [pdf]
Powered by bibtexbrowser