( en | de | ru )

 

Disambiguation of "Papp, Pál András"

Author of the publication

copydeleteadd this publication to your clipboard
On the Hardness of Red-Blue Pebble Games.

, and . SPAA, page 419-429. ACM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andras Pal Veres

Andrea Pál

István Pál

András Fehér

András Bárdossy

 

Other publications of authors with the same name

Stabilization Time in Minority Processes., and . ISAAC, volume 149 of LIPIcs, page 43:1-43:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Sequential Defaulting in Financial Networks., and . CoRR, (2020)Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications., , and . CoRR, (2022)A Study of Influence Propagation in Social and Financial Networks.. ETH Zurich, Zürich, Switzerland, (2021)base-search.net (ftethz:oai:www.research-collection.ethz.ch:20.500.11850/500762).Predicting algorithmic complexity through structure analysis and compression., and . Appl. Soft Comput., 13 (8): 3582-3596 (2013)A General Stabilization Bound for Influence Propagation in Graphs., and . ICALP, volume 168 of LIPIcs, page 90:1-90:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Network-Aware Strategies in Financial Systems., and . ICALP, volume 168 of LIPIcs, page 91:1-91:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Formula partitioning revisited., and . POS@SAT, volume 27 of EPiC Series in Computing, page 41-56. EasyChair, (2014)DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks., , , and . NeurIPS, page 21997-22009. (2021)Agent-based Graph Neural Networks., , , and . ICLR, OpenReview.net, (2023)