Dr.
Pál András Papp
Publications
-
Agent-Based Graph Neural Networks
Karolis Martinkus, Pál András Papp, Benedikt Schesch and Roger Wattenhofer.
11th International Conference on Learning Representations (ICLR), Kigali, Rwanda, May 2023.
BibTeX -
A Theoretical Comparison of Graph Neural Network Extensions
Pál András Papp and Roger Wattenhofer.
39th International Conference on Machine Learning (ICML), Baltimore, Maryland, USA, July 2022.
BibTeX -
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks (Spotlight)
Pál András Papp, Karolis Martinkus, Lukas Faber and Roger Wattenhofer.
35th Conference on Neural Information Processing Systems (NeurIPS), Virtual, December 2021.
BibTeX -
Default Ambiguity: Finding the Best Solution to the Clearing Problem
Pál András Papp and Roger Wattenhofer.
17th Conference on Web and Internet Economics (WINE), Potsdam, Germany, December 2021.
BibTeX -
Stabilization Bounds for Influence Propagation from a Random Initial State
Pál András Papp and Roger Wattenhofer.
46th International Symposium on Mathematical Foundations of Computer Science (MFCS), Tallinn, Estonia, August 2021.
BibTeX -
Debt Swapping for Risk Mitigation in Financial Networks
Pál András Papp and Roger Wattenhofer.
22nd ACM Conference on Economics and Computation (EC), Budapest, Hungary, July 2021.
BibTeX -
Sequential Defaulting in Financial Networks
Pál András Papp and Roger Wattenhofer.
12th Innovations in Theoretical Computer Science (ITCS), Online, January 2021.
BibTeX -
On the Hardness of Red-Blue Pebble Games
Pál András Papp and Roger Wattenhofer.
32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), Philadelphia, Pennsylvania, USA, July 2020.
BibTeX -
Network-Aware Strategies in Financial Systems
Pál András Papp and Roger Wattenhofer.
47th International Colloquium on Automata, Languages and Programming (ICALP), Saarbrücken, Germany, July 2020.
BibTeX -
A General Stabilization Bound for Influence Propagation in Graphs
Pál András Papp and Roger Wattenhofer.
47th International Colloquium on Automata, Languages and Programming (ICALP), Saarbrücken, Germany, July 2020.
BibTeX -
Stabilization Time in Minority Processes
Pál András Papp and Roger Wattenhofer.
30th International Symposium on Algorithms and Computation (ISAAC), Shanghai, China, December 2019.
BibTeX -
Stabilization Time in Weighted Minority Processes
Pál András Papp and Roger Wattenhofer.
36th International Symposium on Theoretical Aspects of Computer Science (STACS), Berlin, Germany, March 2019.
BibTeX
Theses & Labs
Past Theses & Labs | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Title | Type | Contact/Supervisor | Assigned | Student(s) | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Implementing Graph Algorithms for Dynamic Directories [confidential] | B | Robin Fritsch, Pál András Papp | FS 21 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Multi Agent Reinforcement Learning for Game Theory: Financial Graphs [confidential] | M | Béni Egressy, Pál András Papp | FS 21 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Infection Spreading in Graphs | S | Pál András Papp, Béni Egressy | HS 20 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Multiagent Reinforcement Learning in Financial Networks | S | Lukas Faber, Pál András Papp | HS 20 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Mobile Resource Sharing [confidential] | B | Pankaj Khanchandani, Pál András Papp | FS 20 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
A Debatable Way to Gain Participation in Voting | B | Darya Melnyk, Pál András Papp | FS 20 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Online Graph Coloring [confidential] | B | Darya Melnyk, Pál András Papp | FS 19 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Arvy Heuristics for Distributed Mutual Exclusion | B | Pankaj Khanchandani, Pál András Papp | FS 19 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Coloring with Conflicts [confidential] | B | Pál András Papp, Roland Schmid | HS 18 | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Lower Bounds on Local Distributed Deterministic Coloring Algorithms [confidential] | S | Darya Melnyk, Pál András Papp | FS 18 |