Concepedia
Theoretical Computer Science · 2010 · 15 citations · 9 references
Open access
EngineeringExtremal CasesAnalysis Of AlgorithmComputational ComplexityExtremal CombinatoricsTime ComplexityDiscrete MathematicsCombinatorial OptimizationApproximation Theory
9
A linear time solution to the single function coarsest partition problem
Robert Paige, Robert E. Tarjan, Robert Bonic · Theoretical Computer Science · 1985 · 86 citations
Mathematical Programming, Numerical Analysis, Engineering +8
Re-describing an algorithm by Hopcroft
Timo Knuutila · Theoretical Computer Science · 2001 · 75 citations
Mathematical Programming, Engineering, Algorithmic Library +5
A taxonomy of finite automata minimization algorithms
BW Bruce Watson · TU/e Research Portal (Eindhoven University of Technology) · 1993 · 59 citations · Full text
On Christoffel classes
Jean-Pierre Borel, Christophe Reutenauer · RAIRO - Theoretical Informatics and Applications · 2005 · 43 citations
Theoretical Mathematics, Coxeter Group, Combinatorics On Word +10
Circular sturmian words and Hopcroft’s algorithm
Giuseppa Castiglione, Antonio Restivo, Marinella Sciortino · Theoretical Computer Science · 2009 · 24 citations
Combinatorics On Word, Computational Complexity Theory, Time Complexity +2