Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3883604

From MaRDI portal
Publication:3217596
Jump to:navigation, search

zbMATH Open0554.68024MaRDI QIDQ3217596FDOQ3217596

Michèle Soria, Jean-Marc Steyaert

Publication date: 1984



Title of this publication is not available (Why is that?)



Recommendations

  • Patterns and pattern-matching in trees: An analysis
  • scientific article; zbMATH DE number 862545
  • Average-case analysis of pattern-matching in trees under the BST probability model
  • Waiting time and complexity for matching patterns with automata
  • An analytical comparison of two string searching algorithms


zbMATH Keywords

asymptotic analysiscombinatorial analysisaverage time complexitygeneralized Pattern Matching algorithm


Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25)



Cited In (2)

  • Complexity analysis of term-rewriting systems
  • Average Case Analysis of Marking Algorithms





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217596)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3217596&oldid=16388948"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 22:03. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki