Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Jayalal Sarma

Jayalal Sarma

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Complexity×1

Frequent co-authors

Nagashri Krishnakumar1×
Harshil Mittal1×

Research Timeline

2026
On the Reachability Problem on Monoid-Labelled Undirected Graphs

The paper studies the labelled reachability problem for undirected graphs with edges labelled by elements of a monoid M, and provides finer complexity bounds and dichotomies based on the monoid and the accepting set.

Highlighted terms show continued research focus across papers

Papers

cs.CCTheoreticalRecentJun 19, 2026

On the Reachability Problem on Monoid-Labelled Undirected Graphs

Nagashri Krishnakumar, Harshil Mittal, Jayalal Sarma

The paper studies the labelled reachability problem for undirected graphs with edges labelled by elements of a monoid M, and provides finer complexity bounds and dichotomies based on the monoid and th…

View →