Suchergebnisse - "optimal speedup parallel string matching algorithm"

  • Treffer 1 - 1 von 1
Treffer weiter einschränken
  1. 1

    Faster Parallel String Matching via Larger Deterministic Samples: Faster parallel string matching via larger deterministic samples

    Autoren: Tal Goldberg Uri Zwick

    Quelle: Journal of Algorithms. 16:295-308

    Schlagwörter: Analysis of algorithms and problem complexity, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, optimal speedup parallel string matching algorithm, Searching and sorting, 01 natural sciences

    Dateibeschreibung: application/xml

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: