BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × Germany
1 × Greece
1 × Hungary
1 × Italy
1 × Portugal
1 × United Kingdom
7 × USA
Collaborated with:
Y.Bartal L.Becchetti A.Marchetti-Spaccamela T.Roughgarden J.Könemann G.Schäfer D.Raz A.Fiat A.Anagnostopoulos Y.Azar D.Donato P.Tsaparas S.Albers N.Garg R.Colini-Baldeschi M.Henzinger M.Starnberger F.Grandoni P.Sankowski L.Fleischer S.H.M.v.Zwam B.Awerbuch O.Regev C.Castillo A.Gionis L.S.Buriol G.Frahling C.Sohler E.Feuerstein A.Rosén
Talks about:
time (4) line (4) parallel (3) minim (3) rout (3) flow (3) steiner (2) schedul (2) problem (2) network (2)

Person: Stefano Leonardi

DBLP DBLP: Leonardi:Stefano

Contributed to:

ICALP (2) 20122012
STOC 20122012
CIKM 20102010
ICALP (1) 20102010
PODS 20062006
STOC 20062006
ICALP 20052005
STOC 20012001
STOC 19991999
STOC 19981998
ICALP 19971997
STOC 19971997
ICALP 19961996
STOC 19961996
ICALP 19951995

Wrote 16 papers:

ICALP-v2-2012-BaldeschiHLS #keyword #multi #on the
On Multiple Keyword Sponsored Search Auctions with Budgets (RCB, MH, SL, MS), pp. 1–12.
STOC-2012-LeonardiR #order
Prior-free auctions with ordered bidders (SL, TR), pp. 427–434.
CIKM-2010-AnagnostopoulosBCGL #community #scalability
Power in unity: forming teams in large-scale community systems (AA, LB, CC, AG, SL), pp. 599–608.
ICALP-v1-2010-AnagnostopoulosGLS #design #network #online
Online Network Design with Outliers (AA, FG, SL, PS), pp. 114–126.
PODS-2006-BuriolFLMS #data type
Counting triangles in data streams (LSB, GF, SL, AMS, CS), pp. 253–262.
STOC-2006-FleischerKLS #multi #probability
Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (LF, JK, SL, GS), pp. 663–670.
ICALP-2005-DonatoLT #algorithm #analysis #ranking #similarity
Stability and Similarity of Link Analysis Ranking Algorithms (DD, SL, PT), pp. 717–729.
ICALP-2005-KonemannLSZ #problem
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem (JK, SL, GS, SHMvZ), pp. 930–942.
STOC-2001-BecchettiL #parallel #scheduling
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines (LB, SL), pp. 94–103.
STOC-1999-AwerbuchALR #migration
Minimizing the Flow Time Without Migration (BA, YA, SL, OR), pp. 198–205.
STOC-1998-AlbersGL #parallel
Minimizing Stall Time in Single and Parallel Disk Systems (SA, NG, SL), pp. 454–462.
ICALP-1997-BartalL #network #online
On-Line Routing in All-Optical Networks (YB, SL), pp. 516–526.
STOC-1997-LeonardiR #approximate #parallel
Approximating Total Flow Time on Parallel Machines (SL, DR), pp. 110–119.
ICALP-1996-AzarBFFLR #on the
On Capital Investment (YA, YB, EF, AF, SL, AR), pp. 429–441.
STOC-1996-BartalFL #bound #graph #online #problem
Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (YB, AF, SL), pp. 531–540.
ICALP-1995-LeonardiM #online #resource management #scheduling
On-line Resource Management with Applications to Routing and Scheduling (SL, AMS), pp. 303–314.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.