Paul C. Bell

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 29

Top Venues

CoRR

MFCS

Inf. Comput.

J. Comput. Syst. Sci.

University of Liverpool, UK (PHD)

Education History

University of Liverpool, UK

PHD

Publications

Paul C. Bell, Mika Hirvensalo, Igor Potapov
The membership problem for subsemigroups of GL2(Z) is NP-complete. Inf. Comput. 296 (2024)
Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin
On the Identity and Group Problems for Complex Heisenberg Matrices. RP (2023)
Paul C. Bell, Pavel Semukhin
Decision Questions for Probabilistic Automata on Small Alphabets. Log. Methods Comput. Sci. 19 (4) (2023)
Paul C. Bell, Reino Niskanen, Igor Potapov, Pavel Semukhin
On the Identity and Group Problems for Complex Heisenberg Matrices. CoRR (2023)
Paul C. Bell, Igor Potapov
Towards Uniform Online Spherical Tessellations. Discret. Comput. Geom. 67 (4) (2022)
Paul C. Bell, Igor Potapov, Sylvain Schmitz, Patrick Totzke
Preface. Fundam. Informaticae 189 (3-4) (2022)
Paul C. Bell
Polynomially ambiguous probabilistic automata on restricted languages. J. Comput. Syst. Sci. 127 (2022)
Paul C. Bell, Mika Hirvensalo
On injectivity of quantum finite automata. J. Comput. Syst. Sci. 122 (2021)
Paul C. Bell, Igor Potapov, Pavel Semukhin
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond. Inf. Comput. 281 (2021)
Paul C. Bell, Pavel Semukhin
Decision Questions for Probabilistic Automata on Small Alphabets. MFCS (2021)
Paul C. Bell, Pavel Semukhin
Decision Questions for Probabilistic Automata on Small Alphabets. CoRR (2021)
Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
Unique decipherability in formal languages. Theor. Comput. Sci. 804 (2020)
Paul C. Bell, Pavel Semukhin
Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. CONCUR (2020)
Paul C. Bell, Pavel Semukhin
Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata. CoRR (2020)
Paul C. Bell, Shang Chen, Lisa M. Jackson
Freeness properties of weighted and probabilistic automata over bounded languages. Inf. Comput. 269 (2019)
Paul C. Bell, Igor Potapov, Pavel Semukhin
Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond. CoRR (2019)
Paul C. Bell, Igor Potapov, Pavel Semukhin
On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. MFCS (2019)
Paul C. Bell, Igor Potapov
Towards Uniform Online Spherical Tessellations. CiE (2019)
Paul C. Bell, Mika Hirvensalo
Acceptance Ambiguity for Quantum Automata. MFCS (2019)
Paul C. Bell, Mika Hirvensalo
Acceptance Ambiguity for Quantum Automata. CoRR (2019)
Paul C. Bell
Polynomially Ambiguous Probabilistic Automata on Restricted Languages. CoRR (2019)
Paul C. Bell
Polynomially Ambiguous Probabilistic Automata on Restricted Languages. ICALP (2019)
Paul C. Bell, Igor Potapov
Towards Uniform Online Spherical Tessellations. CoRR (2018)
Abeer Aljohani, Daphne Teck Ching Lai, Paul C. Bell, Eran A. Edirisinghe
A Comparison of Distance Metrics in Semi-supervised Hierarchical Clustering Methods. ICIC (3) (2017)
Paul C. Bell, Mika Hirvensalo, Igor Potapov
(ℤ) is NP-complete. SODA (2017)
Paul C. Bell, Shang Chen, Lisa M. Jackson
Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages. LATA (2016)
Paul C. Bell, Shang Chen, Lisa M. Jackson
On the decidability and complexity of problems for restricted hierarchical hybrid systems. Theor. Comput. Sci. 652 (2016)
Paul C. Bell, Prudence W. H. Wong
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines. J. Comb. Optim. 29 (4) (2015)
Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit
Factorization in Formal Languages. DLT (2015)
Paul C. Bell, Shang Chen, Lisa M. Jackson
Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives. RP (2014)
Paul C. Bell, Vesa Halava, Mika Hirvensalo
Decision Problems for Probabilistic Finite Automata on Bounded Languages. Fundam. Informaticae 123 (1) (2013)
Paul C. Bell, Shang Chen
Reachability Problems for Hierarchical Piecewise Constant Derivative Systems. RP (2013)
Paul C. Bell, Mika Hirvensalo, Igor Potapov
Mortality for 2×2 Matrices Is NP-Hard. MFCS (2012)
Paul C. Bell, Igor Potapov
On the Computational Complexity of Matrix Semigroup Problems. Fundam. Informaticae 116 (1-4) (2012)
Paul C. Bell, Prudence W. H. Wong
Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. TAMC (2011)
Paul C. Bell, Igor Potapov
On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups. Int. J. Found. Comput. Sci. 21 (6) (2010)
Paul C. Bell, Jean-Charles Delvenne, Raphaël M. Jungers, Vincent D. Blondel
The continuous Skolem-Pisot problem. Theor. Comput. Sci. 411 (40-42) (2010)

Paul C. Bell.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Paul C. Bell