19 citations · 21 across the 5 of their papers we have counts for
6 papers
OPTIMUMP2P: Fast and Reliable Gossiping in P2P Networks
Nicolas Nicolaou, Onyeka Obi, Aayush Rajasekaran +8
Gossip algorithms are pivotal in the dissemination of information within decentralized systems. Consequently, numerous gossip libraries have been developed and widely utilized espe…
From Indexing to Coding: A New Paradigm for Data Availability Sampling
Moritz Grundei, Vipindev Adat Vasudevan, Kishori Konwar +1
The data availability problem is a central challenge in blockchain systems and lies at the core of the accessibility and scalability issues faced by platforms such as Ethereum. Mod…
An Interleaving Hybrid Consensus Protocol
Yao Sun, Aayush Rajasekaran
We introduce Unity Interleave, a new consensus algorithm for public blockchain settings. It is an eventual consistency protocol merging the Proof-of-Work (PoW) and Proof-of-Stake (…
Lagrange's Theorem for Binary Squares
Parthasarathy Madhusudan, Dirk Nowotka, Aayush Rajasekaran +1
We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things, we obtain the following analogue of Lagrange's theo…
Sums of Palindromes: an Approach via Automata
Aayush Rajasekaran, Jeffrey Shallit, Tim Smith
Recently, Cilleruelo, Luca, & Baxter proved, for all bases b >= 5, that every natural number is the sum of at most 3 natural numbers whose base-b representation is a palindrome. Ho…
On the State Complexity of the Shuffle of Regular Languages
Janusz Brzozowski, Galina Jirásková, Bo Liu +2
We investigate the shuffle operation on regular languages represented by complete deterministic finite automata. We prove that $f(m,n)=2^{mn-1} + 2^{(m-1)(n-1)}(2^{m-1}-1)(2^{n-1}-…