| 2009 |
|---|
| 11 | EE | Tirza Hirst:
A Rice-style theorem for parallel automata.
Inf. Comput. 207(1): 1-13 (2009) |
| 2001 |
|---|
| 10 | EE | Martin Charles Golumbic,
Tirza Hirst,
Moshe Lewenstein:
Uniquely Restricted Matchings.
Algorithmica 31(2): 139-154 (2001) |
| 1999 |
|---|
| 9 | | Tirza Hirst,
Moshe Lewenstein:
Alternation and Bounded Concurrency Are Reverse Equivalent.
Inf. Comput. 152(2): 173-187 (1999) |
| 1998 |
|---|
| 8 | EE | Richard Beigel,
Tirza Hirst:
One Help Bit Doesn't Help.
STOC 1998: 124-130 |
| 1996 |
|---|
| 7 | | Tirza Hirst,
David Harel:
More About Recursive Structures: Descriptive Complexity and Zero-One Laws.
LICS 1996: 334-347 |
| 6 | | Tirza Hirst,
David Harel:
Completeness Results for Recursive Data Bases.
J. Comput. Syst. Sci. 52(3): 522-536 (1996) |
| 5 | | Tirza Hirst,
David Harel:
Taking It to the Limit: On Infinite Variants of NP-Complete Problems.
J. Comput. Syst. Sci. 53(2): 180-193 (1996) |
| 1994 |
|---|
| 4 | EE | Tirza Hirst,
David Harel:
On the Power of Bounded Concurrency II: Pushdown Automata.
J. ACM 41(3): 540-554 (1994) |
| 1993 |
|---|
| 3 | EE | Tirza Hirst,
David Harel:
Completeness Results for Recursive Data Bases.
PODS 1993: 244-252 |
| 2 | | Tirza Hirst,
David Harel:
Taking it to the Limit: On Infinite Variants of NP-Complete Problems.
Structure in Complexity Theory Conference 1993: 292-304 |
| 1990 |
|---|
| 1 | | Tirza Hirst,
David Harel:
On the Power of Bounded Concurrency II: The Pushdown Automata Level.
CAAP 1990: 1-17 |
