Reliable Token Despersal with Random Faults. - Krzysztof Diks; Adam Malinowski; Andrzej Pelc (Parallel Process. Lett., 1994)

Token Transfer in a Faulty Network. - Krzysztof Diks; Adam Malinowski; Andrzej Pelc (RAIRO Theor. Informatics Appl., 1995)

Anonymous Wireless Rings. - Krzysztof Diks; Evangelos Kranakis; Adam Malinowski; Andrzej Pelc (Theor. Comput. Sci., 1995)

A Note on Broadcasting with Linearly Bounded Transmission Faults in Constant Degree Networks. - Krzysztof Ciebiera; Adam Malinowski (FCT, 1997)

Efficient Byzantine Agreement in Networks with Random Faults. - Adam Malinowski (Parallel Process. Lett., 1997)

Randomized Meldable Priority Queues. - Anna Gambin; Adam Malinowski (SOFSEM, 1998)

Efficient Broadcasting with Linearly Bounded Faults. - Krzysztof Ciebiera; Adam Malinowski (Discret. Appl. Math., 1998)

Randomized Gossiping by Packets in Faulty Networks. - Anna Gambin; Adam Malinowski (SOFSEM, 1999)

How to meet in anonymous network. - Dariusz R. Kowalski; Adam Malinowski (Theor. Comput. Sci., 2008)

The Triguarded Fragment with Transitivity. - Emanuel Kieronski; Adam Malinowski (LPAR, 2020)

Weak Heirs, Coheirs, and the Ellis Semigroups. - Adam Malinowski; Ludomir Newelski (J. Symb. Log., 2025)