RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Podolskii Vladimir Vladimirovich

Total publications: 27 (27)
in MathSciNet: 18 (18)
in zbMATH: 15 (15)
in Web of Science: 18 (18)
in Scopus: 24 (24)
Cited articles: 20
Citations in Math-Net.Ru: 9
Citations in MathSciNet (by Sep 2017): 19
Citations in Web of Science: 50
Citations in Scopus: 128
Presentations: 14

Number of views:
This page:2214
Abstract pages:1191
Full texts:114
References:94
Candidate of physico-mathematical sciences
E-mail:
Website: http://www.mi.ras.ru/~podolskii

Subject:

Computational complexity theory.


http://www.mathnet.ru/eng/person47204
http://scholar.google.com/citations?user=56S9XEsAAAAJ&hl=en
http://zbmath.org/authors/?q=ai:podolskii.vladimir-v
http://www.ams.org/mathscinet/search/author.html?return=viewitems&mrauthid=864796
http://www.researcherid.com/rid/K-1430-2015
http://www.scopus.com/authid/detail.url?authorId=23092161300

Full list of publications:
| by years | by types | by times cited | scientific publications | common list |


1. Vladimir V. Podolskii, “Bounds in Ontology-Based Data Access via Circuit Complexity”, Theory Comput. Syst., 61:2 (2017), 464–493  mathnet  crossref  isi  elib  scopus
2. M. Bienvenu, S. Kikot, R. Kontchakov, V. V. Podolskii, V. Ryzhikov, M. Zakharyaschev, “The complexity of ontology-based data access with OWL2QL and bounded treewidth queries”, Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Volume Part F127745, 9 May 2017 (Chicago, United States, 14 May 2017 do 19 May 2017, Kod 127745), 2017, 201–216  crossref
3. M. Bienvenu, S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries” (Cape Town, South Africa, 22 April 2016 – 25 April 2016), CEUR Workshop Proceedings, 1577, 2016 , arXiv: 1604.05258  mathnet  elib  scopus
4. K. A. Hansen, V. V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Inform. and Comput., 240 (2015), 56–73  mathnet  crossref  mathscinet  zmath  isi  elib  scopus (cited: 2)
5. Dima Grigoriev, Vladimir V. Podolskii, “Complexity of tropical and min-plus linear prevarieties”, Comput. Complexity, 24:1 (2015), 31–64 http://www.mpim-bonn.mpg.de/preblob/5202, arXiv: 1204.4578  mathnet (cited: 1)  crossref  mathscinet (cited: 2)  zmath  isi (cited: 2)  scopus (cited: 3)
6. D. Grigoriev, V. V. Podolskii, “Tropical effective primary and dual Nullstellensätze”, 32nd International Symposium on Theoretical Aspects of Computer Science, LIPIcs. Leibniz Int. Proc. Inform., 30, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2015, 379–391  mathnet  crossref  mathscinet (cited: 1)  scopus (cited: 2)
7. V. V. Podolskii, “Circuit complexity meets ontology-based data access”, 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015, Proceedings, Lecture Notes in Comput. Sci., 9139, 2015, 7–26 , arXiv: 1506.01296  mathnet  crossref  mathscinet  zmath  scopus (cited: 1)
8. Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii, “Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results”, 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), IEEE, 2015, 317–328  mathnet  crossref  isi (cited: 1)  scopus (cited: 9)
9. Georg Gottlob, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Thomas Schwentick, Michael Zakharyaschev, “The price of query rewriting in ontology-based data access”, Artificial Intelligence, 213 (2014), 42–59  mathnet  crossref  mathscinet  zmath  isi (cited: 12)  elib (cited: 13)  scopus (cited: 31)
10. Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev, “On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase”, Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), ACM Digital Library, 2014, 57:1–57:10 , arXiv: 1401.4420
11. M. Bienvenu, S. Kikot, V. Podolskii, “Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries”, Description Logics 2014, CEUR Workshop Proceedings, 1193, 2014, 45–57 http://ceur-ws.org/Vol-1193/paper_43.pdf  mathnet  scopus (cited: 2)
12. V. V. Podolskii, “Lower bound on weights of large degree threshold functions”, Log. Methods Comput. Sci., 9:2 (2013), 13 , 17 pp.  mathnet  crossref  mathscinet (cited: 1)  zmath  isi  elib  scopus (cited: 1)
13. K. A. Hansen, V. V. Podolskii, “Polynomial threshold functions and Boolean threshold circuits”, Mathematical Foundations of Computer Science 2013, 38th International Symposium, MFCS 2013 (Klosterneuburg, Austria, August 26–30, 2013), Proceedings, Lecture Notes in Computer Science, 8087, Springer, Berlin–Heidelberg, 2013, 516–527 http://eccc.hpi-web.de/report/2013/021/  mathnet  crossref  mathscinet (cited: 1)  zmath  isi (cited: 2)  scopus (cited: 4)
14. K. A. Hansen, R. I. Jensen, V. V. Podolskii, E. P. Tsigaridas, “Patience of matrix games”, Discrete Appl. Math., 161:16–17 (2013), 2440–2459  mathnet  crossref  mathscinet  zmath  isi  elib  scopus
15. S. Kikot, R. Kontchakov, V. Podolskii, M. Zakharyaschev, “Query Rewriting over Shallow Ontologies”, Description Logics 2013, Informal Proceedings of the 26th International Workshop on Description Logics (Ulm, Germany, July 23–26, 2013), CEUR Workshop Proceedings, 1014, 2013, 316–327  mathnet  scopus (cited: 3)
16. V. V. Podolskii, “Exponential lower bound for bounded depth circuits with few threshold gates”, Inform. Process. Lett., 112:7 (2012), 267–271  mathnet  crossref  mathscinet  zmath  isi  elib (cited: 1)  scopus (cited: 2)
17. V. V. Podolskii, “Lower bound on weights of large degree threshold functions”, How the World Computes, Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012 (Cambridge, UK, June 18–23, 2012), Proceedings, Lecture Notes in Comput. Sci., 7318, Springer–Berlin–Heidelberg, 2012, 599–608 , arXiv: 1204.2652  mathnet  crossref  mathscinet  zmath  scopus
18. K. A. Hansen, R. Ibsen-Jensen, V. V. Podolskii, E. P. Tsigaridas, Patience of matrix games, 2012 , 32 pp., arXiv: 1206.1751
19. S. Kikot, R. Kontchakov, V. V. Podolskii, M. Zakharyaschev, “Exponential lower bounds and separation for query rewriting”, Automata, Languages, and Programming, 39th International Colloquium, ICALP 2012 (Warwick, UK, July 9–13, 2012), Proceedings, Part II, Lecture Notes in Comput. Sci., 7392, Springer Berlin Heidelberg, 2012, 263–274 , arXiv: 1202.4193  mathnet  crossref  mathscinet  zmath  isi (cited: 10)  elib (cited: 11)  scopus (cited: 27)
20. Vladimir V. Podolskii, “Degree-uniform lower bound on the weights of polynomials with given sign function”, Proc. Steklov Inst. Math., 274 (2011), 231–246  mathnet  crossref  mathscinet  isi (cited: 1)  elib  scopus (cited: 1)
21. V. V. Podolskii, A. A. Sherstov, “A Small Decrease in the Degree of a Polynomial with a Given Sign Function Can Exponentially Increase Its Weight and Length”, Math. Notes, 87:6 (2010), 860–873  mathnet  crossref  crossref  mathscinet  isi (cited: 1)  elib (cited: 2)  elib (cited: 2)  scopus (cited: 2)
22. K. A. Hansen, V. V. Podolskii, “Exact threshold circuits”, Proc. of 25th Annual IEEE Conference on Computational Complexity (CCC), IEEE Computer Soc., Los Alamitos, CA, 2010, 270–279  crossref  mathscinet (cited: 1)  isi (cited: 4)  scopus (cited: 9)
23. L. Babai, K. A. Hansen, V. Podolskii, Sun Xiaoming, “Weights of exact threshold functions”, Mathematical foundations of computer science 2010, Proc. of 35th International Symposium on Mathematical Foundations of Computer Science (MFCS) (Brno, Czech Republic, 2010), Lecture Notes in Comput. Sci., 6281, Springer, Berlin, 2010, 66–77  crossref  mathscinet (cited: 3)  zmath  isi (cited: 2)  scopus (cited: 4)
24. V. V. Podolskii, “Perceptrons of large weight”, Problems Inform. Transmission, 45:1 (2009), 46–53  mathnet  crossref  mathscinet  zmath  isi (cited: 8)  elib (cited: 13)  scopus (cited: 12)
25. V. V. Podolskii, A. A. Sherstov, “Reducing by 1 the degree of a polynomial with fixed sign function can increase exponentially its weight and length”, Russian Math. Surveys, 64:5 (2009), 950–951  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib  scopus
26. V. V. Podolskii, “A uniform lower bound on weights of perceptrons”, Computer science—theory and applications, Lecture Notes in Comput. Sci., 5010, Springer, Berlin, 2008, 261–272  crossref  mathscinet (cited: 4)  zmath  isi (cited: 5)  scopus (cited: 7)
27. V. V. Podolskii, “Perceptrons of large weight”, Computer science — theory and applications, Proceedings of the Second International Symposium on Computer Science in Russia, CSR 2007 (Ekaterinburg, Russia, 2007), Lecture Notes in Comput. Sci., 4649, 2007, 328–336  crossref  zmath  isi (cited: 1)  scopus (cited: 4)

