Author of the publication

String Matching: Communication, Circuits, and Learning.

, , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 56:1-56:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing., , and . ITCS, volume 124 of LIPIcs, page 25:1-25:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Acquaintance Time of a Graph., , and . SIAM J. Discret. Math., 28 (2): 767-785 (2014)A Tight Upper Bound on Acquaintance Time of Graphs., and . Graphs Comb., 32 (5): 1667-1673 (2016)On Mappings on the Hypercube with Small Average Stretch., and . CoRR, (2019)On Axis-Parallel Tests for Tensor Product Codes., , and . Theory Comput., (2020)Acquaintance Time of a Graph, , and . CoRR, (2013)Sorting Networks on Restricted Topologies., , and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 54-66. Springer, (2019)Testing Linearity against Non-signaling Strategies., , and . ACM Trans. Comput. Theory, 12 (3): 16:1-16:51 (2020)On Percolation and NP-Hardness., , and . ICALP, volume 55 of LIPIcs, page 80:1-80:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Direct Sum Testing., , , , and . Electron. Colloquium Comput. Complex., (2014)