Stefano Leucci 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Paolo Penna

> Home > Persons > Stefano Leucci 0001

Publications

2020
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/GeissmannLLP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/GeissmannLLP20
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. 64(3): 508-521 (2020)
2019
[c31]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/esa/Geissmann0LP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/Geissmann0LP19
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. ESA 2019: 49:1-49:14
[c29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/isaac/Geissmann0LPP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/Geissmann0LPP19
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti:
Dual-Mode Greedy Algorithms Can Save Energy. ISAAC 2019: 64:1-64:18
2018
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/geb/LeucciMP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/geb/LeucciMP18
Stefano Leucci, Akaki Mamageishvili, Paolo Penna:
No truthful mechanism can be better than n approximate for two natural problems. Games Econ. Behav. 111: 64-74 (2018)
[c23]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/stacs/Geissmann0LP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/Geissmann0LP18
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS 2018: 36:1-36:13
[i19]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1804-07575
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1804-07575
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Optimal Sorting with Persistent Comparison Errors. CoRR abs/1804.07575 (2018)
2017
[c21]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/isaac/Geissmann0LP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/Geissmann0LP17
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. ISAAC 2017: 38:1-38:12
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1709-07249
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1709-07249
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna:
Sorting with Recurrent Comparison Errors. CoRR abs/1709.07249 (2017)
[i14]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1712-06709
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1712-06709
Stefano Leucci, Akaki Mamageishvili, Paolo Penna:
No truthful mechanism can be better than n approximate for two natural problems. CoRR abs/1712.06709 (2017)

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.