Adam Malinowski

According to our database, Adam Malinowski authored at least 11 papers between 1994 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Weak Heirs, Coheirs, and the Ellis Semigroups.

Adam Malinowski, Ludomir Newelski

J. Symb. Log., 2025

2020

The Triguarded Fragment with Transitivity.

Emanuel Kieronski, Adam Malinowski

Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2006

How to Meet in Anonymous Network.

Dariusz R. Kowalski, Adam Malinowski

Proceedings of the Structural Information and Communication Complexity, 2006

1999

Randomized Gossiping by Packets in Faulty Networks.

Anna Gambin, Adam Malinowski

Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

1998

Efficient Broadcasting with Linearly Bounded Faults.

Krzysztof Ciebiera, Adam Malinowski

Discret. Appl. Math., 1998

Randomized Meldable Priority Queues.

Anna Gambin, Adam Malinowski

Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

1997

Efficient Byzantine Agreement in Networks with Random Faults.

Adam Malinowski

Parallel Process. Lett., 1997

A Note on Broadcasting with Linearly Bounded Transmission Faults in Constant Degree Networks.

Krzysztof Ciebiera, Adam Malinowski

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1995

Anonymous Wireless Rings.

Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc

Theor. Comput. Sci., 1995

Token Transfer in a Faulty Network.

Krzysztof Diks, Adam Malinowski, Andrzej Pelc

RAIRO Theor. Informatics Appl., 1995

1994

Reliable Token Despersal with Random Faults.

Krzysztof Diks, Adam Malinowski, Andrzej Pelc

Parallel Process. Lett., 1994