Nithish Raja

collaborators

3 papers

cs.DS2026

Shortest Paths with Linear Edge Weights

Suryajith Chillara, Kshitij Gajjar, Nithish Raja

We study shortest paths in directed graphs whose edge weights are of the form $wt (e) = a_{e, 1} λ_{1} + a_{e, 2} λ_{2} + a_{e, 3} λ_{3} + \dots + a_{e, d} λ_{d} + a_{e, d + 1} .$ Here…

cs.CC2026

Subcube Stifling

Arjan Cornelissen, Nikhil S. Mande, Nithish Raja

We introduce the subcube stifling number, a new combinatorial measure of total Boolean functions. This measure is the largest integer $k$ such that, for every set $S$ of at most $k…

quant-ph2025

Quantum Search With Generalized Wildcards

Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro +2

In the search with wildcards problem [Ambainis, Montanaro, Quantum Inf.~Comput.'14], one's goal is to learn an unknown bit-string $x \in {- 1, 1}^{n}$ . An algorithm may, at unit cost…