We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(Δ+1)$-coloring of an $n$-node graph with maximum degree $Δ$ in $2^{O(\sqrt{\logΔ})}\cdot\log n$ rounds. This improves on the best previously known time complexity for a large range of values of $Δ$. For graphs with arboricity $a$, we obtain a deterministic distributed algorithm to compute a $(2+o(1))a$-coloring in time $2^{O(\sqrt{\log a})}\cdot\log^2 n$. Further, for graphs with bounded neighborhood independence, we show that a $(Δ+1)$-coloring can be computed more efficiently in time $2^{O(\sqrt{\logΔ})} + O(\log^* n)$. This in particular implies that also a $(2Δ-1)$-edge coloring can be computed deterministically in $2^{O(\sqrt{\logΔ})} + O(\log^* n)$ rounds, which improves the best known time bound for small values of $Δ$. All results even hold for the list coloring variants of the problems. As a consequence, we also obtain an improved deterministic $2^{O(\sqrt{\logΔ})}\cdot\log^3 n$-round algorithm for $Δ$-coloring non-complete graphs with maximum degree $Δ\geq 3$. Most of our algorithms only require messages of $O(\log n)$ bits (including the $(Δ+1)$-vertex coloring algorithms). Our main technical contribution is a recursive deterministic distributed list coloring algorithm to solve list coloring problems with lists of size $Δ^{1+o(1)}$. Given some list coloring problem and an orientation of the edges, we show how to recursively divide the global color space into smaller subspaces, assign one of the subspaces to each node of the graph, and compute a new edge orientation such that for each node, the list size to out-degree ratio degrades at most by a constant factor on each recursion level.