☰

Shmuel Safra - Publications

Affiliations: 
Tel Aviv University, Tel Aviv-Yafo, Tel Aviv District, Israel 
Website:
https://www.cs.tau.ac.il/~safra/
Tree Info Similar researchers PubMed Report error

8 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2006 Alon N, Moshkovitz D, Safra S. Algorithmic construction of sets for k -restrictions Acm Transactions On Algorithms. 2: 153-177. DOI: 10.1145/1150334.1150336  0.433
2006 Safra S. Exponential Determinization for Ω-Automata with a Strong Fairness Acceptance Condition Siam Journal On Computing. 36: 803-814. DOI: 10.1137/S0097539798332518  0.373
2006 Ta-Shma A, Zuckerman D, Safra S. Extractors from Reed-Muller codes Journal of Computer and System Sciences. 72: 786-812. DOI: 10.1016/J.Jcss.2005.05.010  0.358
2004 Fischer E, Kindler G, Ron D, Safra S, Samorodnitsky A. Testing juntas Journal of Computer and System Sciences. 68: 753-787. DOI: 10.1016/J.Jcss.2003.11.004  0.364
2004 Dinur I, Safra S. On the hardness of approximating label-cover Information Processing Letters. 89: 247-254. DOI: 10.1016/J.Ipl.2003.11.007  0.508
2003 Dinur I, Kindler G, Raz R, Safra S. Approximating CVP to Within Almost-Polynomial Factors is NP-Hard Combinatorica. 23: 205-243. DOI: 10.1007/S00493-003-0019-Y  0.502
2003 Safra S, Schwartz O. On the Complexity of Approximating TSP with Neighborhoods and Related Problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2832: 446-458. DOI: 10.1007/S00037-005-0200-3  0.587
2000 Goldreich O, Safra S. A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem Siam Journal On Computing. 29: 1132-1154. DOI: 10.1137/S0097539797315744  0.365
Show low-probability matches.