Search Results - Hirst, Tirza

  • Showing 1 - 10 results of 10
Refine Results
  1. 1
    Achieving manet protection without the use of superfluous fictitious nodes

    Achieving manet protection without the use of superfluous fictitious nodes by Schweitzer, Nadav, Cohen, Liad, Hirst, Tirza, Dvir, Amit, Stulman, Ariel

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  2. 2
    Network bottlenecks in OLSR based ad-hoc networks

    Network bottlenecks in OLSR based ad-hoc networks by Schweitzer, Nadav, Stulman, Ariel, Hirst, Tirza, Margalit, Roy David, Shabtai, Asaf

    Published in Ad hoc networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings

    Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings by Amir, Amihood, Apostolico, Alberto, Hirst, Tirza, Landau, Gad M., Lewenstein, Noa, Rozenberg, Liat

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    A Rice-style theorem for parallel automata

    A Rice-style theorem for parallel automata by Hirst, Tirza

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  5. 5
    On the power of bounded concurrency II

    On the power of bounded concurrency II by Hirst, Tirza, Harel, David

    Published in Journal of the ACM
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Alternation and Bounded Concurrency Are Reverse Equivalent

    Alternation and Bounded Concurrency Are Reverse Equivalent by Hirst, Tirza, Lewenstein, Moshe

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    Taking It to the Limit: On Infinite Variants of NP-Complete Problems

    Taking It to the Limit: On Infinite Variants of NP-Complete Problems by Hirst, Tirza, Harel, David

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    On the power of bounded concurrency. II: Pushdown automata

    On the power of bounded concurrency. II: Pushdown automata by HIRST, T, HAREL, D

    Published in Journal of the ACM
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  9. 9
    Completeness Results for Recursive Data Bases

    Completeness Results for Recursive Data Bases by Hirst, Tirza, Harel, David

    Get full text
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    More about recursive structures: descriptive complexity and zero-one laws

    More about recursive structures: descriptive complexity and zero-one laws by Hirst, T., Harel, D.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:

Search Tools: