We would like to thank Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, and Zhifeng Sun for helpful discussions and for sharing their work at an early stage.

We study lower bounds on information dissemination in adversarial dynamic networks. Initially, k pieces of information (henceforth called tokens) are…

A possible way to extend the work of this paper could be to study an online version of MFLP [11] (OMFLP). In [4], it is shown that exploiting the randomized low-stretch hierarchical tree decomposition of [9], it is possible to obtain a polylogarithm…

We study an online problem in which a set of mobile servers have to be moved in order to efficiently serve a set of requests that arrive in an online…

In this section we adapt our techniques to obtain an algorithm which computes a canonization for a given graph of tree width at most k. Since Babai’s quasi-polynomial time algorithm [Bab16] only tests isomorphism of two given input graphs and can no…

We give a new fpt algorithm testing isomorphism of $n$-vertex graphs of tree width $k$ in time $2^{k\operatorname{polylog} (k)}\operatorname{poly} (n…

We consider evolution of a large population, where fitness of each organism is defined by many phenotypical traits. These traits result from expressi…

We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a grap…

In this paper, we have studied the problem of synthesizing symmetric systems. Our new synthesis algorithm is a useful tool in the development of distributed algorithms, because it checks automatically if certain properties in a design problem requir…

We study the problem of determining whether a given temporal specification can be implemented by a symmetric system, i.e., a system composed from ide…

We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen…

Despite the recent progress in hyperparameter optimization (HPO), available benchmarks that resemble real-world scenarios consist of a few and very l…

Bayesian optimization has become a standard technique for hyperparameter optimization, including data-intensive models such as deep neural networks t…

Knowledge graphs have become popular over the past decade and frequently rely on the Resource Description Framework (RDF) or Property Graph (PG) data…

Using proof techniques involving $L^\infty$ covering numbers, we show generalisation error bounds for deep learning with two main improvements over t…

Scalable and highly available systems often require data stores that offer weaker consistency guarantees than traditional relational databases system…

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structu…

In the past, manually re-drawing an image in a certain artistic style required a professional artist and a long time. Doing this for a video sequence…

Logic programs are now used as a representation of object-oriented source code in academic prototypes for about a decade. This representation allows …

We study learning problems in which the conditional distribution of the output given the input varies as a function of additional task variables. In …

Many anonymous communication (AC) networks rely on routing traffic through proxy nodes to obfuscate the originator of the traffic. Without an account…

We introduce a novel uncertainty estimation for classification tasks for Bayesian convolutional neural networks with variational inference. By normal…

In this paper we consider the problem of robot navigation in simple maze-like environments where the robot has to rely on its onboard sensors to perf…

In this paper we present a method for learning a discriminative classifier from unlabeled or partially labeled data. Our approach is based on an obje…

By signing up you accept our content policy

Already have an account? Sign in

No a member yet? Create an account