| |
| 2009 | ||
|---|---|---|
| 5 | EE | Noam Livne: A note on I-completeness of NP-witnessing relations. Inf. Process. Lett. 109(5): 259-261 (2009) |
| 2008 | ||
| 4 | EE | Amos Beimel, Noam Livne, Carles Padró: Matroids Can Be Far from Ideal Secret Sharing. TCC 2008: 194-212 |
| 3 | EE | Amos Beimel, Noam Livne: On Matroids and Nonideal Secret Sharing. IEEE Transactions on Information Theory 54(6): 2626-2643 (2008) |
| 2006 | ||
| 2 | EE | Amos Beimel, Noam Livne: On Matroids and Non-ideal Secret Sharing. TCC 2006: 482-501 |
| 1 | EE | Noam Livne: All Natural NPC Problems Have Average-Case Complete Versions. Electronic Colloquium on Computational Complexity (ECCC) 13(122): (2006) |
| 1 | Amos Beimel | [2] [3] [4] |
| 2 | Carles Padró | [4] |