( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lattice Enumeration Using Extreme Pruning.

, , и . EUROCRYPT, том 6110 из Lecture Notes in Computer Science, стр. 257-278. Springer, (2010)

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.

Oded Green

Oded Maron

Oded Löwenbein

Oded Friedmann

Oded Winter

 

Другие публикации лиц с тем же именем

Long Monotone Paths in Line Arrangements., , , , и . Discrete & Computational Geometry, 32 (2): 167-176 (2004)Recovering Short Generators of Principal Ideals in Cyclotomic Rings., , , и . IACR Cryptology ePrint Archive, (2015)Lattice Enumeration Using Extreme Pruning., , и . EUROCRYPT, том 6110 из Lecture Notes in Computer Science, стр. 257-278. Springer, (2010)On lattices, learning with errors, random linear codes, and cryptography.. STOC, стр. 84-93. ACM, (2005)The Hardness of 3-Uniform Hypergraph Coloring., , и . Comb., 25 (5): 519-535 (2005)Quantum One-Way Communication is Exponentially Stronger Than Classical Communication., и . Electron. Colloquium Comput. Complex., (2010)Strongly Polynomial Algorithms for the Unsplittable Flow Problem., и . IPCO, том 2081 из Lecture Notes in Computer Science, стр. 15-29. Springer, (2001)The Minrank of Random Graphs., , и . IEEE Trans. Inf. Theory, 64 (11): 6990-6995 (2018)Improved Inapproximability of Lattice and Coding Problems with Preprocessing.. CCC, стр. 363-370. IEEE Computer Society, (2003)Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation., , , , , и . FOCS, стр. 42-51. IEEE Computer Society, (2004)