default search action
Paul Bell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Paul C. Bell
, Mika Hirvensalo, Igor Potapov
The membership problem for subsemigroups of GL2(Z) is NP-complete. Inf. Comput. 296: 105132 (2024) - 2023
- [j20]Paul C. Bell, Pavel Semukhin:
Decision Questions for Probabilistic Automata on Small Alphabets. Log. Methods Comput. Sci. 19(4) (2023) - [c21]Paul C. Bell
On the Identity and Group Problems for Complex Heisenberg Matrices. RP 2023: 42-55 - [i8]Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin:
On the Identity and Group Problems for Complex Heisenberg Matrices. CoRR abs/2307.05283 (2023) - 2022
- [j19]Paul C. Bell
Towards Uniform Online Spherical Tessellations. Discret. Comput. Geom. 67(4): 1124-1146 (2022) - [j18]Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke
Preface. Fundam. Informaticae 189(3-4) (2022) - [j17]Paul C. Bell
Polynomially ambiguous probabilistic automata on restricted languages. J. Comput. Syst. Sci. 127: 53-65 (2022) - 2021
- [j16]Paul C. Bell
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. Inf. Comput. 281: 104736 (2021) - [j15]Paul C. Bell
On injectivity of quantum finite automata. J. Comput. Syst. Sci. 122: 19-33 (2021) - [c20]Paul C. Bell
Decision Questions for Probabilistic Automata on Small Alphabets. MFCS 2021: 15:1-15:17 - [e1]Paul C. Bell
Reachability Problems - 15th International Conference, RP 2021, Liverpool, UK, October 25-27, 2021, Proceedings. Lecture Notes in Computer Science 13035, Springer 2021, ISBN 978-3-030-89715-4 [contents] - [i7]Paul C. Bell, Pavel Semukhin:
Decision Questions for Probabilistic Automata on Small Alphabets. CoRR abs/2105.10293 (2021) - 2020
- [j14]Paul C. Bell
Unique decipherability in formal languages. Theor. Comput. Sci. 804: 149-160 (2020) - [c19]Paul C. Bell
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. CONCUR 2020: 22:1-22:16 - [i6]Paul C. Bell, Pavel Semukhin:
Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata. CoRR abs/2002.07660 (2020)
2010 – 2019
- 2019
- [j13]Paul C. Bell
Freeness properties of weighted and probabilistic automata over bounded languages. Inf. Comput. 269 (2019) - [c18]Paul C. Bell
Towards Uniform Online Spherical Tessellations. CiE 2019: 120-131 - [c17]Paul C. Bell
Polynomially Ambiguous Probabilistic Automata on Restricted Languages. ICALP 2019: 105:1-105:14 - [c16]Paul C. Bell
Acceptance Ambiguity for Quantum Automata. MFCS 2019: 70:1-70:14 - [c15]Paul C. Bell
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. MFCS 2019: 83:1-83:15 - [i5]Paul C. Bell:
Polynomially Ambiguous Probabilistic Automata on Restricted Languages. CoRR abs/1902.09407 (2019) - [i4]Paul C. Bell, Igor Potapov, Pavel Semukhin:
Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. CoRR abs/1902.10188 (2019) - [i3]Paul C. Bell
Acceptance Ambiguity for Quantum Automata. CoRR abs/1907.01471 (2019) - 2018
- [i2]Paul C. Bell, Igor Potapov:
Towards Uniform Online Spherical Tessellations. CoRR abs/1810.01786 (2018) - 2017
- [c14]Abeer Aljohani, Daphne Teck Ching Lai
A Comparison of Distance Metrics in Semi-supervised Hierarchical Clustering Methods. ICIC (3) 2017: 719-731 - [c13]Paul C. Bell, Mika Hirvensalo, Igor Potapov:
The Identity Problem for Matrix Semigroups in SL2(ℤ) is NP-complete. SODA 2017: 187-206 - 2016
- [j12]Paul C. Bell
On the decidability and complexity of problems for restricted hierarchical hybrid systems. Theor. Comput. Sci. 652: 47-63 (2016) - [c12]Paul C. Bell
Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages. LATA 2016: 493-505 - 2015
- [j11]Paul C. Bell
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines. J. Comb. Optim. 29(4): 739-749 (2015) - [c11]Paul C. Bell
Factorization in Formal Languages. DLT 2015: 97-107 - [i1]Paul Bell, Daniel Reidenbach, Jeffrey O. Shallit:
Factorization in Formal Languages. CoRR abs/1503.06365 (2015) - 2014
- [j10]Paul Bell, Daniel Reidenbach:
Report on BCTCS 2014. Bull. EATCS 113 (2014) - [c10]Paul C. Bell, Shang Chen, Lisa M. Jackson:
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives. RP 2014: 32-44 - 2013
- [j9]Paul C. Bell
Decision Problems for Probabilistic Finite Automata on Bounded Languages. Fundam. Informaticae 123(1): 1-14 (2013) - [c9]Paul C. Bell
Reachability Problems for Hierarchical Piecewise Constant Derivative Systems. RP 2013: 46-58 - 2012
- [j8]Paul C. Bell
On the Computational Complexity of Matrix Semigroup Problems. Fundam. Informaticae 116(1-4): 1-13 (2012) - [c8]Paul C. Bell
Mortality for 2×2 Matrices Is NP-Hard. MFCS 2012: 148-159 - 2011
- [c7]Paul C. Bell
Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. TAMC 2011: 27-36 - 2010
- [j7]Paul C. Bell
On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups. Int. J. Found. Comput. Sci. 21(6): 963-978 (2010) - [j6]Paul C. Bell
The continuous Skolem-Pisot problem. Theor. Comput. Sci. 411(40-42): 3625-3634 (2010) - [c6]Paul Bell
On the Joint Spectral Radius for Bounded Matrix Languages. RP 2010: 91-103
2000 – 2009
- 2009
- [c5]Paul Bell
The Identity Correspondence Problem and Its Applications. ISAAC 2009: 657-667 - 2008
- [j5]Paul Bell
Reachability problems in quaternion matrix and rotation semigroups. Inf. Comput. 206(11): 1353-1361 (2008) - [j4]Paul Bell
Matrix Equations and Hilbert's Tenth Problem. Int. J. Algebra Comput. 18(8): 1231-1241 (2008) - [j3]Paul Bell
On undecidability bounds for matrix decision problems. Theor. Comput. Sci. 391(1-2): 3-13 (2008) - [c4]Paul Bell, Igor Potapov:
Periodic and Infinite Traces in Matrix Semigroups. SOFSEM 2008: 148-161 - 2007
- [b1]Paul C. Bell:
Computational problems in matrix semigroups. University of Liverpool, UK, 2007 - [j2]Paul Bell:
A Note on the Emptiness of Semigroup Intersections. Fundam. Informaticae 79(1-2): 1-4 (2007) - [j1]Paul Bell
On the membership of invertible diagonal and scalar matrices. Theor. Comput. Sci. 372(1): 37-45 (2007) - [c3]Paul Bell, Igor Potapov:
Reachability Problems in Quaternion Matrix and Rotation Semigroups. MFCS 2007: 346-358 - 2006
- [c2]Paul Bell
Lowering Undecidability Bounds for Decision Questions in Matrices. Developments in Language Theory 2006: 375-385 - 2005
- [c1]Paul Bell, Igor Potapov:
On the Membership of Invertible Diagonal Matrices. Developments in Language Theory 2005: 146-157
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-08 20:57 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: