| 2026 | DLT | On Word Representations and Embeddings in Complex Matrices. | Paul C. Bell, George Kenison, Reino Niskanen, Igor Potapov, Pavel Semukhin |
| 2021 | MFCS | Decision Questions for Probabilistic Automata on Small Alphabets. | Paul C. Bell, Pavel Semukhin |
| 2020 | CONCUR | Decidability of Cutpoint Isolation for Probabilistic Finite Automata on Letter-Bounded Inputs. | Paul C. Bell, Pavel Semukhin |
| 2019 | CiE | Towards Uniform Online Spherical Tessellations. | Paul C. Bell, Igor Potapov |
| 2019 | ICALP | Polynomially Ambiguous Probabilistic Automata on Restricted Languages. | Paul C. Bell |
| 2019 | MFCS | Acceptance Ambiguity for Quantum Automata. | Paul C. Bell, Mika Hirvensalo |
| 2019 | MFCS | On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond. | Paul C. Bell, Igor Potapov, Pavel Semukhin |
| 2017 | SODA | The Identity Problem for Matrix Semigroups in SL | Paul C. Bell, Mika Hirvensalo, Igor Potapov |
| 2016 | LATA | Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages. | Paul C. Bell, Shang Chen, Lisa M. Jackson |
| 2015 | DLT | Factorization in Formal Languages. | Paul C. Bell, Daniel Reidenbach, Jeffrey O. Shallit |
| 2012 | MFCS | Mortality for 22 Matrices Is NP-Hard. | Paul C. Bell, Mika Hirvensalo, Igor Potapov |
| 2011 | TAMC | Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines. | Paul C. Bell, Prudence W. H. Wong |