11 citations · 25 across the 6 of their papers we have counts for
7 papers
Polynomial-time proofs that groups are hyperbolic
Derek Holt, Stephen Linton, Max Neunhoeffer +3
It is undecidable in general whether a given finitely presented group is word hyperbolic. We use the concept of pregroups, introduced by Stallings, to define a new class of van Kam…
A parallel algorithm for Gaussian elimination over finite fields
Stephen Linton, Gabriele Nebe, Alice Niemeyer +2
In this paper we describe a parallel Gaussian elimination algorithm for matrices with entries in a finite field. Unlike previous approaches, our algorithm subdivides a very large i…
S-crucial and bicrucial permutations with respect to squares
Ian Gent, Sergey Kitaev, Alexander Konovalov +2
A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if i…
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…
Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions
Steven Linton, James Propp, Tom Roby +1
We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our mo…
Finding the Minimal DFA of Very Large Finite State Automata with an Application to Token Passing Networks
Vlad Slavici, Daniel Kunkle, Gene Cooperman +1
Finite state automata (FSA) are ubiquitous in computer science. Two of the most important algorithms for FSA processing are the conversion of a non-deterministic finite automaton (…