Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bell, Paul"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reachability problems for hierarchical piecewise constant derivative systems
Paul C. Bell
,
Shang Chen
Lecture Notes in Computer Science
8169
, 2013, pp. 46-58
Mortality for
2\times 2
matrices is NP-hard
Paul C. Bell
,
Mika Hirvensalo
,
Igor Potapov
Lecture Notes in Computer Science
7464
, 2012, pp. 148-159
The continuous Skolem-Pisot problem
Paul C. Bell
,
Jean-Charles Delvenne
,
Raphaƫl M. Jungers
,
Vincent D. Blondel
Theoretical Computer Science
411
(40-42), 2010, pp. 3625-3634
On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
Paul C. Bell
,
Igor Potapov
International Journal of Foundations of Computer Science
21
(6), 2010, pp. 963-978
The identity correspondence problem and its applications
Paul C. Bell
,
Igor Potapov
Lecture Notes in Computer Science
5878
, 2009, pp. 657-667
Reachability problems in quaternion matrix and rotation semigroups
Paul Bell
,
Igor Potapov
Information and Computation
206
(11), 2008, pp. 1353-1361
On undecidability bounds for matrix decision problems
Paul Bell
,
Igor Potapov
Theoretical Computer Science
391
(1-2), 2008, pp. 3-13
Reachability problems in quaternion matrix and rotation semigroups
Paul Bell
,
Igor Potapov
Lecture Notes in Computer Science
4708
, 2007, pp. 346-358
On the membership of invertible diagonal and scalar matrices
Paul Bell
,
Igor Potapov
Theoretical Computer Science
372
(1), 2007, pp. 37-45