21 citations · 38 across the 18 of their papers we have counts for
22 papers
Type-Checking for Pattern-Based Tree Transformations
C. Aiswarya, Sahil Mhaskar, M. Praveen
We introduce and study pattern-based tree transformations. As an illustrating example, consider a source pattern and a target pattern …
Parallel Complexity of Depth-First-Search and Maximal path in restricted graph classes
Archit Chauhan, Samir Datta, M. Praveen
Constructing a Depth First Search (DFS) tree is a fundamental graph problem, whose parallel complexity is still not settled. Reif showed parallel intractability of lex-first DFS. I…
Dynamical Properties of Iterated Function Systems
Praveen M
Iterated function systems (IFS) provide a powerful method for constructing fractals and modeling complex structures. This paper develops the notion of a dynamical system of IFS to…
Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol
M. Praveen, Raghavendra Ramesh, Isaac Doidge
Decentralized Finance (DeFi) has emerged as a contemporary competitive as well as complementary to traditional centralized finance systems. As of 23rd January 2024, per Defillama a…
On the piecewise complexity of words and periodic words
M. Praveen, Philippe Schnoebelen, Isa Vialard +1
The piecewise complexity of a word is the minimal length of subwords needed to exactly characterise . Its piecewise minimality index is the smallest length suc…
On the convergence of sequences in the space of -iterated function systems with applications
Praveen M, Sunil Mathew
This article discusses the notion of convergence of sequences of iterated function systems. The technique of iterated function systems is one of the several methods to construct ob…