Norbert Blum

37 papers A* 4A 3Journal 19Unranked 4
YearRankTypeTitle / Venue / Authors
2024 J jnl
On the approximation method and the P versus NP problem.
Electron. Colloquium Comput. Complex.
Norbert Blum
2015 J jnl
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited.
CoRR
Norbert Blum
2015 J jnl
On LR(k)-parsers of polynomial size.
CoRR
Norbert Blum
2011 — ch.
Dynamic Programming - Evolutionary Distance.
Algorithms Unplugged
Norbert Blum, Matthias Kretschmer
2010 — conf
On
ICALP (2)
Norbert Blum
2009 — conf
On Negations in Boolean Networks.
Efficient Algorithms
Norbert Blum
2008 — ch.
Dynamische Programmierung: Evolutionäre Distanz.
Taschenbuch der Algorithmen
Norbert Blum, Matthias Kretschmer
2007 — book
Einführung in formale Sprachen, Berechenbarkeit, Informations- und Lerntheorie.
Norbert Blum
2004 — book
Algorithmen und Datenstrukturen - eine anwendungsorientierte Einführung.
Norbert Blum
2001 J jnl
On parsing LL-languages.
Theor. Comput. Sci.
Norbert Blum
2001 — book
Theoretische Informatik: Eine anwendungsorientierte Einführung, 2. Auflage
Norbert Blum
2000 J jnl
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology.
J. Algorithms
Norbert Blum
1999 J jnl
Greibach Normal Form Transformation Revisited.
Inf. Comput.
Norbert Blum, Robert Koch
1998 — conf
On Parsing LL-Languages.
Workshop on Implementing Automata
Norbert Blum
1998 — book
Theoretische Informatik - eine anwendungsorientierte Einführung.
Norbert Blum
1997 A conf
Greibach Normal Form Transformation, Revisited.
STACS
Robert Koch, Norbert Blum
1996 J jnl
An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata.
Inf. Process. Lett.
Norbert Blum
1995 J jnl
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits.
Inf. Process. Lett.
Y. Daniel Liang, Norbert Blum
1994 J jnl
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals.
Inf. Process. Lett.
Norbert Blum, Henning Rochow
1992 A conf
On Locally Optimal Alignments in Genetic Sequences.
STACS
Norbert Blum
1991 J jnl
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n).
Inf. Process. Lett.
Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul
1990 A* conf
A New Approach to Maximum Matching in General Graphs.
ICALP
Norbert Blum
1986 J jnl
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem.
SIAM J. Comput.
Norbert Blum
1985 J jnl
An Area-Maximum Edge Length Trade-off for VLSI Layout
Inf. Control.
Norbert Blum
1985 J jnl
An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution.
Theor. Comput. Sci.
Norbert Blum
1985 A conf
On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem.
STACS
Norbert Blum
1984 J jnl
A Boolean Function Requiring 3n Network Size.
Theor. Comput. Sci.
Norbert Blum
1984 A* conf
An Area-Maximum Edge Length Tradeoff for VLSI Layout
STOC
Norbert Blum
1984 J jnl
Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR.
Acta Informatica
Norbert Blum, Martin Seysen
1983 J jnl
A Note on the 'Parallel Computation Thesis'.
Inf. Process. Lett.
Norbert Blum
1983 J jnl
More on the Power of Chain Rules in Context-Free Grammars.
Theor. Comput. Sci.
Norbert Blum
1982 A* conf
On the Power of Chain Rules in Context Free Grammars.
ICALP
Norbert Blum
1982 J jnl
On the Power of Chain Rules in Context Free Grammars.
Acta Informatica
Norbert Blum
1981 A* conf
An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution
FOCS
Norbert Blum
1981 — —
Eine Ω(n4/3) [Omega-n] untere Schranke für die monotone Schaltkreiskomplexität von n-te Grad Convolution.
Norbert Blum
1980 J jnl
On the Average Number of Rebalancing Operations in Weight-Balanced Trees.
Theor. Comput. Sci.
Norbert Blum, Kurt Mehlhorn
1979 — conf
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen.
Theoretical Computer Science
Norbert Blum, Kurt Mehlhorn