Andrew Krapivin
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
4
Venues
3
Active years
2024–2026
Best venue rank
A*
Where they publish
Papers
4 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Greedy Open Addressing Revisited: Beyond Yao's Lower Bound. | Martn Farach-Colton, Andrew Krapivin, William Kuszmaul |
| 2026 | STOC | Optimal and Efficient Partite Decompositions of Hypergraphs. | Andrew Krapivin, Benjamin Przybocki, Nicols Sanhueza-Matamala, Bernardo Subercaseaux |
| 2026 | SAT | Near-Optimal Encodings of Cardinality Constraints. | Andrew Krapivin, Benjamin Przybocki, Bernardo Subercaseaux |
| 2024 | FOCS | Optimal Bounds for Open Addressing Without Reordering. | Martn Farach-Colton, Andrew Krapivin, William Kuszmaul |