Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColva M. Roney-Dougal
Person information
- affiliation: University of St Andrews, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j9]Saul D. Freedman
, Andrea Lucchini, Daniele Nemmi, Colva M. Roney-Dougal:
Finite groups satisfying the independence property. Int. J. Algebra Comput. 33(3): 509-545 (2023)- 2021
- [j8]Peter J. Cameron, Saul D. Freedman, Colva M. Roney-Dougal:
The Non-Commuting, Non-Generating Graph of a Nilpotent Group. Electron. J. Comb. 28(1): 1 (2021) - [j7]Derek F. Holt, Stephen A. Linton, Max Neunhöffer, Richard Parker, Markus Pfeiffer, Colva M. Roney-Dougal:
Polynomial-time proofs that groups are hyperbolic. J. Symb. Comput. 104: 419-475 (2021) - 2011
- [j6]Scott H. Murray, Colva M. Roney-Dougal:
Constructive homomorphisms for classical groups. J. Symb. Comput. 46(4): 371-384 (2011) - 2010
- [j5]Derek F. Holt, Colva M. Roney-Dougal:
Constructing maximal subgroups of orthogonal groups. LMS J. Comput. Math. 13: 164-191 (2010) - 2009
- [j4]Andrew Grayland, Christopher Jefferson, Ian Miguel, Colva M. Roney-Dougal:
Minimal ordering constraints for some families of variable symmetries. Ann. Math. Artif. Intell. 57(1): 75-102 (2009) - 2005
- [j3]Derek F. Holt, Colva M. Roney-Dougal:
Constructing Maximal Subgroups of Classical Groups. LMS J. Comput. Math. 8: 46-79 (2005) - 2004
- [j2]Colva M. Roney-Dougal:
Conjugacy of Subgroups of the General Linear Group. Exp. Math. 13(2): 151-163 (2004) - 2003
- [j1]Colva M. Roney-Dougal, William R. Unger:
The affine primitive permutation groups of degree less than 1000. J. Symb. Comput. 35(4): 421-439 (2003)
Conference and Workshop Papers
- 2021
- [c8]Colva M. Roney-Dougal:
Maximal subgroups of finite simple groups: classifications and applications. BCC 2021: 343-370 - 2009
- [c7]Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
Snake Lex: An Alternative to Double Lex. CP 2009: 391-399 - [c6]Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
Confluence of Reduction Rules for Lexicographic Ordering Constraints. SARA 2009 - [c5]Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
In Search of a Better Method to Break Row and Column Symmetries. SARA 2009 - 2007
- [c4]Ian P. Gent, Tom Kelsey, Stephen A. Linton, J. Pearson, Colva M. Roney-Dougal:
Groupoids and Conditional Symmetry. CP 2007: 823-830 - 2005
- [c3]Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Roney-Dougal:
Symmetry and Consistency. CP 2005: 271-285 - 2004
- [c2]Tom Kelsey, Steve Linton, Colva M. Roney-Dougal:
New Developments in Symmetry Breaking in Search Using Computational Group Theory. AISC 2004: 199-210 - [c1]Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, Steve Linton:
Tractable Symmetry Breaking Using Restricted Search Trees. ECAI 2004: 211-215
Informal and Other Publications
- 2020
- [i1]Colva M. Roney-Dougal, Sergio Siccha:
Normalisers of primitive permutation groups in quasipolynomial time. CoRR abs/2002.01377 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
