Остановите войну!
for scientists:
default search action
Luca Becchetti
- > Home > Persons > Luca Becchetti
Publications
- 2017
- [j24]Gabriel Tolosa, Esteban Feuerstein, Luca Becchetti, Alberto Marchetti-Spaccamela:
Performance improvements for search systems using an integrated cache of lists + intersections. Inf. Retr. J. 20(3): 172-198 (2017) - 2016
- [r2]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2016: 766-768 - 2014
- [c33]Gabriel Tolosa, Luca Becchetti, Esteban Feuerstein, Alberto Marchetti-Spaccamela:
Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections. SPIRE 2014: 227-235 - 2011
- [j17]Luca Becchetti, Ugo Maria Colesanti, Alberto Marchetti-Spaccamela, Andrea Vitaletti:
Recommending items in pervasive scenarios: models and experimental analysis. Knowl. Inf. Syst. 28(3): 555-578 (2011) - 2009
- [j14]Luca Becchetti, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Peter Korteweg, Martin Skutella, Leen Stougie:
Latency-constrained aggregation in sensor networks. ACM Trans. Algorithms 6(1): 13:1-13:20 (2009) - 2008
- [c18]Luca Becchetti, Ugo Maria Colesanti, Alberto Marchetti-Spaccamela, Andrea Vitaletti:
Self-Adaptive Recommendation Systems: Models and Experimental Analysis. SASO 2008: 479-480 - [r1]Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Kirk Pruhs:
Flow Time Minimization. Encyclopedia of Algorithms 2008 - 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) - [c16]Luca Becchetti, Peter Korteweg, Alberto Marchetti-Spaccamela, Martin Skutella, Leen Stougie, Andrea Vitaletti:
Latency Constrained Aggregation in Sensor Networks. ESA 2006: 88-99 - 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) - [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
- [j5]Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximating call-scheduling makespan in all-optical networks. J. Discrete Algorithms 2(4): 501-515 (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
- [j2]Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximation algorithms for routing and call scheduling in all-optical chains and rings. Theor. Comput. Sci. 287(2): 429-448 (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 - 2000
- [c4]Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximating Call-Scheduling Makespan in All-Optical Networks. WG 2000: 13-22 - 1999
- [c3]Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings. FSTTCS 1999: 201-212 - 1997
- [c2]Fabrizio d'Amore, Luca Becchetti, Sergei L. Bezrukov, Alberto Marchetti-Spaccamela, M. Ottaviani, Robert Preis, Markus Röttger, Ulf-Peter Schroeder:
On the Embedding of Refinements of 2-dimensional Grids. Euro-Par 1997: 950-957
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-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint