Eran Rosenbluth

Orcid: 0000-0002-5629-2220

According to our database1, Eran Rosenbluth authored at least 9 papers between 2023 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Lost in Aggregation: On a Fundamental Expressivity Limit of Message-Passing Graph Neural Networks.
CoRR, March, 2026

Repetition Makes Perfect: Recurrent Graph Neural Networks Match Message Passing Limit.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Repetition Makes Perfect: Recurrent Sum-GNNs Match Message Passing Limit.
CoRR, May, 2025

On the uniform expressivity of graph neural networks.
PhD thesis, 2025

2024
Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark.
Trans. Mach. Learn. Res., 2024

Are Targeted Messages More Effective?
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Distinguished In Uniform: Self-Attention Vs. Virtual Nodes.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
The Solidarity Cover Problem.
CoRR, 2023

Some Might Say All You Need Is Sum.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023


  Loading...