activity
20162026
most citedConcurrency in Boolean networks

24 citations · 24 across the 9 of their papers we have counts for

collaborators

10 papers

cs.PL2026

How Often Does Your Program Fail?

Arnab Ray, Aalok Thakkar

Software in production encounters inputs shaped by how it is used in practice. We study distribution-aware reliability estimation: given a program, its operational input distributi…

cs.AI2026

A Forced-Structure Reduction and Verifiable Bounds for Conway's 99-Graph

Aalok Thakkar, Simone Severini

Conway's 99-graph problem asks whether a strongly regular graph with parameters exists. We develop two complementary lines of attack. Fixing one vertex, t…

cs.CY2026

Astra: AI Safety, Trust, & Risk Assessment

Pranav Aggarwal, Ananya Basotia, Debayan Gupta +8

This paper argues that existing global AI safety frameworks exhibit contextual blindness towards India's unique socio-technical landscape. With a population of 1.5 billion and a ma…

cs.CY2025

SocraticAI: Transforming LLMs into Guided CS Tutors Through Scaffolded Interaction

Karthik Sunil, Aalok Thakkar

We present SocraticAI, a scaffolded AI tutoring system that integrates large language models (LLMs) into undergraduate Computer Science education through structured constraints rat…

cs.FL2025

Stochastic Languages at Sub-stochastic Cost

Smayan Agarwal, Aalok Thakkar

When does a deterministic computational model define a probability distribution? What are its properties? This work formalises and settles this stochasticity problem for weighted a…

cs.HC2025

Accessibility Beyond Accommodations: A Systematic Redesign of Introduction to Computer Science for Students with Visual Impairments

Vaanee Tripathi, Aalok Thakkar

Computer science education has evolved extensively; however, systemic barriers still prevent students with visual impairments from fully participating. While existing research has…

cs.FL2025

Identity Testing for Stochastic Languages

Smayan Agarwal, Shobhit Singh, Aalok Thakkar

Determining whether an unknown distribution matches a known reference is a cornerstone problem in distributional analysis. While classical results establish a rigorous framework in…

cs.FL2020

Infinitude of Primes Using Formal Language Theory

Aalok Thakkar

Formal languages are sets of strings of symbols described by a set of rules specific to them. In this note, we discuss a certain class of formal languages, called regular languages…

cs.LO2019★ 24 cited

Concurrency in Boolean networks

Thomas Chatain, Stefan Haar, Juraj Kolčák +2

Boolean networks (BNs) are widely used to model the qualitative dynamics of biological systems. Besides the logical rules determining the evolution of each component with respect t…

math.NT2016

Additive Collatz Trajectories

Aalok Thakkar, Mrunmay Jagadale

Collatz Conjecture (also known as Ulam's conjecture and 3x+1 problem) concerns the behavior of the iterates of a particular function on natural numbers. A number of generalizations…