Steve Linton
-
- Advanced Combinatorial Mathematics 3
-
- semigroups and automata theory 4
- Advanced Graph Theory Research 2
-
- Algorithms and Data Compression 4
- Logic, programming, and type systems 2
-
- Constraint Satisfaction and Optimization 3
-
- DNA and Biological Computing 2
-
- Genome Rearrangement Algorithms 2
- Co-authors
- Nik RuškucMichael AlbertTom KelseyIan P. GentColva M. Roney‐DougalVincent VatterThomas BreuerGene Cooperman
- Cited by
- Discrete Mathematics and CombinatoricsAlgebra and Number TheoryComputational Theory and Mathematics
- Journals
- Artificial Intelligence (1 paper)Annals of Combinatorics (1 paper)The Electronic Journal of Combinatorics (1 paper)
- Partner nations
- United KingdomGermanyNew Zealand
In The Last Decade
Steve Linton
18 papers receiving 104 citations
Peers
Comparison fields: 5 of 29
- Discrete Mathematics and Combinatorics 55
- Algebra and Number Theory 15
- Computational Theory and Mathematics 47
- Software 10
- Artificial Intelligence 54
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-authorship network
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 | 2016 | 3 | |
| 2 | 2015 | 2 | |
| 3 | 2014 | 3 | |
| 4 | 2014 | 3 | |
| 5 | 2012 | 2 | |
| 6 | 2011 | 3 | |
| 7 | Permutation Patterns | 2010 | 9 |
| 8 | 2010 | 3 | |
| 9 | 2010 | 4 | |
| 10 | 2007 | 2 | |
| 11 | 2005 | 23 | |
| 12 | Tractable symmetry breaking using restricted search trees | 2004 | 25 |
| 13 | 2004 | 10 | |
| 14 | The insertion encoding | 2003 | 1 |
| 15 | 2003 | 2 | |
| 16 | 1998 | 8 | |
| 17 | 1998 | 10 | |
| 18 | Constructive recognition of a black box group isomorphic to GL(n, 2) | 1997 | 8 |
About Steve Linton
Steve Linton is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Artificial Intelligence, Hardware and Architecture and Software, having authored 18 papers that have together received 121 indexed citations. Recurring topics across this work include semigroups and automata theory (4 papers), Algorithms and Data Compression (4 papers), Constraint Satisfaction and Optimization (3 papers), Advanced Combinatorial Mathematics (3 papers), DNA and Biological Computing (2 papers), Advanced Graph Theory Research (2 papers), Genome Rearrangement Algorithms (2 papers) and Logic, programming, and type systems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (55 citations), Algebra and Number Theory (15 citations), Computational Theory and Mathematics (47 citations), Software (10 citations) and Artificial Intelligence (54 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, Vincent Vatter, Thomas Breuer, Gene Cooperman, Ursula Martin and Larry Finkelstein. Their work appears in journals such as Artificial Intelligence, Annals of Combinatorics, The Electronic Journal of Combinatorics, Discrete Mathematics and Concurrency and Computation Practice and Experience.
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.