Norbert Blum

发表

Greibach Normal Form Transformation Revisited

Norbert Blum, Robert Koch, Norbert Blum, 1999, Inf. Comput..

A Solution of the P versus NP Problem

Norbert Blum, 2017, 1708.03486.

On Negations in Boolean Networks

Norbert Blum, Norbert Blum, 2009, Efficient Algorithms.

An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution

Norbert Blum, Norbert Blum, 1985, Theor. Comput. Sci..

An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata

Norbert Blum, Norbert Blum, 1996, Inf. Process. Lett..

More on the Power of Chain Rules in Context-Free Grammars

Norbert Blum, Norbert Blum, 1983, Theor. Comput. Sci..

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

Norbert Blum, Norbert Blum, 2015, ArXiv.

A New Approach to Maximum Matching in General Graphs

Norbert Blum, Norbert Blum, 1990, ICALP.

Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n)

Kurt Mehlhorn, Norbert Blum, Helmut Alt, 1991, Inf. Process. Lett..

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

Kurt Mehlhorn, Norbert Blum, K. Mehlhorn, 1980, Theor. Comput. Sci..

On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem

Norbert Blum, Norbert Blum, 1986, SIAM J. Comput..