28 citations · 79 across the 28 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.IT2012★ 5 cited
Capacity achieving multiwrite WOM codes
Amir Shpilka
In this paper we give an explicit construction of a capacity achieving family of binary t-write WOM codes for any number of writes t, that have a polynomial time encoding and decod…
cs.CC2012★ 5 cited
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs
Michael A. Forbes, Amir Shpilka
We study the problem of obtaining deterministic black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. Thi…