default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyle Burke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Kyle Burke, Matthew Ferland
, Shang-Hua Teng:
Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem. Theor. Comput. Sci. 1005: 114636 (2024)- [j5]Kyle Burke, Craig Tennenhouse:
The computational complexity of forced capture Hnefatafl. Theor. Comput. Sci. 1006: 114627 (2024) - [c7]Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng:
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. FUN 2024: 8:1-8:14 - [i17]Kyle Burke, Matthew Ferland, Svenja Huntemann, Shang-Hua Teng:
A Tractability Gap Beyond Nim-Sums: It's Hard to Tell Whether a Bunch of Superstars Are Losers. CoRR abs/2403.04955 (2024) - [i16]Kyle Burke, Antoine Dailly, Nacim Oijid:
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles. CoRR abs/2404.10390 (2024) - 2023
- [i15]Kyle Burke, Craig Tennenhouse:
Forced Capture Hnefatafl. CoRR abs/2301.06127 (2023) - 2022
- [c6]Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Nimber-Preserving Reduction: Game Secrets And Homomorphic Sprague-Grundy Theorem. FUN 2022: 10:1-10:17 - [c5]Kyle W. Burke, Matthew Ferland, Shang-Hua Teng:
Quantum-Inspired Combinatorial Games: Algorithms and Complexity. FUN 2022: 11:1-11:20 - [i14]Kyle G. Burke, Craig Tennenhouse:
Vexing Vexillological Logic. CoRR abs/2212.10631 (2022) - 2021
- [c4]Kyle W. Burke, Matthew T. Ferland, Shang-Hua Teng:
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. FOCS 2021: 1217-1228 - [i13]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Transverse Wave: an impartial color-propagation game inspired by Social Influence and Quantum Nim. CoRR abs/2101.07237 (2021) - [i12]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Winning the War by (Strategically) Losing Battles: Settling the Complexity of Grundy-Values in Undirected Geography. CoRR abs/2106.02114 (2021) - [i11]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Nimber-Preserving Reductions and Homomorphic Sprague-Grundy Game Encodings. CoRR abs/2109.05622 (2021) - 2020
- [i10]Kyle Burke, Matthew Ferland, Shang-Hua Teng:
Quantum Combinatorial Games: Structures and Computational Complexity. CoRR abs/2011.03704 (2020)
2010 – 2019
- 2019
- [j4]Kyle Burke, Robert A. Hearn:
PSPACE-complete two-color planar placement games. Int. J. Game Theory 48(2): 393-410 (2019) - 2017
- [i9]Matthew Ferland, Kyle Burke:
Computational Properties of Slime Trail. CoRR abs/1712.04496 (2017) - 2016
- [i8]Kyle Burke, Bob Hearn:
PSPACE-Complete Two-Color Placement Games. CoRR abs/1602.06012 (2016) - [i7]Mara Bovee, Kyle Burke, Craig Tennenhouse:
Games from Basic Data Structures. CoRR abs/1605.06327 (2016) - [i6]Kyle Burke, Silvia Heubach, Melissa A. Huggan, Svenja Huntemann:
Keeping Your Distance is Hard. CoRR abs/1605.06801 (2016) - [i5]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games. CoRR abs/1607.01826 (2016) - 2015
- [j3]Kyle Burke:
23 Quantified Boolean Formula Games and Their Complexities. Integers 15A: A3 (2015) - [c3]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - 2014
- [c2]David P. Bunde, Kyle Burke:
Chapel: a versatile tool for teaching undergraduates parallel programming (abstract only). SIGCSE 2014: 748 - [i4]Kyle G. Burke:
$2^3$ Quantified Boolean Formula Games and Their Complexities. CoRR abs/1401.3687 (2014) - 2013
- [j2]Gabriel Beaulieu, Kyle G. Burke, Éric Duchêne:
Impartial coloring games. Theor. Comput. Sci. 485: 49-60 (2013) - 2012
- [i3]Gabriel Beaulieu, Kyle G. Burke, Éric Duchêne:
Impartial coloring games. CoRR abs/1202.5762 (2012) - 2011
- [i2]Kyle W. Burke, Olivia George:
A PSPACE-complete Graph Nim. CoRR abs/1101.1507 (2011)
2000 – 2009
- 2008
- [j1]Kyle W. Burke, Shang-Hua Teng:
Atropos: A PSPACE-Complete Sperner Triangle Game. Internet Math. 5(4): 477-492 (2008) - 2007
- [c1]Kyle W. Burke, Shang-Hua Teng:
A PSPACE-complete Sperner Triangle Game. WINE 2007: 445-456 - [i1]Kyle W. Burke, Shang-Hua Teng:
Games on the Sperner Triangle. CoRR abs/cs/0702153 (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-07-19 18: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:
