Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Simon Mauras"'
Publikováno v:
Physical Review Research, Vol 6, Iss 3, p 033265 (2024)
Speckle patterns are inherent features of coherent light propagation through complex media. As a result of interference, they are sensitive to multiple experimental parameters such as the configuration of disorder or the propagating wavelength. Recen
Externí odkaz:
https://doaj.org/article/d40bec3f1de646608d99d34abb6cc379
Autor:
Simon Mauras, Vincent Cohen-Addad, Guillaume Duboc, Max Dupré la Tour, Paolo Frasca, Claire Mathieu, Lulla Opatowski, Laurent Viennot
Publikováno v:
PLoS Computational Biology, Vol 17, Iss 8, p e1009264 (2021)
The COVID-19 epidemic has forced most countries to impose contact-limiting restrictions at workplaces, universities, schools, and more broadly in our societies. Yet, the effectiveness of these unprecedented interventions in containing the virus sprea
Externí odkaz:
https://doaj.org/article/33cbc792bdee474eae324e04d2833eea
Autor:
Simon Mauras
Publikováno v:
EC
Stable matching in a community consisting of $N$ men and $N$ women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. When t
Publikováno v:
Fundamentals of Computation Theory
Fundamentals of Computation Theory, 12867, Springer International Publishing, pp.3-17, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86593-1_1⟩
Fundamentals of Computation Theory ISBN: 9783030865924
FCT
Fundamentals of Computation Theory, 12867, Springer International Publishing, pp.3-17, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-86593-1_1⟩
Fundamentals of Computation Theory ISBN: 9783030865924
FCT
Stable matching in a community consisting of men and women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley, who designed t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::710f308ace1e5a00cfb76a8707e8bf6c
https://hal.archives-ouvertes.fr/hal-03457021
https://hal.archives-ouvertes.fr/hal-03457021
Autor:
Paolo Frasca, Claire Mathieu, Vincent Cohen-Addad, Laurent Viennot, Lulla Opatowski, Simon Mauras, Guillaume Duboc, Max Dupré la Tour
Publikováno v:
PLoS Computational Biology
PLoS Computational Biology, 2021, 17 (8), pp.1-24. ⟨10.1371/journal.pcbi.1009264⟩
PLoS Computational Biology, Public Library of Science, 2021, 17 (8), pp.1-24. ⟨10.1371/journal.pcbi.1009264⟩
PLoS Computational Biology, Vol 17, Iss 8, p e1009264 (2021)
PLoS Computational Biology, 2021, 17 (8), pp.1-24. ⟨10.1371/journal.pcbi.1009264⟩
PLoS Computational Biology, Public Library of Science, 2021, 17 (8), pp.1-24. ⟨10.1371/journal.pcbi.1009264⟩
PLoS Computational Biology, Vol 17, Iss 8, p e1009264 (2021)
The COVID-19 epidemic has forced most countries to impose contact-limiting restrictions at workplaces, universities, schools, and more broadly in our societies. Yet, the effectiveness of these unprecedented interventions in containing the virus sprea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af6ebec1cc5aa38d6e66d04cd131b4d8
https://hal.sorbonne-universite.fr/hal-03351623
https://hal.sorbonne-universite.fr/hal-03351623
Maximizing a monotone submodular function under various constraints is a classical and intensively studied problem. However, in the single-pass streaming model, where the elements arrive one by one and an algorithm can store only a small fraction of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::314c267d80463db0c1e8166e6dcfffe7
Publikováno v:
SIAM Journal on Discrete Mathematics; 2022, Vol. 36 Issue 1, p355-382, 28p
Autor:
Simon Mauras, Claire Mathieu
Publikováno v:
SODA
Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020
Proceedings of the 2020 Symposium on Discrete Algorithms, 2020, Jan 2020, Salt Lake City, United States. pp.2810-2822, ⟨10.1137/1.9781611975994.171⟩
Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2020
Proceedings of the 2020 Symposium on Discrete Algorithms, 2020, Jan 2020, Salt Lake City, United States. pp.2810-2822, ⟨10.1137/1.9781611975994.171⟩
A top-list is a possibly incomplete ranking of elements: only a subset of the elements are ranked, with all unranked elements tied for last. Top-list aggregation, a generalization of the well-known rank aggregation problem, takes as input a collectio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5f02e71a8dc946984835b3688c58d0d
Autor:
Helen Xu, Tyler Mayer, Rob Johnson, Simon Mauras, Michael A. Bender, Martin Farach-Colton, Cynthia A. Phillips
Publikováno v:
PODS
The skip list is an elegant dictionary data structure that is commonly deployed in RAM. A skip list with N elements supports searches, inserts, and deletes in O(log N) operations with high probability (w.h.p.) and range queries returning K elements i