NAND-Trees, Average Choice Complexity, and Effective Resistance S. Jeffery and S. Kimmel (2015). arXiv:1511.02235
Approximate Span Programs T. Ito and S. Jeffery (2015). arXiv:1507.00432
Quantum homomorphic encryption for circuits of low T-gate complexity A. Broadbent and S. Jeffery (2014). arXiv:1412.8766
Advances in Cryptology: Proceedings of the 35^{th} Annual Cryptology Conference (CRYPTO 2015). Pages 609 – 629.
Presented at the 5^{th} International Conference on Quantum Cryptography (QCrypt 2015).
To be presented at the 19^{th} Conference on Quantum Information Processing (QIP 2016).
Optimal parallel quantum query algorithms S. Jeffery, F. Magniez and R. de Wolf (2013). arXiv:1309.6116
Proceedings of the 22^{nd} European Symposium on Algorithms (ESA 2014). Pages 592 – 604.
A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
A. M. Childs, S. Jeffery, R. Kothari and F. Magniez (2013).
arXiv:1302.7316
Merged with arXiv:1302.3143: A. Belovs, A. M. Childs, S. Jeffery, R. Kothari and F. Magniez (2013). Time-efficient quantum walks for 3-distinctness. Proceedings of the 40^{th} International Colloquium on Automata, Languages and Programming (ICALP 2013). Pages 105 – 122.
Presented at the 17^{th} Conference on Quantum Information Processing (QIP 2014).
Quantum Algorithms for the Subset-Sum Problem
D. J. Bernstein, S. Jeffery, T. Lange and A. Meurer. (2013). ePrint
Proceedings of the 5^{th} International Conference on Post-Quantum Cryptography (PQCrypto 2013). Pages 16 – 33.
Partial-indistinguishability obfuscation using braids
G. Alagic, S. Jeffery and S. Jordan (2012). arXiv:1212.6458
Proceedings of the 9^{th} Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Pages 141 – 160.
Proceedings of the 24^{th} ACM-SIAM Symposium on Discrete Algorithms (SODA 2013). Pages 1474 – 1485.
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
S. Jeffery, R. Kothari and F. Magniez (2012). arXiv:1112.5855v2
Proceedings of the 39^{th} International Colloquium on Automata, Languages and Programming (ICALP 2012). Pages 522 – 532.
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, Beyond an Honest Majority
A. Broadbent, S. Jeffery, S. Ranellucci and A. Tapp (2012).
Proceedings of the 6^{th} International Conference on Information Theoretic Security (ICITS 2012). Pages 14 – 36.
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
A. Broadbent, S. Jeffery and A. Tapp (2010). arXiv:1011.5242[cs.CR]
HASS: A Scheduler for Heterogeneous Multicore Systems
D. Shelepov, J. Saez, S. Jeffery, A. Fedorova, N. Perez, Z. Huang, S. Blagodurov and V. Kumar (2009).
Operating Systems Review (Special Issue on Interaction among the OS, Compilers, and Multicore Processors). 43(2):66 – 75.
Doctoral Thesis
S. Jeffery (2014). Frameworks for Quantum Algorithms. Doctoral thesis, University of Waterloo. pdf
Masters Thesis
S. Jeffery (2011). Collision Finding with Many Classical or Quantum Processors. Masters thesis, University of Waterloo. pdf