Steady-paced-output and fractional-on-line algorithms on a RAM

DOI10.1016/0020-0190(82)90105-3zbMath0497.68014OpenAlexW2047259054MaRDI QIDQ1170881

Glenn K. Manacher

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90105-3

zbMATH Keywords

analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (1)

The complexity of on-line simulations between multidimensional turing machines and random access machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
• A Linear-Time On-Line Recognition Algorithm for ``Palstar
• Fast Pattern Matching in Strings
• An optimal real-time algorithm for planar convex hulls

This page was built for publication: Steady-paced-output and fractional-on-line algorithms on a RAM