default search action
Todd Wareham
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Federico Adolfi, Martina G. Vilas, Todd Wareham:
The Computational Complexity of Circuit Discovery for Inner Interpretability. CoRR abs/2410.08025 (2024) - 2023
- [j29]Todd Wareham, Ronald de Haan, Andrew Vardy
, Iris van Rooij:
Swarm Control for Distributed Construction: A Computational Complexity Perspective. ACM Trans. Hum. Robot Interact. 12(1): 6:1-6:45 (2023) - [j28]Federico Adolfi
A Computational Complexity Perspective on Segmentation as a Cognitive Subcomputation. Top. Cogn. Sci. 15(2): 255-273 (2023) - 2022
- [c32]Federico Adolfi, Todd Wareham, Iris van Rooij:
Computational Complexity of Segmentation. CogSci 2022 - [i8]Federico Adolfi, Todd Wareham, Iris van Rooij:
Computational Complexity of Segmentation. CoRR abs/2201.13106 (2022) - [i7]Todd Wareham:
Creating Teams of Simple Agents for Specified Tasks: A Computational Complexity Perspective. CoRR abs/2205.02061 (2022) - [i6]Todd Wareham:
Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach. CoRR abs/2205.04989 (2022) - [i5]Todd Wareham, Marieke Sweers:
Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version). CoRR abs/2205.05001 (2022) - [i4]Todd Wareham, Andrew Vardy:
Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective. CoRR abs/2205.05034 (2022) - [i3]Todd Wareham, Ronald de Haan:
Viable Algorithmic Options for Creating and Adapting Emergent Software Systems. CoRR abs/2205.06097 (2022) - 2021
- [j27]Patricia Rich
Naturalism, tractability and the adaptive toolbox. Synth. 198(6): 5749-5784 (2021) - [c31]Todd Wareham, Andrew Vardy:
The Computational Complexity of Designing Scalar-Field Sensing Robot Teams and Environments for Distributed Construction (Extended Abstract). ACSOS-C 2021: 232-237 - [c30]Patricia Rich, Ronald de Haan, Todd Wareham, Iris van Rooij:
How hard is cognitive science? CogSci 2021 - [c29]Marieke Woensdregt, Matthew Spike, Ronald de Haan, Todd Wareham, Iris van Rooij, Mark Blokpoel:
Why is scaling up models of language evolution hard? CogSci 2021
2010 – 2019
- 2019
- [b2]Iris van Rooij
Cognition and intractability: a guide to classical and parameterized complexity analysis. Cambridge University Press 2019, ISBN 9781107358331 - [j26]Todd Wareham
Designing Robot Teams for Distributed Construction, Repair, and Maintenance. ACM Trans. Auton. Adapt. Syst. 14(1): 2:1-2:29 (2019) - 2018
- [j25]Maria Otworowska, Mark Blokpoel, Marieke Sweers, Todd Wareham, Iris van Rooij
Demons of Ecological Rationality. Cogn. Sci. 42(3): 1057-1066 (2018) - [j24]Mark Blokpoel, Todd Wareham, Pim Haselager, Ivan Toni, Iris van Rooij
Deep Analogical Inference as the Origin of Hypotheses. J. Probl. Solving 11(1) (2018) - [j23]Todd Wareham
Putting it together: the computational complexity of designing robot controllers and environments for distributed construction. Swarm Intell. 12(2): 111-128 (2018) - [j22]Iris van Rooij
Rational analysis, intractability, and the prospects of 'as if'-explanations. Synth. 195(2): 491-510 (2018) - [j21]Todd Wareham, Andrew Vardy
Viable Algorithmic Options for Designing Reactive Robot Swarms. ACM Trans. Auton. Adapt. Syst. 13(1): 5:1-5:23 (2018) - [c28]Mesam Timmar, Todd Wareham:
The Computational Complexity of Controller-Environment Co-design Using Library Selection for Distributed Construction. DARS 2018: 51-63 - 2017
- [j20]Todd Wareham:
The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective. J. Probl. Solving 10(1) (2017) - [j19]Arastoo Bozorgi
Community-based influence maximization in social networks under a competitive linear threshold model. Knowl. Based Syst. 134: 149-158 (2017) - 2016
- [j18]Todd Wareham, Marieke Sweers:
On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems. EAI Endorsed Trans. Self Adapt. Syst. 2(5): e4 (2016) - [j17]Todd Wareham:
On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities. EAI Endorsed Trans. Self Adapt. Syst. 2(7): e4 (2016) - [j16]Todd Wareham:
Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms. EAI Endorsed Trans. Serious Games 3(9): e4 (2016) - 2015
- [c27]Todd Wareham:
Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms. BICT 2015: 295-302 - [c26]Todd Wareham:
On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities. BICT 2015: 418-424 - [c25]Todd Wareham, Marieke Sweers:
On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems. BICT 2015: 425-432 - [c24]Scott Watson, Andrew Vardy, Wolfgang Banzhaf, Todd Wareham:
Machiavellian agents: Player modelling to deceive and be deceived. CGAMES 2015: 10-17 - [c23]Todd Wareham, Scott Watson:
Exploring options for efficiently evaluating the playability of computer game agents. CGAMES 2015: 78-87 - [c22]Mark Blokpoel, Todd Wareham, Jan P. de Ruiter, Pim Haselager, Ivan Toni, Iris van Rooij:
Bridging the communicative gap between robots and humans, by analogy. CogSci 2015 - [c21]Maria Otworowska, Marieke Sweers, Robin Wellner, Todd Wareham, Iris van Rooij:
How did Homo Heuristicus become ecologically rational? CogSci 2015 - [c20]Maria Otworowska, Marieke Sweers, Robin Wellner, Marvin Uhlmann, Todd Wareham, Iris van Rooij:
How did Homo Heuristicus Become Ecologically Rational? EAPCogSci 2015 - 2014
- [c19]Zahra Sajedinia, Todd Wareham:
Assessing the computational adequacy of the General Problem Solver model. CogSci 2014 - [c18]Arne Wijnia, Todd Wareham, Iris van Rooij:
Can Tractable Algorithmic-level Explanations Be Evolved? CogSci 2014 - [i2]Yll Haxhimusa, Iris van Rooij, Sashank Varma, Todd Wareham:
Resource-bounded Problem Solving (Dagstuhl Seminar 14341). Dagstuhl Reports 4(8): 45-72 (2014) - 2013
- [c17]Mark Blokpoel, Todd Wareham, Ivan Toni, Iris van Rooij:
Modeling the genesis of a novel communicative system. CogSci 2013 - [c16]Iris van Rooij, Johan Kwisthout, Mark Blokpoel, Todd Wareham:
Computational complexity analysis for cognitive scientists. CogSci 2013 - [c15]Todd Wareham, Tijl Grootswagers, Iris van Rooij:
Closer than you think?: Options for efficiently approximating optimal analogies under Structure Mapping Theory. CogSci 2013 - [p1]Yvan Rose, Gregory J. Hedlund, Rod Byrne, Todd Wareham, Brian MacWhinney:
Phon: A Computational Basis for Phonological Database Building and Model Testing. Cognitive Aspects of Computational Language Acquisition 2013: 29-49 - 2012
- [j15]Iris van Rooij
Intractability and the use of heuristics in psychological explanations. Synth. 187(2): 471-487 (2012) - [c14]Todd Wareham:
Flyby: Life Before, During, and After Graduate Studies with Mike Fellows. The Multivariate Algorithmic Revolution and Beyond 2012: 51-55 - 2011
- [j14]Johan Kwisthout, Todd Wareham, Iris van Rooij
Bayesian Intractability Is Not an Ailment That Approximation Can Cure. Cogn. Sci. 35(5): 779-784 (2011) - [j13]Todd Wareham, Iris van Rooij
On the computational challenges of analogy-based generalization. Cogn. Syst. Res. 12(3-4): 266-280 (2011) - [j12]Todd Wareham, Patricia A. Evans, Iris van Rooij
What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective. J. Probl. Solving 3(2) (2011) - [c13]Mark Blokpoel, Johan Kwisthout, Todd Wareham, Pim Haselager, Ivan Toni, Iris van Rooij:
The computational costs of recipient design and intention recognition in communication. CogSci 2011 - [c12]Todd Wareham, Johan Kwisthout, Pim Haselager
Ignorance is bliss: A complexity perspective on adapting reactive architectures. ICDL-EPIROB 2011: 1-5
2000 – 2009
- 2009
- [j11]Patricia A. Evans, Todd Wareham, Rhonda Chaytor:
Fixed-parameter tractability of anonymizing data by suppressing entries. J. Comb. Optim. 18(4): 362-375 (2009) - 2008
- [j10]Iris van Rooij
Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities. Comput. J. 51(3): 385-404 (2008) - [c11]Rhonda Chaytor, Patricia A. Evans, Todd Wareham:
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries. COCOA 2008: 23-31 - 2007
- [e1]Selim G. Akl, Cristian S. Calude, Michael J. Dinneen, Grzegorz Rozenberg, Todd Wareham:
Unconventional Computation, 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007, Proceedings. Lecture Notes in Computer Science 4618, Springer 2007, ISBN 978-3-540-73553-3 [contents] - [i1]Iris van Rooij, Matthew Hamilton, Moritz Müller, Todd Wareham:
Approximating Solution Structure. Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs 2007 - 2006
- [c10]Matthew Hamilton, Rhonda Chaytor, Todd Wareham:
The Parameterized Complexity of Enumerating Frequent Itemsets. IWPEC 2006: 227-238 - 2004
- [j9]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. 2(2): 257-272 (2004) - 2003
- [j8]Patricia A. Evans, Andrew D. Smith
On the complexity of finding common approximate substrings. Theor. Comput. Sci. 306(1-3): 407-430 (2003) - [c9]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215 - 2002
- [j7]Gianluca Della Vedova
Optimal algorithms for local vertex quartet cleaning. Bioinform. 18(10): 1297-1304 (2002) - [c8]Gianluca Della Vedova, Todd Wareham:
Optimal algorithms for local vertex quartet cleaning. SAC 2002: 173-177 - 2001
- [c7]Patricia A. Evans, Harold T. Wareham:
Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract). Pacific Symposium on Biocomputing 2001: 559-570 - 2000
- [j6]Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theor. Comput. Sci. 244(1-2): 167-188 (2000) - [c6]Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang:
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). SODA 2000: 287-296 - [c5]Todd Wareham:
The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata. CIAA 2000: 302-310
1990 – 1999
- 1999
- [b1]Todd Wareham:
Systematic parameterized complexity analysis in computational phonology. University of Victoria, Canada, 1999 - [c4]Vincent Berry, Tao Jiang
Quartet Cleaning: Improved Algorithms and Simulations. ESA 1999: 313-324 - 1998
- [j5]Todd Wareham:
Jennifer Cole, Georgia M. Green and Jerry L. Morgan, editors, Linguistics and Computation. CLSI Lecture Notes no 52. Stanford, CA: CLSI, 1995. ISBN 1 881526 81 X, £14.95, xi+296 pages. Nat. Lang. Eng. 4(3): 277-286 (1998) - 1995
- [j4]Hans L. Bodlaender
Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. 11(1): 49-57 (1995) - [j3]Harold T. Wareham:
A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment. J. Comput. Biol. 2(4): 509-514 (1995) - [j2]Hans L. Bodlaender
The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. 147(1&2): 31-54 (1995) - 1994
- [j1]Michael T. Hallett, Todd Wareham:
A compendium of parameterized complexity results. SIGACT News 25(3): 122-123 (1994) - [c3]Hans L. Bodlaender
The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30 - [c2]Bruce M. Kapron
The Parameterized Complexity of Some Problems in Logic and Linguistics. LFCS 1994: 89-100 - 1993
- [c1]Michael R. Fellows, Michael T. Hallett
DNA Physical Mapping: Three Ways Difficult. ESA 1993: 157-168
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-11-19 21:44 CET 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: