◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. Kelsey

4 papers hereh-index 13633 citations33 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author2
  • middle author1
  • last author1

Across the 4 of 4 papers where every author was matched, so the position is known.

fields
  • cs.AI1
  • cs.CE1
  • cs.DC1
  • math.CO1
same name
  • T. Kelsey — 2 papers, h 24
  • T. Kelsey — 2 papers, h 11
  • T. Kelsey — 1 paper, h 11

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102013
most citedThe semigroups of order 9 and their automorphism groups

14 citations · 24 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2013★ 14 cited

The semigroups of order 9 and their automorphism groups

Andreas Distler, Tom Kelsey

We report the number of semigroups with 9 elements up to isomorphism or anti-isomorphism to be 52,989,400,714,478 and up to isomorphism to be 105,978,177,936,292. We obtained these…

cs.CE2012★ 1 cited

Qualitative Modelling via Constraint Programming: Past, Present and Future

Thomas W. Kelsey, Lars Kotthoff, Christoffer A. Jefferson +4

Qualitative modelling is a technique integrating the fields of theoretical computer science, artificial intelligence and the physical and biological sciences. The aim is to be able…

cs.DC2012

A framework for large-scale distributed AI search across disconnected heterogeneous infrastructures

Lars Kotthoff, Tom Kelsey, Martin McCaffery

We present a framework for a large-scale distributed eScience Artificial Intelligence search. Our approach is generic and can be used for many different problems. Unlike many other…

cs.AI2010★ 9 cited

The Exact Closest String Problem as a Constraint Satisfaction Problem

Tom Kelsey, Lars Kotthoff

We report (to our knowledge) the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.