default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJason P. Bell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j23]Jason P. Bell, Sean Monahan
, Matthew Satriano, Karen Situ, Zheng Xie:
There are no good infinite families of toric codes. J. Comb. Theory, Ser. A 213: 106009 (2025)- 2024
- [i14]Jason P. Bell, Christian Schulz, Jeffrey O. Shallit:
Consecutive Power Occurrences in Sturmian Words. CoRR abs/2402.09597 (2024) - [i13]Jason P. Bell, Sean Monahan, Matthew Satriano, Karen Situ, Zheng Xie:
There are no good infinite families of toric codes. CoRR abs/2406.00243 (2024) - 2023
- [j22]Jason P. Bell, Haggai Liu, Marni Mishna:
Cogrowth series for free products of finite groups. Int. J. Algebra Comput. 33(2): 237-260 (2023) - [j21]Seda Albayrak, Jason P. Bell:
Quantitative estimates for the size of an intersection of sparse automatic sets. Theor. Comput. Sci. 977: 114144 (2023) - [c6]Jason P. Bell, Daniel Smertnig:
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields. LICS 2023: 1-13 - [c5]Jason P. Bell, Daniel Smertnig, Hellis Tamm:
Duality of lattices associated to left and right quotients. AFL 2023: 35-50 - [i12]Seda Albayrak, Jason P. Bell:
Quantitative estimates for the size of an intersection of sparse automatic sets. CoRR abs/2304.09223 (2023) - 2022
- [j20]Jason P. Bell:
Topological invariants for words of linear factor complexity. Adv. Appl. Math. 139: 102372 (2022) - [j19]Jason P. Bell, Jeffrey O. Shallit:
Automatic sequences of rank two. RAIRO Theor. Informatics Appl. 56: 7 (2022) - [j18]Jason P. Bell, Jeffrey O. Shallit:
Lie complexity of words. Theor. Comput. Sci. 927: 98-108 (2022) - [i11]Jason P. Bell:
Topological invariants for words of linear factor complexity. CoRR abs/2202.00643 (2022) - [i10]Jason P. Bell, Daniel Smertnig:
Computing the linear hull: Deciding Sequential? and Unambiguous? for weighted automata over fields. CoRR abs/2209.02260 (2022) - [i9]Jason P. Bell, Jeffrey O. Shallit:
Counterexamples to a Conjecture of Dombi in Additive Number Theory. CoRR abs/2212.12473 (2022) - 2021
- [j17]Jason P. Bell, Khoa D. Nguyen:
An analogue of Ruzsa's conjecture for polynomials over finite fields. J. Comb. Theory A 178: 105337 (2021) - [i8]Jason P. Bell, Jeffrey O. Shallit:
Lie complexity of words. CoRR abs/2102.03821 (2021) - [i7]Jason P. Bell, Jeffrey O. Shallit:
Automatic Sequences of Rank Two. CoRR abs/2108.05434 (2021) - 2020
- [j16]Jason P. Bell, Thomas F. Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. Int. J. Found. Comput. Sci. 31(6): 667-687 (2020) - [i6]Jason P. Bell:
The upper density of an automatic set is rational. CoRR abs/2002.07256 (2020)
2010 – 2019
- 2018
- [c4]Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. DLT 2018: 121-132 - [i5]Jason P. Bell, Frédéric Chyzak, Michael Coons, Philippe Dumas:
Becker's conjecture on Mahler functions. CoRR abs/1802.08653 (2018) - [i4]Jason P. Bell, Thomas Finn Lidbetter, Jeffrey O. Shallit:
Additive Number Theory via Approximation by Regular Languages. CoRR abs/1804.07996 (2018) - 2017
- [j15]Jason P. Bell, Igor E. Shparlinski:
Power series approximations to Fekete polynomials. J. Approx. Theory 222: 132-142 (2017) - [j14]Jason P. Bell, Shaoshi Chen:
Power series with coefficients from a finite set. J. Comb. Theory A 151: 241-253 (2017) - [j13]Jason P. Bell, Matthew Satriano, Susan J. Sierra:
On a dynamical Mordell-Lang conjecture for coherent sheaves. J. Lond. Math. Soc. 96(1): 28-46 (2017) - [i3]Jason P. Bell, Kathryn Hare, Jeffrey O. Shallit:
When is an automatic set an additive basis? CoRR abs/1710.08353 (2017) - 2014
- [j12]Azhvan Sheikh Ahmady, Jason P. Bell, Bojan Mohar:
Integral Cayley Graphs and Groups. SIAM J. Discret. Math. 28(2): 685-701 (2014) - [c3]Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis:
Symmetric Groups and Quotient Complexity of Boolean Operations. ICALP (2) 2014: 1-12 - 2013
- [i2]Jason P. Bell, Janusz A. Brzozowski, Nelma Moreira, Rogério Reis:
Symmetric Groups and Quotient Complexity of Boolean Operations. CoRR abs/1310.1841 (2013) - 2012
- [j11]Jason P. Bell, Stanley Burris, Karen A. Yeats:
Monadic second-order classes of forests with a monadic second-order 0-1 law. Discret. Math. Theor. Comput. Sci. 14(1): 87-108 (2012) - 2010
- [j10]Jason P. Bell, Stanley Burris, Karen A. Yeats:
Characteristic Points of Recursive Systems. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j9]Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo:
A Decision Problem for Ultimately Periodic Sets in Nonstandard Numeration Systems. Int. J. Algebra Comput. 19(6): 809-839 (2009) - [c2]Jason P. Bell, Stanley N. Burris, Karen A. Yeats:
Spectra and Systems of Equations. AMS-ASL Joint Special Session 2009: 43-96 - [c1]Jason P. Bell, Stanley N. Burris:
Compton's Method for Proving Logical Limit Laws. AMS-ASL Joint Special Session 2009: 97-128 - [i1]Jason P. Bell, Emilie Charlier, Aviezri S. Fraenkel, Michel Rigo:
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems. CoRR abs/0907.0620 (2009) - 2007
- [j8]Jason P. Bell:
p-adic valuations and k-regular sequences. Discret. Math. 307(23): 3070-3075 (2007) - [j7]Jason P. Bell, Teow Lim Goh:
Exponential lower bounds for the number of words of uniform length avoiding a pattern. Inf. Comput. 205(9): 1295-1306 (2007) - 2006
- [j6]Jason P. Bell, Stanley Burris, Karen A. Yeats:
Counting Rooted Trees: The Universal Law t(n)~C ρ-n n-3/2. Electron. J. Comb. 13(1) (2006) - 2005
- [j5]Jason P. Bell:
On the values attained by a k-regular sequence. Adv. Appl. Math. 34(3): 634-643 (2005) - [j4]Jason P. Bell:
Unavoidable and Almost Unavoidable Sets of Words. Int. J. Algebra Comput. 15(4): 717-724 (2005) - 2004
- [j3]Jason P. Bell, Stanley Burris:
Partition Identities I: Sandwich Theorems and Logical 0-1 Laws. Electron. J. Comb. 11(1) (2004) - 2000
- [j2]Jason P. Bell:
When Structures Are Almost Surely Connected. Electron. J. Comb. 7 (2000) - [j1]Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond:
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. Electron. J. Comb. 7 (2000)
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 2025-03-04 22:16 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:
