( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Correlation decay and deterministic FPTAS for counting list-colorings of a graph.

, и . SODA, стр. 1245-1254. SIAM, (2007)

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.

Dmitriy Nikolayev

Dmitriy Izychev

Dmitriy Stukalin

Dmitriy Logashenko

Dmitriy Shevela

 

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

Correlation decay and deterministic FPTAS for counting list-colorings of a graph., и . SODA, стр. 1245-1254. SIAM, (2007)Active Structure Learning of Causal DAGs via Directed Clique Trees., , , , , и . NeurIPS, (2020)The stability of the deterministic Skorokhod problem is undecidable., и . Queueing Syst. Theory Appl., 79 (3-4): 221-249 (2015)Sample Efficient Active Learning of Causal Trees., , , , , , и . NeurIPS, стр. 14279-14289. (2019)Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier., , , , и . AISTATS, том 206 из Proceedings of Machine Learning Research, стр. 10445-10469. PMLR, (2023)Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule., , , и . ICALP (1), том 5555 из Lecture Notes in Computer Science, стр. 144-155. Springer, (2009)Size of Interventional Markov Equivalence Classes in random DAG models., , , и . AISTATS, том 89 из Proceedings of Machine Learning Research, стр. 3234-3243. PMLR, (2019)Brief Announcement: Flexible Resource Allocation for Clouds and All-Optical Networks., , и . SPAA, стр. 225-226. ACM, (2016)Active Structure Learning of Causal DAGs via Directed Clique Tree., , , , , и . CoRR, (2020)A deterministic approximation algorithm for computing the permanent of a 0, 1 matrix., и . J. Comput. Syst. Sci., 76 (8): 879-883 (2010)