João Ribeiro
Orcid: 0000-0002-9870-0501Affiliations:
- Instituto Superior Técnico, Universidade de Lisboa, Portugal (since 2024)
- New University of Lisbon, School of Science and Technology, Portugal (2023-2024)
- Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA (2021-2023)
- Imperial College London, UK (2017-2021, PhD 2021)
- ETH Zurich, Switzerland (2015-2017)
According to our database1,
João Ribeiro
authored at least 39 papers
between 2016 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Semi-quantitative group testing for efficient and accurate qPCR screening of pathogens with a wide range of loads.
BMC Bioinform., December, 2024
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms.
SIAM J. Comput., 2024
Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences.
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
IACR Cryptol. ePrint Arch., 2024
Electron. Colloquium Comput. Complex., 2024
Electron. Colloquium Comput. Complex., 2024
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024
2023
SIAM J. Discret. Math., June, 2023
IEEE Trans. Inf. Theory, 2023
IACR Cryptol. ePrint Arch., 2023
Semi-Quantitative Group Testing for Efficient and Accurate qPCR Screening of Pathogens with a Wide Range of Loads.
CoRR, 2023
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓ<i><sub>p</sub></i> Norms.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
2022
IACR Trans. Symmetric Cryptol., 2022
IEEE Trans. Inf. Theory, 2022
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
IEEE Trans. Inf. Theory, 2022
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.
IEEE Trans. Inf. Theory, 2022
IACR Cryptol. ePrint Arch., 2022
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓ<sub>p</sub> Norms.
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
2021
IEEE Trans. Inf. Theory, 2021
Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel With Positive Dark Current.
IEEE Commun. Lett., 2021
IACR Cryptol. ePrint Arch., 2021
Electron. Colloquium Comput. Complex., 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel.
IEEE Trans. Inf. Theory, 2019
IEEE Trans. Inf. Theory, 2019
IACR Cryptol. ePrint Arch., 2019
2018
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.
IACR Cryptol. ePrint Arch., 2018
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018
2017
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio.
IACR Cryptol. ePrint Arch., 2017
2016
Proceedings of the IEEE International Symposium on Information Theory, 2016