Catalogo dei prodotti della ricerca

LEONARDI, Stefano
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.861
EU - Europa 1.473
AS - Asia 534
SA - Sud America 36
AF - Africa 18
Continente sconosciuto - Info sul continente non disponibili 2
OC - Oceania 1
Totale 8.925
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.817
IT - Italia 472
UA - Ucraina 311
IN - India 284
CN - Cina 156
SE - Svezia 153
DE - Germania 143
FI - Finlandia 125
GB - Regno Unito 99
SG - Singapore 78
CA - Canada 42
NL - Olanda 41
AR - Argentina 32
IE - Irlanda 30
BG - Bulgaria 25
RO - Romania 24
FR - Francia 17
BE - Belgio 14
RU - Federazione Russa 12
TG - Togo 11
KR - Corea 6
ZA - Sudafrica 4
BR - Brasile 2
CL - Cile 2
EU - Europa 2
GR - Grecia 2
IL - Israele 2
IR - Iran 2
MX - Messico 2
SC - Seychelles 2
SK - Slovacchia (Repubblica Slovacca) 2
VN - Vietnam 2
DK - Danimarca 1
ES - Italia 1
HK - Hong Kong 1
JP - Giappone 1
MC - Monaco 1
MU - Mauritius 1
MY - Malesia 1
NZ - Nuova Zelanda 1
SA - Arabia Saudita 1
Totale 8.925
Salva come PNG Salva come JPEG
Città #
Fairfield 1.061
Woodbridge 645
Houston 534
Ashburn 508
Chandler 497
Seattle 440
Wilmington 378
Cambridge 365
Ann Arbor 248
Rome 238
Princeton 176
New York 136
Plano 125
Beijing 123
Jacksonville 123
Lawrence 120
Boston 112
San Diego 103
San Paolo di Civitate 102
Des Moines 58
Southend 45
Singapore 37
Andover 35
Norwalk 34
Millbury 33
Federal 31
Dublin 29
Falls Church 27
Sofia 25
Toronto 25
Boardman 23
San Mateo 19
Phoenix 18
Dearborn 15
Brussels 14
Karlsruhe 14
Auburn Hills 11
Lomé 11
London 11
Ottawa 11
Milan 10
Bühl 9
Helsinki 9
Indiana 8
Los Angeles 7
Washington 7
Choisy-le-roi 6
Munich 6
Rodgau 5
Turin 5
Beaverton 4
Buffalo 4
Castelnuovo Di Porto 4
Grafing 4
Hefei 4
Serra San Bruno 4
Ancona 3
Bremen 3
Fleury-les-Aubrais 3
Kunming 3
Leawood 3
Leipzig 3
Muizenberg 3
Parma 3
Pescara 3
Pune 3
Seongnam 3
Shanghai 3
Aosta 2
Bengaluru 2
Campagnano di Roma 2
Caserta 2
Changchun 2
Chicago 2
Ciampino 2
Cosenza 2
Hanover 2
Ho Chi Minh City 2
Hounslow 2
Kirkland 2
Lambeth 2
Laurel 2
Menlo Park 2
Mexico City 2
Nuremberg 2
Philadelphia 2
Piešťany 2
Poggio Renatico 2
Provo 2
Pátrai 2
Redmond 2
Redwood City 2
Sacramento 2
San Francisco 2
Segni 2
Seoul 2
Shenzhen 2
Siracusa 2
Terni 2
Trofarello 2
Totale 6.756
Salva come PNG Salva come JPEG
Nome #
Revenue maximizing envy-free fixed-price auctions with budgets 150
Large scale properties of the Webgraph 119
Simulating the webgraph: A comparative analysis of models 111
Stability and similarity of link analysis ranking algorithms 109
Algorithms for hiring and outsourcing in the online labor market 107
Algorithms for auctions and games 97
Sequential posted price mechanisms with correlated valuations 97
Pricing tree access networks with connected backbones 95
An Experimental Study of Prefetching and Caching Algorithms for the World Wide Web 94
Algorithms for fair team formation in online labour marketplaces 94
Network-Aware Recommendations of Novel Tweets 92
Prior-free multi-unit auctions with ordered bidders 90
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm 89
Link analysis for Web spam detection 88
Enclosing a set of objects by two minimum area rectangles 87
Stochastic Query Covering for Fast Approximate Document Retrieval 87
Average stretch without migration 87
Designing Cost-Sharing Methods for Bayesian Games 86
Approximately Efficient Double Auctions with Strong Budget Balance 85
Efficient Computation of the Weighted Clustering Coefficient 83
On multiple keyword sponsored search auctions with budgets 83
Algorithms and Experiments for the Webgraph 82
From primal-dual to cost shares and back: a stronger LP relaxation for the Steiner forest problem 81
Approximately Efficient Two-Sided Combinatorial Auctions 81
Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia 80
A reference collection for web spam. 80
Online team formation in social networks 80
Online weighted flow time and deadline scheduling 79
Mining the inner structure of the Web graph 79
Approximating total flow time on parallel machines 78
Sequential Posted-Price Mechanisms with Correlated Valuations 78
Lottery pricing equilibria 78
Efficient computation of the Weighted Clustering Coefficient 77
Online Network Design with Outliers 77
Simple Cost-sharing Schemes for Multi-Commodity Rent-or-Buy and Stochastic Steiner Tree 75
Cross-monotonic cost sharing methods for connected facility location games 75
Minimizing the flow time without migration 75
Single valued combinatorial auctions with budgets 75
A path-decomposition theorem with applications to pricing and covering on trees 75
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines 74
Revenue maximizing envy-free multi-unit auctions with budgets 74
Revenue maximizing envy-free pricing in matching markets with budgets 74
Stochastic query covering 73
Fixed price approximability of the optimal gain from trade 73
On-line randomized call control revisited 72
Online weighted flow time and deadline scheduling 72
Stability and Similarity of Link Analysis Ranking Algorithms. 71
Fully decentralized computation of aggregates over data streams 71
On the value of preemption in scheduling 71
Algorithms for the on-line travelling salesman 70
Bidding Strategies for Fantasy-Sports Auctions 70
Constant integrality gap LP formulations of unsplittable flow on a path 70
On Multiple Keyword Sponsored Search Auctions with Budgets 70
Designing cost-sharing methods for Bayesian games 69
Online Network Design with Outliers 69
Mining the inner structure of the web graph. 67
Multiprocessor scheduling with rejection 67
Efficient cost-sharing mechanisms for prize-collecting problems 67
Scheduling to Minimize Flow Time Metrics 67
Budget feasible mechanisms on matroids 67
Estimating clustering indexes in data streams 67
A mazing 2+ε approximation for unsplittable flow on a path 67
Randomized Lower Bounds for Online Path Coloring 67
Robust hierarchical k-center clustering 66
A simpler proof of preemptive total flow time approximation on parallel machines 65
Average-case and smoothed competitive analysis of the multilevel feedback algorithm 64
New metrics for reputation management in P2P networks 64
(1 + ε)-approximate incremental matching in constant deterministic amortized time 64
Parallel scheduling problems in next generation wireless networks 64
Minimizing Stall Time in Single and Parallel Disk Systems. 63
Utilitarian mechanism design for multi-objective optimization 63
Scheduling Against an Adversarial Network 61
Mining large networks with subgraph counting 61
Parallel scheduling problems in next generation wireless networks 61
SEMI-CLAIRVOYANT SCHEDULING 61
Semi-clairvoyant scheduling 61
SET COVERING WITH OUR EYES CLOSED 60
Fully decentralized computation of aggregates over data streams 60
Algorithms for fair k-clustering with multiple protected attributes 60
A group-strategyproof cost sharing mechanism for the steiner forest game 59
Strict cost sharing schemes for steiner forest 59
Prior-free auctions with ordered bidders 59
On-Line Competitive Algorithms for Call Admission in Optical Networks. 59
Utilitarian mechanism design for multiobjective optimization 59
When the optimum is also blind: A new perspective on universal optimization 59
Network formation games with local coalitions 58
Game-theoretic analysis of Internet switching with selfish users 58
An efficient cost-sharing mechanism for the prize-collecting steiner forest problem 57
On salesmen, repairmen, spiders and other traveling agents 57
Temporal analysis of the wikigraph 57
Reduce and Aggregate: Similarity Ranking in Multi-Categorical Bipartite Graphs 57
Scheduling multicasts on unit-capacity trees and meshes 56
Near-optimal multi-unit auctions with ordered bidders 56
Lower bounds for on-line graph problems with application to on-line circuit and optical routing 55
Non-Clairvoyant Scheduling to Minimize the Average Flow Time on Single and Parallel Machines 54
Competitive influence in social networks: Convergence, submodularity, and competition effects 54
Budget Feasible Mechanisms on Matroids 53
Envy, regret, and social welfare loss 53
Efficient two-sided markets with limited information 53
Scheduling to minimize Average Stretch without Migration 52
Totale 7.296
Salva come PNG Salva come JPEG
Categoria #
all - tutte 21.954
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 220
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 22.174
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019790 0 0 0 0 0 0 0 0 0 0 441 349
2019/20202.061 271 67 25 117 215 232 255 255 225 197 128 74
2020/2021952 102 114 23 59 29 59 110 87 95 179 72 23
2021/20221.970 30 113 165 51 215 197 20 135 118 175 456 295
2022/20231.555 305 277 65 163 182 175 14 88 160 8 52 66
2023/2024793 53 90 45 59 49 215 20 48 32 181 1 0
Totale 9.237