EDBT 2026 Demo / reviewers in the wild / expert

Michal Karonski

dblp:92/554 · DBLP profile ↗
← Back
8ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Distributed computing theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed computing theory
distributed graph algorithms		 0.021999
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically · PODC 1999
On the Distributed Complexity of Computing Maximal Matchings · SODA 1998
Distributed computing theory › distributed graph algorithms
maximal matching		 0.021999
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically · PODC 1999
On the Distributed Complexity of Computing Maximal Matchings · SODA 1998
Distributed computing theory › distributed algorithms
deterministic distributed algorithms		 0.011999
A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically · PODC 1999
Distributed computing theory
distributed complexity		 0.011998
On the Distributed Complexity of Computing Maximal Matchings · SODA 1998

Methods — techniques the papers use, named apart from their topics

distributed algorithm · 0.0
YearPublicationVenuePosition
2013 Random Intersection Graph Process
Mindaugas Bloznelis, Michal Karonski
 WAW2
2011 A New Upper Bound for the Irregularity Strength of Graphs
abstract
A weighting of the edges of a graph is called irregular if the weighted degrees of the vertices are all different. In this note we show that such a weighting is possible from the weight set [Formula: see text] for all graphs not containing a component with exactly two vertices or two isolated vertices.
Maciej Kalkowski, Michal Karonski, Florian Pfender
 SIAM J. Discret. Math.2
2010 An iterative approach to graph irregularity strength
Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender
 Discret. Appl. Math.3
2001 Distributed O(Delta log(n))-Edge-Coloring Algorithm
Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski
 ESA3
2001 On the Distributed Complexity of Computing Maximal Matchings
abstract
We show that maximal matchings can be computed deterministically in O(log 4 n ) rounds in the synchronous, message-passing model of computation. This is one of the very few cases known of a nontrivial graph structure, and the only "classical" one, which can be computed distributively in polylogarithmic time without recourse to randomization.
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
 SIAM J. Discret. Math.2
1999 A Faster Distributed Algorithm for Computing Maximal Matchings Deterministically
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
 PODC2
1999 On Perfect Matchings and Hamilton Cycles in Sums of Random Trees
abstract
We prove that the sum of two random trees possesses with high probability a perfect matching and the sum of five random trees possesses with high probability a Hamilton cycle.
Alan M. Frieze, Michal Karonski, Lubos Thoma
 SIAM J. Discret. Math.2
1998 On the Distributed Complexity of Computing Maximal Matchings
Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
 SODA2