We stand with Ukraine  

Norbert Blum

Affiliations:
  • University of Bonn, Germany


According to our database1, Norbert Blum authored at least 31 papers between 1979 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2015
On LR(k)-parsers of polynomial size.
[BibTeX]
[DOI]
Norbert Blum
CoRR, 2015

Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited.
[BibTeX]
[DOI]
Norbert Blum
CoRR, 2015

2011
Dynamic Programming - Evolutionary Distance.
[BibTeX]
[DOI]
Norbert Blum
,
Matthias Kretschmer
Proceedings of the Algorithms Unplugged, 2011

2010
On <i>LR</i>(<i>k</i>)-Parsers of Polynomial Size.
[BibTeX]
[DOI]
Norbert Blum
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
On Negations in Boolean Networks.
[BibTeX]
[DOI]
Norbert Blum
Proceedings of the Efficient Algorithms, 2009

2008
Dynamische Programmierung: Evolutionäre Distanz.
[BibTeX]
[DOI]
Norbert Blum
,
Matthias Kretschmer
Proceedings of the Taschenbuch der Algorithmen, 2008

2007
Einführung in formale Sprachen, Berechenbarkeit, Informations- und Lerntheorie.
[BibTeX]
Norbert Blum
Oldenbourg, ISBN: 978-3-486-27433-2, 2007

2004
Algorithmen und Datenstrukturen - eine anwendungsorientierte Einführung.
[BibTeX]
Norbert Blum
Oldenbourg, ISBN: 978-3-486-27394-6, 2004

2001
On parsing LL-languages.
[BibTeX]
[DOI]
Norbert Blum
Theor. Comput. Sci., 2001

Theoretische Informatik: Eine anwendungsorientierte Einführung, 2. Auflage
[BibTeX]
Norbert Blum
Oldenbourg, ISBN: 3-486-25776-5, 2001

2000
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology.
[BibTeX]
[DOI]
Norbert Blum
J. Algorithms, 2000

1999
Greibach Normal Form Transformation Revisited.
[BibTeX]
[DOI]
Norbert Blum
,
Robert Koch
Inf. Comput., 1999

1998
Theoretische Informatik - eine anwendungsorientierte Einführung.
[BibTeX]
Norbert Blum
Oldenbourg, ISBN: 978-3-486-24279-9, 1998

1996
An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata.
[BibTeX]
[DOI]
Norbert Blum
Inf. Process. Lett., 1996

1995
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits.
[BibTeX]
[DOI]
Y. Daniel Liang
,
Norbert Blum
Inf. Process. Lett., 1995

1994
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals.
[BibTeX]
[DOI]
Norbert Blum
,
Henning Rochow
Inf. Process. Lett., 1994

1992
On Locally Optimal Alignments in Genetic Sequences.
[BibTeX]
[DOI]
Norbert Blum
Proceedings of the STACS 92, 1992

1991
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).
[BibTeX]
[DOI]
Helmut Alt
,
Norbert Blum
,
Kurt Mehlhorn
,
Markus Paul
Inf. Process. Lett., 1991

1990
A New Approach to Maximum Matching in General Graphs.
[BibTeX]
[DOI]
Norbert Blum
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1986
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem.
[BibTeX]
[DOI]
Norbert Blum
SIAM J. Comput., 1986

1985
An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution.
[BibTeX]
[DOI]
Norbert Blum
Theor. Comput. Sci., 1985

An Area-Maximum Edge Length Trade-off for VLSI Layout
[BibTeX]
[DOI]
Norbert Blum
Inf. Control., 1985

1984
A Boolean Function Requiring 3n Network Size.
[BibTeX]
[DOI]
Norbert Blum
Theor. Comput. Sci., 1984

Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR.
[BibTeX]
[DOI]
Norbert Blum
,
Martin Seysen
Acta Informatica, 1984

An Area-Maximum Edge Length Tradeoff for VLSI Layout
[BibTeX]
[DOI]
Norbert Blum
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
More on the Power of Chain Rules in Context-Free Grammars.
[BibTeX]
[DOI]
Norbert Blum
Theor. Comput. Sci., 1983

A Note on the 'Parallel Computation Thesis'.
[BibTeX]
[DOI]
Norbert Blum
Inf. Process. Lett., 1983

1982
On the Power of Chain Rules in Context Free Grammars.
[BibTeX]
[DOI]
Norbert Blum
Acta Informatica, 1982

1981
Eine Ω(n4/3) [Omega-n] untere Schranke für die monotone Schaltkreiskomplexität von n-te Grad Convolution.
[BibTeX]
[DOI]
Norbert Blum
PhD thesis, 1981

1980
On the Average Number of Rebalancing Operations in Weight-Balanced Trees.
[BibTeX]
[DOI]
Norbert Blum
,
Kurt Mehlhorn
Theor. Comput. Sci., 1980

1979
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.
[BibTeX]
[DOI]
Norbert Blum
,
Kurt Mehlhorn
Proceedings of the Theoretical Computer Science, 1979


  Loading...