default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNorbert Blum
Person information
- affiliation: University of Bonn, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Norbert Blum:
On the approximation method and the P versus NP problem. Electron. Colloquium Comput. Complex. TR24 (2024)
2010 – 2019
- 2015
- [i2]Norbert Blum:
Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited. CoRR abs/1509.04927 (2015) - [i1]Norbert Blum:
On LR(k)-parsers of polynomial size. CoRR abs/1511.05770 (2015) - 2011
- [p2]Norbert Blum, Matthias Kretschmer:
Dynamic Programming - Evolutionary Distance. Algorithms Unplugged 2011: 305-311 - 2010
- [c11]Norbert Blum:
On LR(k)-Parsers of Polynomial Size. ICALP (2) 2010: 163-174
2000 – 2009
- 2009
- [c10]Norbert Blum:
On Negations in Boolean Networks. Efficient Algorithms 2009: 18-29 - 2008
- [p1]Norbert Blum, Matthias Kretschmer:
Dynamische Programmierung: Evolutionäre Distanz. Taschenbuch der Algorithmen 2008: 323-330 - 2007
- [b5]Norbert Blum:
Einführung in formale Sprachen, Berechenbarkeit, Informations- und Lerntheorie. Oldenbourg 2007, ISBN 978-3-486-27433-2, pp. I-VIII, 1-260 - 2004
- [b4]Norbert Blum:
Algorithmen und Datenstrukturen - eine anwendungsorientierte Einführung. Oldenbourg 2004, ISBN 978-3-486-27394-6, pp. I-X, 1-213 - 2001
- [b3]Norbert Blum:
Theoretische Informatik: Eine anwendungsorientierte Einführung, 2. Auflage. Oldenbourg 2001, ISBN 3-486-25776-5 - [j16]Norbert Blum:
On parsing LL-languages. Theor. Comput. Sci. 267(1-2): 49-59 (2001) - 2000
- [j15]Norbert Blum:
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology. J. Algorithms 35(2): 129-168 (2000)
1990 – 1999
- 1999
- [j14]Norbert Blum, Robert Koch:
Greibach Normal Form Transformation Revisited. Inf. Comput. 150(1): 112-118 (1999) - 1998
- [b2]Norbert Blum:
Theoretische Informatik - eine anwendungsorientierte Einführung. Oldenbourg 1998, ISBN 978-3-486-24279-9, pp. I-XI, 1-343 - [c9]Norbert Blum:
On Parsing LL-Languages. Workshop on Implementing Automata 1998: 13-21 - 1997
- [c8]Robert Koch, Norbert Blum:
Greibach Normal Form Transformation, Revisited. STACS 1997: 47-54 - 1996
- [j13]Norbert Blum:
An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata. Inf. Process. Lett. 57(2): 65-59 (1996) - 1995
- [j12]Y. Daniel Liang, Norbert Blum:
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. Inf. Process. Lett. 56(4): 215-219 (1995) - 1994
- [j11]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): 57-60 (1994) - 1992
- [c7]Norbert Blum:
On Locally Optimal Alignments in Genetic Sequences. STACS 1992: 425-436 - 1991
- [j10]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): 237-240 (1991) - 1990
- [c6]Norbert Blum:
A New Approach to Maximum Matching in General Graphs. ICALP 1990: 586-597
1980 – 1989
- 1986
- [j9]Norbert Blum:
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. SIAM J. Comput. 15(4): 1021-1024 (1986) - 1985
- [j8]Norbert Blum:
An Area-Maximum Edge Length Trade-off for VLSI Layout. Inf. Control. 66(1/2): 45-52 (1985) - [j7]Norbert Blum:
An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution. Theor. Comput. Sci. 36: 59-69 (1985) - [c5]Norbert Blum:
On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem. STACS 1985: 32-38 - 1984
- [j6]Norbert Blum, Martin Seysen:
Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR. Acta Informatica 21: 171-181 (1984) - [j5]Norbert Blum:
A Boolean Function Requiring 3n Network Size. Theor. Comput. Sci. 28: 337-345 (1984) - [c4]Norbert Blum:
An Area-Maximum Edge Length Tradeoff for VLSI Layout. STOC 1984: 92-97 - 1983
- [j4]Norbert Blum:
A Note on the 'Parallel Computation Thesis'. Inf. Process. Lett. 17(4): 203-205 (1983) - [j3]Norbert Blum:
More on the Power of Chain Rules in Context-Free Grammars. Theor. Comput. Sci. 27: 287-295 (1983) - 1982
- [j2]Norbert Blum:
On the Power of Chain Rules in Context Free Grammars. Acta Informatica 17: 425-433 (1982) - [c3]Norbert Blum:
On the Power of Chain Rules in Context Free Grammars. ICALP 1982: 72-82 - 1981
- [b1]Norbert Blum:
Eine Ω(n4/3) [Omega-n] untere Schranke für die monotone Schaltkreiskomplexität von n-te Grad Convolution. Saarland University, Saarbrücken, Germany, 1981, pp. 1-32 - [c2]Norbert Blum:
An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution. FOCS 1981: 101-108 - 1980
- [j1]Norbert Blum, Kurt Mehlhorn:
On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. 11: 303-320 (1980)
1970 – 1979
- 1979
- [c1]Norbert Blum, Kurt Mehlhorn:
Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. Theoretical Computer Science 1979: 67-78
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
