1 citations · 1 across the 6 of their papers we have counts for
7 papers
Convex Hulls, Triangulations, and Voronoi Diagrams of Planar Point Sets on the Congested Clique
Jesper Jansson, Christos Levcopoulos, Andrzej Lingas +1
We consider geometric problems on planar -point sets in the congested clique model. Initially, each node in the -clique network holds a batch of distinct points in the…
Efficient Assignment of Identities in Anonymous Populations
Leszek Gasieniec, Jesper Jansson, Christos Levcopoulos +1
We consider the fundamental problem of assigning distinct labels to agents in the probabilistic model of population protocols. Our protocols operate under the assumption that the s…
New and Improved Algorithms for Unordered Tree Inclusion
Tatsuya Akutsu, Jesper Jansson, Ruiming Li +2
The tree inclusion problem is, given two node-labeled trees and (the ``pattern tree'' and the ``target tree''), to locate every minimal subtree in (if any) that can be…
On the Parameterized Complexity of Associative and Commutative Unification
Tatsuya Akutsu, Takeyuki Tamura, Atsuhiro Takasu
This paper studies the unification problem with associative, commutative, and associative-commutative functions mainly from a viewpoint of the parameterized complexity on the numbe…
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree
Jesper Jansson, Chuanqi Shen, Wing-Kin Sung
This paper presents two new deterministic algorithms for constructing consensus trees. Given an input of k phylogenetic trees with identical leaf label sets and n leaves each, the…
CRAM: Compressed Random Access Memory
Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung
We present a new data structure called the \emph{Compressed Random Access Memory} (CRAM) that can store a dynamic string of characters, e.g., representing the memory of a compu…
More efficient periodic traversal in anonymous undirected graphs
J. Czyzowicz, S. Dobrev, L. Gasieniec +7
We consider the problem of periodic graph exploration in which a mobile entity with constant memory, an agent, has to visit all n nodes of an arbitrary undirected graph G in a peri…