( en | de | ru )

 

Disambiguation of "Khmelnitsky, Igor"

Author of the publication

copydeleteadd this publication to your clipboard
Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise.

, , , , , , , and . GandALF, volume 370 of EPTCS, page 81-96. (2022)

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.

Igor Barabash

Das Bildzitat im Internet. Uni München, (2009)

Igor Smolitsch

Igor Popov

Igor Pilawski

Igor Yakushev

 

Other publications of authors with the same name

Commodification of accelerations for the Karp and Miller Construction., , and . Discret. Event Dyn. Syst., 31 (2): 251-270 (2021)Dynamic Recursive Petri Nets., and . Petri Nets, volume 12152 of Lecture Notes in Computer Science, page 345-366. Springer, (2020)Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search., , , , , , , , and . ICGI, volume 153 of Proceedings of Machine Learning Research, page 113-129. PMLR, (2021)Property-Directed Verification and Robustness Certification of Recurrent Neural Networks., , , , , , , , , and . ATVA, volume 12971 of Lecture Notes in Computer Science, page 364-380. Springer, (2021)Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise., , , , , , , and . Log. Methods Comput. Sci., (2024)Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise., , , , , , , and . GandALF, volume 370 of EPTCS, page 81-96. (2022)Coverability and Termination in Recursive Petri Nets., , and . Petri Nets, volume 11522 of Lecture Notes in Computer Science, page 429-448. Springer, (2019)Minimal Coverability Tree Construction Made Complete and Efficient., , and . FoSSaCS, volume 12077 of Lecture Notes in Computer Science, page 237-256. Springer, (2020)