Pál András Papp

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 34

Top Topics

Graph Representation

Top Venues

Publications

Toni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. SPAA (2024)
Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. SPAA (2024)
Pál András Papp, Georg Anegg, Aikaterini Karanasiou, A. N. Yzelman
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. CoRR (2024)
Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman
Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). IPDPS (Workshops) (2024)
Karolis Martinkus, Pál András Papp, Benedikt Schesch, Roger Wattenhofer
Agent-based Graph Neural Networks. ICLR (2023)
Pál András Papp, Georg Anegg, A. N. Yzelman
DAG Scheduling in the BSP Model. CoRR (2023)
Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. SPAA (2023)
Pál András Papp, Roger Wattenhofer
An Introduction to Graph Neural Networks from a Distributed Computing Perspective. ICDCIT (2022)
Karolis Martinkus, Pál András Papp, Benedikt Schesch, Roger Wattenhofer
Agent-based Graph Neural Networks. CoRR (2022)
Pál András Papp, Georg Anegg, A. N. Yzelman
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. CoRR (2022)
Pál András Papp, Roger Wattenhofer
A Theoretical Comparison of Graph Neural Network Extensions. ICML (2022)
Pál András Papp, Roger Wattenhofer
A Theoretical Comparison of Graph Neural Network Extensions. CoRR (2022)
Pál András Papp, Roland Schmid, Valentin Stoppiello, Roger Wattenhofer
Two-Class (r, k)-Coloring: Coloring with Service Guarantees. CoRR (2021)
Pál András Papp, Roger Wattenhofer
Default Ambiguity: Finding the Best Solution to the Clearing Problem. WINE (2021)
Pál András Papp, Roger Wattenhofer
Stabilization Bounds for Influence Propagation from a Random Initial State. MFCS (2021)
Pál András Papp, Roger Wattenhofer
Sequential Defaulting in Financial Networks. ITCS (2021)
Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. NeurIPS (2021)
Pál András Papp, Roger Wattenhofer
Debt Swapping for Risk Mitigation in Financial Networks. EC (2021)
Pál András Papp, Roger Wattenhofer
Stabilization Bounds for Influence Propagation from a Random Initial State. CoRR (2021)
Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. CoRR (2021)
Pál András Papp, Roger Wattenhofer
Debt Swapping for Risk Mitigation in Financial Networks. CoRR (2021)
Pál András Papp, Roger Wattenhofer
Network-Aware Strategies in Financial Systems. ICALP (2020)
Pál András Papp, Roger Wattenhofer
On the Hardness of Red-Blue Pebble Games. SPAA (2020)
Pál András Papp, Roger Wattenhofer
Default Ambiguity: Finding the Best Solution to the Clearing Problem. CoRR (2020)
Pál András Papp, Roger Wattenhofer
A General Stabilization Bound for Influence Propagation in Graphs. CoRR (2020)
Pál András Papp, Roger Wattenhofer
Sequential Defaulting in Financial Networks. CoRR (2020)
Pál András Papp, Roger Wattenhofer
On the Hardness of Red-Blue Pebble Games. CoRR (2020)
Pál András Papp, Roger Wattenhofer
Network-Aware Strategies in Financial Systems. CoRR (2020)
Pál András Papp, Roger Wattenhofer
A General Stabilization Bound for Influence Propagation in Graphs. ICALP (2020)
Pál András Papp, Roger Wattenhofer
Stabilization Time in Weighted Minority Processes. CoRR (2019)
Pál András Papp, Roger Wattenhofer
Stabilization Time in Minority Processes. CoRR (2019)
Pál András Papp, Roger Wattenhofer
Stabilization Time in Weighted Minority Processes. STACS (2019)
Pál András Papp, Roger Wattenhofer
Stabilization Time in Minority Processes. ISAAC (2019)
Zoltán Ádám Mann, Pál András Papp
Guiding SAT Solving by Formula Partitioning. Int. J. Artif. Intell. Tools 26 (4) (2017)
Zoltán Ádám Mann, Pál András Papp
Formula partitioning revisited. POS@SAT (2014)
Zoltán Ádám Mann, Pál András Papp
Predicting algorithmic complexity through structure analysis and compression. Appl. Soft Comput. 13 (8) (2013)