Pál András Papp

A. N. Yzelman

CoRR, 2024

Efficient Multi-Processor Scheduling in Increasingly Realistic Models.

[BibT_eX]

[DOI]

Aikaterini Karanasiou

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs.

[BibT_eX]

[DOI]

Toni Böhnlein

Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary).

[BibT_eX]

[DOI]

Aikaterini Karanasiou

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024

2023

DAG Scheduling in the BSP Model.

[BibT_eX]

[DOI]

A. N. Yzelman

CoRR, 2023

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications.

[BibT_eX]

[DOI]

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Agent-based Graph Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

A Theoretical Comparison of Graph Neural Network Extensions.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

An Introduction to Graph Neural Networks from a Distributed Computing Perspective.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Intelligent Technology, 2022

2021

A Study of Influence Propagation in Social and Financial Networks.

[BibT_eX]

[DOI]

PhD thesis, 2021

Two-Class (r, k)-Coloring: Coloring with Service Guarantees.

[BibT_eX]

[DOI]

CoRR, 2021

Default Ambiguity: Finding the Best Solution to the Clearing Problem.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 17th International Conference, 2021

Debt Swapping for Risk Mitigation in Financial Networks.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Stabilization Bounds for Influence Propagation from a Random Initial State.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Sequential Defaulting in Financial Networks.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

On the Hardness of Red-Blue Pebble Games.

[BibT_eX]

[DOI]

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

Network-Aware Strategies in Financial Systems.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

A General Stabilization Bound for Influence Propagation in Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Stabilization Time in Weighted Minority Processes.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Stabilization Time in Minority Processes.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2017

Guiding SAT Solving by Formula Partitioning.

[BibT_eX]

[DOI]

Zoltán Ádám Mann

Int. J. Artif. Intell. Tools, 2017

2014

Formula partitioning revisited.

[BibT_eX]

[DOI]

Zoltán Ádám Mann

Proceedings of the POS-14. Fifth Pragmatics of SAT workshop, 2014

2013

Predicting algorithmic complexity through structure analysis and compression.

[BibT_eX]

[DOI]

Zoltán Ádám Mann