Thomas O'Neil

According to our database, Thomas O'Neil authored at least 7 papers between 2005 and 2015.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2015

Complement, Complexity, and Symmetric Representation.

Thomas O'Neil

Int. J. Found. Comput. Sci., 2015

Representation-Independent Fixed Parameter Tractability for Vertex Cover and Weighted Monotone Satisfiability.

Thomas O'Neil

Electron. Colloquium Comput. Complex., 2015

Empirical support for the high-density subset sum decision threshold.

Thomas O'Neil, Travis Desell

Proceedings of the 14th IEEE Canadian Workshop on Information Theory, 2015

2010

A Simple O(2^sqrt(x)) Algorithm for Partition and Subset Sum.

Thomas O'Neil, Scott Kerlin

Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

2009

The Importance of Symmetric Representation.

Thomas O'Neil

Proceedings of the 2009 International Conference on Foundations of Computer Science, 2009

2006

The Representational Power of Conjunctive Normal Form.

Thomas O'Neil, Jason Smith

Proceedings of the 2006 International Conference on Foundations of Computer Science, 2006

2005

A Clause-Based Reduction from k-SAT to CLIQUE.

Thomas O'Neil

Proceedings of The 2005 International Conference on Foundations of Computer Science, 2005