Travelled to:
1 × France
1 × Italy
1 × Portugal
1 × Spain
2 × USA
Collaborated with:
R.H.Sloan H.D.Gröger M.Langlois A.Hajnal W.Maass K.V.Adaricheva B.Szörényi A.Bhattacharya B.DasGupta D.Mubayi M.Ajtai L.Babai P.Hajnal J.Komlós P.Pudlák V.Rödl E.Szemerédi
Talks about:
horn (3) complex (2) bound (2) properti (1) function (1) contract (1) communic (1) approxim (1) remaind (1) program (1)
Person: György Turán
DBLP: Tur=aacute=n:Gy=ouml=rgy
Contributed to:
Wrote 6 papers:
- KR-2012-AdarichevaSST #complexity
- Horn Belief Contraction: Remainders, Envelopes and Complexity (KVA, RHS, BS, GT).
- ICALP-v1-2010-BhattacharyaDMT #approximate #on the
- On Approximate Horn Formula Minimization (AB, BD, DM, GT), pp. 438–450.
- SAT-2007-LangloisST #bound
- Horn Upper Bounds and Renaming (ML, RHS, GT), pp. 80–93.
- ICALP-1991-GrogerT #linear #on the
- On Linear Decision Trees Computing Boolean Functions (HDG, GT), pp. 707–718.
- STOC-1988-HajnalMT #communication #complexity #graph #on the
- On the Communication Complexity of Graph Properties (AH, WM, GT), pp. 186–191.
- STOC-1986-AjtaiBHKPRST #bound #branch #source code
- Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.