Näytetään 91 - 100 yhteensä 146 tuloksesta haulle '"Theory of Computation."', hakuaika: 0,03s Tarkenna hakua
  1. 91

    Packet classification using tuple space search. Tekijä Srinivasan, V.

    Artikkeli

    Packet classification using tuple space search.
  2. 92

    Routing with a clue. Tekijä Bremler-Barr, Anat

    Artikkeli

    Routing with a clue.
  3. 93

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

    Artikkeli

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

    Splicing systems with targets are computationally universal. Tekijä Paun, Gheorghe

    Artikkeli

    Splicing systems with targets are computationally universal.
  5. 95

    Indexing compressed text. Tekijä Ferragina, Paolo

    Julkaisussa Journal of the ACM
    Artikkeli

    Indexing compressed text.
  6. 96

    Source routing and scheduling in packet networks. Tekijä Andrews, Matthew

    Julkaisussa Journal of the ACM
    Artikkeli

    Source routing and scheduling in packet networks.
  7. 97

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

    Julkaisussa Journal of the ACM
    Artikkeli

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

    Concurrent zero-knowledge. Tekijä Dwork, Cynthia

    Julkaisussa Journal of the ACM
    Artikkeli

    Concurrent zero-knowledge.
  9. 99

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

    Julkaisussa Journal of the ACM
    Artikkeli

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

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

    Julkaisussa Journal of the ACM
    Artikkeli

    Resolution lower bounds for the weak pigeonhole principle.

Työkalut: