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
Hilfe
Suche: Author="Hirst, Tirza"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Rice-style theorem for parallel automata
Tirza Hirst
Information and Computation
207
(1), 2009, pp. 1-13
Closures on COPs form complete lattices
Tirza Hirst
,
Moshe Lewenstein
Information and Computation
152
(2), 1999, pp. 173-187
One help bit doesn't help
Richard Beigel
,
Tirza Hirst
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 124-130
Completeness results for recursive data bases
Tirza Hirst
,
David Harel
Journal of Computer and System Sciences
52
(3), 1996, pp. 522-536
Taking it to the limit: On infinite variants of
NP
-complete problems
Tirza Hirst
,
David Harel
Journal of Computer and System Sciences
53
(2), 1996, pp. 180-193
On the power of bounded concurrency II: Pushdown automata
Tirza Hirst
,
David Harel
Journal of the ACM
41
(3), 1994, May, pp. 540-554
Taking it to the limit: On infinite variants of NP-complete problems
Tirza Hirst
,
David Harel
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 292-304