Aidan Roy

According to our database, Aidan Roy authored at least 12 papers between 2007 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2020

Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results.

Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti

Inf. Comput., 2020

2017

Uniform Mixing and Association Schemes.

Chris D. Godsil, Natalie Mullin, Aidan Roy

Electron. J. Comb., 2017

Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report.

Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti

Proceedings of the Frontiers of Combining Systems - 11th International Symposium, 2017

2016

Fast clique minor generation in Chimera qubit connectivity graphs.

Tomas Boothby, Andrew D. King, Aidan Roy

Quantum Inf. Process., 2016

Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis.

Zhengbing Bian, Fabián A. Chudak, Robert B. Israel, Brad Lackey, William G. Macready, Aidan Roy

Frontiers ICT, 2016

2014

A practical heuristic for finding graph minors.

Jun Cai, William G. Macready, Aidan Roy

CoRR, 2014

2011

Local extrema of entropy functions under tensor products.

Shmuel Friedland, Gilad Gour, Aidan Roy

Quantum Inf. Comput., 2011

2010

Minimal Euclidean representations of graphs.

Aidan Roy

Discret. Math., 2010

2009

Equiangular lines, mutually unbiased bases, and spin models.

Chris D. Godsil, Aidan Roy

Eur. J. Comb., 2009

Unitary designs and codes.

Aidan Roy, A. J. Scott

Des. Codes Cryptogr., 2009

2008

Two Characterizations of Crooked Functions.

Chris D. Godsil, Aidan Roy

IEEE Trans. Inf. Theory, 2008

2007

The chromatic number and rank of the complements of the Kasami graphs.

Aidan Roy, Gordon F. Royle

Discret. Math., 2007