Prati
Christian Konrad
Christian Konrad
University of Bristol
Potvrđena adresa e-pošte na bristol.ac.uk - Početna stranica
Naslov
Citirano
Citirano
Godina
Improved massively parallel computation algorithms for mis, matching, and vertex cover
M Ghaffari, T Gouleakis, C Konrad, S Mitrović, R Rubinfeld
arXiv preprint arXiv:1802.08237, 2018
1262018
Maximum matching in semi-streaming with few passes
C Konrad, F Magniez, C Mathieu
International Workshop on Approximation Algorithms for Combinatorial …, 2012
1252012
Maximum matching in turnstile streams
C Konrad
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
852015
The Densest -Subhypergraph Problem
E Chlamtác, M Dinitz, C Konrad, G Kortsarz, G Rabanca
SIAM Journal on Discrete Mathematics 32 (2), 1458-1477, 2018
61*2018
Independent sets in vertex-arrival streams
G Cormode, J Dark, C Konrad
arXiv preprint arXiv:1807.08331, 2018
452018
A simple augmentation method for matchings with applications to streaming algorithms
C Konrad
43rd International Symposium on Mathematical Foundations of Computer Science …, 2018
382018
Detecting cliques in CONGEST networks
A Czumaj, C Konrad
Distributed Computing 33 (6), 533-543, 2020
322020
Validating XML documents in the streaming model with external memory
C Konrad, F Magniez
ACM Transactions on Database Systems (TODS) 38 (4), 1-36, 2013
272013
Approximating semi-matchings in streaming and in two-party communication
C Konrad, A Rosén
ACM Transactions on Algorithms (TALG) 12 (3), 1-21, 2016
242016
Robust set reconciliation
D Chen, C Konrad, K Yi, W Yu, Q Zhang
Proceedings of the 2014 ACM SIGMOD International Conference on Management of …, 2014
232014
On the power of advice and randomization for online bipartite matching
C Dürr, C Konrad, M Renault
arXiv preprint arXiv:1602.07154, 2016
222016
Brief announcement: Local independent set approximation
MHL Bodlaender, MM Halldórsson, C Konrad, F Kuhn
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
212016
Optimal lower bounds for matching and vertex cover in dynamic graph streams
J Dark, C Konrad
arXiv preprint arXiv:2005.11116, 2020
192020
MIS in the Congested Clique Model in Rounds
C Konrad
arXiv preprint arXiv:1802.07647, 2018
192018
Computing large independent sets in a single round
MM Halldórsson, C Konrad
Distributed Computing 31 (1), 69-82, 2018
15*2018
Approximating the caro-wei bound for independent sets in graph streams
G Cormode, J Dark, C Konrad
International Symposium on Combinatorial Optimization, 101-114, 2018
13*2018
Distributed algorithms for coloring interval graphs
MM Halldórsson, C Konrad
International Symposium on Distributed Computing, 454-468, 2014
122014
On two-pass streaming algorithms for maximum bipartite matching
C Konrad, KK Naidu
arXiv preprint arXiv:2107.07841, 2021
102021
The complexity of symmetry breaking in massive graphs
C Konrad, SV Pemmaraju, T Riaz, P Robinson
arXiv preprint arXiv:2105.01833, 2021
102021
The triangle scheduling problem
C Dürr, Z Hanzálek, C Konrad, Y Seddik, R Sitters, ÓC Vásquez, ...
Journal of Scheduling 21, 305-312, 2018
102018
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20