Norbert Blum

According to our database, Norbert Blum authored at least 32 papers between 1979 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

On the approximation method and the P versus NP problem.

Norbert Blum

Electron. Colloquium Comput. Complex., 2024

2015

On LR(k)-parsers of polynomial size.

Norbert Blum

CoRR, 2015

Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited.

Norbert Blum

CoRR, 2015

2011

Dynamic Programming - Evolutionary Distance.

Norbert Blum, Matthias Kretschmer

Proceedings of the Algorithms Unplugged, 2011

2010

On <i>LR</i>(<i>k</i>)-Parsers of Polynomial Size.

Norbert Blum

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

On Negations in Boolean Networks.

Norbert Blum

Proceedings of the Efficient Algorithms, 2009

2008

Dynamische Programmierung: Evolutionäre Distanz.

Norbert Blum, Matthias Kretschmer

Proceedings of the Taschenbuch der Algorithmen, 2008

2007

Einführung in formale Sprachen, Berechenbarkeit, Informations- und Lerntheorie.

Norbert Blum

Oldenbourg, ISBN: 978-3-486-27433-2, 2007

2004

Algorithmen und Datenstrukturen - eine anwendungsorientierte Einführung.

Norbert Blum

Oldenbourg, ISBN: 978-3-486-27394-6, 2004

2001

On parsing LL-languages.

Norbert Blum

Theor. Comput. Sci., 2001

Theoretische Informatik: Eine anwendungsorientierte Einführung, 2. Auflage

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.

Norbert Blum

J. Algorithms, 2000

1999

Greibach Normal Form Transformation Revisited.

Norbert Blum, Robert Koch

Inf. Comput., 1999

1998

Theoretische Informatik - eine anwendungsorientierte Einführung.

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.

Norbert Blum

Inf. Process. Lett., 1996

1995

Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits.

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.

Norbert Blum, Henning Rochow

Inf. Process. Lett., 1994

1992

On Locally Optimal Alignments in Genetic Sequences.

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).

Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul

Inf. Process. Lett., 1991

1990

A New Approach to Maximum Matching in General Graphs.

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.

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.

Norbert Blum

Theor. Comput. Sci., 1985

An Area-Maximum Edge Length Trade-off for VLSI Layout

Norbert Blum

Inf. Control., 1985

1984

A Boolean Function Requiring 3n Network Size.

Norbert Blum

Theor. Comput. Sci., 1984

Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR.

Norbert Blum, Martin Seysen

Acta Informatica, 1984

An Area-Maximum Edge Length Tradeoff for VLSI Layout

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.

Norbert Blum

Theor. Comput. Sci., 1983

A Note on the 'Parallel Computation Thesis'.

Norbert Blum

Inf. Process. Lett., 1983

1982

On the Power of Chain Rules in Context Free Grammars.

Norbert Blum

Acta Informatica, 1982

1981

Eine Ω(n4/3) [Omega-n] untere Schranke für die monotone Schaltkreiskomplexität von n-te Grad Convolution.

Norbert Blum

PhD thesis, 1981

1980

On the Average Number of Rebalancing Operations in Weight-Balanced Trees.

Norbert Blum, Kurt Mehlhorn

Theor. Comput. Sci., 1980

1979

Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.

Norbert Blum, Kurt Mehlhorn

Proceedings of the Theoretical Computer Science, 1979