Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Norbert Blum"'
Autor:
Norbert Blum
Der Autor bietet eine systematische und umfassende Einführung in das Thema Datenstrukturen und Algorithmen. Aus dem Inhalt: Bäume, Hashing, Union Find, Priority Queues, Divide-and-conquer, dynamische Programmierung, Aufzählungsmethoden, Greedy-, A
Autor:
Norbert Blum
Publikováno v:
Theoretical Computer Science. 267:49-59
Usually, a parser for an LL(k) -grammar G is a deterministic pushdown transducer which produces a leftmost derivation for a given input string x ∈ L(G) . Ukkonen (JCCS 26(1983)153–170) has given a family of LL(2) -grammars proving that every pars
Autor:
Norbert Blum, Robert Koch
Publikováno v:
Information and Computation. 150(1):112-118
We develop a new method for placing a given context-free grammar into Greibach normal form with only polynomial increase of its size. Starting with an arbitraryε-free context-free grammarG, we transformGinto an equivalent context-free grammarHin ext
Publikováno v:
Marine Geology. 136:1-19
Alkaline volcanic rocks dredged from the upper and central flanks of Tropic Seamount, central Atlantic Ocean, encompass a compositional spectrum ranging from basalt and trachybasalt (hawaiite, mugearite) to trachyte. Plagioclase and olivine form phen
Autor:
Norbert Blum
Publikováno v:
Information Processing Letters. 57:65-69
More than 20 years ago, Hopcroft (1971) has given an algorithm for minimizing an n-state finite automaton in O(kn log n) time where k is the size of the alphabet. This contrasts to the usual O(kn2) algorithms presented in text books. Since Hopcroft's
Autor:
Henning Rochow, Norbert Blum
Publikováno v:
Information Processing Letters. 51:57-60
We define a class of algorithms for the disjoint set union problem on intervals that includes the class of pointer-algorithms defined by Tarjan. We show that each algorithm from this class has at least Ω(log n /loglog n single-operation worst-case t
Autor:
Norbert Blum, Matthias Kretschmer
Publikováno v:
Algorithms Unplugged ISBN: 9783642153273
Algorithms Unplugged
Algorithms Unplugged
The authors show how one can determine from their genetic information how closely two organisms are related to each other, and they show how we can see from mutations how far apart the organisms are from each other, or from a common ancestor. This is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d75edfc85694b0891c6301e96eedcae2
https://doi.org/10.1007/978-3-642-15328-0_31
https://doi.org/10.1007/978-3-642-15328-0_31
Publikováno v:
Chemical Geology. 106:331-343
Al- and Ti-rich smectites associated with alkaline volcanic rocks were dredged during several cruises of the German research vessel “SONNE” as part of an extensive survey of manganese crusts in the Central Pacific seamount region. X-ray diffracti
Autor:
Norbert Blum
Publikováno v:
Algorithmen und Datenstrukturen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9426b0bd70d563de3cf69f97e7c3a539
https://doi.org/10.1524/9783486594089.142
https://doi.org/10.1524/9783486594089.142