zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Jewels of stringology. Text algorithms. (English) Zbl 1078.68151
River Edge, NJ: World Scientific (ISBN 981-02-4897-0/pbk; 981-02-4782-6/hbk; 978-981-277-822-2/ebook). x, 310 p. $ 34.00, £ 25.00pbk; $ 67.00, £ 50.00/hbk (2003).
Efficient algorithms for matching a text sample against a given text are not only theoretically interesting; they also have many important applications, ranging from basic text editor functions, over look-up operations in dictionaries, to alignment problems for DNA sequences. In their new book, the authors present some algorithmic jewels of this field, starting from textbook classics like the Knuth-Morris-Pratt and Boyer-Moore algorithms, then moving on to two-dimensional and parallel algorithms. One can only agree with the authors that such jewels deserve to shine. On the other hand, it is not so clear which group of readers profit most from this collection. Students may find the -- seemingly smooth -- text hard to read at some places, whereas the experienced reader can always resort to the excellent book on text algorithms by the same authors [Text algorithms. New York, NY: Oxford Univ. Press (1994; Zbl 0844.68101)]. Still, the book is a valuable addition to the field.

68U15Text processing; mathematical typography
68R15Combinatorics on words
68-01Textbooks (computer science)
68-02Research monographs (computer science)
68Q45Formal languages and automata
68W05Nonnumerical algorithms
68W10Parallel algorithms
68W40Analysis of algorithms
68P10Searching and sorting
Full Text: Link