Presentations in Math-Net.Ru
1. О корнях многочленов в мин-плюс алгебре
V. V. Podolskii
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
November 21, 2017 18:30
2. Ontology-based data access meets circuit complexity
V. V. Podolskii
Applied Mathematics Day
September 22, 2017 17:00   
3. Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
V. V. Podolskii
MIPT Interdepartmental Seminar on Discrete Mathematics
March 23, 2017 18:30
4. Polynomials in min-plus algebra and related algorithmic problems
V. V. Podolskii
Mathematical Logic, Algebra and Computation: A two-day conference dedicated to 85-th anniversary of S. I. Adian
July 19, 2016 15:50   
5. Оценки длин преобразований запросов к снабженным логической теорией базам данных
V. V. Podolskii
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
December 1, 2015 18:30
6. Bounds on the size of query rewritings in ontology based data access
V. V. Podolskii
Scientific session of the Steklov Mathematical Institute of RAS dedicated to the results of 2015
November 11, 2015 11:45   
7. Min-Plus polynomials and mean payoff games
V. V. Podolskii
Colloquium of the Faculty of Computer Science
April 30, 2015 16:40   
8. Approximation of Boolean functions by polynomials
V. V. Podolskii
Colloquium of the Steklov Mathematical Institute of Russian Academy of Sciences
April 2, 2015 16:00   
9. On the analog of Hilbert's Nullstellensatz for polynomials in algebraic system $(\mathbb{R}, \min, +)$
V. V. Podolskii
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
November 11, 2014 18:30
10. Threshold gates on the set $\{1,2\}$ and threshold circuits
V. V. Podolskii
Kolmogorov seminar on computational complexity and descriptive complexity
April 1, 2013 16:45
11. On the analog of Hilbert's Nullstellensatz theorem in the algebraic system $(\mathbb{R}, \min, +)$.
V. V. Podolskii
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
March 26, 2013 18:30
12. On the representation of Boolean functions by sign functions of integer polynomials
V. V. Podolskii
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
December 4, 2012 18:30
13. On equations in $(\mathbb{Z}, \min, +)$ algebraic system
V. V. Podolskii
Seminar of the Department of Mathematical Logic "Algorithmic problems in algebra and logic"
May 15, 2012 18:30
14. On some classes of Boolean schemes of bounded depth
V. V. Podolskii
Traditional Christmas session MIAN-POMI, 2009 "Logic and Theoretical Computer Science"
December 18, 2009 16:00   

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2017