( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Almost optimal query algorithm for hitting set using a subset query.

, , , , и . J. Comput. Syst. Sci., (ноября 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.

Gopinath Muruganandam

Gopinath Ganji

K Mishra

Dushyant Mishra

Brahmdatt Mishra

 

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

Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams., , , , и . CoRR, (2019)FPT Algorithms for Embedding into Low-Complexity Graphic Metrics., , и . TOCT, 12 (1): 1:1-1:41 (2020)Improved Algorithms for the Evacuation Route Planning Problem., , и . CoRR, (2016)Bipartite Independent Set Oracles and Beyond: Can it Even Count Triangles in Polylogarithmic Queries?, , и . CoRR, (2021)Testing of Index-Invariant Properties in the Huge Object Model., , , , и . CoRR, (2022)Improved Algorithms for the Evacuation Route Planning Problem., , и . COCOA, том 9486 из Lecture Notes in Computer Science, стр. 3-19. Springer, (2015)Optimal (Degree+1)-Coloring in Congested Clique., , , и . ICALP, том 261 из LIPIcs, стр. 46:1-46:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds., , , и . APPROX-RANDOM, том 207 из LIPIcs, стр. 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Triangle Estimation Using Tripartite Independent Set Queries., , , и . ISAAC, том 149 из LIPIcs, стр. 19:1-19:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Exploring the Gap between Tolerant and Non-tolerant Distribution Testing., , , , и . CoRR, (2021)