
This is a revised and expanded version of the author's paper in Lect. Notes Comput. Sci. 158, 78-93 (1983; Zbl 0529.68014).
parallel greedy algorithm, Analysis of algorithms and problem complexity, reducibility, Algorithms in computer science, uniform Boolean circuit families, Computability and recursion theory on ordinals, admissible sets, etc., Engineering(all)
parallel greedy algorithm, Analysis of algorithms and problem complexity, reducibility, Algorithms in computer science, uniform Boolean circuit families, Computability and recursion theory on ordinals, admissible sets, etc., Engineering(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 418 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 0.1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 1% |
