Valentine Kabanets

ScholarGPS® ID: 42745904452167

Affiliation

Simon Fraser University, Burnaby/ Surrey/ Downtown Vancouver, Canada

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Metrics Summary

Publication Count

Predicted Citations

2,007

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
The Power of Natural Properties as Oracles (journal article) Impagliazzo, Russell \| Kabanets, Valentine \| Volkovich, Ilya computational complexity, volume 32, issue 2 (2023). 10.1007/s00037-023-00241-0 Cited by (2) \| Cite \| Source
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic (conference) Carmosino, Marco \| Kabanets, Valentine \| Kolokolova, Antonina \| Oliveira, Igor C. 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022) Denver, CO, USA 10.1109/FOCS52979.2021.00080 Cited by (1) \| Cite \| Source
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates (journal article) Kabanets, Valentine \| Koroth, Sajin \| Lu, Zhenjian \| Myrisiotis, Dimitrios \| Oliveira, Igor C. ACM Transactions on Computation Theory, volume 13, issue 4, pages 1-37 (2021). 10.1145/3470861 Cited by (3) \| Cite \| Source
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators (journal article) Cheraghchi, Mahdi \| Kabanets, Valentine \| Lu, Zhenjian \| Myrisiotis, Dimitrios ACM Transactions on Computation Theory, volume 12, issue 3, pages 1-27 (2020). 10.1145/3404860 Cited by (3) \| Cite \| Source
Harmful entomofauna of hemp Cannabis sativa L. (analytical overview) (journal article) Pivtoraiko, V. \| Kabanets, V. \| Vlasenko, V. Karantin i zahist roslin (2020). 10.36495/2312-0614.2020.7-9.20-25 Cited by (1) \| Cite \| Source
Expander construction in VNC1 (journal article) Buss, Sam \| Kabanets, Valentine \| Kolokolova, Antonina \| Koucký, Michal Annals of Pure and Applied Logic, volume 171, issue 7, pages 102796- (2020). 10.1016/j.apal.2020.102796 Cited by (4) \| Cite \| Source
Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017) (journal article) Kabanets, Valentine \| Raskhodnikova, Sofya \| Swamy, Chaitanya SIAM Journal on Computing, volume 49, issue 4, pages FOCS17-i-FOCS17-i (2020). 10.1137/20N975099 Cite \| Source
The power of natural properties as oracles (conference) Impagliazzo, Russell \| Kabanets, Valentine \| Volkovich, Ilya Conference on Computational Complexity (2018) 10.4230/LIPIcs.CCC.2018.7 Cited by (10) \| Cite \| Source
A polynomial restriction lemma with applications (conference) Kabanets, Valentine \| Kane, Daniel M. \| Lu, Zhenjian STOC '17: Symposium on Theory of Computing (2017) Montreal Canada 10.1145/3055399.3055470 Cited by (5) \| Cite \| Source
The Minimum Oracle Circuit Size Problem (journal article) Allender, Eric \| Holden, Dhiraj \| Kabanets, Valentine computational complexity, volume 26, issue 2, pages 469-496 (2017). 10.1007/s00037-016-0124-0 Cited by (17) \| Cite \| Source \| Open Access
Fourier Concentration from Shrinkage (journal article) Impagliazzo, Russell \| Kabanets, Valentine computational complexity, volume 26, issue 1, pages 275-321 (2017). 10.1007/s00037-016-0134-y Cited by (2) \| Cite \| Source
Agnostic Learning from Tolerant Natural Proofs. (conference) Carmosino, Marco L. \| Impagliazzo, Russell \| Kabanets, Valentine \| Kolokolova, Antonina International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2017) 10.4230/LIPIcs.APPROX-RANDOM.2017.35 Cited by (2) \| Cite \| Source
Does Looking Inside a Circuit Help (conference) Impagliazzo, Russell \| Kabanets, Valentine \| Kolokolova, Antonina \| McKenzie, Pierre \| Romani, Shadab Mathematical Foundations of Computer Science (2017) 10.4230/LIPIcs.MFCS.2017.1 Cite \| Source
Expander Construction in VNC1 (conference) Buss, Sam \| Kabanets, Valentine \| Kolokolova, Antonina \| Koucky, Michal Conference on Innovations in Theoretical Computer Science (2017) 10.4230/LIPIcs.ITCS.2017.31 Cited by (2) \| Cite \| Source
Correlation bounds and #SAT algorithms for small linear-size circuits (journal article) Chen, Ruiwen \| Kabanets, Valentine Theoretical Computer Science, volume 654 (2016). 10.1016/j.tcs.2016.05.005 Cited by (7) \| Cite \| Source \| Open Access
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas (journal article) Chen, Ruiwen \| Kabanets, Valentine \| Saurabh, Nitin Algorithmica, volume 76, issue 1, pages 68-87 (2016). 10.1007/s00453-015-0020-z Cited by (3) \| Cite \| Source \| Open Access
Learning algorithms from natural proofs (conference) Carmosino, Marco L. \| Impagliazzo, Russell \| Kabanets, Valentine \| Kolokolova, Antonina Conference on Computational Complexity (2016) 10.4230/LIPIcs.CCC.2016.10 Cited by (25) \| Cite \| Source
Pseudorandomness when the odds are against you (conference) Artemenko, Sergei \| Impagliazzo, Russell \| Kabanets, Valentine \| Shaltiel, Ronen Conference on Computational Complexity (2016) 10.4230/LIPIcs.CCC.2016.9 Cited by (3) \| Cite \| Source
Simultaneous Secrecy and Reliability Amplification for a General Channel Model (book chapter) In Theory of Cryptography Impagliazzo, Russell \| Jaiswal, Ragesh \| Kabanets, Valentine \| Kapron, Bruce M. \| King, Valerie \| Tessaro, Stefano Springer Berlin Heidelberg (2016) 10.1007/978-3-662-53641-4_10 Cite \| Source
Mining Circuit Lower Bound Proofs for Meta-Algorithms (journal article) Chen, Ruiwen \| Kabanets, Valentine \| Kolokolova, Antonina \| Shaltiel, Ronen \| Zuckerman, David computational complexity, volume 24, issue 2, pages 333-392 (2015). 10.1007/s00037-015-0100-0 Cited by (36) \| Cite \| Source \| Open Access