Ben Barber

According to our database, Ben Barber authored at least 13 papers between 2012 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of two.

2024

Introducing Ambiguity Clustering: An Accurate and Efficient Decoder for qLDPC Codes.

Stasiu Wolanski, Ben Barber

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

2023

Post-selection-free preparation of high-quality physical qubits.

Ben Barber, Neil I. Gillespie, J. M. Taylor

Quantum, May, 2023

2021

The Namer-Claimer game.

Ben Barber

Discret. Math., 2021

2020

Minimalist designs.

Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus

Random Struct. Algorithms, 2020

2017

Clique decompositions of multipartite graphs and completion of Latin squares.

Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus, Amelia Taylor

J. Comb. Theory A, 2017

Fractional clique decompositions of dense graphs and hypergraphs.

Ben Barber, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus

J. Comb. Theory B, 2017

2015

Distinguishing subgroups of the rationals by their Ramsey properties.

Ben Barber, Neil Hindman, Imre Leader, Dona Strauss

J. Comb. Theory A, 2015

Edge-decompositions of graphs with high minimum degree.

Ben Barber, Daniela Kühn, Allan Lo, Deryk Osthus

Electron. Notes Discret. Math., 2015

2014

Partition Regularity of a System of De and Hindman.

Ben Barber

Integers, 2014

Maximum Hitting for n Sufficiently Large.

Ben Barber

Graphs Comb., 2014

2013

Partition regularity in the rationals.

Ben Barber, Neil Hindman, Imre Leader

J. Comb. Theory A, 2013

Random Walks on Quasirandom Graphs.

Ben Barber, Eoin Long

Electron. J. Comb., 2013

2012

A note on balanced independent sets in the cube.

Ben Barber

Australas. J Comb., 2012