22 citations · 43 across the 9 of their papers we have counts for
11 papers
General Constructions of Permutation-Fair Dice
Tomáš Gavenčiak, Bernhard Haeupler, Václav Rozhoň
Suppose that each of players rolls a different die and the players are ordered by their rolls. Can the dice use disjoint labels such that ties are impossible, while all or…
AI Evaluation Should Work With Humans
Jan Kulveit, Gavin Leech, Tomáš Gavenčiak +1
This position paper argues that the dominant paradigm of AI evaluation (which focuses on superhuman autonomous performance and so implicitly targets the goal of replacing humans) i…
Soft Contamination Means Benchmarks Test Shallow Generalization
Ari Spiesberger, Juan J. Vazquez, Nicky Pochinkov +4
If LLM training data is polluted with benchmark test data, then benchmark performance gives biased estimates of out-of-distribution (OOD) generalization. Typical decontamination fi…
AI-AI Bias: large language models favor communications generated by large language models
Walter Laurito, Benjamin Davis, Peli Grietzer +3
Are large language models (LLMs) biased in favor of communications produced by LLMs, leading to possible antihuman discrimination? Using a classical experimental design inspired by…
LemmaTag: Jointly Tagging and Lemmatizing for Morphologically-Rich Languages with BRNNs
Daniel Kondratyuk, Tomáš Gavenčiak, Milan Straka +1
We present LemmaTag, a featureless neural network architecture that jointly generates part-of-speech tags and lemmas for sentences by using bidirectional RNNs with character-level…
Sorting by Swaps with Noisy Comparisons
Tomáš Gavenčiak, Barbara Geissmann, Johannes Lengler
We study sorting of permutations by random swaps if each comparison gives the wrong result with some fixed probability . We use this process as prototype for the behaviour o…
Integer Programming in Parameterized Complexity: Three Miniatures
Tomáš Gavenčiak, Dušan Knop, Martin Koutecký
Powerful results from the theory of integer programming have recently led to substantial advances in parameterized complexity. However, our perception is that, except for Lenstra's…
Cops and Robbers on Intersection Graphs
Tomáš Gavenčiak, Przemysław Gordinowicz, Vít Jelínek +2
The cop number of a graph is the smallest such that cops win the game of cops and robber on . We investigate the maximum cop number of geometric intersection graphs,…
Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems
Jiří Fiala, Tomáš Gavenčiak, Dušan Knop +2
We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neigh…
Firefighting on square, hexagonal, and triangular grids
Tomas Gavenciak, Jan Kratochvil, Pawel Pralat
In this paper, we consider the \emph{firefighter problem} on a graph that is either finite or infinite. Suppose that a fire breaks out at a given vertex . In eac…
Deciding first order logic properties of matroids
Tomas Gavenciak, Daniel Kral, Sang-il Oum
Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be deci…