Fenner, Stephen A.
120  Ergebnisse:
Personensuche X
?
1

The complexity of regex crosswords:

Fenner, Stephen ; Padé, Daniel ; Thierauf, Thomas
Information and Computation.  286 (2022)  - p. 104777 , 2022
 
?
2

The Complexity of Poset Games:

Fenner, Stephen A. ; Grier, Daniel ; Gurjar, Rohit..
Journal of Graph Algorithms and Applications.  26 (2022)  1 - p. 1-14 , 2022
 
?
3

Remembrances of Alan:

Fenner, Stephen
ACM SIGACT News.  52 (2021)  1 - p. 87-93 , 2021
 
?
6

Remembrances of Alan:

Fenner, Stephen
ACM SIGACT News.  52 (2021)  1 - p. 87-93 , 2021
 
?
7

Complexity of Regex Crosswords:

, In: Language and Automata Theory and Applications; Lecture Notes in Computer Science,
Fenner, Stephen ; Padé, Daniel - p. 215-230 , 2019
 
?
10

Bipartite Perfect Matching is in Quasi-NC:

Fenner, Stephen ; Gurjar, Rohit ; Thierauf, Thomas
SIAM Journal on Computing.  50 (2019)  3 - p. STOC16-218-STOC16-235 , 2019
 
1-15