Pál András Papp

47 papers A* 6A 2B 9Misc 1Journal 23Unranked 5

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	DAG Scheduling in the BSP Model. SOFSEM (2) Pál András Papp, Georg Anegg, Albert-Jan Yzelman
2025	—	`conf`	Efficient Parallel Scheduling for Sparse Triangular Solvers. IPDPS (Workshops) Toni Böhnlein, Pál András Papp, Raphael S. Steiner, Albert-Jan Nicholas Yzelman
2025	J	`jnl`	Efficient Parallel Scheduling for Sparse Triangular Solvers. CoRR Toni Böhnlein, Pál András Papp, Raphael S. Steiner, A. N. Yzelman
2025	B	`conf`	Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions. ICPP Pál András Papp, Toni Böhnlein, Albert-Jan Nicholas Yzelman
2025	J	`jnl`	Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions. CoRR Pál András Papp, Toni Böhnlein, A. N. Yzelman
2025	B	`conf`	Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs. SIROCCO Toni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman
2025	J	`jnl`	Symmetry-breaking symmetry in directed spectral partitioning. CoRR Dimosthenis Pasadakis, Raphael S. Steiner, Pál András Papp, Toni Böhnlein, Albert-Jan Nicholas Yzelman
2025	B	`conf`	The Impact of Partial Computations on the Red-Blue Pebble Game. SPAA Pál András Papp, Aleksandros Sobczyk, Albert-Jan Nicholas Yzelman
2025	J	`jnl`	The Impact of Partial Computations on the Red-Blue Pebble Game. CoRR Pál András Papp, Aleksandros Sobczyk, A. N. Yzelman
2024	B	`conf`	Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. SPAA Toni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman
2024	—	`conf`	Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). IPDPS (Workshops) Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman
2024	B	`conf`	Efficient Multi-Processor Scheduling in Increasingly Realistic Models. SPAA Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman
2024	J	`jnl`	Efficient Multi-Processor Scheduling in Increasingly Realistic Models. CoRR Pál András Papp, Georg Anegg, Aikaterini Karanasiou, A. N. Yzelman
2024	J	`jnl`	Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. CoRR Toni Böhnlein, Pál András Papp, A. N. Yzelman
2023	A*	`conf`	Agent-based Graph Neural Networks. ICLR Karolis Martinkus, Pál András Papp, Benedikt Schesch, Roger Wattenhofer
2023	J	`jnl`	DAG Scheduling in the BSP Model. CoRR Pál András Papp, Georg Anegg, A. N. Yzelman
2023	B	`conf`	Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. SPAA Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman
2022	A*	`conf`	A Theoretical Comparison of Graph Neural Network Extensions. ICML Pál András Papp, Roger Wattenhofer
2022	J	`jnl`	A Theoretical Comparison of Graph Neural Network Extensions. CoRR Pál András Papp, Roger Wattenhofer
2022	J	`jnl`	Agent-based Graph Neural Networks. CoRR Karolis Martinkus, Pál András Papp, Benedikt Schesch, Roger Wattenhofer
2022	Misc	`conf`	An Introduction to Graph Neural Networks from a Distributed Computing Perspective. ICDCIT Pál András Papp, Roger Wattenhofer
2022	J	`jnl`	Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. CoRR Pál András Papp, Georg Anegg, A. N. Yzelman
2021	—	`—`	A Study of Influence Propagation in Social and Financial Networks. Pál András Papp
2021	A*	`conf`	Debt Swapping for Risk Mitigation in Financial Networks. EC Pál András Papp, Roger Wattenhofer
2021	J	`jnl`	Debt Swapping for Risk Mitigation in Financial Networks. CoRR Pál András Papp, Roger Wattenhofer
2021	—	`conf`	Default Ambiguity: Finding the Best Solution to the Clearing Problem. WINE Pál András Papp, Roger Wattenhofer
2021	A*	`conf`	DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. NeurIPS Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer
2021	J	`jnl`	DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. CoRR Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer
2021	A	`conf`	Sequential Defaulting in Financial Networks. ITCS Pál András Papp, Roger Wattenhofer
2021	B	`conf`	Stabilization Bounds for Influence Propagation from a Random Initial State. MFCS Pál András Papp, Roger Wattenhofer
2021	J	`jnl`	Stabilization Bounds for Influence Propagation from a Random Initial State. CoRR Pál András Papp, Roger Wattenhofer
2021	J	`jnl`	Two-Class (r, k)-Coloring: Coloring with Service Guarantees. CoRR Pál András Papp, Roland Schmid, Valentin Stoppiello, Roger Wattenhofer
2020	A*	`conf`	A General Stabilization Bound for Influence Propagation in Graphs. ICALP Pál András Papp, Roger Wattenhofer
2020	J	`jnl`	A General Stabilization Bound for Influence Propagation in Graphs. CoRR Pál András Papp, Roger Wattenhofer
2020	J	`jnl`	Default Ambiguity: Finding the Best Solution to the Clearing Problem. CoRR Pál András Papp, Roger Wattenhofer
2020	A*	`conf`	Network-Aware Strategies in Financial Systems. ICALP Pál András Papp, Roger Wattenhofer
2020	J	`jnl`	Network-Aware Strategies in Financial Systems. CoRR Pál András Papp, Roger Wattenhofer
2020	B	`conf`	On the Hardness of Red-Blue Pebble Games. SPAA Pál András Papp, Roger Wattenhofer
2020	J	`jnl`	On the Hardness of Red-Blue Pebble Games. CoRR Pál András Papp, Roger Wattenhofer
2020	J	`jnl`	Sequential Defaulting in Financial Networks. CoRR Pál András Papp, Roger Wattenhofer
2019	B	`conf`	Stabilization Time in Minority Processes. ISAAC Pál András Papp, Roger Wattenhofer
2019	J	`jnl`	Stabilization Time in Minority Processes. CoRR Pál András Papp, Roger Wattenhofer
2019	A	`conf`	Stabilization Time in Weighted Minority Processes. STACS Pál András Papp, Roger Wattenhofer
2019	J	`jnl`	Stabilization Time in Weighted Minority Processes. CoRR Pál András Papp, Roger Wattenhofer
2017	J	`jnl`	Guiding SAT Solving by Formula Partitioning. Int. J. Artif. Intell. Tools Zoltán Ádám Mann, Pál András Papp
2014	—	`conf`	Formula partitioning revisited. POS@SAT Zoltán Ádám Mann, Pál András Papp
2013	J	`jnl`	Predicting algorithmic complexity through structure analysis and compression. Appl. Soft Comput. Zoltán Ádám Mann, Pál András Papp