Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric S. Rowland
Person information
- affiliation: Hofstra University, Hempstead, NY, USA
- affiliation (former): University of Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Julia Carrigan, Isaiah Hollars
, Eric Rowland:
A natural bijection for contiguous pattern avoidance in words. Discret. Math. 347(3): 113793 (2024)- 2023
- [j20]Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle, John López, Mauditra Matin, Daniel Roebuck, Eric Rowland, Noam Scully, Juliet Whidden:
The Lexicographically Least Square-Free Word with a Given Prefix. Electron. J. Comb. 30(3) (2023) - [c5]Savinien Kreczman, Luca Prigioniero, Eric Rowland, Manon Stipulanti:
Magic Numbers in Periodic Sequences. WORDS 2023: 206-219 - [i16]Savinien Kreczman, Luca Prigioniero, Eric Rowland, Manon Stipulanti:
Magic numbers in periodic sequences. CoRR abs/2304.03268 (2023) - [i15]Eric Rowland, Manon Stipulanti, Reem Yassawi:
Algebraic power series and their automatic complexity I: finite fields. CoRR abs/2308.10977 (2023) - 2022
- [j19]Émilie Charlier, Adeline Massuir, Michel Rigo, Eric S. Rowland:
Ultimate periodicity problem for linear numeration systems. Int. J. Algebra Comput. 32(3): 561-596 (2022) - [j18]Eric Rowland:
Lucas' Theorem Modulo p2. Am. Math. Mon. 129(9): 846-855 (2022) - [i14]Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle, John López, Mauditra Matin, Daniel Roebuck, Eric Rowland, Noam Scully, Juliet Whidden:
The lexicographically least square-free word with a given prefix. CoRR abs/2210.00508 (2022) - [i13]Julia Carrigan, Isaiah Hollars, Eric Rowland:
Natural bijections for contiguous pattern avoidance in words. CoRR abs/2212.08959 (2022) - 2020
- [j17]Eric Rowland, Manon Stipulanti:
Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers. Electron. J. Comb. 27(3): 3 (2020) - [c4]Eric Rowland, Manon Stipulanti:
Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract). DLT 2020: 280-293 - [i12]Eric Rowland, Manon Stipulanti:
Avoiding 5/4-powers on the alphabet of nonnegative integers. CoRR abs/2005.03158 (2020) - [i11]Emilie Charlier, Adeline Massuir, Michel Rigo, Eric Rowland:
Ultimate periodicity problem for linear numeration systems. CoRR abs/2007.08147 (2020)
2010 – 2019
- 2018
- [j16]Lara Pudwell, Eric Rowland:
Avoiding Fractional Powers over the Natural Numbers. Electron. J. Comb. 25(2): 2 (2018) - [j15]Eric Rowland:
A Matrix Generalization of a Theorem of Fine. Integers 18A: A18 (2018) - [c3]Eric Rowland:
IntegerSequences: A Package for Computing with k-Regular Sequences. ICMS 2018: 414-421 - [i10]Eric S. Rowland, Reem Yassawi:
Automaticity and invariant measures of linear cellular automata. CoRR abs/1811.01256 (2018) - 2017
- [j14]Eric S. Rowland, Reem Yassawi:
Profinite automata. Adv. Appl. Math. 85: 60-83 (2017) - [j13]Chen Fei Du, Hamoon Mousavi, Eric Rowland, Luke Schaeffer, Jeffrey O. Shallit:
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability. Theor. Comput. Sci. 657: 146-162 (2017) - [c2]Eric Rowland:
Binomial Coefficients, Valuations, and Words. DLT 2017: 68-74 - [i9]Eric Rowland:
A matrix generalization of a theorem of Fine. CoRR abs/1704.05872 (2017) - 2016
- [j12]Leyda Almodovar, Victor H. Moll, Hadrian Quan, Fernando Roman, Eric Rowland, Michole Washington:
Infinite Products Arising in Paperfolding. J. Integer Seq. 19(5): 16.5.1 (2016) - 2015
- [j11]Eric Rowland, Reem Yassawi:
A characterization of p-automatic sequences as columns of linear cellular automata. Adv. Appl. Math. 63: 68-89 (2015) - [j10]Aline Parreau, Michel Rigo, Eric Rowland, Élise Vandomme:
A New Approach to the 2-Regularity of the ℓ-Abelian Complexity of 2-Automatic Sequences. Electron. J. Comb. 22(1): 1 (2015) - [j9]Eric Rowland, Jeffrey O. Shallit:
Automatic Sets of Rational Numbers. Int. J. Found. Comput. Sci. 26(3): 343-366 (2015) - [i8]Lara Pudwell, Eric S. Rowland:
Avoiding fractional powers over the natural numbers. CoRR abs/1510.02807 (2015) - 2014
- [i7]Eric S. Rowland, Reem Yassawi:
Profinite automata. CoRR abs/1403.7659 (2014) - [i6]Aline Parreau, Michel Rigo, Eric Rowland, Élise Vandomme:
A new approach to the $2$-regularity of the l-abelian complexity of 2-automatic sequences. CoRR abs/1405.3532 (2014) - 2013
- [i5]Lara Pudwell, Eric S. Rowland:
What's in YOUR wallet? CoRR abs/1306.2060 (2013) - [i4]Eric S. Rowland, Reem Yassawi:
Automatic congruences for diagonals of rational functions. CoRR abs/1310.8635 (2013) - 2012
- [j8]Bobbe Cooper, Eric Rowland, Doron Zeilberger:
Toward a language theoretic proof of the four color theorem. Adv. Appl. Math. 48(2): 414-431 (2012) - [j7]Charles D. Brummitt, Eric S. Rowland:
Boundary Growth in One-Dimensional Cellular Automata. Complex Syst. 21(2) (2012) - [j6]Eric Rowland, Jeffrey O. Shallit:
Avoiding 3/2-powers over the natural numbers. Discret. Math. 312(6): 1282-1288 (2012) - [c1]Eric Rowland, Jeffrey O. Shallit:
k-Automatic Sets of Rational Numbers. LATA 2012: 490-501 - [i3]Charles D. Brummitt, Eric S. Rowland:
Boundary growth in one-dimensional cellular automata. CoRR abs/1204.2172 (2012) - [i2]Eric S. Rowland, Reem Yassawi:
A characterization of p-automatic sequences as columns of linear cellular automata. CoRR abs/1209.6008 (2012) - 2011
- [i1]Eric Rowland, Jeffrey O. Shallit:
k-Automatic sets of rational numbers. CoRR abs/1110.2382 (2011) - 2010
- [j5]Eric S. Rowland:
Non-Regularity of ⌊ α + logk n ⌋. Integers 10: A3 (2010) - [j4]Eric S. Rowland:
Pattern avoidance in binary trees. J. Comb. Theory A 117(6): 741-758 (2010) - [j3]Lara Pudwell, Eric S. Rowland:
Counting Interesting Elections. Am. Math. Mon. 117(2): 167-174 (2010)
2000 – 2009
- 2009
- [j2]Eric S. Rowland:
Regularity versus Complexity in the Binary Representation of 3n. Complex Syst. 18(3) (2009) - 2006
- [j1]Eric S. Rowland:
Local Nested Structure in Rule 30. Complex Syst. 16(3) (2006)
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-06-10 21:21 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:
