On the Power of Bounded Concurrency II: The Pushdown Automata Level. - Tirza Hirst; David Harel (CAAP, 1990)

On the Power of Bounded Concurrency II: Pushdown Automata. - Tirza Hirst; David Harel (J. ACM, 1994)

More About Recursive Structures: Descriptive Complexity and Zero-One Laws. - Tirza Hirst; David Harel (LICS, 1996)

Completeness Results for Recursive Data Bases. - Tirza Hirst; David Harel (J. Comput. Syst. Sci., 1996)

Taking It to the Limit: On Infinite Variants of NP-Complete Problems. - Tirza Hirst; David Harel (J. Comput. Syst. Sci., 1996)

One Help Bit Doesn't Help. - Richard Beigel; Tirza Hirst (STOC, 1998)

Alternation and Bounded Concurrency Are Reverse Equivalent. - Tirza Hirst; Moshe Lewenstein (Inf. Comput., 1999)

Uniquely Restricted Matchings. - Martin Charles Golumbic; Tirza Hirst; Moshe Lewenstein (Algorithmica, 2001)

A Rice-style theorem for parallel automata. - Tirza Hirst (Inf. Comput., 2009)

Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. - Amihood Amir; Alberto Apostolico; Tirza Hirst; Gad M. Landau; Noa Lewenstein; Liat Rozenberg (Theor. Comput. Sci., 2016)

Network bottlenecks in OLSR based ad-hoc networks. - Nadav Schweitzer; Ariel Stulman; Tirza Hirst; Roy David Margalit; Asaf Shabtai (Ad Hoc Networks, 2019)

Academia and Industry Synergy: Addressing Integrity Challenge in Programming Education. - Rina Azoulay; Tirza Hirst; Shulamit Reches (ICAART (3), 2024)

Integrity in the AI Era: Collaborative Solutions for Programming Education. - Rina Azoulay; Tirza Hirst; Shulamit Reches (ICAART (Revised Selected Paper, 2), 2024)

Achieving manet protection without the use of superfluous fictitious nodes. - Nadav Schweitzer; Liad Cohen; Tirza Hirst; Amit Dvir; Ariel Stulman (Comput. Commun., 2025)