The expected linearity of a simple equivalence algorithm
type: Item
instance of: scholarly article
title: The expected linearity of a simple equivalence algorithm
zbMATH Open document ID: 0377.68024
DOI: 10.1016/0304-3975(78)90009-9
author: Donald E. Knuth
author: Arnold Schönhage
published in: Theoretical Computer Science
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 3588036
MaRDI profile type: Publication
full work available at URL: 0304-3975(78)90009-9
OpenAlex ID: W1988401041
cites work: On the computational power of pushdown automata
cites work: Linear expected time of a simple union-find algorithm
cites work: Random Graphs
cites work: Q5585020
cites work: Axioms and hulls
cites work: The Expected Number of Components Under a Random Mapping Function
cites work: Q5589310
cites work: Combinatorial Algebra and Random Graphs
cites work: On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
cites work: Structure of the Random Graphs $\mathcal{G}_m (x|h)$
cites work: Q4140369
description: scientific article; zbMATH DE number 3588036