The price of query rewriting in ontology-based data access G Gottlob, S Kikot, R Kontchakov, V Podolskii, T Schwentick, ... Artificial Intelligence 213, 42-59, 2014 | 64 | 2014 |

Exponential lower bounds and separation for query rewriting S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev International Colloquium on Automata, Languages, and Programming, 263-274, 2012 | 38 | 2012 |

Perceptrons of large weight VV Podolskii Problems of Information Transmission 45 (1), 46-53, 2009 | 24 | 2009 |

A uniform lower bound on weights of perceptrons V Podolskii Computer Science–Theory and Applications, 261-272, 2008 | 18 | 2008 |

Complexity of tropical and min-plus linear prevarieties D Grigoriev, VV Podolskii computational complexity 24 (1), 31-64, 2015 | 17 | 2015 |

Exact threshold circuits KA Hansen, VV Podolskii 2010 25th Annual IEEE Conference on Computational Complexity, 270-279, 2010 | 17 | 2010 |

Perceptrons of large weight VV Podolskii Problems of Information Transmission 45 (1), 46-53, 2009 | 15 | 2009 |

On the succinctness of query rewriting over shallow ontologies S Kikot, R Kontchakov, VV Podolskii, M Zakharyaschev Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 14 | 2014 |

Tropical effective primary and dual Nullstellensätze D Grigoriev, VV Podolskii Discrete & Computational Geometry 59 (3), 507-552, 2018 | 13 | 2018 |

Tree-like queries in OWL 2 QL: succinctness and complexity results M Bienvenu, S Kikot, V Podolskii Proceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer …, 2015 | 12 | 2015 |

The complexity of ontology-based data access with OWL 2 QL and bounded treewidth queries M Bienvenu, S Kikot, R Kontchakov, VV Podolskii, V Ryzhikov, ... Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2017 | 11 | 2017 |

Weights of exact threshold functions L Babai, KA Hansen, VV Podolskii, X Sun International Symposium on Mathematical Foundations of Computer Science, 66-77, 2010 | 11 | 2010 |

Ontology-mediated queries: Combined complexity and succinctness of rewritings via circuit complexity M Bienvenu, S Kikot, R Kontchakov, VV Podolskii, M Zakharyaschev Journal of the ACM (JACM) 65 (5), 28, 2018 | 10 | 2018 |

Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates AS Kulikov, VV Podolskii arXiv preprint arXiv:1610.02686, 2016 | 10 | 2016 |

Polynomial threshold functions and Boolean threshold circuits KA Hansen, VV Podolskii Information and Computation 240, 56-73, 2015 | 7 | 2015 |

Query rewriting over shallow ontologies S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev CEUR-WS, 2013 | 7 | 2013 |

On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Shallow Chases S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev arXiv preprint arXiv:1401.4420, 2014 | 6 | 2014 |

Long rewritings, short rewritings S Kikot, R Kontchakov, V Podolskii, M Zakharyaschev Proceedings of the 2012 International Workshop on Description Logics, 2012 | 6 | 2012 |

On the Data Complexity of Ontology-Mediated Queries with a Covering Axiom G Olga, VV Podolskii, S Kikot, M Zakharyaschev Proceedings of the 30th International Workshop on Description Logics …, 2017 | 5* | 2017 |

On the data complexity of ontology-mediated queries with a covering axiom O Gerasimova, S Kikot, V Podolskii, M Zakharyaschev Proceedings of the 30th International Workshop on Description Logics, 2017 | 5 | 2017 |