Ryan Hayward - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 34 from 34

2022

Improving Search in Go Using Bounded Static SafetyOwen Randall, Ting-Han Wei, Ryan Hayward, Martin Müller 0003. CG 2023: 14-23 [doi]

2021

BoxOff is NP-CompleteRyan Hayward, Robert Hearn, Mahya Jamshidian. acg 2022: 118-127 [doi]

2019

New Hex Patterns for Fill and PruneNicolas Fabiano, Ryan Hayward. acg 2020: 79-90 [doi]

Hex 2018: MoHex3HNN over DeepEzoChao Gao, Kei Takada, Ryan Hayward. icga, 41(1):39-42, 2019. [doi]

Domain-Independent Cost-Optimal Planning in ASPDavid Spies, Jia-Huai You, Ryan Hayward. tplp, 19(5-6):1124-1142, 2019. [doi]

2018

2017

2016

NeuroHex: A Deep Q-learning Hex AgentKenny Young, Gautham Vasan, Ryan Hayward. IJCAI 2017: 3-18 [doi]

2014

Solving Substitution Ciphers with Combined Language ModelsBradley Hauer, Ryan Hayward, Grzegorz Kondrak. COLING 2014: 2314-2325 [doi]

2013

An Architecture for Parallelizing Fully Homomorphic Cryptography on CloudRyan Hayward, Chia-Chu Chiang. cisis 2013: 72-77 [doi]

MOHEX Wins Hex TournamentRyan Hayward, Broderick Arneson, Shih-Chieh Huang, Jakub Pawlewicz. icga, 36(3):180-183, 2013. [doi]

2012

MOHEX Wins Hex TournamentRyan Hayward. icga, 35(2):124-127, 2012. [doi]

2006

Finding optimal satisficing strategies for and-or treesRussell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy. ai, 170(1):19-58, 2006. [doi]

2005

Solving 7x7 Hex with domination, fill-in, and virtual connectionsRyan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck. TCS, 349(2):123-139, 2005. [doi]

2003

Solving 7x7 Hex: Virtual Connections and Game-State ReductionRyan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck. acg 2004: 261-278

2002

Optimal Depth-First Strategies for And-Or TreesRussell Greiner, Ryan Hayward, Michael Molloy. AAAI 2002: 725-730

2000

Weakly chordal graph algorithms via handlesRyan Hayward, Jeremy Spinrad, R. Sritharan. soda 2000: 42-49 [doi]

1999

Weakly Triangulated Comparability GraphsElaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan. SICOMP, 29(2):378-386, 1999.

Evolutionary Trees and Ordinal AssertionsPaul E. Kearney, Ryan Hayward, Henk Meijer. algorithmica, 25(2-3):196-221, 1999. [doi]

1997

Inferring Evolutionary Trees from Ordinal DataPaul E. Kearney, Ryan Hayward, Henk Meijer. soda 1997: 418-426

1996

Generating weakly triangulated graphsRyan Hayward. jgt, 21(1):67-69, 1996. [doi]

Large Deviations for QuicksortColin McDiarmid, Ryan Hayward. jal, 21(3):476-507, 1996.

1994

Tolerance-Free NeST RepresentationsRyan Hayward, Paul E. Kearney. cccg 1994: 275-280

1992

Strong Concentration for QuicksortColin McDiarmid, Ryan Hayward. soda 1992: 414-421 [doi]

1991

Average Case Analysis of Heap Building by Repeated InsertionRyan Hayward, Colin McDiarmid. jal, 12(1):126-153, 1991.

1990

Optimizing weakly triangulated graphsRyan Hayward, Chính T. Hoàng, Frédéric Maffray. gc, 6(1):33-35, 1990. [doi]

1989

A Note on the Circle Containment ProblemRyan Hayward. dcg, 4:263-264, 1989.

Optimizing weakly triangulated graphsRyan Hayward, Chính T. Hoàng, Frédéric Maffray. gc, 5(1):339-349, 1989. [doi]

Sign in or sign up to see more results.

runs on WebDSL