Space complexity in on-line computation
Hajime Machida,Takumi Kasai +1 more
TLDR
A technique is developed for determining space complexity in on-line computation and it is shown that each of the following functions requires linear space.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1982-06-01 and is currently open access. It has received 36 citations till now. The article focuses on the topics: Binary operation & Polish notation.read more
Citations
More filters
Book ChapterDOI
Spanning Trees and Spanners
TL;DR: This work surveys results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
Journal ArticleDOI
Incremental algorithms for minimal length paths
Giorgio Ausiello,Giuseppe F. Italiano,Giuseppe F. Italiano,Alberto Marchetti Spaccamela,Umberto Nanni +4 more
TL;DR: The problem of maintaining on-line a solution to the All Pairs Shortest Paths Problem in a directed graph G = (V,E) where edges may be dynamically inserted or have their cost decreased is considered and a new data structure is introduced which is able to answer queries concerning the length of the shortest path between any two vertices in constant time.
Book ChapterDOI
Dinitz' algorithm: the original version and even's version
TL;DR: The origins of the Soviet school of algorithms, which remain unknown to the Western Computer Science community, are presented, and the substantial influence of Shimon Even on the fortune of this algorithm is presented.
Journal ArticleDOI
Finding paths and deleting edges in directed acyclic graphs
TL;DR: This paper restricts ourselves to directed acyclic graphs (DAGs), and shows how to return an arbitrarily chosen path between couples of nodes (if it exists) during the deletion of edges in ark efficient manner.
Journal ArticleDOI
A new—old algorithm for minimum‐cut and maximum‐flow in closure graphs
TL;DR: The Lerchs—Grossmann algorithm (LG algorithm) solves the maximum closure which is equivalent to the minimum‐cut problem, and a linear time procedure that evaluates a feasible flow corresponding to any iteration of the algorithm is devised.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Proceedings ArticleDOI
Memory bounds for recognition of context-free and context-sensitive languages
TL;DR: The computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines is investigated and a "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy.
Journal ArticleDOI
On the Recognition of Primes by Automata
Juris Hartmanis,H. Shank +1 more
TL;DR: It is shown that the linearly bounded automaton can accept the set of primes, and it is conjectured that no automaton whose memory grows less rapidly can recognize the setof primes.
An improved overlap argument for on-line multiplication
TL;DR: A lower bound of cNlogN is proved for the mean time complexity of an on-line multitape with known upper bounds of the form cN(logN)k sub K, and for some classes the upper and lower bounds coincide.
Journal ArticleDOI
Fast on-line integer multiplication
TL;DR: A general method for converting any off-line multiplication algorithm which forms the product of two n-digit binary numbers in time F( n) into an on-line method which uses time only O(F(n) log n), assuming that F is monotone and satisfies n@?F (n) @?F(2n)/2@?kF(N) for some constant k.