default search action
Aidan Roy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j10]Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results. Inf. Comput. 275: 104609 (2020)
2010 – 2019
- 2018
- [i3]Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT and MaxSAT with a Quantum Annealer: Foundations, Encodings, and Preliminary Results. CoRR abs/1811.02524 (2018) - 2017
- [j9]Chris D. Godsil, Natalie Mullin, Aidan Roy:
Uniform Mixing and Association Schemes. Electron. J. Comb. 24(3): 3 (2017) - [c1]Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report. FroCoS 2017: 153-171 - 2016
- [j8]Zhengbing Bian, Fabián A. Chudak, Robert B. Israel, Brad Lackey, William G. Macready, Aidan Roy:
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis. Frontiers ICT 3: 14 (2016) - [j7]Tomas Boothby, Andrew D. King, Aidan Roy:
Fast clique minor generation in Chimera qubit connectivity graphs. Quantum Inf. Process. 15(1): 495-508 (2016) - 2015
- [i2]Tomas Boothby, Andrew D. King, Aidan Roy:
Fast clique minor generation in Chimera qubit connectivity graphs. CoRR abs/1507.04774 (2015) - 2014
- [i1]Jun Cai, William G. Macready, Aidan Roy:
A practical heuristic for finding graph minors. CoRR abs/1406.2741 (2014) - 2011
- [j6]Shmuel Friedland, Gilad Gour, Aidan Roy:
Local extrema of entropy functions under tensor products. Quantum Inf. Comput. 11(11-12): 1028-1044 (2011) - 2010
- [j5]Aidan Roy:
Minimal Euclidean representations of graphs. Discret. Math. 310(4): 727-733 (2010)
2000 – 2009
- 2009
- [j4]Aidan Roy, A. J. Scott:
Unitary designs and codes. Des. Codes Cryptogr. 53(1): 13-31 (2009) - [j3]Chris D. Godsil
, Aidan Roy:
Equiangular lines, mutually unbiased bases, and spin models. Eur. J. Comb. 30(1): 246-262 (2009) - 2008
- [j2]Chris D. Godsil
Two Characterizations of Crooked Functions. IEEE Trans. Inf. Theory 54(2): 864-866 (2008) - 2007
- [j1]Aidan Roy, Gordon F. Royle
The chromatic number and rank of the complements of the Kasami graphs. Discret. Math. 307(1): 132-136 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: