Dominik Pajak

Theor. Comput. Sci., 2022

Multilingual fine-tuning for Grammatical Error Correction.

[BibT_eX]

[DOI]

Krzysztof Pajak

Expert Syst. Appl., 2022

Efficient Algorithm for Deterministic Search of Hot Elements.

[BibT_eX]

[DOI]

CoRR, 2022

Scalable and Efficient Non-adaptive Deterministic Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Tree Exploration in Dual-Memory Model.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Light Agents Searching for Hot Information.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Efficient Deterministic Quantitative Group Testing for Precise Information Retrieval.

[BibT_eX]

[DOI]

CoRR, 2021

2020

On simple back-off in unreliable radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Fast size approximation of a radio network in beeping model.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Self-Stabilizing Task Allocation In Spite of Noise.

[BibT_eX]

[DOI]

Anna R. Dornhaus

Nancy A. Lynch

Frederik Mallmann-Trenn

Tsvetomira Radeva

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019

Does adding more agents make a difference? A case study of cover time for the rotor-router.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Linear Search by a Pair of Distinct-Speed Robots.

[BibT_eX]

[DOI]

Algorithmica, 2019

Noidy Conmunixatipn: On the Convergence of the Averaging Population Protocol.

[BibT_eX]

[DOI]

Frederik Mallmann-Trenn

Yannic Maus

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

On Simple Back-Off in Complicated Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2018

Brief Announcement: On Simple Back-Off in Unreliable Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Brief Announcement: Broadcast in Radio Networks, Time vs. Energy Tradeoffs.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Collision-free network exploration.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Time and space optimality of rotor-router graph exploration.

[BibT_eX]

[DOI]

Artur Menc

Przemyslaw Uznanski

Inf. Process. Lett., 2017

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.

[BibT_eX]

[DOI]

Distributed Comput., 2017

Broadcast in radio networks: time vs. energy tradeoffs.

[BibT_eX]

[DOI]

CoRR, 2017

Multiple Random Walks on Paths and Grids.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Location Hiding in Distributed Systems.

[BibT_eX]

[DOI]

Karol Gotfryd

Proceedings of the Structural Information and Communication Complexity, 2017

2016

Bounds on the cover time of parallel rotor walks.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?

[BibT_eX]

[DOI]

Ralf Klasing

Proceedings of the Structural Information and Communication Complexity, 2016

Approximating the Size of a Radio Network in Beeping Model.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Distributed Patrolling with Two-Speed Robots (and an Application to Transportation).

[BibT_eX]

[DOI]

Jurek Czyzowicz

Konstantinos Georgiou

Evangelos Kranakis

Fraser MacQuarrie

Proceedings of the Operations Research and Enterprise Systems, 2016

Fence Patrolling with Two-speed Robots.

[BibT_eX]

[DOI]

Jurek Czyzowicz

Konstantinos Georgiou

Evangelos Kranakis

Fraser MacQuarrie

Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

2015

Distinguishing views in symmetric networks: A tight lower bound.

[BibT_eX]

[DOI]

Dariusz Dereniowski

Theor. Comput. Sci., 2015

Fast collaborative graph exploration.

[BibT_eX]

[DOI]

Inf. Comput., 2015

On the power of one bit: How to explore a graph when you cannot backtrack?

[BibT_eX]

[DOI]

Artur Menc

Przemyslaw Uznanski

CoRR, 2015

Electing a Leader in Wireless Networks Quickly Despite Jamming.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Information Spreading by Mobile Particles on a Line.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2015

2014

Algorithms for deterministic parallel graph exploration. (Algorithmes pour l'exploration parallèle d'un graphe déterminé).

[BibT_eX]

[DOI]

PhD thesis, 2014

k-Selection Protocols from Energetic Complexity Perspective.

[BibT_eX]

[DOI]

Int. J. Netw. Comput., 2014

Evacuating Robots via Unknown Exit in a Disk.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Patrolling by Robots Equipped with Visibility.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2014

2013

Maximum matching in multi-interface networks.

[BibT_eX]

[DOI]

Alfredo Navarra

Maria Cristina Pinotti

Theor. Comput. Sci., 2013

Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks.

[BibT_eX]

[DOI]

Marcin Kardas

Proceedings of the 42nd International Conference on Parallel Processing, 2013

2012

On λ-Alert Problem.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

2011

Review of SIROCCO 2011.

[BibT_eX]

[DOI]