From post

Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches.

, , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 22:1-22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Functional Monitoring without Monotonicity., , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 95-106. Springer, (2009)An optimal lower bound on the communication complexity of gap-hamming-distance., и . STOC, стр. 51-60. ACM, (2011)When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks., , и . STOC, стр. 19-26. ACM, (2012)A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube., , , и . STOC, стр. 305-311. ACM, (1999)Beyond set disjointness: the communication complexity of finding the intersection., , , , и . PODC, стр. 106-113. ACM, (2014)Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover., и . SODA, стр. 1365-1373. SIAM, (2016)Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models., , и . ICALP, том 168 из LIPIcs, стр. 11:1-11:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Estimating Entropy and Entropy Norm on Data Streams., , и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 196-205. Springer, (2006)Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches., , и . APPROX-RANDOM, том 176 из LIPIcs, стр. 22:1-22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Informational Complexity and the Direct Sum Problem for Simultaneous Message Complexity., , , и . FOCS, стр. 270-278. IEEE Computer Society, (2001)