Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Blum, Norbert"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On
LR(k)
-parsers of polynomial size
Norbert Blum
Lecture Notes in Computer Science
6199
, 2010, pp. 163-174
Dynamische Programmierung: Evolutionäre Distanz
Norbert Blum
,
Matthias Kretschmer
eXamen.press
, 2008, pp. 323-330
Algorithmen und Datenstrukturen - Eine anwendungsorientierte Einführung
Norbert Blum
Buch, 2004, pp. X, 213
Algorithmen und Datenstrukturen - Eine anwendungsorientierte Einführung
Norbert Blum
Buch, 2004, pp. x, 213
On parsing LL-languages
Norbert Blum
Theoretical Computer Science
267
(1-2), 2001, pp. 49-59
Speeding up dynamic programming without omitting any optimal solution and some applications in molecular biology
Norbert Blum
Journal of Algorithms
35
(2), 2000, pp. 129-168
Greibach normal form transformation revisited
Norbert Blum
,
Robert Koch
Information and Computation
150
(1), 1999, pp. 112-118
Theoretische Informatik: Eine anwendungsorientierte Einführung
Norbert Blum
Buch, 1998, pp. xi, 343
Greibach normal form transformation, revisited
Robert Koch
,
Norbert Blum
Lecture Notes in Computer Science
1200
, 1997, pp. 47-54
An
O(n \log n)
implementation of the standard method for minimizing
n
-state finite automata
Norbert Blum
Information Processing Letters
57
(2), 1996, pp. 65-69
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Y. Daniel Liang
,
Norbert Blum
Information Processing Letters
56
, 1995, pp. 215-219
A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals
Norbert Blum
,
Henning Rochow
Information Processing Letters
51
, 1994, pp. 57-60
An
O(n\log n)
implementation of the standard method for minimizing
n
-state finite automata
Norbert Blum
misc, 1994, June
A new approach to maximum matching in general graphs
Norbert Blum
Technical Report (8546-CS), 1994, June
Speeding up dynamic programming without omitting any optimal solution and some applications in molecular biology
Norbert Blum
Technical Report (85110-CS), 1994, April
Some remarks on the accurate notion of local optimality in genetic sequences
Norbert Blum
Technical Report (8588-CS), 1993, February
Efficient computation of all optimal alignments of two genetic sequences with concave weighting functions
Norbert Blum
Technical Report (8586-CS), 1993, February
On locally optimal local alignments and subalignments of genetic sequences with concave weighting functions
Norbert Blum
Technical Report (8587-CS), 1993, February
A new approach to maximum matching in general graphs (revised version)
Norbert Blum
Technical Report (8546-CS), 1993, May
On locally optimal alignments in genetic sequences
Norbert Blum
Lecture Notes in Computer Science
577
, 1992, pp. 425-436
Jack Edmonds original maximum matching algorithm needs only
O(n^3)
time
Norbert Blum
Technical Report (8568-CS), 1991, June
On locally optimal alignments in genetic sequences
Norbert Blum
Technical Report (8567-CS), 1991, April
A new approach to maximum matching in general graphs
Norbert Blum
Technical Report (8546-CS), 1990, February
A new approach to maximum matching in general graphs
Norbert Blum
Lecture Notes in Computer Science
443
, 1990, pp. 586-597
On the single-operation worst-case time complexity of the disjoint set union problem
Norbert Blum
Lecture Notes in Computer Science
182
, 1985, pp. 32-38
Seiten 1
2
>