Norbert Blum

Publication Activity (10 Years)

Years Active: 1979-2015
Publications (10 Years): 0

Top Venues

CoRR

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Norbert Blum
On LR(k)-parsers of polynomial size. CoRR (2015)
Norbert Blum
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited. CoRR (2015)
Norbert Blum
)-Parsers of Polynomial Size. ICALP (2) (2010)
Norbert Blum
On Negations in Boolean Networks. Efficient Algorithms (2009)
Norbert Blum
On parsing LL-languages. Theor. Comput. Sci. 267 (1-2) (2001)
Norbert Blum
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology. J. Algorithms 35 (2) (2000)
Norbert Blum, Robert Koch
Greibach Normal Form Transformation Revisited. Inf. Comput. 150 (1) (1999)
Norbert Blum
On Parsing LL-Languages. Workshop on Implementing Automata (1998)
Robert Koch, Norbert Blum
Greibach Normal Form Transformation, Revisited. STACS (1997)
Norbert Blum
An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata. Inf. Process. Lett. 57 (2) (1996)
Y. Daniel Liang, Norbert Blum
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. Inf. Process. Lett. 56 (4) (1995)
Norbert Blum, Henning Rochow
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. Inf. Process. Lett. 51 (2) (1994)
Norbert Blum
On Locally Optimal Alignments in Genetic Sequences. STACS (1992)
Helmut Alt, Norbert Blum, Kurt Mehlhorn, Markus Paul
Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n). Inf. Process. Lett. 37 (4) (1991)
Norbert Blum
A New Approach to Maximum Matching in General Graphs. ICALP (1990)
Norbert Blum
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. SIAM J. Comput. 15 (4) (1986)
Norbert Blum
On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem. STACS (1985)
Norbert Blum
An Area-Maximum Edge Length Trade-off for VLSI Layout Inf. Control. 66 (1/2) (1985)
Norbert Blum
An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution. Theor. Comput. Sci. 36 (1985)
Norbert Blum
An Area-Maximum Edge Length Tradeoff for VLSI Layout STOC (1984)
Norbert Blum
A Boolean Function Requiring 3n Network Size. Theor. Comput. Sci. 28 (1984)
Norbert Blum, Martin Seysen
Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR. Acta Informatica 21 (1984)
Norbert Blum
A Note on the 'Parallel Computation Thesis'. Inf. Process. Lett. 17 (4) (1983)
Norbert Blum
More on the Power of Chain Rules in Context-Free Grammars. Theor. Comput. Sci. 27 (1983)
Norbert Blum
On the Power of Chain Rules in Context Free Grammars. ICALP (1982)
Norbert Blum
On the Power of Chain Rules in Context Free Grammars. Acta Informatica 17 (1982)
Norbert Blum
An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution FOCS (1981)
Norbert Blum, Kurt Mehlhorn
On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. 11 (1980)
Norbert Blum, Kurt Mehlhorn
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. Theoretical Computer Science (1979)

Norbert Blum.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Norbert Blum