Search the dblp DataBase
Ryan Hayward: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Russell Greiner, Ryan Hayward, Michael Molloy
Optimal Depth-First Strategies for And-Or Trees. [Citation Graph (0, 0)][DBLP]
AAAI/IAAI, 2002, pp:725-730 [Conf] - Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck
Solving 7x7 Hex: Virtual Connections and Game-State Reduction. [Citation Graph (0, 0)][DBLP]
ACG, 2003, pp:261-278 [Conf] - Ryan Hayward, Paul E. Kearney
Tolerance-Free NeST Representations. [Citation Graph (0, 0)][DBLP]
CCCG, 1994, pp:275-280 [Conf] - Ryan Hayward, Jeremy Spinrad, R. Sritharan
Weakly chordal graph algorithms via handles. [Citation Graph (0, 0)][DBLP]
SODA, 2000, pp:42-49 [Conf] - Paul E. Kearney, Ryan Hayward, Henk Meijer
Inferring Evolutionary Trees from Ordinal Data. [Citation Graph (0, 0)][DBLP]
SODA, 1997, pp:418-426 [Conf] - Colin McDiarmid, Ryan Hayward
Strong Concentration for Quicksort. [Citation Graph (0, 0)][DBLP]
SODA, 1992, pp:414-421 [Conf] - Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy
Finding optimal satisficing strategies for and-or trees. [Citation Graph (0, 0)][DBLP]
Artif. Intell., 2006, v:170, n:1, pp:19-58 [Journal] - Paul E. Kearney, Ryan Hayward, Henk Meijer
Evolutionary Trees and Ordinal Assertions. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1999, v:25, n:2-3, pp:196-221 [Journal] - Ryan Hayward
A Note on the Circle Containment Problem. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1989, v:4, n:, pp:263-264 [Journal] - Ryan Hayward, Colin McDiarmid
Average Case Analysis of Heap Building by Repeated Insertion. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1991, v:12, n:1, pp:126-153 [Journal] - Colin McDiarmid, Ryan Hayward
Large Deviations for Quicksort. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1996, v:21, n:3, pp:476-507 [Journal] - Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan
Weakly Triangulated Comparability Graphs. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1999, v:29, n:2, pp:378-386 [Journal] - Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck
Solving 7x7 Hex with domination, fill-in, and virtual connections. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2005, v:349, n:2, pp:123-139 [Journal]
Search in 0.031secs, Finished in 0.031secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002