1 citations · 1 across the 17 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
Towards the Pseudorandomness of Expander Random Walks for Read-Once ACC0 circuits
Emile Anand
Expander graphs are among the most useful combinatorial objects in theoretical computer science. A line of work studies random walks on expander graphs for their pseudorandomness a…
cs.CC2024
The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
Emile Anand, Jan van den Brand, Mehrdad Ghadiri +1
Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression w…