| 2008 |
|---|
| 27 | EE | Norbert Blum,
Matthias Kretschmer:
Dynamische Programmierung: Evolutionäre Distanz.
Taschenbuch der Algorithmen 2008: 323-330 |
| 2001 |
|---|
| 26 | | Norbert Blum:
Theoretische Informatik: Eine anwendungsorientierte Einführung, 2. Auflage
Oldenbourg 2001 |
| 25 | EE | Norbert Blum:
On parsing LL-languages.
Theor. Comput. Sci. 267(1-2): 49-59 (2001) |
| 2000 |
|---|
| 24 | | Norbert Blum:
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology.
J. Algorithms 35(2): 129-168 (2000) |
| 1999 |
|---|
| 23 | | Norbert Blum,
Robert Koch:
Greibach Normal Form Transformation Revisited.
Inf. Comput. 150(1): 112-118 (1999) |
| 1998 |
|---|
| 22 | EE | Norbert Blum:
On Parsing LL-Languages.
Workshop on Implementing Automata 1998: 13-21 |
| 1997 |
|---|
| 21 | | Robert Koch,
Norbert Blum:
Greibach Normal Form Transformation, Revisited.
STACS 1997: 47-54 |
| 1996 |
|---|
| 20 | EE | Norbert Blum:
An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata.
Inf. Process. Lett. 57(2): 65-59 (1996) |
| 1995 |
|---|
| 19 | EE | Y. Daniel Liang,
Norbert Blum:
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits.
Inf. Process. Lett. 56(4): 215-219 (1995) |
| 1994 |
|---|
| 18 | | Norbert Blum,
Henning Rochow:
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals.
Inf. Process. Lett. 51(2): 57-60 (1994) |
| 1992 |
|---|
| 17 | | Norbert Blum:
On Locally Optimal Alignments in Genetic Sequences.
STACS 1992: 425-436 |
| 1991 |
|---|
| 16 | | Helmut Alt,
Norbert Blum,
Kurt Mehlhorn,
Markus Paul:
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).
Inf. Process. Lett. 37(4): 237-240 (1991) |
| 1990 |
|---|
| 15 | | Norbert Blum:
A New Approach to Maximum Matching in General Graphs.
ICALP 1990: 586-597 |
| 1986 |
|---|
| 14 | | Norbert Blum:
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem.
SIAM J. Comput. 15(4): 1021-1024 (1986) |
| 1985 |
|---|
| 13 | | Norbert Blum:
On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem.
STACS 1985: 32-38 |
| 12 | | Norbert Blum:
An Area-Maximum Edge Length Trade-off for VLSI Layout
Information and Control 66(1/2): 45-52 (1985) |
| 11 | | Norbert Blum:
An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution.
Theor. Comput. Sci. 36: 59-69 (1985) |
| 1984 |
|---|
| 10 | | Norbert Blum:
An Area-Maximum Edge Length Tradeoff for VLSI Layout
STOC 1984: 92-97 |
| 9 | | Norbert Blum,
Martin Seysen:
Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR.
Acta Inf. 21: 171-181 (1984) |
| 8 | | Norbert Blum:
A Boolean Function Requiring 3n Network Size.
Theor. Comput. Sci. 28: 337-345 (1984) |
| 1983 |
|---|
| 7 | | Norbert Blum:
A Note on the `Parallel Computation Thesis'.
Inf. Process. Lett. 17(4): 203-205 (1983) |
| 6 | | Norbert Blum:
More on the Power of Chain Rules in Context-Free Grammars.
Theor. Comput. Sci. 27: 287-295 (1983) |
| 1982 |
|---|
| 5 | | Norbert Blum:
On the Power of Chain Rules in Context Free Grammars.
ICALP 1982: 72-82 |
| 4 | | Norbert Blum:
On the Power of Chain Rules in Context Free Grammars.
Acta Inf. 17: 425-433 (1982) |
| 1981 |
|---|
| 3 | | Norbert Blum:
An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution
FOCS 1981: 101-108 |
| 1980 |
|---|
| 2 | | Norbert Blum,
Kurt Mehlhorn:
On the Average Number of Rebalancing Operations in Weight-Balanced Trees.
Theor. Comput. Sci. 11: 303-320 (1980) |
| 1979 |
|---|
| 1 | | Norbert Blum,
Kurt Mehlhorn:
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.
Theoretical Computer Science 1979: 67-78 |
