Follow
Pál András Papp
Pál András Papp
Verified email at huawei.com
Title
Cited by
Cited by
Year
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks
PA Papp, K Martinkus, L Faber, R Wattenhofer
NeurIPS 2021: 35th Conference on Neural Information Processing Systems, 2021
1402021
A Theoretical Comparison of Graph Neural Network Extensions
PA Papp, R Wattenhofer
ICML 2022: 39th International Conference on Machine Learning, 2022
362022
Default Ambiguity: Finding the Best Solution to the Clearing Problem
PA Papp, R Wattenhofer
WINE 2021: 17th Conference on Web and Internet Economics, 2021
192021
Network-Aware Strategies in Financial Systems
PA Papp, R Wattenhofer
ICALP 2020: 47th International Colloquium on Automata, Languages, and …, 2020
172020
Formula partitioning revisited
ZÁ Mann, PA Papp
POS-14: 5th Pragmatics of SAT workshop, 41-56, 2014
152014
Sequential Defaulting in Financial Networks
PA Papp, R Wattenhofer
ITCS 2021: 12th Innovations in Theoretical Computer Science Conference 185 …, 2021
142021
Low-stretch spanning trees
PA Papp, S Kisfaludi-Bak, Z Király
Undergraduate thesis, Eötvös Loránd University, 2014
132014
Agent-based Graph Neural Networks
K Martinkus, PA Papp, B Schesch, R Wattenhofer
ICLR 2023: 11th International Conference on Learning Representations, 2023
102023
Debt Swapping for Risk Mitigation in Financial Networks
PA Papp, R Wattenhofer
EC 2021: 22nd ACM Conference on Economics and Computation, 2021
102021
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications
PA Papp, G Anegg, AN Yzelman
SPAA 2023: 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
72023
On the Hardness of Red-Blue Pebble Games
PA Papp, R Wattenhofer
SPAA 2020: Proceedings of the 32nd ACM Symposium on Parallelism in …, 2020
72020
Stabilization Time in Minority Processes
PA Papp, R Wattenhofer
ISAAC 2019: 30th International Symposium on Algorithms and Computation 149 …, 2019
72019
DAG Scheduling in the BSP Model
PA Papp, G Anegg, AN Yzelman
arXiv preprint arXiv:2303.05989, 2023
52023
Guiding SAT solving by formula partitioning
ZÁ Mann, PA Papp
International Journal on Artificial Intelligence Tools 26 (04), 1750011, 2017
52017
Predicting algorithmic complexity through structure analysis and compression
ZÁ Mann, PA Papp
Applied Soft Computing 13 (8), 3582-3596, 2013
52013
Stabilization Time in Weighted Minority Processes
PA Papp, R Wattenhofer
STACS 2019: 36th International Symposium on Theoretical Aspects of Computer …, 2019
42019
An Introduction to Graph Neural Networks from a Distributed Computing Perspective
PA Papp, R Wattenhofer
ICDCIT 2022: 18th International Conference on Distributed Computing and …, 2022
22022
A General Stabilization Bound for Influence Propagation in Graphs
PA Papp, R Wattenhofer
ICALP 2020: 47th International Colloquium on Automata, Languages, and …, 2020
12020
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
T Böhnlein, PA Papp, AJN Yzelman
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024
2024
Efficient Multi-Processor Scheduling in Increasingly Realistic Models
PA Papp, G Anegg, A Karanasiou, AN Yzelman
SPAA 2024: 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024
2024
The system can't perform the operation now. Try again later.
Articles 1–20