12 citations · 59 across the 19 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
cs.DS2015★ 8 cited
Optimal Dynamic Strings
Paweł Gawrychowski, Adam Karczmarz, Tomasz Kociumaka +2
In this paper we study the fundamental problem of maintaining a dynamic collection of strings under the following operations: concat - concatenates two strings, split - splits a st…
cs.DS2015
Algorithmic Complexity of Power Law Networks
Paweł Brach, Marek Cygan, Jakub Łącki +1
It was experimentally observed that the majority of real-world networks follow power law degree distribution. The aim of this paper is to study the algorithmic complexity of such "…
cs.DS2015
Fast and simple connectivity in graph timelines
Adam Karczmarz, Jakub Łącki
In this paper we study the problem of answering connectivity queries about a \emph{graph timeline}. A graph timeline is a sequence of undirected graphs on a common…