35 citations · 83 across the 19 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DB2014
Defining relations on graphs: how hard is it in the presence of node partitions?
M. Praveen, B. Srivathsan
Designing query languages for graph structured data is an active field of research. Evaluating a query on a graph results in a relation on the set of its nodes. In other words, a q…
cs.LO2014★ 1 cited
Fast detection of cycles in timed automata
Aakash Deshpande, Frédéric Herbreteau, B. Srivathsan +2
We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is ex…