3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.PR2025
The speed of biased random walks among dynamical random conductances
Eszter Couillard
We study biased variable-speed random walks in dynamical random conductances. Assuming that the conductances are upper-bounded, we prove that the walk has strictly positive speed f…
cs.LO2023★ 3 cited
Making Practical: Efficient Interactive Protocols for BDD Algorithms
Eszter Couillard, Philipp Czerner, Javier Esparza +1
We show that interactive protocols between a prover and a verifier, a well-known tool of complexity theory, can be used in practice to certify the correctness of automated reasonin…