Výsledky vyhľadávania - "parallel string-matching algorithm"

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

Autori: Tal Goldberg Uri Zwick

Zdroj: Journal of Algorithms. 16:295-308

Predmety: 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

Popis súboru: application/xml

An Optimal O(log log n) Time Parallel Algorithm for Detecting all Squares in a String: An optimal \(O(\log\log n)\)-time parallel algorithm for detecting all squares in a string

Autori: Apostolico, Albert Breslauer, Dany

Zdroj: Department of Computer Science Technical Reports

Predmety: parallel string-matching algorithm, Computer Sciences, Analysis of algorithms and problem complexity, Distributed algorithms, Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.), 0102 computer and information sciences, 0101 mathematics, 01 natural sciences

Popis súboru: application/xml; application/pdf

Prístupová URL adresa: https://tidsskrift.dk/brics/article/download/19514/17135
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2085&context=cstech
https://tidsskrift.dk/brics/article/download/19514/17135
https://tidsskrift.dk/brics/article/view/19514
http://core.ac.uk/display/22612158
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp25.html#ApostolicoB96
https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2085&context=cstech
https://docs.lib.purdue.edu/cstech/1086/
https://epubs.siam.org/doi/10.1137/S0097539793260404
http://docs.lib.purdue.edu/cstech/1086
http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2085&context=cstech