Alexander Smal

Orcid: 0000-0002-8241-5503

According to our database1, Alexander Smal authored at least 13 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Lifting dichotomies.
Electron. Colloquium Comput. Complex., 2024

2023
Proving Unsatisfiability with Hitting Formulas.
Electron. Colloquium Comput. Complex., 2023

Irreducible Subcube Partitions.
Electron. J. Comb., 2023

2022
Super-cubic lower bound for generalized Karchmer-Wigderson games.
Electron. Colloquium Comput. Complex., 2022

Irreducible subcube partitions.
CoRR, 2022

2020
Toward better depth lower bounds: the XOR-KRW conjecture.
Electron. Colloquium Comput. Complex., 2020

New bounds on the half-duplex communication complexity.
Electron. Colloquium Comput. Complex., 2020

2018
Gate elimination: Circuit size lower bounds and #SAT upper bounds.
Theor. Comput. Sci., 2018

Prediction from partial information and hindsight, an alternative proof.
Inf. Process. Lett., 2018

Half-duplex communication complexity.
Electron. Colloquium Comput. Complex., 2018

2016
Circuit size lower bounds and #SAT upper bounds through a general framework.
Electron. Colloquium Comput. Complex., 2016

2011
Optimal heuristic algorithms for the image of an injective function.
Electron. Colloquium Comput. Complex., 2011

2010
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography.
Electron. Colloquium Comput. Complex., 2010


  Loading...