Institut für Informatik V
Arbeitsgruppe Prof. Blum
Publikationen
Prof. Dr. N. Blum
N. Blum,
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited,
N. Blum,
On LR(k)-parsers of polynomial size
(
pdf
)
N. Blum,
Speeding up Dynamic Programming without Omitting any Optimal Solution and some Applications in Molecular Biology
,
Journal of Algorithms
35
(2000), 129-168
N. Blum,
On Parsing LL-Languages
,
TCS 267 (2001) 49-59
N. Blum, R. Koch,
Greibach Normal Form Transformation Revisited
,
Information and Computation
150
(1999), 112-118
N. Blum,
An O(n log n) implementation of the standard method for minimizing n-state finite automata
,
IPL
57
(1996), 65-69
N. Blum, H. Rochow
A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals
,
IPL
51
(1994), 57-60
N. Blum,
On the single-operation worst-case time complexity of the disjoint set union problem
,
SIAM J. Comput.
15
(1986), 1021-1024
N. Blum,
An Area-Maximum Edge Length Trade-off for VLSI Layout
,
Information and Control
66
(1985), 45-52
N. Blum,
An
lower bound on the monotone network complexity of the n-th degree convolution,
TCS
36
(1985), 59-69
N. Blum, M. Seysen
Chracterization of all Optimal Networks for a Simultaneous Computation of AND and NOR
,
Acta Informatica
21
(1984), 171-181
N. Blum,
A boolean funtion requiring 3n network size
,
TCS
28
(1984), 337-345
N. Blum,
More on the power of chain rules in context-free grammars
,
TCS
27
(1983), 287-295
N. Blum, K. Mehlhorn
On the average number of rebalancing operations in weight-balanced trees
,
TCS
11
(1980), 303-320
[Universität Bonn]
-
[Institut für Informatik]
-
[Abteilung V]
-
[AG Blum]
-
[Hinweise]
-
[
}
lower bound on the monotone network complexity of the n-th degree convolution,
}