Остановите войну!
for scientists:
default search action
Luca Becchetti
- > Home > Persons > Luca Becchetti
Publications
- 2019
- [i13]Aris Anagnostopoulos, Luca Becchetti, Matteo Böhm, Adriano Fazzone, Stefano Leonardi, Cristina Menghini, Chris Schwiegelshohn:
Principal Fairness: \\ Removing Bias via Projections. CoRR abs/1905.13651 (2019) - 2016
- [r2]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2016: 766-768 - 2015
- [j22]Aris Anagnostopoulos, Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Ida Mele, Piotr Sankowski:
Stochastic Query Covering for Fast Approximate Document Retrieval. ACM Trans. Inf. Syst. 33(3): 11:1-11:35 (2015) - 2012
- [c27]Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi:
Online team formation in social networks. WWW 2012: 839-848 - 2011
- [c25]Aris Anagnostopoulos, Luca Becchetti, Stefano Leonardi, Ida Mele, Piotr Sankowski:
Stochastic query covering. WSDM 2011: 725-734 - 2010
- [j16]Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén:
Fully decentralized computation of aggregates over data streams. SIGKDD Explor. 12(2): 83-91 (2010) - [c24]Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi:
Power in unity: forming teams in large-scale community systems. CIKM 2010: 599-608 - [c23]Luca Becchetti, Ilaria Bordino, Stefano Leonardi, Adi Rosén:
Fully decentralized computation of aggregates over data streams. StreamKDD@KDD 2010: 1-9 - 2008
- [j13]Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo Baeza-Yates, Stefano Leonardi:
Link analysis for Web spam detection. ACM Trans. Web 2(1): 2:1-2:42 (2008) - [r1]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2008 - 2007
- [j12]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy. ACM Trans. Algorithms 3(2): 23 (2007) - 2006
- [j11]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Online weighted flow time and deadline scheduling. J. Discrete Algorithms 4(3): 339-352 (2006) - [j10]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm. Math. Oper. Res. 31(1): 85-108 (2006) - [j9]Carlos Castillo, Debora Donato, Luca Becchetti, Paolo Boldi, Stefano Leonardi, Massimo Santini, Sebastiano Vigna:
A reference collection for web spam. SIGIR Forum 40(2): 11-24 (2006) - [c17]Luca Becchetti, Carlos Castillo, Debora Donato, Stefano Leonardi, Ricardo A. Baeza-Yates:
Link-Based Characterization and Detection of Web Spam. AIRWeb 2006: 1-8 - 2005
- [j8]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Suhas N. Diggavi, S. Muthukrishnan, Thyagarajan Nandagopal:
Parallel scheduling problems in next generation wireless networks. Networks 45(1): 9-22 (2005) - [c14]Luca Becchetti, Jochen Könemann, Stefano Leonardi, Martin Pál:
Sharing the cost more efficiently: improved approximation for multicommodity rent-or-buy. SODA 2005: 375-384 - [i1]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [j7]Luca Becchetti, Stefano Leonardi:
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51(4): 517-539 (2004) - [j6]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan:
Average stretch without migration. J. Comput. Syst. Sci. 68(1): 80-95 (2004) - [j4]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Semi-clairvoyant scheduling. Theor. Comput. Sci. 324(2-3): 325-335 (2004) - 2003
- [c12]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Semi-clairvoyant Scheduling. ESA 2003: 67-77 - [c11]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. FOCS 2003: 462-471 - [c10]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer:
Scheduling to Minimize Flow Time Metrics. IPDPS 2003: 223 - 2002
- [c9]Luca Becchetti, Suhas N. Diggavi, Stefano Leonardi, Alberto Marchetti-Spaccamela, S. Muthukrishnan, Thyagarajan Nandagopal, Andrea Vitaletti:
Parallel scheduling problems in next generation wireless networks. SPAA 2002: 238-247 - 2001
- [c7]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Online Weighted Flow Time and Deadline Scheduling. RANDOM-APPROX 2001: 36-47 - [c6]Luca Becchetti, Stefano Leonardi:
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. STOC 2001: 94-103 - 2000
- [c5]Luca Becchetti, Stefano Leonardi, S. Muthukrishnan:
Scheduling to minimize average stretch without migration. SODA 2000: 548-557
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-08 00:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint