Steve Linton
Impact in
-
- Advanced Combinatorial Mathematics
- Finite Group Theory Research
Papers in
-
- Algorithms and Data Compression 4
-
- semigroups and automata theory 4
- Advanced Graph Theory Research 2
- Co-authors
- Nik Ruškuc (3 shared papers)Michael Albert (3 shared papers)Tom Kelsey (2 shared papers)Ian P. Gent (3 shared papers)Colva M. Roney‐Dougal (1 shared paper)Thomas Breuer (1 shared paper)Vincent Vatter (3 shared papers)Gene Cooperman (1 shared paper)
- Journals
- Artificial Intelligence (1 paper)Annals of Combinatorics (1 paper)The Electronic Journal of Combinatorics (1 paper)Discrete Mathematics (1 paper)Electronic Notes in Theoretical Computer Science (1 paper)
- Partner nations
- United KingdomGermanyNew Zealand
In The Last Decade
Steve Linton
18 papers receiving 107 citations
Peers
Comparison fields: 5 of 29
- Discrete Mathematics and Combinatorics 56
- Algebra and Number Theory 16
- Computational Theory and Mathematics 48
- Software 10
- Artificial Intelligence 55
Countries citing papers authored by Steve Linton
This map shows the geographic impact of Steve Linton's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Steve Linton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Steve Linton more than expected).
Fields of papers citing papers by Steve Linton
This network shows the impact of papers produced by Steve Linton. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Steve Linton. The network helps show where Steve Linton may publish in the future.
Co-authors
The 21 scholars most cited alongside Steve Linton, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Tractable symmetry breaking using restricted search trees | 2004 | 25 |
| 2 | 2005 | 23 | |
| 3 | 1998 | 10 | |
| 4 | 2004 | 10 | |
| 5 | 1998 | 9 | |
| 6 | Permutation Patterns | 2010 | 9 |
| 7 | Constructive recognition of a black box group isomorphic to GL(n, 2) | 1997 | 8 |
| 8 | 2010 | 4 | |
| 9 | 2014 | 4 | |
| 10 | 2016 | 3 | |
| 11 | 2007 | 3 | |
| 12 | 2010 | 3 | |
| 13 | 2011 | 3 | |
| 14 | 2014 | 3 | |
| 15 | 2003 | 2 | |
| 16 | 2015 | 2 | |
| 17 | 2012 | 2 | |
| 18 | The insertion encoding | 2003 | 1 |
About Steve Linton
Steve Linton is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics and Molecular Biology, having authored 18 papers that have together received 124 indexed citations. Recurring topics across this work include Algorithms and Data Compression (4 papers), semigroups and automata theory (4 papers), Constraint Satisfaction and Optimization (3 papers), Advanced Combinatorial Mathematics (3 papers), Genome Rearrangement Algorithms (2 papers), Advanced Graph Theory Research (2 papers), Parallel Computing and Optimization Techniques (2 papers) and Finite Group Theory Research (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (56 citations), Algebra and Number Theory (16 citations), Computational Theory and Mathematics (48 citations), Software (10 citations) and Artificial Intelligence (55 citations). Steve Linton has collaborated with scholars based in United Kingdom, Germany and New Zealand. Frequent co-authors include Nik Ruškuc, Michael Albert, Tom Kelsey, Ian P. Gent, Colva M. Roney‐Dougal, Thomas Breuer, Vincent Vatter, Gene Cooperman, Larry Finkelstein and Ursula Martin. Their work appears in journals such as Artificial Intelligence, Annals of Combinatorics, The Electronic Journal of Combinatorics, Discrete Mathematics and Electronic Notes in Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.