Bernshteyn, Anton
- Coloring graphs with forbidden bipartite subgraphs
2021/07/12 by James Anderson, Anderson, James, Anton Bernshteyn +3 · 4 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
- Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms
2021/02/17 by Anton Bernshteyn, Bernshteyn, Anton · 3 citations
Mathematics · Computer Science · #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #Limits and Structures in Graph Theory
- Coloring graphs with forbidden almost bipartite subgraphs
2022/03/14 by Anderson, James, Bernshteyn, Anton, Dhawan, Abhishek · 3 citations
#Combinatorics (math.CO) #FOS: Mathematics
- Sunflowers in set systems with small VC-dimension
2024/08/08 by József Balogh, Anton Bernshteyn, Balogh, József +7 · 4 citations
Business, Management and Accounting · Social Sciences · #Advanced Queuing Theory Analysis #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Probability (math.PR) #Transportation Planning and Optimization
- Large-scale geometry of Borel graphs of polynomial growth
2023/02/09 by Bernshteyn, Anton, Yu, Jing · 2 citations
#Combinatorics (math.CO) #FOS: Mathematics #Logic (math.LO) #Metric Geometry (math.MG)
- Counting colorings of triangle-free graphs
2021/09/27 by Anton Bernshteyn, Tyler Brazelton, Bernshteyn, Anton +5 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
- Fractional DP-Colorings of Sparse Graphs
2018/01/22 by Bernshteyn, Anton, Kostochka, Alexandr, Zhu, Xuding · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
- Descriptive combinatorics and distributed algorithms
2022/08/04 by Anton Bernshteyn, Bernshteyn, Anton · 2 citations
Computer Science · #Advanced Algebra and Logic #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #Discrete Mathematics (cs.DM) #Distributed #FOS: Computer and information sciences #FOS: Mathematics #History and Overview (math.HO) #Logic (math.LO) #Parallel #and Cluster Computing (cs.DC)
- Separating complexity classes of LCL problems on grids
2025/01/29 by Katalin Berlow, Berlow, Katalin, Anton Bernshteyn +5 · 1 voice · 2 citations
Computer Science · #Coding theory and cryptography #Cellular Automata and Applications #Algorithms and Data Compression
- A linear-time algorithm for (1+ε)Δ-edge-coloring
2024/07/05 by Anton Bernshteyn, Abhishek Dhawan, Bernshteyn, Anton +1 · 1 citation
Physics and Astronomy · Decision Sciences · Computer Science · #Color Science and Applications #Scheduling and Timetabling Solutions #Graph Labeling and Dimension Problems
- Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
2023/08/28 by Anton Bernshteyn, Felix Weilacher, Bernshteyn, Anton +1 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Data Management and Algorithms #Advanced Graph Theory Research