Travelled to:2 × Canada
5 × USA
Collaborated with:M.Y.Vardi I.Dinur R.Raz ∅ X.Deng C.H.Papadimitriou O.Kupferman P.B.Miltersen N.Nisan A.Wigderson E.Fischer G.Kindler
Talks about:automata (3) probabl (3) error (3) character (2) constant (2) complex (2) sub (2) pcp (2) equilibria (1) exponenti (1)
Person: Shmuel Safra
DBLP: Safra:Shmuel
Contributed to:
200219991997
1996199519921989Wrote 8 papers:
- STOC-2002-DengPS #complexity #on the
- On the complexity of equilibria (XD, CHP, SS), pp. 67–71.
- STOC-2002-DinurS
- The importance of being biased (ID, SS), pp. 33–42.
- STOC-1999-DinurFKRS #towards
- PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability (ID, EF, GK, RR, SS), pp. 29–40.
- STOC-1997-RazS
- A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP (RR, SS), pp. 475–484.
- LICS-1996-KupfermanSV #automaton #word
- Relating Word and Tree Automata (OK, SS, MYV), pp. 322–332.
- STOC-1995-MiltersenNSW #communication #complexity #data type #on the #symmetry
- On data structures and asymmetric communication complexity (PBM, NN, SS, AW), pp. 103–111.
- STOC-1992-Safra #automaton #exponential
- Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition (SS), pp. 275–282.
- STOC-1989-SafraV #automaton #logic #on the
- On ω-Automata and Temporal Logic (SS, MYV), pp. 127–137.