Norbert Blum - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2011

Dynamic Programming - Evolutionary DistanceNorbert Blum, Matthias Kretschmer. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 305-311, Springer, 2011. [doi]

2010

On ::::LR::::(::::k::::)-Parsers of Polynomial SizeNorbert Blum. icalp 2010: 163-174 [doi]

2009

On Negations in Boolean NetworksNorbert Blum. BIRTHDAY 2009: 18-29 [doi]

2007

Einführung in formale Sprachen, Berechenbarkeit, Informations- und LerntheorieNorbert Blum. Oldenbourg, 2007.

2004

Algorithmen und Datenstrukturen - eine anwendungsorientierte EinführungNorbert Blum. Oldenbourg, 2004.

2001

Theoretische Informatik: Eine anwendungsorientierte Einführung, 2. AuflageNorbert Blum. Oldenbourg, 2001.

On parsing LL-languagesNorbert Blum. TCS, 267(1-2):49-59, 2001. [doi]

2000

Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular BiologyNorbert Blum. jal, 35(2):129-168, 2000.

1999

Greibach Normal Form Transformation RevisitedNorbert Blum, Robert Koch. iandc, 150(1):112-118, 1999.

1998

On Parsing LL-LanguagesNorbert Blum. wia 1999: 13-21 [doi]

Theoretische Informatik - eine anwendungsorientierte EinführungNorbert Blum. Oldenbourg, 1998.

1997

Greibach Normal Form Transformation, RevisitedRobert Koch, Norbert Blum. STACS 1997: 47-54

1996

An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite AutomataNorbert Blum. ipl, 57(2):65-59, 1996. [doi]

1995

Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian CircuitsY. Daniel Liang, Norbert Blum. ipl, 56(4):215-219, 1995. [doi]

1994

A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on IntervalsNorbert Blum, Henning Rochow. ipl, 51(2):57-60, 1994.

1992

On Locally Optimal Alignments in Genetic SequencesNorbert Blum. STACS 1992: 425-436

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. ipl, 37(4):237-240, 1991.

1990

A New Approach to Maximum Matching in General GraphsNorbert Blum. icalp 1990: 586-597

1986

On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union ProblemNorbert Blum. SICOMP, 15(4):1021-1024, 1986.

1985

On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union ProblemNorbert Blum. STACS 1985: 32-38

An Area-Maximum Edge Length Trade-off for VLSI LayoutNorbert Blum. iandc, 66(1/2):45-52, July/August 1985.

An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree ConvolutionNorbert Blum. TCS, 36:59-69, 1985.

1984

Characterization of all Optimal Networks for a Simultaneous Computation of AND and NORNorbert Blum, Martin Seysen. ACTA, 21:171-181, 1984.

An Area-Maximum Edge Length Tradeoff for VLSI LayoutNorbert Blum. stoc 1984: 92-97

A Boolean Function Requiring 3n Network SizeNorbert Blum. TCS, 28:337-345, 1984.

1983

A Note on the Parallel Computation Thesis Norbert Blum. ipl, 17(4):203-205, 1983.

More on the Power of Chain Rules in Context-Free GrammarsNorbert Blum. TCS, 27:287-295, 1983.

1982

On the Power of Chain Rules in Context Free GrammarsNorbert Blum. icalp 1982: 72-82

On the Power of Chain Rules in Context Free GrammarsNorbert Blum. ACTA, 17:425-433, 1982.

1981

An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree ConvolutionNorbert Blum. focs 1981: 101-108

Eine Ω(n4/3) [Omega-n] untere Schranke für die monotone Schaltkreiskomplexität von n-te Grad ConvolutionNorbert Blum. PhD thesis, Saarland University, Saarbrücken, Germany, 1981. [doi]

1980

On the Average Number of Rebalancing Operations in Weight-Balanced TreesNorbert Blum, Kurt Mehlhorn. TCS, 11:303-320, 1980.

1979

Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten BäumenNorbert Blum, Kurt Mehlhorn. tcs 1979: 67-78

Sign in or sign up to see more results.

runs on WebDSL