SIGN IN
SIGN UP
Pattern matching in dynamic texts
Full Text:
PDF
Buy this Article
Authors:
Stephen Alstrup
The IT University in Copenhagen, Glentevej 67, DK-2400 Copenhagen NV, Denmark
Gerth Stølting Brodal
BRICS, Basic Research in Computer Science, Centre of the Danish National Research Foundation and Department of Computer Science, University of Aarhus, Ny Munkegade, DK-8000 Ârhus C, Denmark
Theis Rauhe
The IT University in Copenhagen, Glentevej 67, DK-2400 Copenhagen NV, Denmark
Published in:
· Proceeding
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Pages 819-828
Society for Industrial and Applied Mathematics
Philadelphia, PA
, USA
©2000
table of contents
ISBN:0-89871-453-2
2000 Article
Bibliometrics
· Downloads (6 Weeks): 24
· Downloads (12 Months): 70
· Downloads (cumulative): 529
· Citation Count: 11
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
design
documentation
pattern matching
performance
sorting and searching
text analysis
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder