Search the dblp DataBase
Tirza Hirst :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Tirza Hirst , David Harel Completeness Results for Recursive Data Bases. [Citation Graph (5, 4)][DBLP ] PODS, 1993, pp:244-252 [Conf ] Tirza Hirst , David Harel On the Power of Bounded Concurrency II: The Pushdown Automata Level. [Citation Graph (0, 0)][DBLP ] CAAP, 1990, pp:1-17 [Conf ] Tirza Hirst , David Harel Taking it to the Limit: On Infinite Variants of NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1993, pp:292-304 [Conf ] Tirza Hirst , David Harel More About Recursive Structures: Descriptive Complexity and Zero-One Laws. [Citation Graph (0, 0)][DBLP ] LICS, 1996, pp:334-347 [Conf ] Richard Beigel , Tirza Hirst One Help Bit Doesn't Help. [Citation Graph (0, 0)][DBLP ] STOC, 1998, pp:124-130 [Conf ] Martin Charles Golumbic , Tirza Hirst , Moshe Lewenstein Uniquely Restricted Matchings. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2001, v:31, n:2, pp:139-154 [Journal ] Tirza Hirst , Moshe Lewenstein Alternation and Bounded Concurrency Are Reverse Equivalent. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1999, v:152, n:2, pp:173-187 [Journal ] Tirza Hirst , David Harel On the Power of Bounded Concurrency II: Pushdown Automata. [Citation Graph (0, 0)][DBLP ] J. ACM, 1994, v:41, n:3, pp:540-554 [Journal ] Tirza Hirst , David Harel Completeness Results for Recursive Data Bases. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1996, v:52, n:3, pp:522-536 [Journal ] Tirza Hirst , David Harel Taking It to the Limit: On Infinite Variants of NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1996, v:53, n:2, pp:180-193 [Journal ] Search in 0.002secs, Finished in 0.003secs