default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPál András Papp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c19]Pál András Papp
, Georg Anegg, Albert-Jan Yzelman:
DAG Scheduling in the BSP Model. SOFSEM (2) 2025: 238-253- [i18]Toni Böhnlein, Pál András Papp, Raphael S. Steiner, A. N. Yzelman:
Efficient Parallel Scheduling for Sparse Triangular Solvers. CoRR abs/2503.05408 (2025) - 2024
- [c18]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: 1169-1171 - [c17]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: 285-287 - [c16]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. SPAA 2024: 463-474 - [i17]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, A. N. Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. CoRR abs/2404.15246 (2024) - [i16]Toni Böhnlein, Pál András Papp, A. N. Yzelman:
Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. CoRR abs/2409.03898 (2024) - 2023
- [c15]Karolis Martinkus, Pál András Papp, Benedikt Schesch, Roger Wattenhofer:
Agent-based Graph Neural Networks. ICLR 2023 - [c14]Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman:
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. SPAA 2023: 415-425 - [i15]Pál András Papp, Georg Anegg, A. N. Yzelman:
DAG Scheduling in the BSP Model. CoRR abs/2303.05989 (2023) - 2022
- [c13]Pál András Papp, Roger Wattenhofer:
An Introduction to Graph Neural Networks from a Distributed Computing Perspective. ICDCIT 2022: 26-44 - [c12]Pál András Papp, Roger Wattenhofer:
A Theoretical Comparison of Graph Neural Network Extensions. ICML 2022: 17323-17345 - [i14]Pál András Papp, Roger Wattenhofer:
A Theoretical Comparison of Graph Neural Network Extensions. CoRR abs/2201.12884 (2022) - [i13]Karolis Martinkus, Pál András Papp, Benedikt Schesch, Roger Wattenhofer:
Agent-based Graph Neural Networks. CoRR abs/2206.11010 (2022) - [i12]Pál András Papp, Georg Anegg, A. N. Yzelman:
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. CoRR abs/2208.08257 (2022) - 2021
- [b1]Pál András Papp:
A Study of Influence Propagation in Social and Financial Networks. ETH Zurich, Zürich, Switzerland, 2021 - [c11]Pál András Papp, Roger Wattenhofer:
Sequential Defaulting in Financial Networks. ITCS 2021: 52:1-52:20 - [c10]Pál András Papp, Roger Wattenhofer:
Stabilization Bounds for Influence Propagation from a Random Initial State. MFCS 2021: 83:1-83:15 - [c9]Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer:
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. NeurIPS 2021: 21997-22009 - [c8]Pál András Papp, Roger Wattenhofer:
Debt Swapping for Risk Mitigation in Financial Networks. EC 2021: 765-784 - [c7]Pál András Papp, Roger Wattenhofer:
Default Ambiguity: Finding the Best Solution to the Clearing Problem. WINE 2021: 391-409 - [i11]Pál András Papp, Roger Wattenhofer:
Stabilization Bounds for Influence Propagation from a Random Initial State. CoRR abs/2107.02076 (2021) - [i10]Pál András Papp, Roger Wattenhofer:
Debt Swapping for Risk Mitigation in Financial Networks. CoRR abs/2107.05359 (2021) - [i9]Pál András Papp, Roland Schmid, Valentin Stoppiello, Roger Wattenhofer:
Two-Class (r, k)-Coloring: Coloring with Service Guarantees. CoRR abs/2108.03882 (2021) - [i8]Pál András Papp, Karolis Martinkus, Lukas Faber, Roger Wattenhofer:
DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks. CoRR abs/2111.06283 (2021) - 2020
- [c6]Pál András Papp, Roger Wattenhofer:
A General Stabilization Bound for Influence Propagation in Graphs. ICALP 2020: 90:1-90:15 - [c5]Pál András Papp, Roger Wattenhofer:
Network-Aware Strategies in Financial Systems. ICALP 2020: 91:1-91:17 - [c4]Pál András Papp, Roger Wattenhofer:
On the Hardness of Red-Blue Pebble Games. SPAA 2020: 419-429 - [i7]Pál András Papp, Roger Wattenhofer:
Network-Aware Strategies in Financial Systems. CoRR abs/2002.07566 (2020) - [i6]Pál András Papp, Roger Wattenhofer:
Default Ambiguity: Finding the Best Solution to the Clearing Problem. CoRR abs/2002.07741 (2020) - [i5]Pál András Papp, Roger Wattenhofer:
A General Stabilization Bound for Influence Propagation in Graphs. CoRR abs/2004.09185 (2020) - [i4]Pál András Papp, Roger Wattenhofer:
On the Hardness of Red-Blue Pebble Games. CoRR abs/2005.08609 (2020) - [i3]Pál András Papp, Roger Wattenhofer:
Sequential Defaulting in Financial Networks. CoRR abs/2011.10485 (2020)
2010 – 2019
- 2019
- [c3]Pál András Papp, Roger Wattenhofer:
Stabilization Time in Minority Processes. ISAAC 2019: 43:1-43:19 - [c2]Pál András Papp, Roger Wattenhofer:
Stabilization Time in Weighted Minority Processes. STACS 2019: 54:1-54:15 - [i2]Pál András Papp, Roger Wattenhofer:
Stabilization Time in Weighted Minority Processes. CoRR abs/1902.01228 (2019) - [i1]Pál András Papp, Roger Wattenhofer:
Stabilization Time in Minority Processes. CoRR abs/1907.02131 (2019) - 2017
- [j2]Zoltán Ádám Mann, Pál András Papp:
Guiding SAT Solving by Formula Partitioning. Int. J. Artif. Intell. Tools 26(4): 1750011:1-1750011:37 (2017) - 2014
- [c1]Zoltán Ádám Mann, Pál András Papp:
Formula partitioning revisited. POS@SAT 2014: 41-56 - 2013
- [j1]Zoltán Ádám Mann, Pál András Papp:
Predicting algorithmic complexity through structure analysis and compression. Appl. Soft Comput. 13(8): 3582-3596 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-14 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
