16 citations · 31 across the 3 of their papers we have counts for
4 papers
Optimizing small BERTs trained for German NER
Jochen Zöllner, Konrad Sperfeld, Christoph Wick +1
Currently, the most widespread neural network architecture for training language models is the so called BERT which led to improvements in various Natural Language Processing (NLP)…
Monochromatic triangles in three-coloured graphs
James Cummings, Daniel Král', Florian Pfender +3
In 1959, Goodman determined the minimum number of monochromatic triangles in a complete graph whose edge set is two-coloured. Goodman also raised the question of proving analogous…
The inducibility of small oriented graphs
Konrad Sperfeld
We use Razborov's flag algebra method to show an asymptotic upper bound for the maximal induced density of the orgraph in an arbitrary orgraph. A conjectur…
On the minimal monochromatic K4-density
Konrad Sperfeld
We use Razborov's flag algebra method to show a new asymptotic lower bound for the minimal density of monochromatic 's in any 2-coloring of the edges of the complete gra…