BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Japan
1 × Switzerland
1 × United Kingdom
2 × USA
Collaborated with:
S.Raskhodnikova P.Berman D.P.Woodruff K.Makarychev A.Bhattacharyya M.Molinaro A.Kojevnikov A.S.Kulikov S.Chawla T.Schramm A.Andoni A.Nikolov K.Onak V.Karwa A.Smith E.Grigorescu
Talks about:
graph (3) algorithm (2) spanner (2) problem (2) complet (2) dimension (1) structur (1) parallel (1) approxim (1) transit (1)

Person: Grigory Yaroslavtsev

DBLP DBLP: Yaroslavtsev:Grigory

Contributed to:

ICALP (1) 20152015
STOC 20152015
STOC 20142014
ICALP (1) 20112011
VLDB 20112011
SAT 20092009

Wrote 8 papers:

ICALP-v1-2015-MolinaroWY #complexity
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (MM, DPW, GY), pp. 960–972.
STOC-2015-ChawlaMSY #algorithm #clustering #graph
Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.
STOC-2014-AndoniNOY #algorithm #geometry #graph #parallel #problem
Parallel algorithms for geometric graph problems (AA, AN, KO, GY), pp. 574–583.
STOC-2014-BermanRY
Lp-testing (PB, SR, GY), pp. 164–173.
ICALP-v1-2011-BermanBGRWY #transitive
Steiner Transitive-Closure Spanners of Low-Dimensional Posets (PB, AB, EG, SR, DPW, GY), pp. 760–772.
ICALP-v1-2011-BermanBMRY #approximate #problem
Improved Approximation for the Directed Spanner Problem (PB, AB, KM, SR, GY), pp. 1–12.
VLDB-2011-KarwaRSY #analysis #graph
Private Analysis of Graph Structure (VK, SR, AS, GY), pp. 1146–1157.
SAT-2009-KojevnikovKY #performance #using
Finding Efficient Circuits Using SAT-Solvers (AK, ASK, GY), pp. 32–44.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.