Zobrazeno 1 - 10
of 964
pro vyhledávání: '"RIBEIRO, JOAO"'
Autor:
Doron, Dean, Ribeiro, João
(abstract shortened due to space constraints) Existing constructions of seeded extractors with short seed length and large output length run in time $\Omega(n \log(1/\varepsilon))$ and often slower, where $n$ is the input source length and $\varepsil
Externí odkaz:
http://arxiv.org/abs/2411.07473
We prove that random low-degree polynomials (over $\mathbb{F}_2$) are unbiased, in an extremely general sense. That is, we show that random low-degree polynomials are good randomness extractors for a wide class of distributions. Prior to our work, su
Externí odkaz:
http://arxiv.org/abs/2405.10297
Autor:
Kennedy, James B., Ribeiro, João P.
We study partition problems based on two ostensibly different kinds of energy functionals defined on $k$-partitions of metric graphs: Cheeger-type functionals whose minimisers are the $k$-Cheeger cuts of the graph, and the corresponding values are th
Externí odkaz:
http://arxiv.org/abs/2310.02701
Non-malleable codes are fundamental objects at the intersection of cryptography and coding theory. These codes provide security guarantees even in settings where error correction and detection are impossible, and have found applications to several ot
Externí odkaz:
http://arxiv.org/abs/2308.06466
Autor:
Nambiar, Ananthan, Pan, Chao, Rana, Vishal, Cheraghchi, Mahdi, Ribeiro, João, Maslov, Sergei, Milenkovic, Olgica
Pathogenic infections pose a significant threat to global health, affecting millions of people every year and presenting substantial challenges to healthcare systems worldwide. Efficient and timely testing plays a critical role in disease control and
Externí odkaz:
http://arxiv.org/abs/2307.16352
Quantum secret sharing (QSS) allows a dealer to distribute a secret quantum state among a set of parties so that certain subsets can reconstruct the secret, while unauthorized subsets obtain no information. While QSS was introduced over twenty years
Externí odkaz:
http://arxiv.org/abs/2305.00356
We prove that the Minimum Distance Problem (MDP) on linear codes over any fixed finite field and parameterized by the input distance bound is W[1]-hard to approximate within any constant factor. We also prove analogous results for the parameterized S
Externí odkaz:
http://arxiv.org/abs/2211.07900
Autor:
Ribeiro, João Gabriel, Raimondi, Rizia Maria, de Souza, Alana Gabrieli, dos Santos Rosa, Derval, Paulino, Alexandre Tadeu
Publikováno v:
In Journal of Water Process Engineering January 2025 69
We continue a line of work on extracting random bits from weak sources that are generated by simple processes. We focus on the model of locally samplable sources, where each bit in the source depends on a small number of (hidden) uniformly random inp
Externí odkaz:
http://arxiv.org/abs/2205.13725
Autor:
Nobrega, Glauco, Santos Afonso, Inês, Cardoso, Beatriz, Rodrigues de Souza, Reinaldo, Moita, Ana, Eduardo Ribeiro, João, Lima, Rui A.
Publikováno v:
In Thermal Science and Engineering Progress December 2024 56