On the lower bound for parallel string matching

We present a correction to a previous paper, see [G], on the lower bound for parallel string matching, and improve further the range that the lower bound holds for, from that in [BG], and [G].

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of computer mathematics 1996-01, Vol.62 (3-4), p.155-162
Hauptverfasser:	Galley, Clive N., Iliopoulosam, Costas S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Analysis of algorithms Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems design of algorithms Exact sciences and technology F1.2 F2.2 G2.1 parallel algorithms Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present a correction to a previous paper, see [G], on the lower bound for parallel string matching, and improve further the range that the lower bound holds for, from that in [BG], and [G].
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207169608804533