Visas 91 - 100 av 146 resultat för sökning '"Theory of computation."', Sökningstid: 0,02s Förfina resultatet
  1. 91

    Packet classification using tuple space search. av Srinivasan, V.

    Artikel

    Packet classification using tuple space search.
  2. 92

    Routing with a clue. av Bremler-Barr, Anat

    Artikel

    Routing with a clue.
  3. 93

    Negation-limited circuit complexity of symmetric functions. av Tanaka, Keisuke

    Artikel

    Negation-limited circuit complexity of symmetric functions.
  4. 94

    Splicing systems with targets are computationally universal. av Paun, Gheorghe

    Artikel

    Splicing systems with targets are computationally universal.
  5. 95

    Indexing compressed text. av Ferragina, Paolo

    I publikationen Journal of the ACM
    Artikel

    Indexing compressed text.
  6. 96

    Source routing and scheduling in packet networks. av Andrews, Matthew

    I publikationen Journal of the ACM
    Artikel

    Source routing and scheduling in packet networks.
  7. 97

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. av Kaplan, Haim

    I publikationen Journal of the ACM
    Artikel

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
  8. 98

    Concurrent zero-knowledge. av Dwork, Cynthia

    I publikationen Journal of the ACM
    Artikel

    Concurrent zero-knowledge.
  9. 99

    Fast monte-carlo algorithms for finding low-rank approximations. av Frieze, Alan

    I publikationen Journal of the ACM
    Artikel

    Fast monte-carlo algorithms for finding low-rank approximations.
  10. 100

    Resolution lower bounds for the weak pigeonhole principle. av Raz, R.

    I publikationen Journal of the ACM
    Artikel

    Resolution lower bounds for the weak pigeonhole principle.

Sökverktyg: