default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRyan B. Hayward
Person information
- affiliation: University of Alberta, Edmonton, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Owen Randall, Martin Müller, Ting-Han Wei, Ryan Hayward:
Expected Work Search: Combining Win Rate and Proof Size Estimation. IJCAI 2024: 7003-7011- [i4]Owen Randall, Martin Müller, Ting-Han Wei, Ryan Hayward:
Expected Work Search: Combining Win Rate and Proof Size Estimation. CoRR abs/2405.05594 (2024) - 2022
- [c29]Owen Randall, Ting-Han Wei, Ryan Hayward, Martin Müller:
Improving Search in Go Using Bounded Static Safety. CG 2022: 14-23 - 2021
- [c28]Ryan Hayward, Robert Hearn, Mahya Jamshidian:
BoxOff is NP-Complete. ACG 2021: 118-127
2010 – 2019
- 2019
- [j39]Chao Gao, Kei Takada, Ryan Hayward:
Hex 2018: MoHex3HNN over DeepEzo. J. Int. Comput. Games Assoc. 41(1): 39-42 (2019) - [j38]David Spies, Jia-Huai You
, Ryan Hayward:
Domain-Independent Cost-Optimal Planning in ASP. Theory Pract. Log. Program. 19(5-6): 1124-1142 (2019) - [c27]Nicolas Fabiano, Ryan Hayward:
New Hex Patterns for Fill and Prune. ACG 2019: 79-90 - [c26]David Spies, Jia-Huai You, Ryan Hayward:
Mutex Graphs and Multicliques: Reducing Grounding Size for Planning. ICLP Technical Communications 2019: 140-153 - [i3]David Spies, Jia-Huai You, Ryan Hayward:
Domain-Independent Cost-Optimal Planning in ASP. CoRR abs/1908.00112 (2019) - 2018
- [j37]Chao Gao, Siqi Yan, Ryan Hayward, Martin Müller:
A transferable neural network for Hex. J. Int. Comput. Games Assoc. 40(3): 224-233 (2018) - [j36]Chao Gao, Ryan Hayward, Martin Müller:
Move Prediction Using Deep Convolutional Neural Networks in Hex. IEEE Trans. Games 10(4): 336-343 (2018) - [c25]Chao Gao, Martin Müller, Ryan Hayward:
Adversarial Policy Gradient for Alternating Markov Games. ICLR (Workshop) 2018 - [c24]Chao Gao, Martin Müller, Ryan Hayward:
Three-Head Neural Network Architecture for Monte Carlo Tree Search. IJCAI 2018: 3762-3768 - 2017
- [j35]Ryan Hayward, Jakub Pawlewicz, Kei Takada, Ton van der Valk:
Mohex Wins 2015 Hex 11×11 and Hex 13×13 Tournaments. J. Int. Comput. Games Assoc. 39(1): 60-64 (2017) - [j34]Ryan Hayward, Noah Weninger:
Hex 2017: MoHex wins the 11x11 and 13x13 tournaments. J. Int. Comput. Games Assoc. 39(3-4): 222-227 (2017) - [c23]Noah Weninger, Ryan Hayward:
Exploring Positional Linear Go. ACG 2017: 101-114 - [c22]Chao Gao, Martin Müller, Ryan Hayward:
Focused Depth-first Proof Number Search using Convolutional Neural Networks for the Game of Hex. IJCAI 2017: 3668-3674 - [i2]Kenny Young, Ryan B. Hayward:
A Reverse Hex Solver. CoRR abs/1707.00627 (2017) - 2016
- [j33]Jakub Pawlewicz, Ryan B. Hayward:
Conspiracy number search with relative sibling scores. Theor. Comput. Sci. 644: 127-142 (2016) - [c21]Kenny Young, Ryan B. Hayward:
A Reverse Hex Solver. Computers and Games 2016: 137-148 - [c20]Kenny Young, Gautham Vasan, Ryan Hayward:
NeuroHex: A Deep Q-learning Hex Agent. CGW@IJCAI 2016: 3-18 - [i1]Kenny Young, Ryan Hayward, Gautham Vasan:
Neurohex: A Deep Q-learning Hex Agent. CoRR abs/1604.07097 (2016) - 2015
- [j32]Jakub Pawlewicz, Ryan B. Hayward, Philip Henderson, Broderick Arneson:
Stronger Virtual Connections in Hex. IEEE Trans. Comput. Intell. AI Games 7(2): 156-166 (2015) - [c19]Jakub Pawlewicz, Ryan B. Hayward:
Feature Strength and Parallelization of Sibling Conspiracy Number Search. ACG 2015: 198-209 - [c18]Jakub Pawlewicz, Ryan B. Hayward:
Sibling Conspiracy Number Search. SOCS 2015: 105-112 - 2014
- [j31]Samuel Clowes Huneke, Ryan B. Hayward, Bjarne Toft:
A winning strategy for 3×n Cylindrical Hex. Discret. Math. 331: 93-97 (2014) - [c17]Bradley Hauer, Ryan Hayward, Grzegorz Kondrak:
Solving Substitution Ciphers with Combined Language Models. COLING 2014: 2314-2325 - 2013
- [j30]Ryan Hayward, Broderick Arneson, Shih-Chieh Huang, Jakub Pawlewicz:
MOHEX Wins Hex Tournament. J. Int. Comput. Games Assoc. 36(3): 180-183 (2013) - [c16]Shih-Chieh Huang, Broderick Arneson, Ryan B. Hayward, Martin Müller, Jakub Pawlewicz:
MoHex 2.0: A Pattern-Based MCTS Hex Player. Computers and Games 2013: 60-71 - [c15]Jakub Pawlewicz, Ryan B. Hayward:
Scalable Parallel DFPN Search. Computers and Games 2013: 138-150 - [c14]Ryan Hayward, Chia-Chu Chiang:
An Architecture for Parallelizing Fully Homomorphic Cryptography on Cloud. CISIS 2013: 72-77 - 2012
- [j29]Ryan B. Hayward, Bjarne Toft, Philip Henderson:
How to play Reverse Hex. Discret. Math. 312(1): 148-156 (2012) - [j28]Ryan Hayward:
MOHEX Wins Hex Tournament. J. Int. Comput. Games Assoc. 35(2): 124-127 (2012) - 2011
- [c13]Henry Brausen, Ryan B. Hayward, Martin Müller, Abdul Qadir, David Spies:
Blunder Cost in Go and Hex. ACG 2011: 220-229 - 2010
- [j27]Broderick Arneson, Ryan B. Hayward, Philip Henderson:
Monte Carlo Tree Search in Hex. IEEE Trans. Comput. Intell. AI Games 2(4): 251-258 (2010) - [c12]Broderick Arneson, Ryan B. Hayward, Philip Henderson:
Solving Hex: Beyond Humans. Computers and Games 2010: 1-10
2000 – 2009
- 2009
- [c11]Philip Henderson, Broderick Arneson, Ryan B. Hayward:
Hex, Braids, the Crossing Rule, and XH-Search. ACG 2009: 88-98 - [c10]Philip Henderson, Broderick Arneson, Ryan B. Hayward:
Solving 8x8 Hex. IJCAI 2009: 505-510 - 2008
- [c9]Philip Henderson, Ryan B. Hayward:
Probing the 4-3-2 Edge Template in Hex. Computers and Games 2008: 229-240 - 2007
- [j26]Ryan B. Hayward:
The Story of Perfectly Orderable Graphs. Graphs Comb. 23(Supplement-1): 269-273 (2007) - [j25]Ryan B. Hayward, Jeremy P. Spinrad, R. Sritharan:
Improved algorithms for weakly chordal graphs. ACM Trans. Algorithms 3(2): 14 (2007) - 2006
- [j24]Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy:
Finding optimal satisficing strategies for and-or trees. Artif. Intell. 170(1): 19-58 (2006) - [j23]Ryan B. Hayward, Jack van Rijswijck:
Hex and combinatorics. Discret. Math. 306(19-20): 2515-2528 (2006) - [c8]Ryan B. Hayward, Broderick Arneson, Philip Henderson:
Automatic Strategy Verification for Hex. Computers and Games 2006: 112-121 - 2005
- [j22]Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck:
Solving 7x7 Hex with domination, fill-in, and virtual connections. Theor. Comput. Sci. 349(2): 123-139 (2005) - 2004
- [j21]Ryan B. Hayward, William J. Lenhart:
Bichromatic P4-composition schemes for perfect orderability. Discret. Appl. Math. 141(1-3): 161-183 (2004) - [j20]Ryan B. Hayward, Ron Shamir:
A note on tolerance graph recognition. Discret. Appl. Math. 143(1-3): 307-311 (2004) - 2003
- [c7]Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck:
Solving 7x7 Hex: Virtual Connections and Game-State Reduction. ACG 2003: 261-278 - 2002
- [j19]Ryan B. Hayward, Paul E. Kearney, Andrew J. Malton:
NeST graphs. Discret. Appl. Math. 121(1-3): 139-153 (2002) - [c6]Russell Greiner, Ryan Hayward, Michael Molloy:
Optimal Depth-First Strategies for And-Or Trees. AAAI/IAAI 2002: 725-730 - [c5]Ryan B. Hayward, Stefan Hougardy, Bruce A. Reed:
Polynomial time recognition of P4-structure. SODA 2002: 382-389 - 2001
- [j18]Ryan B. Hayward, William J. Lenhart:
Perfectly Orderable P4 Composition. Electron. Notes Discret. Math. 7: 190-193 (2001) - [j17]Ryan B. Hayward:
Bull-Free Weakly Chordal Perfectly Orderable Graphs. Graphs Comb. 17(3): 479-500 (2001) - 2000
- [c4]Ryan Hayward, Jeremy P. Spinrad, R. Sritharan:
Weakly chordal graph algorithms via handles. SODA 2000: 42-49
1990 – 1999
- 1999
- [j16]Paul E. Kearney, Ryan Hayward, Henk Meijer:
Evolutionary Trees and Ordinal Assertions. Algorithmica 25(2-3): 196-221 (1999) - [j15]Elaine M. Eschen, Ryan Hayward, Jeremy P. Spinrad, R. Sritharan:
Weakly Triangulated Comparability Graphs. SIAM J. Comput. 29(2): 378-386 (1999) - 1997
- [j14]Ryan B. Hayward:
Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability. Discret. Appl. Math. 73(3): 199-210 (1997) - [j13]Ryan B. Hayward:
Meyniel Weakly Triangulated Graphs II: A Theorem of Dirac. Discret. Appl. Math. 78(1-3): 283-289 (1997) - [c3]Paul E. Kearney, Ryan Hayward, Henk Meijer:
Inferring Evolutionary Trees from Ordinal Data. SODA 1997: 418-426 - 1996
- [j12]Colin McDiarmid, Ryan Hayward:
Large Deviations for Quicksort. J. Algorithms 21(3): 476-507 (1996) - [j11]Ryan B. Hayward:
RecognizingP3-Structure: A Switching Approach. J. Comb. Theory B 66(2): 247-262 (1996) - [j10]Ryan Hayward:
Generating weakly triangulated graphs. J. Graph Theory 21(1): 67-69 (1996) - 1995
- [j9]Ryan B. Hayward:
Discs in unbreakable graphs. Graphs Comb. 11(3): 249-254 (1995) - 1994
- [c2]Ryan Hayward, Paul E. Kearney:
Tolerance-Free NeST Representations. CCCG 1994: 275-280 - 1992
- [c1]Colin McDiarmid, Ryan Hayward:
Strong Concentration for Quicksort. SODA 1992: 414-421 - 1991
- [j8]Ryan Hayward, Colin McDiarmid:
Average Case Analysis of Heap Building by Repeated Insertion. J. Algorithms 12(1): 126-153 (1991) - 1990
- [j7]Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. Graphs Comb. 6(1): 33-35 (1990) - [j6]Ryan B. Hayward, William J. Lenhart:
On the P4-structure of Perfect Graphs. IV. Partner graphs. J. Comb. Theory B 48(1): 135-139 (1990) - [j5]Ryan B. Hayward:
Murky graphs. J. Comb. Theory B 49(2): 200-235 (1990)
1980 – 1989
- 1989
- [j4]Ryan Hayward:
A Note on the Circle Containment Problem. Discret. Comput. Geom. 4: 263-264 (1989) - [j3]Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. Graphs Comb. 5(1): 339-349 (1989) - 1987
- [j2]Ryan B. Hayward:
A Low Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem. Discret. Comput. Geom. 2: 327-343 (1987) - 1985
- [j1]Ryan B. Hayward:
Weakly triangulated graphs. J. Comb. Theory B 39(3): 200-208 (1985)
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-10-21 21:28 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:
