Norbert Blum On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem. [Citation Graph (0, 0)][DBLP] STACS, 1985, pp:32-38 [Conf]
Norbert Blum An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:57, n:2, pp:65-59 [Journal]
Norbert Blum, Henning Rochow A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:51, n:2, pp:57-60 [Journal]
Norbert Blum Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2000, v:35, n:2, pp:129-168 [Journal]
Norbert Blum On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1986, v:15, n:4, pp:1021-1024 [Journal]
Norbert Blum More on the Power of Chain Rules in Context-Free Grammars. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1983, v:27, n:, pp:287-295 [Journal]