21 citations · 75 across the 21 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
Artur Czumaj, Peter Davies, Merav Parter
The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (t…
cs.DS2019
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)
Artur Czumaj, Christian Sohler
The problem of characterizing testable graph properties (properties that can be tested with a number of queries independent of the input size) is a fundamental problem in the area…
cs.DS2019
Testable Properties in General Graphs and Random Order Streaming
Artur Czumaj, Hendrik Fichtenberger, Pan Peng +1
We present a novel framework closely linking the areas of property testing and data streaming algorithms in the setting of general graphs. It has been recently shown (Monemizadeh e…