Todd Wareham
Cited by
Cited by
Introducing Phon: A software solution for the study of phonological acquisition
Y Rose, B MacWhinney, R Byrne, G Hedlund, K Maddocks, P O'Brien, ...
Proceedings of the... Annual Boston University Conference on Language …, 2006
Parameterized complexity analysis in computational biology
HL Bodlaender, RG Downey, MR Fellows, MT Hallett, HT Wareham
Bioinformatics 11 (1), 49-57, 1995
Community-based influence maximization in social networks under a competitive linear threshold model
A Bozorgi, S Samet, J Kwisthout, T Wareham
Knowledge-Based Systems 134, 149-158, 2017
The parameterized complexity of sequence alignment and consensus
HL Bodlaender, RG Downey, MR Fellows, HT Wareham
Theoretical Computer Science 147 (1-2), 31-54, 1995
Bayesian intractability is not an ailment that approximation can cure.
J Kwisthout, T Wareham, I Van Rooij
Cogn. Sci. 35 (5), 779-784, 2011
Quartet cleaning: improved algorithms and simulations
V Berry, T Jiang, P Kearney, M Li, T Wareham
Algorithms-ESA’99: 7th Annual European Symposium Prague, Czech Republic …, 1999
On the complexity of finding common approximate substrings
PA Evans, AD Smith, HT Wareham
Theoretical Computer Science 306 (1-3), 407-430, 2003
A practical algorithm for recovering the best supported edges of an evolutionary tree
V Berry, D Bryant, T Jiang, PE Kearney, M Li, T Wareham, H Zhang
SODA, 287-296, 2000
DNA physical mapping: Three ways difficult
MR Fellows, MT Hallett, HT Wareham
Algorithms—ESA'93: First Annual European Symposium Bad Honnef, Germany …, 1993
Intentional communication: Computationally easy or difficult?
I Van Rooij, J Kwisthout, M Blokpoel, J Szymanik, T Wareham, I Toni
Frontiers in Human Neuroscience 5, 52, 2011
Cognition and intractability: A guide to classical and parameterized complexity analysis
I Van Rooij, M Blokpoel, J Kwisthout, T Wareham
Cambridge University Press, 2019
The parameterized complexity of some problems in logic and linguistics
RG Downey, MR Fellows, BM Kapron, MT Hallett, HT Wareham
Logical Foundations of Computer Science: Third International Symposium, LFCS …, 1994
Systematic parameterized complexity analysis in computational phonology
HT Wareham
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
HL Bodlaender, MR Fellows, MT Hallett, HT Wareham, TJ Warnow
Theoretical Computer Science 244 (1-2), 167-188, 2000
Parameterized complexity in cognitive modeling: Foundations, applications and opportunities
I Van Rooij, T Wareham
The Computer Journal 51 (3), 385-404, 2008
Practical algorithms for universal DNA primer design: an exercise in algorithm engineering
P Evans, HT Wareham
Currents in Computational Molecular Biology, 25-26, 2001
Intractability and the use of heuristics in psychological explanations
I Van Rooij, CD Wright, T Wareham
Synthese 187 (2), 471-487, 2012
The parameterized complexity of intersection and composition operations on sets of finite-state automata
H Todd Wareham
Implementation and Application of Automata: 5th International Conference …, 2001
On the computational complexity of inferring evolutionary trees
HT Wareham
Memorial University of Newfoundland, 1992
Rational analysis, intractability, and the prospects of ‘as if’-explanations
I van Rooij, CD Wright, J Kwisthout, T Wareham
Synthese 195, 491-510, 2018
The system can't perform the operation now. Try again later.
Articles 1–20