scientific article
From MaRDI portal
Publication:3793740
zbMath0648.68073MaRDI QIDQ3793740
I. V. Ramakrishnan, Scott A. Smolka, Gurdip Singh
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
time complexitybit complexitytree pattern matchingbottom-up algorithmmultiple patternstop-down algorithmefficient distributed algorithms
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Об асимптотической нормальности в задаче о повторениях цепочек в помеченном полном дереве ⋮ Conditions for asymptotic normality of the number of multiple repetitions of chains in marked complete trees and forests;Условия асимптотической нормальности числа кратных повторений цепочек в помеченных полных деревьях и лесах
This page was built for publication:
