 | 2012 |
|---|
| 4 |       | Eli Ben-Sasson,
Alessandro Chiesa,
Daniel Genkin,
Eran Tromer:
On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs.
Electronic Colloquium on Computational Complexity (ECCC) 19: 45 (2012) |
| 3 | | Eli Ben-Sasson,
Alessandro Chiesa,
Daniel Genkin,
Eran Tromer:
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems.
IACR Cryptology ePrint Archive 2012: 71 (2012) |
| 2010 |
|---|
| 2 | | Daniel Genkin,
Nissim Francez,
Michael Kaminski:
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars.
Essays in Memory of Amir Pnueli 2010: 144-166 |
| 1 | | Tamar Aizikowitz,
Nissim Francez,
Daniel Genkin,
Michael Kaminski:
Extending Free Pregroups with Lower Bounds.
Studia Logica 95(3): 417-441 (2010) |
Data released under the ODC-BY 1.0 license — See also our legal information page