Papers
DBLP profile
-
Artur Ignatiev, Ivan Mihajlin, Alexander Smal.
Super-cubic lower bound for generalized Karchmer-Wigderson games.
ECCC (preprint).
-
Ivan Mihajlin, Alexander Smal.
Toward better depth lower bounds: the XOR-KRW conjecture.
CCC2021.
-
Yuriy Dementiev, Artur Ignatiev, Vyacheslav Sidelnik, Alexander Smal, Mikhail Ushakov.
New bounds on the half-duplex communication complexity.
SOFSEM2021.
-
Kenneth Hoover,
Russell Impagliazzo,
Ivan Mihajlin,
Alexander Smal.
"Half-duplex communication complexity".
ISAAC 2018: 10:1-10:12.
-
Navid Talebanfard,
Alexander Smal.
"Prediction from Partial Information and Hindsight, an Alternative Proof".
Inf. Process. Lett. 136: 102-104 (2018).
.
-
Alexander Golovnev,
Alexander S. Kulikov,
Alexander Smal,
Suguru Tamaki.
"Circuit size lower bounds and #SAT upper bounds through a general framework".
MFCS 2016: 45:1-45:16.
- Edward A. Hirsch,
Dieter van Melkebeek,
and Alexander Smal.
"Succinct Interactive Proofs for Quantified Boolean Formulas".
ECCC, Comment on TR12-077, 2013.
- Edward A. Hirsch,
Dmitry Itsykson,
Valeria Nikolaenko, and Alexander Smal.
"Optimal heuristic algorithms
for the image of an injective function".
Zapiski Nauchnykh Seminarov POMI, Vol. 399, 2012, pp. 1531.
- Edward A. Hirsch,
Dmitry Itsykson,
Ivan Monakhov, and Alexander Smal.
"On optimal heuristic randomized semidecision procedures,
with applications to proof complexity and cryptography".
Theory Comput. Syst. 51(2): 179-195 (2012).
Talks (with slides)
Posters
Theses (in Russian)
back
