Skip to content
Log in
Sponsored Design Multi-Agent AI Systems Using MCP and A2A: Engineer your own Pyt Design Multi-Agent AI Systems Using MCP and A2A: Engineer your own Pyt

Author

Daniela Petrisan

h-index 15 View on Semantic Scholar

We have 3 of 52 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference 2026

Space Complexity of Reachability in Simple Path Graphs

In this work, the space complexity of reachability problem for restricted directed graph families is studied and the following results are shown.

K. Dinesh, C. Sasidharan, Michal Koucký et al. · 0 citations
Conference 2026

Parameterizing the Complexity of Finding Long Paths in DAGs

This work studies the unambiguous complexity of the Long Path problem on DAGs under parameterization and obtains an algorithm that achieves unambiguous and co-unambiguous O ( k log n ) space while running in time polynomial in both n and k.

Ronak Bhadra, Saurya Singh, Raghunath Tewari · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.