An algorithmic comparison of three scientific impact indices

Authors:
Gerhard J. Woeginger
Affiliations:
Department of Mathematics and Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
Acta Cybernetica
Year:
2010

Citing 4
Cited 0

Introduction to algorithms

Introduction to algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Time bounds for selection

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

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.