The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Norbert Blum: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Norbert Blum
    An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:101-108 [Conf]
  2. Norbert Blum
    On the Power of Chain Rules in Context Free Grammars. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:72-82 [Conf]
  3. Norbert Blum
    A New Approach to Maximum Matching in General Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:586-597 [Conf]
  4. Norbert Blum
    On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:32-38 [Conf]
  5. Norbert Blum
    On Locally Optimal Alignments in Genetic Sequences. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:425-436 [Conf]
  6. Robert Koch, Norbert Blum
    Greibach Normal Form Transformation, Revisited. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:47-54 [Conf]
  7. Norbert Blum
    An Area-Maximum Edge Length Tradeoff for VLSI Layout [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:92-97 [Conf]
  8. Norbert Blum, Kurt Mehlhorn
    Mittlere Anzahl von Rebalancierungsoperationen in gewichtsbalancierten Bäumen. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:67-78 [Conf]
  9. Norbert Blum
    On Parsing LL-Languages. [Citation Graph (0, 0)][DBLP]
    Workshop on Implementing Automata, 1998, pp:13-21 [Conf]
  10. Norbert Blum
    On the Power of Chain Rules in Context Free Grammars. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:17, n:, pp:425-433 [Journal]
  11. Norbert Blum, Martin Seysen
    Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:171-181 [Journal]
  12. Norbert Blum
    An Area-Maximum Edge Length Trade-off for VLSI Layout [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:45-52 [Journal]
  13. Norbert Blum, Robert Koch
    Greibach Normal Form Transformation Revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:150, n:1, pp:112-118 [Journal]
  14. 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). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:4, pp:237-240 [Journal]
  15. Norbert Blum
    A Note on the `Parallel Computation Thesis'. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:4, pp:203-205 [Journal]
  16. Norbert Blum
    An O(n log n) Implementation of the Standard Method for Minimizing n-State Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:2, pp:65-59 [Journal]
  17. Norbert Blum, Henning Rochow
    A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:2, pp:57-60 [Journal]
  18. Y. Daniel Liang, Norbert Blum
    Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:4, pp:215-219 [Journal]
  19. Norbert Blum
    Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:2, pp:129-168 [Journal]
  20. Norbert Blum
    On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1021-1024 [Journal]
  21. Norbert Blum
    On parsing LL-languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:267, n:1-2, pp:49-59 [Journal]
  22. Norbert Blum
    More on the Power of Chain Rules in Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:287-295 [Journal]
  23. Norbert Blum
    A Boolean Function Requiring 3n Network Size. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:28, n:, pp:337-345 [Journal]
  24. Norbert Blum
    An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:59-69 [Journal]
  25. Norbert Blum, Kurt Mehlhorn
    On the Average Number of Rebalancing Operations in Weight-Balanced Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:303-320 [Journal]

  26. On Negations in Boolean Networks. [Citation Graph (, )][DBLP]


  27. On LR(k)-Parsers of Polynomial Size. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002