6 citations to https://www.mathnet.ru/rus/lics1
  1. Ping Lu, Ting Deng, Haoyuan Zhang, Yufeng Jin, Feiyi Liu, Tiancheng Mao, Lexiao Liu, 2024 IEEE 40th International Conference on Data Engineering (ICDE), 2024, 382  crossref
  2. Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity”, Journal of the ACM, 65:5 (2018), 28–51  mathnet  crossref  isi  scopus
  3. Edward Stabler, Lecture Notes in Computer Science, 10686, Formal Grammar, 2018, 72  crossref
  4. Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 61:2 (2017), 464–493  mathnet  crossref  isi  scopus
  5. Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev, Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2017, 201  crossref
  6. Meghyn Bienvenu, Magdalena Ortiz, Lecture Notes in Computer Science, 9203, Reasoning Web. Web Logic Rules, 2015, 218  crossref