Tirza Hirst
Tirza Hirst
Unknown affiliation
Verified email at
Cited by
Cited by
Uniquely restricted matchings
MC Golumbic, T Hirst, M Lewenstein
Algorithmica 31, 139-154, 2001
Completeness results for recursive data bases
T Hirst, D Harel
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles …, 1993
Taking it to the limit: on infinite variants of NP-complete problems
T Hirst, D Harel
Journal of Computer and System Sciences 53 (2), 180-193, 1996
Network bottlenecks in OLSR based ad-hoc networks
N Schweitzer, A Stulman, T Hirst, RD Margalit, A Shabtai
Ad Hoc Networks 88, 36-54, 2019
On the power of bounded concurrency II: Pushdown automata
T Hirst, D Harel
Journal of the ACM (JACM) 41 (3), 540-554, 1994
Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
A Amir, A Apostolico, T Hirst, GM Landau, N Lewenstein, L Rozenberg
Theoretical Computer Science 656, 146-159, 2016
One help-bit doesn't help
R Beigel, T Hirst
Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998
More about recursive structures: Descriptive complexity and zero-one laws
T Hirst, D Harel
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 334-347, 1996
Detecting bottlenecks on-the-fly in OLSR based MANETs
N Schweitzer, A Stulman, T Hirst, RD Margalit, M Armon, A Shabtai
2014 IEEE 28th Convention of Electrical & Electronics Engineers in Israel …, 2014
Defining parallel automata and their conflicts
HG Mendelbaum, RB Yehezkael, T Hirst, A Teitelbaum, S Bloch
WSEAS CSCC Conference, 126-133, 2003
On the power of bounded concurrency II: The pushdown automata level
T Hirst, D Harel
Colloquium on Trees in Algebra and Programming, 1-17, 1990
On the Power of Bounded Concurrency
D Drusinsky, D Harel, T Hirst, R Rosner, M Vardi
Weizmann Institute of Science. Department of Applied Mathematics, 1989
Alternation and bounded concurrency are reverse equivalent
T Hirst, M Lewenstein
Information and Computation 152 (2), 173-187, 1999
A Rice-style theorem for parallel automata
T Hirst
Information and Computation 207 (1), 1-13, 2009
Some Theoretical Results on Parallel Automata, Conflict, Complexity
T Hirst, RB Yehezkael, HG Mendelbaum
JCT Research Report, 2003
Article ID inco. 1999.2803, available online at http: 侣 www. idealibrary. com on
B Awerbuch, GR Baliga, M Betke, J Case, T Ehrhard, J Engelfriet, ...
Information and Computation 152, 250, 1999
article no. 0044
A Amir, M Andries, E Astesiano, BS Baker, PL Bartlett, C Beeri, G Benson, ...
journal of computer and system sciences 52, 613, 1996
Are Fictitious Nodes Needed at All?
N Schweitzer, L Cohen, T Hirst, A Dvir, A Stulman
Available at SSRN 4356714, 0
The system can't perform the operation now. Try again later.
Articles 1–18