statistiche ricercatore

Nome	#
Sublinear algorithms for local graph centrality estimation	121
Score and rank convergence of HITS.	113
A Theoretical Study of a Generalized Version of Kleinberg's HITS Algorithm	111
HITS can converge slowly, but not too slowly, in score and rank	96
Brief announcement: On approximating pageRank locally with sublinear query complexity	84
Annotations and Digital Libraries: Designing Adequate Test-Beds.	83
The Power of Local Information in PageRank	72
Structural properties of Kleinberg's HITS algorithm	63
Approximating PageRank locally with sublinear query complexity	58
An Approach for the Construction of an Experimental Test Collection to Evaluate Search Systems that Exploit Annotation.	48
What does it mean to converge in rank?	47
Local Computation of PageRank: the Ranking Side	38
On approximating the stationary distribution of time-reversible Markov chains	38
Exploiting Relevance Assessment for the Creation of an Experimental Test Collection to Evaluate Systems that Use Annotations	31
On Approximating the Stationary Distribution of Time-Reversible Markov Chains	24
Totale	1.027

	Totale	Lug	Ago	Sett	Ott	Nov	Dic	Gen	Feb	Mar	Apr	Mag	Giu
2019/2020	232	0	18	2	44	25	19	19	26	20	23	25	11
2020/2021	119	6	12	4	7	4	9	0	18	12	14	18	15
2021/2022	165	6	38	15	4	5	8	14	11	11	5	16	32
2022/2023	107	28	2	0	5	20	15	0	8	17	2	8	2
2023/2024	75	0	13	9	5	4	18	1	1	3	7	6	8
2024/2025	5	5	0	0	0	0	0	0	0	0	0	0	0
Totale													1.027