scientific article
From MaRDI portal
Publication:4003168
zbMath0748.68028MaRDI QIDQ4003168
Antoni Kreczmar, Lech Banachowski, Wojciech Rytter
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Data structures (68P05) Discrete mathematics in relation to computer science (68R99)
Related Items (9)
An optimal sublinear time parallel algorithm for some dynamic programming problems ⋮ Speeding up two string-matching algorithms ⋮ Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages ⋮ Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition ⋮ Parallel recognition and ranking of context-free languages ⋮ Context-free recognition via shortest paths computation: a version of Valiant's algorithm ⋮ Fast recognition of deterministic cfl's with a smaller number of processors ⋮ Speeding up two string-matching algorithms ⋮ Recursive circulants and their embeddings among hypercubes
This page was built for publication:
