default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikola Ruskuc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j31]Nik Ruskuc
, Bill de Witt:
On the number of countable subdirect powers of unary algebras. Int. J. Algebra Comput. 33(6): 1183-1194 (2023)- [i4]V. Ironmonger, Nik Ruskuc:
Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings. CoRR abs/2301.11048 (2023) - 2021
- [j30]M. McDevitt, Nikola Ruskuc:
Atomicity and Well Quasi-Order for Consecutive Orderings on Words and Permutations. SIAM J. Discret. Math. 35(1): 495-520 (2021) - 2020
- [j29]Craig Miller, Nik Ruskuc:
Right noetherian semigroups. Int. J. Algebra Comput. 30(1): 13-48 (2020) - [j28]William J. DeMeo, Peter Mayr, Nik Ruskuc:
Bounded homomorphisms and finitely generated fiber products of lattices. Int. J. Algebra Comput. 30(04): 693-710 (2020)
2010 – 2019
- 2019
- [j27]Michael H. Albert, Robert Brignall, Nik Ruskuc, Vincent Vatter:
Rationality for subclasses of 321-avoiding permutations. Eur. J. Comb. 78: 44-72 (2019) - [j26]Peter Mayr, Nik Ruskuc:
Generating subdirect products. J. Lond. Math. Soc. 100(2): 404-424 (2019) - 2017
- [j25]Sophie Huczynska, Nikola Ruskuc:
On well quasi-order of graph classes under homomorphic image orderings. Eur. J. Comb. 63: 164-175 (2017) - 2016
- [j24]Tom Bourne, Nik Ruskuc:
On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups. Theor. Comput. Sci. 653: 87-96 (2016) - [i3]Tom Bourne, Nik Ruskuc:
On the star-height of factor counting languages and their relationship to Rees zero-matrix semigroups. CoRR abs/1603.06236 (2016) - 2015
- [j23]Sophie Huczynska, Nik Ruskuc:
Homomorphic Image Orders on Combinatorial Structures. Order 32(2): 205-226 (2015) - [p1]Sophie Huczynska, Nik Ruskuc:
Well quasi-order in combinatorics: embeddings and homomorphisms. Surveys in Combinatorics 2015: 261-294 - 2013
- [j22]Igor Dolinka, Nik Ruskuc:
Every Group is a Maximal Subgroup of the Free Idempotent Generated Semigroup over a band. Int. J. Algebra Comput. 23(3): 573-582 (2013) - 2012
- [j21]Alan J. Cain, Nikola Ruskuc, Richard M. Thomas:
Unary FA-Presentable Semigroups. Int. J. Algebra Comput. 22(4) (2012) - [i2]Max Neunhöffer, Markus Pfeiffer, Nik Ruskuc:
Deciding Word Problems of Semigroups using Finite State Automata. CoRR abs/1206.1714 (2012) - [i1]Alan J. Cain, Nikola Ruskuc:
Subalgebras of FA-presentable algebras. CoRR abs/1206.5548 (2012) - 2011
- [j20]Michael H. Albert, Steve Linton, Nikola Ruskuc, Vincent Vatter, Steve Waton:
On convex permutations. Discret. Math. 311(8-9): 715-722 (2011) - [j19]M. D. Atkinson, Nikola Ruskuc, Rebecca Smith:
Substitution-closed pattern classes. J. Comb. Theory A 118(2): 317-340 (2011) - 2010
- [j18]Michael H. Albert, M. D. Atkinson, Robert Brignall, Nikola Ruskuc, Rebecca Smith, J. West:
Growth Rates for Subclasses of Av(321). Electron. J. Comb. 17(1) (2010) - [j17]Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic Presentations and Semigroup Constructions. Theory Comput. Syst. 47(2): 568-592 (2010)
2000 – 2009
- 2009
- [j16]Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic presentations for semigroups. Inf. Comput. 207(11): 1156-1168 (2009) - 2008
- [j15]Sophie Huczynska, Nikola Ruskuc:
Pattern classes of permutations via bijections between linearly ordered sets. Eur. J. Comb. 29(1): 118-139 (2008) - [j14]Robert Brignall, Nikola Ruskuc, Vincent Vatter:
Simple permutations: Decidability and unavoidable substructures. Theor. Comput. Sci. 391(1-2): 150-163 (2008) - [c1]Alan J. Cain, Graham P. Oliver, Nikola Ruskuc, Richard M. Thomas:
Automatic Presentations for Cancellative Semigroups. LATA 2008: 149-159 - 2005
- [j13]Michael H. Albert, Steve Linton, Nikola Ruskuc:
The Insertion Encoding of Permutations. Electron. J. Comb. 12 (2005) - [j12]Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc:
Pattern Avoidance Classes and Subpermutations. Electron. J. Comb. 12 (2005) - [j11]Luís Descalço, Nikola Ruskuc:
Subsemigroups of the Bicyclic Monoid. Int. J. Algebra Comput. 15(1): 37-57 (2005) - [j10]Ersebet R. Dombi, Nick D. Gilbert, Nikola Ruskuc:
Finite Presentability of HNN Extensions of Inverse Semigroups. Int. J. Algebra Comput. 15(3): 423-436 (2005) - 2003
- [j9]Michael H. Albert, Mike D. Atkinson, Nikola Ruskuc:
Regular closed sets of permutations. Theor. Comput. Sci. 306(1-3): 85-100 (2003) - 2002
- [j8]Michael Hoffmann, Richard M. Thomas, Nikola Ruskuc:
Automatic Semigroups with Subsemigroups of Finite Rees Index. Int. J. Algebra Comput. 12(3): 463-461 (2002) - [j7]Steve Linton, Götz Pfeiffer, Edmund F. Robertson, Nikola Ruskuc:
Computing Transformation Semigroups. J. Symb. Comput. 33(2): 145-162 (2002) - [j6]Mike D. Atkinson, Max Murphy, Nikola Ruskuc:
Partially Well-Ordered Closed Sets of Permutations. Order 19(2): 101-113 (2002) - [j5]Mike D. Atkinson, Max Murphy, Nikola Ruskuc:
Sorting with two ordered stacks in series. Theor. Comput. Sci. 289(1): 205-223 (2002) - 2001
- [j4]Friedrich Otto, Nikola Ruskuc:
Confluent Monadic String-Rewriting Systems and Automatic Structures. J. Autom. Lang. Comb. 6(3): 375-388 (2001) - [j3]Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
Automatic semigroups. Theor. Comput. Sci. 250(1-2): 365-391 (2001)
1990 – 1999
- 1996
- [j2]Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
On Subsemigroups and ideals in Free Products of Semigroups. Int. J. Algebra Comput. 6(5): 571-592 (1996) - 1995
- [j1]Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas:
Rewriting a Semigroup Presentation. Int. J. Algebra Comput. 5(1): 81-104 (1995)
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-11-04 21:41 CET 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:
