Todd Wareham

Orcid: 0000-0002-2410-7991

According to our database1, Todd Wareham authored at least 64 papers between 1993 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Computational Complexity Perspective on Segmentation as a Cognitive Subcomputation.
Top. Cogn. Sci., April, 2023

Swarm Control for Distributed Construction: A Computational Complexity Perspective.
ACM Trans. Hum. Robot Interact., 2023

2022
Viable Algorithmic Options for Creating and Adapting Emergent Software Systems.
CoRR, 2022

Environmental Sensing Options for Robot Teams: A Computational Complexity Perspective.
CoRR, 2022

Exploring Viable Algorithmic Options for Automatically Creating and Reconfiguring Component-based Software Systems: A Computational Complexity Approach (Full Version).
CoRR, 2022

Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach.
CoRR, 2022

Creating Teams of Simple Agents for Specified Tasks: A Computational Complexity Perspective.
CoRR, 2022

Computational Complexity of Segmentation.
Proceedings of the 44th Annual Meeting of the Cognitive Science Society, 2022

2021
Naturalism, tractability and the adaptive toolbox.
Synth., 2021

Why is scaling up models of language evolution hard?
Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

How hard is cognitive science?
Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

The Computational Complexity of Designing Scalar-Field Sensing Robot Teams and Environments for Distributed Construction (Extended Abstract).
Proceedings of the IEEE International Conference on Autonomic Computing and Self-Organizing Systems, 2021

2019
Designing Robot Teams for Distributed Construction, Repair, and Maintenance.
ACM Trans. Auton. Adapt. Syst., 2019

Cognition and intractability: a guide to classical and parameterized complexity analysis.
Cambridge University Press, ISBN: 9781107358331, 2019

2018
Viable Algorithmic Options for Designing Reactive Robot Swarms.
ACM Trans. Auton. Adapt. Syst., 2018

Rational analysis, intractability, and the prospects of 'as if'-explanations.
Synth., 2018

Putting it together: the computational complexity of designing robot controllers and environments for distributed construction.
Swarm Intell., 2018

Deep Analogical Inference as the Origin of Hypotheses.
J. Probl. Solving, 2018

Demons of Ecological Rationality.
Cogn. Sci., 2018

The Computational Complexity of Controller-Environment Co-design Using Library Selection for Distributed Construction.
Proceedings of the Distributed Autonomous Robotic Systems, 2018

2017
Community-based influence maximization in social networks under a competitive linear threshold model.
Knowl. Based Syst., 2017

The Roles of Internal Representation and Processing in Problem Solving Involving Insight: A Computational Complexity Perspective.
J. Probl. Solving, 2017

2016
Exploring Algorithmic Options for the Efficient Design and Reconfiguration of Reactive Robot Swarms.
EAI Endorsed Trans. Serious Games, 2016

On the Computational Complexity of Designing and Reconfiguring Component-based Software Systems.
EAI Endorsed Trans. Self Adapt. Syst., 2016

On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities.
EAI Endorsed Trans. Self Adapt. Syst., 2016

2015
How did Homo Heuristicus Become Ecologically Rational?
Proceedings of the EuroAsianPacific Joint Conference on Cognitive Science / 4th European Conference on Cognitive Science / 11th International Conference on Cognitive Science, 2015

How did Homo Heuristicus become ecologically rational?
Proceedings of the 37th Annual Meeting of the Cognitive Science Society, 2015

Bridging the communicative gap between robots and humans, by analogy.
Proceedings of the 37th Annual Meeting of the Cognitive Science Society, 2015

Machiavellian agents: Player modelling to deceive and be deceived.
Proceedings of the Computer Games: AI, 2015

Exploring options for efficiently evaluating the playability of computer game agents.
Proceedings of the Computer Games: AI, 2015

2014
Resource-bounded Problem Solving (Dagstuhl Seminar 14341).
Dagstuhl Reports, 2014

Can Tractable Algorithmic-level Explanations Be Evolved?
Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

Assessing the computational adequacy of the General Problem Solver model.
Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

2013
Phon: A Computational Basis for Phonological Database Building and Model Testing.
Proceedings of the Cognitive Aspects of Computational Language Acquisition, 2013

Closer than you think?: Options for efficiently approximating optimal analogies under Structure Mapping Theory.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Computational complexity analysis for cognitive scientists.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

Modeling the genesis of a novel communicative system.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

2012
Intractability and the use of heuristics in psychological explanations.
Synth., 2012

Flyby: Life Before, During, and After Graduate Studies with Mike Fellows.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

2011
What Does (and Doesn’t) Make Analogical Problem Solving Easy? A Complexity-Theoretic Perspective.
J. Probl. Solving, 2011

On the computational challenges of analogy-based generalization.
Cogn. Syst. Res., 2011

Bayesian Intractability Is Not an Ailment That Approximation Can Cure.
Cogn. Sci., 2011

Ignorance is bliss: A complexity perspective on adapting reactive architectures.
Proceedings of the 1st International Conference on Development and Learning and on Epigenetic Robotics, 2011

The computational costs of recipient design and intention recognition in communication.
Proceedings of the 33th Annual Meeting of the Cognitive Science Society, 2011

2009
Fixed-parameter tractability of anonymizing data by suppressing entries.
J. Comb. Optim., 2009

2008
Parameterized Complexity in Cognitive Modeling: Foundations, Applications and Opportunities.
Comput. J., 2008

2007
Approximating Solution Structure.
Proceedings of the Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07., 2007

2006
The Parameterized Complexity of Enumerating Frequent Itemsets.
Proceedings of the Parameterized and Exact Computation, Second International Workshop, 2006

2004
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinform. Comput. Biol., 2004

2003
On the complexity of finding common approximate substrings.
Theor. Comput. Sci., 2003

2002
Optimal algorithms for local vertex quartet cleaning.
Bioinform., 2002

2001
Exact Algorithms for Computing Pairwise Alignments and 3-Medians From Structure-Annotated Sequences (Extended Abstract).
Proceedings of the 6th Pacific Symposium on Biocomputing, 2001

2000
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.
Theor. Comput. Sci., 2000

The Parameterized Complexity of Intersection and Composition Operations on Sets of Finite-State Automata.
Proceedings of the Implementation and Application of Automata, 2000

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Systematic parameterized complexity analysis in computational phonology.
PhD thesis, 1999

Quartet Cleaning: Improved Algorithms and Simulations.
Proceedings of the Algorithms, 1999

1998
Jennifer Cole, Georgia M. Green and Jerry L. Morgan, editors, <i>Linguistics and Computation</i>. CLSI Lecture Notes no 52. Stanford, CA: CLSI, 1995. ISBN 1 881526 81 X, £14.95, xi+296 pages.
Nat. Lang. Eng., 1998

1995
The Parameterized Complexity of Sequence Alignment and Consensus.
Theor. Comput. Sci., 1995

A Simplified Proof of the NP- and MAX SNP-Hardness of Multiple Sequence Tree Alignment.
J. Comput. Biol., 1995

Parameterized complexity analysis in computational biology.
Comput. Appl. Biosci., 1995

1994
A compendium of parameterized complexity results.
SIGACT News, 1994

The Parameterized Complexity of Some Problems in Logic and Linguistics.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993
DNA Physical Mapping: Three Ways Difficult.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993


  Loading...