Valentine Kabanets

1.6k total citations
50 papers, 728 citations indexed

About

Valentine Kabanets is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Valentine Kabanets has authored 50 papers receiving a total of 728 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computational Theory and Mathematics, 42 papers in Artificial Intelligence and 5 papers in Computer Networks and Communications. Recurrent topics in Valentine Kabanets's work include Complexity and Algorithms in Graphs (44 papers), Cryptography and Data Security (24 papers) and Machine Learning and Algorithms (20 papers). Valentine Kabanets is often cited by papers focused on Complexity and Algorithms in Graphs (44 papers), Cryptography and Data Security (24 papers) and Machine Learning and Algorithms (20 papers). Valentine Kabanets collaborates with scholars based in Canada, United States and Israel. Valentine Kabanets's co-authors include Russell Impagliazzo, Avi Wigderson, Ragesh Jaiswal, Ruiwen Chen, Marco Carmosino, Ramamohan Paturi, Ronen Shaltiel, Eric Allender, David Zuckerman and Stephen Cook and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Valentine Kabanets

45 papers receiving 632 citations

Peers

Countries citing papers authored by Valentine Kabanets

Since Specialization

Citations

This map shows the geographic impact of Valentine Kabanets's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Valentine Kabanets with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Valentine Kabanets more than expected).

Fields of papers citing papers by Valentine Kabanets

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Valentine Kabanets. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Valentine Kabanets. The network helps show where Valentine Kabanets may publish in the future.

Co-authorship network of co-authors of Valentine Kabanets

This figure shows the co-authorship network connecting the top 25 collaborators of Valentine Kabanets. A scholar is included among the top collaborators of Valentine Kabanets based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Valentine Kabanets. Valentine Kabanets is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	The Power of Natural Properties as Oracles 2023 ·Computational Complexity ·Russell Impagliazzo, Valentine Kabanets, (unknown)	1
2	Circuit Lower Bounds for MCSP from Local Pseudorandom Generators 2020 ·Mahdi Cheraghchi, Valentine Kabanets, (unknown), (unknown)	1
3	AC^0[p] Lower Bounds Against MCSP via the Coin Problem 2019 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Alexander Golovnev, (unknown), Russell Impagliazzo, Valentine Kabanets, (unknown), Avishay Tal	1
4	Satisfiability and Derandomization for Small Polynomial Threshold Circuits 2018 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Valentine Kabanets, (unknown)	2
5	Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. 2014 ·Electronic colloquium on computational complexity ·Ruiwen Chen, Valentine Kabanets	1
6	Mining Circuit Lower Bound Proofs for Meta-Algorithms. 2013 ·Electronic colloquium on computational complexity ·Ruiwen Chen, Valentine Kabanets, (unknown), Ronen Shaltiel, David Zuckerman	1
7	Compression of Boolean Functions. 2013 ·Electronic colloquium on computational complexity ·Valentine Kabanets, (unknown)	4
8	Lower Bounds Against Weakly-Uniform Threshold Circuits 2013 ·Algorithmica ·Ruiwen Chen, Valentine Kabanets, (unknown)	1
9	Is the Valiant-Vazirani Isolation Lemma Improvable? 2011 ·Electronic colloquium on computational complexity ·Valentine Kabanets, Osamu Watanabe	2
10	Constructive Proofs of Concentration Bounds. 2010 ·Electronic colloquium on computational complexity ·Russell Impagliazzo, Valentine Kabanets	2
11	An axiomatic approach to algebrization 2009 ·Russell Impagliazzo, Valentine Kabanets, (unknown)	11
12	The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs 2007 ·Journal of Computer and System Sciences ·(unknown), Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi	19
13	Uniform Hardness Amplification in NP via Monotone Codes 2006 ·Electronic colloquium on computational complexity ·(unknown), Valentine Kabanets, Rahul Santhanam	10
14	The complexity of unique k-SAT: an isolation lemma for k-CNFs 2004 ·(unknown), Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi	8
15	Derandomizing polynomial identity tests means proving circuit lower bounds 2003 ·Valentine Kabanets, Russell Impagliazzo	12
16	Almost k-wise independence and hard Boolean functions 2003 ·Theoretical Computer Science ·Valentine Kabanets	0
17	Derandomizing polynomial identity tests means proving circuit lower bounds 2003 ·Valentine Kabanets, Russell Impagliazzo	44
18	In search of an easy witness: exponential time vs. probabilistic polynomial time 2002 ·Journal of Computer and System Sciences ·Russell Impagliazzo, Valentine Kabanets, Avi Wigderson	114
19	Easiness Assumptions and Hardness Tests: Trading Time for Zero Error 2001 ·Journal of Computer and System Sciences ·Valentine Kabanets	40
20	Efficiently Approximable Real-Valued Functions 2000 ·Electronic colloquium on computational complexity ·Valentine Kabanets, Charles Rackoff, Stephen Cook	11

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact