Scholar

Anastasia Sofronova

Google Scholar ID: 4Aa1SeQAAAAJ

EPFL

proof complexity

Homepage↗Google Scholar↗

Citations & Impact

All-time

Citations

30

H-index

3

i10-index

1

Publications

10

Co-authors

0

Contact

No contact links provided.

Publications

3 items

No Constant-Cost Protocol for Point--Line Incidence

2026

Cited

0

Monotone Circuit Complexity of Matching

2025

Cited

0

Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication

2025

Cited

0

Resume (English only)

Co-authors

0 total

Co-authors: 0 (list not available)