( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory.

, , , , и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 151-162. Springer, (2015)

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.

Võ V n Loan

N V Fernandez Villalobos

n n n

Lê v n Ä i h

V Saile

 

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

A Note on Mod and Generalised Mod Classes., и . Inf. Process. Lett., 55 (1): 27-31 (1995)Model Counting Meets Distinct Elements., , , и . Commun. ACM, 66 (9): 95-102 (сентября 2023)Testing Product Distributions: A Closer Look., , , и . ALT, том 132 из Proceedings of Machine Learning Research, стр. 367-396. PMLR, (2021)Model Counting meets F0 Estimation., , , и . PODS, стр. 299-311. ACM, (2021)The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract)., и . ALT, том 1160 из Lecture Notes in Computer Science, стр. 100-112. Springer, (1996)Computing triangle and open-wedge heavy-hitters in large networks., , , , и . IEEE BigData, стр. 998-1005. IEEE Computer Society, (2016)Exact learning via teaching assistants., и . Theor. Comput. Sci., 241 (1-2): 51-81 (2000)A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs., , , , , и . Electron. Colloquium Comput. Complex., (2019)Distinct Elements in Streams: An Algorithm for the (Text) Book., , и . CoRR, (2023)On the Feasibility of Forgetting in Data Streams., , , и . Proc. ACM Manag. Data, 2 (2): 102 (2024)