An algorithmic comparison of three scientific impact indices

Published 1 January 2010Open access

Gerhard J. Woeginger

Source URL

Citations1

SJR quartileQ3

SJR score0.21

SNIP0.60

View PDF

TL;DR

This work uses tools from Theoretical Computer Science to analyze the computational complexity of determining the h-index, the g- index, and the w-index in various models of computation, and confirms the natural intuition that theh-index is an easier concept than theg-index.

Abstract

We use tools from Theoretical Computer Science to analyze the computational complexity of determining the h-index, the g-index, and the w-index in various models of computation. Our results confirm the natural intuition that the h-index is an easier concept than the g-index, which in turn is an easier concept than the w-index.

Keywords

Decision SciencesArts and Humanities

Journal of the Operational Research SocietyIntroduction to Algorithms

16,942 Citations1991V. J. Rayward‐Smith, Thomas H. Cormen +2 more

Proceedings of the National Academy of SciencesAn index to quantify an individual's scientific research output

11,535 Citations2005J. E. Hirsch

The index hbar, defined as the number of papers of an individual that have citation count larger than or equal to the citation count of all coauthors of each paper, is proposed as a useful index to characterize the scientific output of a researcher that takes into account the effect of multiple authorship.

View PDF

The Design and Analysis of Computer Algorithms

9,456 Citations1974Alfred V. Aho, John E. Hopcroft

This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

Journal of Computer and System SciencesTime bounds for selection

1,249 Citations1973Manuel Blum, Robert W. Floyd +3 more

The number of comparisons required to select the i-th smallest of n numbers is shown to be at most a linear function of n by analysis of a new selection algorithm-PICK.

Lower bounds for algebraic computation trees

525 Citations1983Michael Ben-Or

All the apparently known lower bounds for linear decision trees are extended to bounded degree algebraic decision trees, thus answering the open questions raised by Steele and Yao [20].

View PDF

Mathematical Social SciencesAn axiomatic characterization of the Hirsch-index

147 Citations2008Gerhard J. Woeginger

An axiomatic characterization of the Hirsch-index in terms of three natural axioms is presented, which is a well-known index for measuring and comparing the output of scientific researchers.

Journal of InformetricsAn axiomatic analysis of Egghe’s g-index

83 Citations2008Gerhard J. Woeginger

An axiomatic characterization of the g-index in terms of three natural axioms is given, which is an improvement of the Hirsch-index.