default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris Bukh
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Boris Bukh, Alexey Vasileuski:
New Bounds for the Same-Type Lemma. Electron. J. Comb. 31(2) (2024)- 2023
- [j28]Boris Bukh
, R. Amzi Jeffs:
Planar Convex Codes are Decidable. SIAM J. Discret. Math. 37(2): 951-963 (2023) - 2022
- [j27]Boris Bukh, Ting-Wei Chao:
Digital Almost Nets. Electron. J. Comb. 29(4) (2022) - [j26]Boris Bukh, Ting-Wei Chao, Ron Holzman:
On convex holes in d-dimensional point sets. Comb. Probab. Comput. 31(1): 101-108 (2022) - 2021
- [c5]Boris Bukh, Karthik C. S., Bhargav Narayanan:
Applications of Random Algebraic Constructions to Hardness of Approximation. FOCS 2021: 237-244 - [i18]Boris Bukh, Ting-Wei Chao:
Digital almost nets. CoRR abs/2102.12872 (2021) - [i17]Boris Bukh, Karthik C. S., Bhargav Narayanan:
Applications of Random Algebraic Constructions to Hardness of Approximation. CoRR abs/2111.05518 (2021) - [i16]Boris Bukh, Karthik C. S., Bhargav Narayanan:
Applications of Random Algebraic Constructions to Hardness of Approximation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j25]Boris Bukh, Michael Tait:
Turán numbers of theta graphs. Comb. Probab. Comput. 29(4): 495-507 (2020) - [j24]Boris Bukh, Raymond Hogenson:
Length of the Longest Common Subsequence between Overlapping Words. SIAM J. Discret. Math. 34(1): 721-729 (2020) - [j23]Boris Bukh, Oleksandr Rudenko:
Order-Isomorphic Twins in Permutations. SIAM J. Discret. Math. 34(3): 1620-1622 (2020) - [i15]Boris Bukh, Ting-Wei Chao, Ron Holzman:
On convex holes in d-dimensional point sets. CoRR abs/2007.08972 (2020) - [i14]Boris Bukh, Ting-Wei Chao:
Empty axis-parallel boxes. CoRR abs/2009.05820 (2020)
2010 – 2019
- 2019
- [j22]Boris Bukh, Xavier Goaoc:
Shatter Functions with Polynomial Growth Rates. SIAM J. Discret. Math. 33(2): 784-794 (2019) - [j21]Noga Alon, Boris Bukh, Yury Polyanskiy:
List-Decodable Zero-Rate Codes. IEEE Trans. Inf. Theory 65(3): 1657-1667 (2019) - [j20]Boris Bukh, Christopher Cox:
On a Fractional Version of Haemers' Bound. IEEE Trans. Inf. Theory 65(6): 3340-3348 (2019) - 2018
- [j19]Boris Bukh, Zilin Jiang:
Bipartite algebraic graphs without quadrilaterals. Discret. Math. 341(6): 1597-1604 (2018) - [c4]Boris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager:
Consistent Sets of Lines with no Colorful Incidence. SoCG 2018: 17:1-17:14 - [i13]Boris Bukh, Christopher Cox:
On a fractional version of Haemers' bound. CoRR abs/1802.00476 (2018) - [i12]Boris Bukh, Christopher Cox:
Nearly orthogonal vectors and small antipodal spherical codes. CoRR abs/1803.02949 (2018) - [i11]Boris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager:
Consistent sets of lines with no colorful incidence. CoRR abs/1803.06267 (2018) - 2017
- [j18]Boris Bukh, Zilin Jiang:
A Bound on the Number of Edges in Graphs Without an Even Cycle. Comb. Probab. Comput. 26(1): 1-15 (2017) - [j17]Boris Bukh, Zilin Jiang:
Erratum For 'A Bound on the Number of Edges in Graphs Without an Even Cycle'. Comb. Probab. Comput. 26(6): 952-953 (2017) - [j16]Boris Bukh, Po-Shen Loh, Gabriel Nivasch:
Classifying unavoidable Tverberg partitions. J. Comput. Geom. 8(1): 174-205 (2017) - [j15]Boris Bukh, Venkatesan Guruswami, Johan Håstad:
An Improved Bound on the Fraction of Correctable Deletions. IEEE Trans. Inf. Theory 63(1): 93-103 (2017) - [i10]Boris Bukh, Xavier Goaoc:
Shatter functions with polynomial growth rates. CoRR abs/1701.06632 (2017) - [i9]Noga Alon, Boris Bukh, Yury Polyanskiy:
List-decodable zero-rate codes. CoRR abs/1710.10663 (2017) - 2016
- [j14]Boris Bukh:
An Improvement of the Beck-Fiala Theorem. Comb. Probab. Comput. 25(3): 380-398 (2016) - [j13]Boris Bukh:
Bounds on Equiangular Lines and on Related Spherical Codes. SIAM J. Discret. Math. 30(1): 549-554 (2016) - [c3]Boris Bukh, Venkatesan Guruswami:
An improved bound on the fraction of correctable deletions. SODA 2016: 1893-1901 - [i8]Boris Bukh, Gabriel Nivasch:
One-sided epsilon-approximants. CoRR abs/1603.05717 (2016) - [i7]Boris Bukh, Po-Shen Loh, Gabriel Nivasch:
Classifying unavoidable Tverberg partitions. CoRR abs/1611.01078 (2016) - 2015
- [i6]Boris Bukh, Venkatesan Guruswami:
An improved bound on the fraction of correctable deletions. CoRR abs/1507.01719 (2015) - [i5]Boris Bukh, Venkatesan Guruswami:
An improved bound on the fraction of correctable deletions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j12]Boris Bukh, Jie Ma:
Longest Common Subsequences in Sets of Words. SIAM J. Discret. Math. 28(4): 2042-2049 (2014) - 2012
- [j11]Boris Bukh, Alfredo Hubard:
Space Crossing Numbers. Comb. Probab. Comput. 21(3): 358-373 (2012) - [j10]Boris Bukh, Gabriel Nivasch:
Upper bounds for centerlines. J. Comput. Geom. 3(1): 20-30 (2012) - [j9]Boris Bukh:
Multidimensional Kruskal-Katona Theorem. SIAM J. Discret. Math. 26(2): 548-554 (2012) - 2011
- [j8]Pavle V. M. Blagojevic, Boris Bukh, Roman N. Karasev:
Turán numbers for Ks, t-free graphs: topological obstructions and algebraic constructions. Electron. Notes Discret. Math. 38: 141-145 (2011) - [c2]Boris Bukh, Alfredo Hubard:
Space crossing numbers. SCG 2011: 163-170 - [i4]Boris Bukh, Gabriel Nivasch:
Upper bounds for centerlines. CoRR abs/1107.3421 (2011) - 2010
- [j7]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Stabbing Simplices by Points and Flats. Discret. Comput. Geom. 43(2): 321-338 (2010) - [i3]Boris Bukh:
Radon partitions in convexity spaces. CoRR abs/1009.2384 (2010)
2000 – 2009
- 2009
- [j6]Boris Bukh:
Set Families with a Forbidden Subposet. Electron. J. Comb. 16(1) (2009) - [c1]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Lower bounds for weak epsilon-nets and stair-convexity. SCG 2009: 1-10 - 2008
- [j5]Boris Bukh:
Sums of Dilates. Comb. Probab. Comput. 17(5): 627-639 (2008) - [i2]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Stabbing simplices by points and flats. CoRR abs/0804.4464 (2008) - [i1]Boris Bukh, Jirí Matousek, Gabriel Nivasch:
Lower bounds for weak epsilon-nets and stair-convexity. CoRR abs/0812.5039 (2008) - 2007
- [j4]Boris Bukh:
Measurable sets with excluded distances. Electron. Notes Discret. Math. 29: 65-71 (2007) - [j3]Boris Bukh, Benny Sudakov:
Induced subgraphs of Ramsey graphs with many distinct degrees. J. Comb. Theory B 97(4): 612-619 (2007) - 2006
- [j2]Boris Bukh:
A Point in Many Triangles. Electron. J. Comb. 13(1) (2006) - [j1]Boris Bukh:
Maximum pebbling number of graphs of diameter three. J. Graph Theory 52(4): 353-357 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
