( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Streaming complexity of CSPs with randomly ordered constraints.

, , , и . SODA, стр. 4083-4103. SIAM, (2023)

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.

Abhinav Saxena

Ambrish Saxena

Amit Saxena

Sabine Saxena

Krishna Saxena

 

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

Streaming complexity of CSPs with randomly ordered constraints., , , и . SODA, стр. 4083-4103. SIAM, (2023)Computation over the Noisy Broadcast Channel with Malicious Parties., , , и . ITCS, том 185 из LIPIcs, стр. 82:1-82:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Binary Interactive Error Resilience Beyond $^1\!/\!_8$ (or why $(^1\!/\!_2)^3 > ^1\!/\!_8)$., , и . FOCS, стр. 470-481. IEEE, (2020)Circuits resilient to short-circuit errors., , , , , , и . STOC, стр. 582-594. ACM, (2022)Interactive error resilience beyond 2/7., , и . STOC, стр. 565-578. ACM, (2020)Exponential communication separations between notions of selfishness., , , , и . STOC, стр. 947-960. ACM, (2021)Optimal error resilience of adaptive message exchange., , и . STOC, стр. 1235-1247. ACM, (2021)An Improved Lower Bound for Matroid Intersection Prophet Inequalities., , и . ITCS, том 251 из LIPIcs, стр. 95:1-95:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems., , , и . FOCS, стр. 354-364. IEEE, (2020)Binary Codes with Resilience Beyond 1/4 via Interaction., , , и . FOCS, стр. 1-12. IEEE, (2022)