Yuval Domb

According to our database, Yuval Domb authored at least 9 papers between 2012 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

Why Self-Supervised Encoders Want to Be Normal.

Yuval Domb

CoRR, April, 2026

2025

LiteAttention: A Temporal Sparse Attention for Diffusion Transformers.

Dor Shmilovich, Tony Wu, Aviad Dahan, Yuval Domb

CoRR, November, 2025

Speeding Up Sum-Check Proving.

Suyash Bagad, Quang Dao, Yuval Domb, Justin Thaler

IACR Cryptol. ePrint Arch., 2025

2024

Really Complex Codes with Application to STARKs.

Yuval Domb

IACR Cryptol. ePrint Arch., 2024

The Sum-Check Protocol over Fields of Small Characteristic.

Suyash Bagad, Yuval Domb, Justin Thaler

IACR Cryptol. ePrint Arch., 2024

2016

The Random Coding Bound Is Tight for the Average Linear Code or Lattice.

Yuval Domb, Ram Zamir, Meir Feder

IEEE Trans. Inf. Theory, 2016

Non-Random Coding Error Bounds for Lattices.

Yuval Domb, Meir Feder

IEEE Trans. Inf. Theory, 2016

2012

A Distance Spectrum Based, Upper Error Bound for Lattices

Yuval Domb, Meir Feder

CoRR, 2012

Non-random coding error exponent for lattices.

Yuval Domb, Meir Feder

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012