From post

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.

 

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

Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs., , и . CoRR, (2018)Control of Tele-Operation Systems Subject to Capacity Limited Channels and Uncertainty., и . CCECE, стр. 1019-1024. IEEE, (2006)Suboptimal decentralized control over noisy communication channels., и . Syst. Control. Lett., 60 (4): 285-293 (2011)Memory-Restricted and Secure Algorithms For Large Datasets.. University of Maryland, College Park, MD, USA, (2022)base-search.net (ftunivmaryland:oai:drum.lib.umd.edu:1903/28878).Online Bipartite Matching with Reusable Resources., , , и . CoRR, (2021)Stochastic Matching with Few Queries: New Algorithms and Tools., , , и . SODA, стр. 2855-2874. SIAM, (2019)An integration framework for Control/Communication/Computation (3C) co-design with application in fleet control of AUVs., и . CDC/ECC, стр. 193-198. IEEE, (2011)Differentially Private Densest Subgraph., , и . AISTATS, том 151 из Proceedings of Machine Learning Research, стр. 11581-11597. PMLR, (2022)A practical approach to networked control design for robust H∞ performance in the presence of uncertainties in both communication and system., , и . Appl. Math. Comput., (2020)On the Complexity of Chore Division., и . IJCAI, стр. 226-232. ijcai.org, (2018)