( en | de | ru )

 

Disambiguation of "Espitau, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Relational ⋆⋆\star-Liftings for Differential Privacy.

, , , , and . Log. Methods Comput. Sci., (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Thomas Thomas

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Thomas Potinecke

Methode zur Systematisierung von Teilprozessen in der Produktentwicklung beim Einsatz von CAx-Technologien. Uni Stuttgart, (2009)
 

Other publications of authors with the same name

Synthesizing Probabilistic Invariants via Doob's Decomposition., , , and . CAV (1), volume 9779 of Lecture Notes in Computer Science, page 43-61. Springer, (2016)Algebraic and Euclidean Lattices: Optimal Lattice Reduction and Beyond., , and . IACR Cryptology ePrint Archive, (2019)Certified lattice reduction., and . Adv. Math. Commun., 14 (1): 137-159 (2020)Proving Expected Sensitivity of Probabilistic Programs., , , , and . CoRR, (2017)Towards Faster Polynomial-Time Lattice Reduction., , and . CRYPTO (2), volume 12826 of Lecture Notes in Computer Science, page 760-790. Springer, (2021)Adaptive precision LLL and Potential-LLL reductions with Interval arithmetic., and . IACR Cryptology ePrint Archive, (2016)On a hybrid approach to solve binary-LWE., , and . IACR Cryptol. ePrint Arch., (2020)GALACTICS: Gaussian Sampling for Lattice-Based Constant- Time Implementation of Cryptographic Signatures, Revisited., , , , , and . CCS, page 2147-2164. ACM, (2019)Finding Short Integer Solutions When the Modulus Is Small., , and . CRYPTO (3), volume 14083 of Lecture Notes in Computer Science, page 150-176. Springer, (2023)Plover: Masking-Friendly Hash-and-Sign Lattice Signatures., , , , , and . IACR Cryptol. ePrint Arch., (2024)