Paul Bell

Orcid: 0000-0003-2620-635X

According to our database1, Paul Bell authored at least 39 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The membership problem for subsemigroups of GL2(Z) is NP-complete.
Inf. Comput., January, 2024

2023
Decision Questions for Probabilistic Automata on Small Alphabets.
Log. Methods Comput. Sci., 2023

On the Identity and Group Problems for Complex Heisenberg Matrices.
Proceedings of the Reachability Problems - 17th International Conference, 2023

2022
Polynomially ambiguous probabilistic automata on restricted languages.
J. Comput. Syst. Sci., 2022

Preface.
Fundam. Informaticae, 2022

Towards Uniform Online Spherical Tessellations.
Discret. Comput. Geom., 2022

2021
On injectivity of quantum finite automata.
J. Comput. Syst. Sci., 2021

On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond.
Inf. Comput., 2021

2020
Unique decipherability in formal languages.
Theor. Comput. Sci., 2020

Decidability of cutpoint isolation for letter-monotonic probabilistic finite automata.
CoRR, 2020

Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Freeness properties of weighted and probabilistic automata over bounded languages.
Inf. Comput., 2019

Decidability of the Mortality Problem: from multiplicative matrix equations to linear recurrence sequences and beyond.
CoRR, 2019

Acceptance Ambiguity for Quantum Automata.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2017
The Identity Problem for Matrix Semigroups in SL<sub>2</sub>(ℤ) is NP-complete.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

A Comparison of Distance Metrics in Semi-supervised Hierarchical Clustering Methods.
Proceedings of the Intelligent Computing Methodologies - 13th International Conference, 2017

2016
On the decidability and complexity of problems for restricted hierarchical hybrid systems.
Theor. Comput. Sci., 2016

Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines.
J. Comb. Optim., 2015

Factorization in Formal Languages.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Report on BCTCS 2014.
Bull. EATCS, 2014

Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013
Decision Problems for Probabilistic Finite Automata on Bounded Languages.
Fundam. Informaticae, 2013

Reachability Problems for Hierarchical Piecewise Constant Derivative Systems.
Proceedings of the Reachability Problems - 7th International Workshop, 2013

2012
On the Computational Complexity of Matrix Semigroup Problems.
Fundam. Informaticae, 2012

Mortality for 2×2 Matrices Is NP-Hard.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2010
The continuous Skolem-Pisot problem.
Theor. Comput. Sci., 2010

On the Undecidability of the Identity Correspondence Problem and its Applications for Word and Matrix Semigroups.
Int. J. Found. Comput. Sci., 2010

On the Joint Spectral Radius for Bounded Matrix Languages.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009
The Identity Correspondence Problem and Its Applications.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
On undecidability bounds for matrix decision problems.
Theor. Comput. Sci., 2008

Matrix Equations and Hilbert's Tenth Problem.
Int. J. Algebra Comput., 2008

Reachability problems in quaternion matrix and rotation semigroups.
Inf. Comput., 2008

Periodic and Infinite Traces in Matrix Semigroups.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007
Computational problems in matrix semigroups.
PhD thesis, 2007

On the membership of invertible diagonal and scalar matrices.
Theor. Comput. Sci., 2007

A Note on the Emptiness of Semigroup Intersections.
Fundam. Informaticae, 2007

2006
Lowering Undecidability Bounds for Decision Questions in Matrices.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2005
On the Membership of Invertible Diagonal Matrices.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005


  Loading...