default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Smal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Ryazanov, Alexander V. Smal, Marc Vinyals:
Irreducible Subcube Partitions. Electron. J. Comb. 30(3) (2023)- 2022
- [j4]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals:
Irreducible subcube partitions. CoRR abs/2212.14685: 1-38 (2022) - 2018
- [j3]Alexander V. Smal
, Navid Talebanfard:
Prediction from partial information and hindsight, an alternative proof. Inf. Process. Lett. 136: 102-104 (2018) - [j2]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Gate elimination: Circuit size lower bounds and #SAT upper bounds. Theor. Comput. Sci. 719: 46-63 (2018) - 2012
- [j1]Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal:
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography. Theory Comput. Syst. 51(2): 179-195 (2012)
Conference and Workshop Papers
- 2024
- [c7]Yaroslav Alekseev, Yuval Filmus, Alexander Smal:
Lifting Dichotomies. CCC 2024: 9:1-9:18 - [c6]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. ITCS 2024: 48:1-48:20 - 2022
- [c5]Artur Ignatiev, Ivan Mihajlin, Alexander Smal:
Super-Cubic Lower Bound for Generalized Karchmer-Wigderson Games. ISAAC 2022: 66:1-66:18 - 2021
- [c4]Ivan Mihajlin, Alexander Smal:
Toward Better Depth Lower Bounds: The XOR-KRW Conjecture. CCC 2021: 38:1-38:24 - [c3]Yuriy Dementiev, Artur Ignatiev, Vyacheslav Sidelnik, Alexander Smal, Mikhail Ushakov:
New Bounds on the Half-Duplex Communication Complexity. SOFSEM 2021: 233-248 - 2018
- [c2]Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander V. Smal:
Half-Duplex Communication Complexity. ISAAC 2018: 10:1-10:12 - 2016
- [c1]Alexander Golovnev, Alexander S. Kulikov, Alexander V. Smal, Suguru Tamaki:
Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework. MFCS 2016: 45:1-45:16
Informal and Other Publications
- 2024
- [i11]Yaroslav Alekseev, Yuval Filmus, Alexander Smal:
Lifting dichotomies. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i10]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. CoRR abs/2302.06241 (2023) - [i9]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i8]Artur Ignatiev, Ivan Mihajlin, Alexander Smal:
Super-cubic lower bound for generalized Karchmer-Wigderson games. Electron. Colloquium Comput. Complex. TR22 (2022) - 2020
- [i7]Yuriy Dementiev, Artur Ignatiev, Vyacheslav Sidelnik, Alexander Smal, Mikhail Ushakov:
New bounds on the half-duplex communication complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i6]Ivan Mihajlin, Alexander Smal:
Toward better depth lower bounds: the XOR-KRW conjecture. Electron. Colloquium Comput. Complex. TR20 (2020) - 2018
- [i5]Kenneth Hoover, Russell Impagliazzo, Ivan Mihajlin, Alexander Smal:
Half-duplex communication complexity. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i4]Alexander Smal, Navid Talebanfard:
Prediction from Partial Information and Hindsight, an Alternative Proof. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i3]Alexander Golovnev, Alexander S. Kulikov, Alexander Smal, Suguru Tamaki:
Circuit size lower bounds and #SAT upper bounds through a general framework. Electron. Colloquium Comput. Complex. TR16 (2016) - 2011
- [i2]Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolaenko, Alexander Smal:
Optimal heuristic algorithms for the image of an injective function. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i1]Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal:
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography. Electron. Colloquium Comput. Complex. TR10 (2010)
Coauthor Index
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).
Privacy notice: By enabling the option above, your browser will contact the API of 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.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional 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 information given by OpenAlex.
last updated on 2024-08-10 01:26 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 was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
