Ameya Velingker

On the Sensitivity Conjecture for Read-k Formulas.

2016 · Electronic colloquium on computational complexity

Various combinatorial/algebraic parameters are used to quantify the complexity of a Boolean function. Among them, sensitivity is one of the simplest and block sensitivity is one of the most useful. Nisan (1989) and Nisan and …

Even Sparser Graph Transformers

2024 · arXiv (Cornell University)

Graph Transformers excel in long-range dependency modeling, but generally require quadratic memory complexity in the number of nodes in an input graph, and hence have trouble scaling to large graphs. Sparse attention variants such as …