
Uncertaintysensitive Learning and Planning with Ensembles
We propose a reinforcement learning framework for discrete environments ...
read it

Helping AI to Play Hearthstone: AAIA'17 Data Mining Challenge
This paper summarizes the AAIA'17 Data Mining Challenge: Helping AI to P...
read it

Atari games and Intel processors
The asynchronous nature of the stateoftheart reinforcement learning a...
read it

MultiObjective Deep QLearning with Subsumption Architecture
In this work we present a method for using Deep QNetworks (DQNs) in mul...
read it

Approximation and Parameterized Complexity of Minimax Approval Voting
We present three results on the complexity of Minimax Approval Voting. F...
read it

ENet: A Deep Neural Network Architecture for RealTime Semantic Segmentation
The ability to perform pixelwise semantic segmentation in realtime is ...
read it

A Prior Distribution over Directed Acyclic Graphs for Sparse Bayesian Networks
The main contribution of this article is a new prior distribution over d...
read it

An Analysis of Deep Neural Network Models for Practical Applications
Since the emergence of Deep Neural Networks (DNNs) as a prominent techni...
read it

Optimal Tableau Decision Procedures for PDL
We reformulate Pratt's tableau decision procedure of checking satisfiabi...
read it

The ErdősHajnal conjecture for caterpillars and their complements
The celebrated ErdősHajnal conjecture states that for every proper here...
read it

Improved approximate near neighbor search without false negatives for l_2
We present a new algorithm for the capproximate nearest neighbor searc...
read it

Planar Perfect Matching is in NC
In this paper we show that the problem of computing perfect matchings in...
read it

When the Optimum is also Blind: a New Perspective on Universal Optimization
Consider the following variant of the set cover problem. We are given a ...
read it

A Quantitative Analysis of MultiWinner Rules
To choose a multiwinner rule, i.e., a voting rule that selects a subset...
read it

Linear Equations with Ordered Data
Following a recently considered generalization of linear equations to un...
read it

Analysis of Langevin Monte Carlo via convex optimization
In this paper, we provide new insights on the Unadjusted Langevin Algori...
read it

Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform QuasiWideness
The notions of bounded expansion and nowhere denseness not only offer ro...
read it

An improved FPT algorithm for Independent Feedback Vertex Set
We study the Independent Feedback Vertex Set problem  a variant of the ...
read it

Fair nonmonetary scheduling in federated clouds
In a hybrid cloud, individual cloud service providers (CSPs) often have ...
read it

Definable decompositions for graphs of bounded linear cliquewidth
We prove that for every positive integer k, there exists an MSO_1transd...
read it

Collective Schedules: Scheduling Meets Computational Social Choice
When scheduling public works or events in a shared facility one needs to...
read it

Losing Treewidth by Separating Subsets
We study the problem of deleting the smallest set S of vertices (resp.ed...
read it

Subquadratic Approximation Scheme for Partition
The subject of this paper is the time complexity of approximating Knapsa...
read it

Random Order Contention Resolution Schemes
Contention resolution schemes have proven to be an incredibly powerful c...
read it

On Abelian Longest Common Factor with and without RLE
We consider the Abelian longest common factor problem in two scenarios: ...
read it

Individual Security and Network Design with Malicious Nodes
Networks are beneficial to those being connected but can also be used as...
read it

Longest Common Factor Made Fully Dynamic
In the longest common factor (LCF) problem, we are given two strings S a...
read it

Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
We study an expressive model of timed pushdown automata extended with mo...
read it

Analysis of nonsmooth stochastic approximation: the differential inclusion approach
In this paper we address the convergence of stochastic approximation whe...
read it

Parameterized circuit complexity of model checking firstorder logic on sparse structures
We prove that for every class C of graphs with effectively bounded expan...
read it

Decremental SPQRtrees for Planar Graphs
We present a decremental data structure for maintaining the SPQRtree of...
read it

Online Facility Location with Deletions
In this paper we study three previously unstudied variants of the online...
read it

A collisionless singular CuckerSmale model with decentralized formation control
In this paper we address the design of decentralized feedback control la...
read it

Quasipolynomial time approximation schemes for packing and covering problems in planar graphs
We consider two optimization problems in planar graphs. In Maximum Weigh...
read it

Undecidability of MSO+"ultimately periodic"
We prove that MSO on ωwords becomes undecidable if allowing to quantify...
read it

Connected Components at Scale via Local Contractions
As a fundamental tool in hierarchical graph clustering, computing connec...
read it

Asymptotics of maximum likelihood estimators based on Markov chain Monte Carlo methods
In many complex statistical models maximum likelihood estimators cannot ...
read it

Finite Query Answering in Expressive Description Logics with Transitive Roles
We study the problem of finite ontology mediated query answering (FOMQA)...
read it

Improving Hearthstone AI by Combining MCTS and Supervised Learning Algorithms
We investigate the impact of supervised prediction models on the strengt...
read it

An infinitary rewriting interpretation of coinductive types
We introduce an infinitary rewriting semantics for strictly positive nes...
read it

Kernelization and approximation of distancer independent sets on nowhere dense graphs
For a positive integer r, a distancer independent set in an undirected ...
read it

Constant factor FPT approximation for capacitated kmedian
Capacitated kmedian is one of the few outstanding optimization problems...
read it

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract)
Petri nets, also known as vector addition systems, are a long establishe...
read it

Firstorder interpretations of bounded expansion classes
The notion of bounded expansion captures uniform sparsity of graph class...
read it

Randomized contractions meet lean decompositions
The randomized contractions technique, introduced by Chitnis et al. in 2...
read it

Multibudgeted directed cuts
We study multibudgeted variants of the classic minimum cut problem and ...
read it

Proportionality Degree of Multiwinner Rules
We study multiwinner elections with approvalbased preferences. An insta...
read it

HansonWright inequality in Banach spaces
We discuss twosided bounds for moments and tails of quadratic forms in ...
read it

Entropy versus variance for symmetric logconcave random variables and related problems
We show that the uniform distribution minimises entropy among all symmet...
read it

Almost Optimal Distance Oracles for Planar Graphs
We present new tradeoffs between space and querytime for exact distance...
read it
University of Warsaw
The program committee of the ACM Symposium on Theory of Computing (STOC) conference, which presents about 100 most important discoveries in a given year in theoretical computer science, awarded the award for the best work of the article “The Reachability Problem for Petri Nets is Not Elementary”, which coauthors are Wojciech Czerwiński and Sławomir Lasota (Institute of Computer Science, MIM UW).