Travelled to:1 × Latvia
1 × Poland
1 × Spain
3 × USA
Collaborated with:P.Pudlák M.Schacht Y.Kohayakawa B.Nagle M.Lauria N.Thapen N.Alon A.Coja-Oghlan H.Hàn M.Kang M.Ajtai L.Babai P.Hajnal J.Komlós E.Szemerédi G.Turán
Talks about:hypergraph (2) graph (2) test (2) distribut (1) algorithm (1) properti (1) regular (1) program (1) general (1) complex (1)
Person: Vojtech Rödl
DBLP: R=ouml=dl:Vojtech
Contributed to:
20132007
2007200219931986Wrote 6 papers:
- ICALP-v1-2013-LauriaPRT #complexity #graph #proving
- The Complexity of Proving That a Graph Is Ramsey (ML, PP, VR, NT), pp. 684–695.
- ICALP-2007-AlonCHKRS #algorithm #graph
- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.
- STOC-2007-RodlS #testing
- Property testing in hypergraphs and the removal lemma (VR, MS), pp. 488–495.
- ICALP-2002-KohayakawaNR #performance #testing
- Efficient Testing of Hypergraphs (YK, BN, VR), pp. 1017–1028.
- STOC-1993-PudlakR
- Modified ranks of tensors and the size of circuits (PP, VR), pp. 523–531.
- STOC-1986-AjtaiBHKPRST #bound #branch #source code
- Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.