Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDValentine Kabanets
Person information
- affiliation: Simon Fraser University, Burnaby, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j25]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Carboni Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. ACM Trans. Comput. Theory 13(4): 23:1-23:37 (2021)- [c37]Marco Carmosino, Kenneth Hoover, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Lifting for Constant-Depth Circuits and Applications to MCSP. ICALP 2021: 44:1-44:20 - [e1]Valentine Kabanets:
36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference). LIPIcs 200, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-193-1 [contents] - [i38]Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor Carboni Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. Electron. Colloquium Comput. Complex. 28: 95 (2021) - 2020
- [j24]Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký:
Expander construction in VNC1. Ann. Pure Appl. Log. 171(7): 102796 (2020) - [j23]Valentine Kabanets, Sofya Raskhodnikova, Chaitanya Swamy:
Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017). SIAM J. Comput. 49(4) (2020) - [j22]Mahdi Cheraghchi
, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. ACM Trans. Comput. Theory 12(3): 21:1-21:27 (2020) - [c36]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Carboni Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. Computational Complexity Conference 2020: 15:1-15:41 - [i37]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Carboni Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. CoRR abs/2002.08533 (2020) - [i36]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor Carboni Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. Electron. Colloquium Comput. Complex. 27: 18 (2020)
2010 – 2019
- 2019
- [c35]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. ICALP 2019: 39:1-39:14 - [c34]Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds Against MCSP via the Coin Problem. ICALP 2019: 66:1-66:15 - [i35]Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds against MCSP via the Coin Problem. Electron. Colloquium Comput. Complex. 26: 18 (2019) - [i34]Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. Electron. Colloquium Comput. Complex. 26: 22 (2019) - 2018
- [c33]Valentine Kabanets, Zhenjian Lu:
Satisfiability and Derandomization for Small Polynomial Threshold Circuits. APPROX-RANDOM 2018: 46:1-46:19 - [c32]Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
The Power of Natural Properties as Oracles. Computational Complexity Conference 2018: 7:1-7:20 - [i33]Markus Bläser, Valentine Kabanets, Jacobo Torán, Christopher Umans:
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391). Dagstuhl Reports 8(9): 133-153 (2018) - [i32]Valentine Kabanets, Zhenjian Lu:
Nisan-Wigderson Pseudorandom Generators for Circuits with Polynomial Threshold Gates. Electron. Colloquium Comput. Complex. 25: 12 (2018) - [i31]Valentine Kabanets, Zhenjian Lu:
Satisfiability and Derandomization for Small Polynomial Threshold Circuits. Electron. Colloquium Comput. Complex. 25: 115 (2018) - 2017
- [j21]Russell Impagliazzo, Valentine Kabanets:
Fourier Concentration from Shrinkage. Comput. Complex. 26(1): 275-321 (2017) - [j20]Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. Comput. Complex. 26(2): 469-496 (2017) - [c31]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Agnostic Learning from Tolerant Natural Proofs. APPROX-RANDOM 2017: 35:1-35:19 - [c30]Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký:
Expander Construction in VNC1. ITCS 2017: 31:1-31:26 - [c29]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani:
Does Looking Inside a Circuit Help?. MFCS 2017: 1:1-1:13 - [c28]Valentine Kabanets, Daniel M. Kane, Zhenjian Lu:
A polynomial restriction lemma with applications. STOC 2017: 615-628 - [i30]Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich:
The Power of Natural Properties as Oracles. Electron. Colloquium Comput. Complex. 24: 23 (2017) - [i29]Valentine Kabanets, Daniel M. Kane, Zhenjian Lu:
A Polynomial Restriction Lemma with Applications. Electron. Colloquium Comput. Complex. 24: 26 (2017) - [i28]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Pierre McKenzie, Shadab Romani:
Does Looking Inside a Circuit Help? Electron. Colloquium Comput. Complex. 24: 109 (2017) - 2016
- [j19]Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small de Morgan Formulas. Algorithmica 76(1): 68-87 (2016) - [j18]Ruiwen Chen, Valentine Kabanets:
Correlation bounds and #SAT algorithms for small linear-size circuits. Theor. Comput. Sci. 654: 2-10 (2016) - [c27]Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel:
Pseudorandomness When the Odds are Against You. Computational Complexity Conference 2016: 9:1-9:35 - [c26]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Learning Algorithms from Natural Proofs. Computational Complexity Conference 2016: 10:1-10:24 - [c25]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. TCC (B1) 2016: 235-261 - [i27]Valentine Kabanets, Thomas Thierauf, Jacobo Torán, Christopher Umans:
Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411). Dagstuhl Reports 6(10): 13-32 (2016) - [i26]Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Algorithms from Natural Lower Bounds. Electron. Colloquium Comput. Complex. 23: 8 (2016) - [i25]Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets, Ronen Shaltiel:
Pseudorandomness when the odds are against you. Electron. Colloquium Comput. Complex. 23: 37 (2016) - [i24]Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký:
Expander Construction in VNC1. Electron. Colloquium Comput. Complex. 23: 144 (2016) - [i23]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro:
Simultaneous Secrecy and Reliability Amplification for a General Channel Model. IACR Cryptol. ePrint Arch. 2016: 760 (2016) - 2015
- [j17]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Comput. Complex. 24(2): 333-392 (2015) - [c24]Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
Tighter Connections between Derandomization and Circuit Lower Bounds. APPROX-RANDOM 2015: 645-658 - [c23]Ruiwen Chen, Valentine Kabanets:
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. COCOON 2015: 211-222 - [c22]Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. STACS 2015: 21-33 - 2014
- [j16]Ruiwen Chen, Valentine Kabanets, Jeff Kinne:
Lower Bounds Against Weakly-Uniform Threshold Circuits. Algorithmica 70(1): 47-75 (2014) - [c21]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-algorithms. Computational Complexity Conference 2014: 262-273 - [c20]Russell Impagliazzo, Valentine Kabanets:
Fourier Concentration from Shrinkage. Computational Complexity Conference 2014: 321-332 - [c19]Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas. MFCS (2) 2014: 165-176 - [i22]Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, Christopher Umans:
Algebra in Computational Complexity (Dagstuhl Seminar 14391). Dagstuhl Reports 4(9): 85-105 (2014) - [i21]Eric Allender, Dhiraj Holden, Valentine Kabanets:
The Minimum Oracle Circuit Size Problem. Electron. Colloquium Comput. Complex. 21: 176 (2014) - [i20]Ruiwen Chen, Valentine Kabanets:
Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. Electron. Colloquium Comput. Complex. 21: 184 (2014) - 2013
- [j15]Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe:
Is Valiant-Vazirani's isolation probability improvable? Comput. Complex. 22(2): 345-383 (2013) - [i19]Valentine Kabanets, Antonina Kolokolova:
Compression of Boolean Functions. Electron. Colloquium Comput. Complex. 20: 24 (2013) - [i18]Ruiwen Chen, Valentine Kabanets, Antonina Kolokolova, Ronen Shaltiel, David Zuckerman:
Mining Circuit Lower Bound Proofs for Meta-Algorithms. Electron. Colloquium Comput. Complex. 20: 57 (2013) - [i17]Ruiwen Chen, Valentine Kabanets, Nitin Saurabh:
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas. Electron. Colloquium Comput. Complex. 20: 150 (2013) - [i16]Russell Impagliazzo, Valentine Kabanets:
Fourier Concentration from Shrinkage. Electron. Colloquium Comput. Complex. 20: 163 (2013) - 2012
- [j14]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
New Direct-Product Testers and 2-Query PCPs. SIAM J. Comput. 41(6): 1722-1768 (2012) - [c18]Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe:
Is Valiant-Vazirani's Isolation Probability Improvable? Computational Complexity Conference 2012: 10-20 - [c17]Ruiwen Chen, Valentine Kabanets:
Lower Bounds against Weakly Uniform Circuits. COCOON 2012: 408-419 - [i15]Ruiwen Chen, Valentine Kabanets:
Lower Bounds against Weakly Uniform Circuits. Electron. Colloquium Comput. Complex. 19: 7 (2012) - 2011
- [i14]Valentine Kabanets, Osamu Watanabe:
Is the Valiant-Vazirani Isolation Lemma Improvable? Electron. Colloquium Comput. Complex. 18: 151 (2011) - 2010
- [j13]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput. 39(4): 1637-1665 (2010) - [c16]Russell Impagliazzo, Valentine Kabanets:
Constructive Proofs of Concentration Bounds. APPROX-RANDOM 2010: 617-631 - [i13]Russell Impagliazzo, Valentine Kabanets:
Constructive Proofs of Concentration Bounds. Electron. Colloquium Comput. Complex. 17: 72 (2010)
2000 – 2009
- 2009
- [j12]Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka:
The Black-Box Query Complexity of Polynomial Summation. Comput. Complex. 18(1): 59-79 (2009) - [j11]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Chernoff-Type Direct Product Theorems. J. Cryptol. 22(1): 75-92 (2009) - [j10]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification. SIAM J. Comput. 39(2): 564-605 (2009) - [c15]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
New direct-product testers and 2-query PCPs. STOC 2009: 131-140 - [c14]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
An axiomatic approach to algebrization. STOC 2009: 695-704 - [c13]Yevgeniy Dodis, Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Security Amplification for InteractiveCryptographic Primitives. TCC 2009: 128-145 - [i12]Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova:
An Axiomatic Approach to Algebrization. Algebraic Methods in Computational Complexity 2009 - [i11]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
New Direct-Product Testers and 2-Query PCPs. Electron. Colloquium Comput. Complex. 16: 90 (2009) - 2008
- [j9]Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans:
On the Complexity of Succinct Zero-Sum Games. Comput. Complex. 17(3): 353-376 (2008) - [j8]Venkatesan Guruswami, Valentine Kabanets:
Hardness Amplification via Space-Efficient Direct Products. Comput. Complex. 17(4): 475-500 (2008) - [j7]Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi:
The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. J. Comput. Syst. Sci. 74(3): 386-393 (2008) - [c12]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform direct product theorems: simplified, optimized, and derandomized. STOC 2008: 579-588 - [i10]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson:
Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized. Electron. Colloquium Comput. Complex. 15(079) (2008) - 2007
- [j6]Venkatesan Guruswami, Valentine Kabanets:
Special Issue "Conference on Computational Complexity 2006" Guest Editors' Foreword. Comput. Complex. 16(2): 113-114 (2007) - [c11]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Chernoff-Type Direct Product Theorems. CRYPTO 2007: 500-516 - [i9]Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka:
The black-box query complexity of polynomial summation. Electron. Colloquium Comput. Complex. 14(125) (2007) - 2006
- [c10]Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets:
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. FOCS 2006: 187-196 - [c9]Venkatesan Guruswami, Valentine Kabanets:
Hardness Amplification Via Space-Efficient Direct Products. LATIN 2006: 556-568 - [i8]Joshua Buresh-Oppenheim, Valentine Kabanets, Rahul Santhanam:
Uniform Hardness Amplification in NP via Monotone Codes. Electron. Colloquium Comput. Complex. 13(154) (2006) - 2005
- [c8]Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans:
On the Complexity of Succinct Zero-Sum Games. Computational Complexity Conference 2005: 323-332 - [i7]Venkatesan Guruswami, Valentine Kabanets:
Hardness amplification via space-efficient direct products. Electron. Colloquium Comput. Complex.(057) (2005) - 2004
- [j5]Valentine Kabanets, Russell Impagliazzo:
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Comput. Complex. 13(1-2): 1-46 (2004) - [i6]Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans:
On the complexity of succinct zero-sum games. Electron. Colloquium Comput. Complex.(001) (2004) - 2003
- [j4]Valentine Kabanets:
Almost k-wise independence and hard Boolean functions. Theor. Comput. Sci. 297(1-3): 281-295 (2003) - [c7]Chris Calabro, Russell Impagliazzo, Valentine Kabanets, Ramamohan Paturi:
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs. Computational Complexity Conference 2003: 135- - [c6]Valentine Kabanets, Russell Impagliazzo:
Derandomizing polynomial identity tests means proving circuit lower bounds. STOC 2003: 355-364 - 2002
- [j3]Valentine Kabanets:
Derandomization: a brief overview. Bull. EATCS 76: 88-103 (2002) - [j2]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
In search of an easy witness: exponential time vs. probabilistic polynomial time. J. Comput. Syst. Sci. 65(4): 672-694 (2002) - [i5]Valentine Kabanets:
Derandomization: A Brief Overview. Electron. Colloquium Comput. Complex.(008) (2002) - [i4]Valentine Kabanets, Russell Impagliazzo:
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. Electron. Colloquium Comput. Complex.(055) (2002) - 2001
- [j1]Valentine Kabanets:
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. J. Comput. Syst. Sci. 63(2): 236-252 (2001) - [c5]Russell Impagliazzo, Valentine Kabanets, Avi Wigderson:
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time. Computational Complexity Conference 2001: 2-12 - 2000
- [c4]Valentine Kabanets:
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error. Computational Complexity Conference 2000: 150-157 - [c3]Valentine Kabanets:
Almost k-Wise Independence and Hard Boolean Functions. LATIN 2000: 197-206 - [c2]Valentine Kabanets, Jin-yi Cai:
Circuit minimization problem. STOC 2000: 73-79 - [i3]Valentine Kabanets, Charles Rackoff, Stephen A. Cook:
Efficiently Approximable Real-Valued Functions. Electron. Colloquium Comput. Complex. 7(34) (2000)
1990 – 1999
- 1999
- [i2]Valentine Kabanets:
Almost k-Wise Independence and Boolean Functions Hard for Read-Once Branching Programs. Electron. Colloquium Comput. Complex. 6(4) (1999) - [i1]Valentine Kabanets, Jin-yi Cai:
Circuit Minimization Problem. Electron. Colloquium Comput. Complex.(45) (1999) - 1997
- [c1]Valentine Kabanets:
Recognizability Equals Definability for Partial k-Paths. ICALP 1997: 805-815
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-10-16 01:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
