Boris Bukh

According to our database1, Boris Bukh authored at least 32 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Length of the Longest Common Subsequence between Overlapping Words.
SIAM J. Discret. Math., 2020

Turán numbers of theta graphs.
Comb. Probab. Comput., 2020

Empty axis-parallel boxes.
CoRR, 2020

On convex holes in d-dimensional point sets.
CoRR, 2020

2019
On a Fractional Version of Haemers' Bound.
IEEE Trans. Inf. Theory, 2019

List-Decodable Zero-Rate Codes.
IEEE Trans. Inf. Theory, 2019

Shatter Functions with Polynomial Growth Rates.
SIAM J. Discret. Math., 2019

2018
Bipartite algebraic graphs without quadrilaterals.
Discret. Math., 2018

Nearly orthogonal vectors and small antipodal spherical codes.
CoRR, 2018

Consistent Sets of Lines with no Colorful Incidence.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2017
An Improved Bound on the Fraction of Correctable Deletions.
IEEE Trans. Inf. Theory, 2017

Classifying unavoidable Tverberg partitions.
J. Comput. Geom., 2017

Erratum For 'A Bound on the Number of Edges in Graphs Without an Even Cycle'.
Comb. Probab. Comput., 2017

A Bound on the Number of Edges in Graphs Without an Even Cycle.
Comb. Probab. Comput., 2017

2016
Bounds on Equiangular Lines and on Related Spherical Codes.
SIAM J. Discret. Math., 2016

An Improvement of the Beck-Fiala Theorem.
Comb. Probab. Comput., 2016

One-sided epsilon-approximants.
CoRR, 2016

2015
An improved bound on the fraction of correctable deletions.
Electron. Colloquium Comput. Complex., 2015

2014
Longest Common Subsequences in Sets of Words.
SIAM J. Discret. Math., 2014

2012
Multidimensional Kruskal-Katona Theorem.
SIAM J. Discret. Math., 2012

Upper bounds for centerlines.
J. Comput. Geom., 2012

Space Crossing Numbers.
Comb. Probab. Comput., 2012

2011
Turán numbers for K<sub>s, t</sub>-free graphs: topological obstructions and algebraic constructions.
Electron. Notes Discret. Math., 2011

2010
Stabbing Simplices by Points and Flats.
Discret. Comput. Geom., 2010

Radon partitions in convexity spaces
CoRR, 2010

2009
Set Families with a Forbidden Subposet.
Electron. J. Comb., 2009

Lower bounds for weak epsilon-nets and stair-convexity.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Sums of Dilates.
Comb. Probab. Comput., 2008

2007
Induced subgraphs of Ramsey graphs with many distinct degrees.
J. Comb. Theory, Ser. B, 2007

Measurable sets with excluded distances.
Electron. Notes Discret. Math., 2007

2006
Maximum pebbling number of graphs of diameter three.
J. Graph Theory, 2006

A Point in Many Triangles.
Electron. J. Comb., 2006


  Loading...