Andrew Krapivin

According to our database, Andrew Krapivin authored at least 4 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Near-Optimal Encodings of Cardinality Constraints.

Andrew Krapivin, Benjamin Przybocki, Bernardo Subercaseaux

CoRR, March, 2026

Optimal and Efficient Partite Decompositions of Hypergraphs.

Andrew Krapivin, Benjamin Przybocki, Nicolás Sanhueza-Matamala, Bernardo Subercaseaux

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Greedy Open Addressing Revisited: Beyond Yao's Lower Bound.

Martín Farach-Colton, Andrew Krapivin, William Kuszmaul

Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

2024

Optimal Bounds for Open Addressing Without Reordering.

Martín Farach-Colton, Andrew Krapivin, William Kuszmaul

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024