Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
Constant-space string-matching

Constant-space string-matching

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 338/1988
BookFoundations of Software Technology and Theoretical Computer Science
DOI10.1007/3-540-50517-2
Copyright1988
ISBN978-3-540-50517-4
CategorySession 3 Algorithms
DOI10.1007/3-540-50517-2_72
Pages80-87
Subject CollectionComputer Science
SpringerLink DateFriday, January 20, 2006
Add to marked items

Session 3 Algorithms

Constant-space string-matching

Maxime Crochemore1

(1)  Université de Paris-Nord, avenue J-B Clément, F-93430 Villetaneuse
Abstract
We present a string-matching algorithm with the following properties: it is linear in time with a small multiplicative constant during all its phases; it processes the searched text with constant memory space in addition to the string.
This work has been supported by PRC Math.-Info.
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.111 • Server: mpweb24
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)