Artur Czumaj
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| On testing networks that compute ... | Workshop on Local Algorithms (WoLA) 2024 | 2024-08-05 |
Introduces a property-testing model for fully connected feedforward ReLU networks where distance means changing at most an epsilon-fraction of weights per… | ||
| Property Testing for Graphs | Sublinear Algorithms Boot Camp 2024 | 2024-05-21 |
Survey of graph property testing that draws a sharp line between models and gives concrete bounds: dense graphs admit constant‑query testers for every… | ||
| Conditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds | Sublinear Algorithms Boot Camp 2024 | 2024-05-21 |
Shows that MPC with linear local space is essentially equivalent to congested clique equivalence, so unconditional lower bounds would imply circuit complexity… | ||
| Generating Random Permutations Using Switching Networks | Approximate Counting, Markov Chains and Phase Transitions | 2016-02-22 |
Almost every fixed switching network of logarithmic depth yields a distribution that is uniform on 99% of elements; proofs use expansion of short layered… | ||
| Fast Testing of Graph Properties | Workshop on Succinct Data Representations and Applications (Simons Institute Big Data 2013) | 2013-09-16 |
Characterizes what's testable fast and where costs hide: dense graphs (adjacency matrix) admit constant-query testers for all hereditary properties but with… | ||
| nothing matches | ||