default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTirza Hirst
Person information
- affiliation: Machon Tal, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Rina Azoulay, Tirza Hirst, Shulamit Reches:
Academia and Industry Synergy: Addressing Integrity Challenge in Programming Education. ICAART (3) 2024: 1135-1143
2010 – 2019
- 2019
- [j8]Nadav Schweitzer, Ariel Stulman
, Tirza Hirst, Roy David Margalit, Asaf Shabtai:
Network bottlenecks in OLSR based ad-hoc networks. Ad Hoc Networks 88: 36-54 (2019) - 2016
- [j7]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings. Theor. Comput. Sci. 656: 146-159 (2016) - 2014
- [c6]Amihood Amir, Alberto Apostolico, Tirza Hirst, Gad M. Landau, Noa Lewenstein, Liat Rozenberg:
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings. SPIRE 2014: 45-51
2000 – 2009
- 2009
- [j6]Tirza Hirst:
A Rice-style theorem for parallel automata. Inf. Comput. 207(1): 1-13 (2009) - 2001
- [j5]Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein:
Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001)
1990 – 1999
- 1999
- [j4]Tirza Hirst, Moshe Lewenstein:
Alternation and Bounded Concurrency Are Reverse Equivalent. Inf. Comput. 152(2): 173-187 (1999) - 1998
- [c5]Richard Beigel, Tirza Hirst:
One Help Bit Doesn't Help. STOC 1998: 124-130 - 1996
- [j3]Tirza Hirst, David Harel:
Completeness Results for Recursive Data Bases. J. Comput. Syst. Sci. 52(3): 522-536 (1996) - [j2]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) - [c4]Tirza Hirst, David Harel:
More About Recursive Structures: Descriptive Complexity and Zero-One Laws. LICS 1996: 334-347 - 1994
- [j1]Tirza Hirst, David Harel:
On the Power of Bounded Concurrency II: Pushdown Automata. J. ACM 41(3): 540-554 (1994) - 1993
- [c3]Tirza Hirst, David Harel:
Taking it to the Limit: On Infinite Variants of NP-Complete Problems. SCT 1993: 292-304 - [c2]Tirza Hirst, David Harel:
Completeness Results for Recursive Data Bases. PODS 1993: 244-252 - 1990
- [c1]Tirza Hirst, David Harel:
On the Power of Bounded Concurrency II: The Pushdown Automata Level. CAAP 1990: 1-17
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
