summaryrefslogtreecommitdiff
path: root/content/publications.tex
diff options
context:
space:
mode:
authorChris Cox <chris@mathematicaster.org>2020-10-12 10:13:17 -0500
committerChris Cox <chris@mathematicaster.org>2020-10-12 10:13:17 -0500
commite0d60a5da60505004ba67d2c9da58937ccf6cf6e (patch)
treef6623b1b52194a9ee1f33f97dccf7b8a0cf74c5b /content/publications.tex
parent27954e0f65bc391a72bf2479bf40149a122901bb (diff)
downloadcv-e0d60a5da60505004ba67d2c9da58937ccf6cf6e.tar
cv-e0d60a5da60505004ba67d2c9da58937ccf6cf6e.tar.gz
cv-e0d60a5da60505004ba67d2c9da58937ccf6cf6e.tar.bz2
cv-e0d60a5da60505004ba67d2c9da58937ccf6cf6e.tar.lz
cv-e0d60a5da60505004ba67d2c9da58937ccf6cf6e.tar.xz
cv-e0d60a5da60505004ba67d2c9da58937ccf6cf6e.tar.zst
cv-e0d60a5da60505004ba67d2c9da58937ccf6cf6e.zip
CV updates
Diffstat (limited to 'content/publications.tex')
-rw-r--r--content/publications.tex8
1 files changed, 4 insertions, 4 deletions
diff --git a/content/publications.tex b/content/publications.tex
index c56f42f..70d21cf 100644
--- a/content/publications.tex
+++ b/content/publications.tex
@@ -3,12 +3,12 @@
\item\submitted{Uniquely optimal codes of low complexity are symmetric}{E.J.\ King, D.G.\ Mixon and H.\ Parshall}{2008.12871}
\item\submitted{Periodic words, common subsequences and frogs}{B.\ Bukh}{1912.03510}
\end{itemize}
-\subsection*{Accepted}
-\begin{itemize}[leftmargin=*]
- \item\accepted{Nearly orthogonal vectors and small antipodal spherical codes}{B.\ Bukh}{Israel Journal of Mathematics}{1803.02949}
-\end{itemize}
+% \subsection*{Accepted}
+% \begin{itemize}[leftmargin=*]
+% \end{itemize}
\subsection*{Published}
\begin{itemize}[leftmargin=*]
+ \item\published{Nearly orthogonal vectors and small antipodal spherical codes}{B.\ Bukh}{Israel Journal of Mathematics}{238}{}{359--388}{Jun 2020}
\item\published{Restricted online Ramsey numbers of matchings and trees}{J.\ Briggs}{Electronic Journal of Combinatorics}{27}{3}{3.49}{Sep 2020}
\item\published{Inverting the Tur\'an problem}{J.\ Briggs}{Discrete Mathematics}{342}{7}{1865--1884}{Jul 2019}
\item\published{On a fractional version of Haemers' bound}{B.\ Bukh}{IEEE Transactions on Information Theory}{65}{6}{3340--3348}{Jun 2019}