An algorithm for source location in directed graphs. - Mihály Bárász; Johanna Becker; András Frank (Oper. Res. Lett., 2005)

Breaking EMAP. - Mihály Bárász; Balázs Boros; Péter Ligeti; Krisztina Lója; Daniel A. Nagy (SecureComm, 2007)

A New Approach to Strongly Polynomial Linear Programming. - Mihály Bárász; Santosh S. Vempala (ICS, 2010)

Anonymous sealed bid auction protocol based on a variant of the dining cryptographers' protocol. - Mihály Bárász; Péter Ligeti; László Mérai; Daniel A. Nagy (Period. Math. Hung., 2012)

Robust Cooperation in the Prisoner's Dilemma: Program Equilibrium via Provability Logic. - Mihály Bárász; Paul F. Christiano; Benja Fallenstein; Marcello Herreshoff; Patrick LaVictoire; Eliezer Yudkowsky (CoRR, 2014)

Matroid Intersection under Minimum Rank Oracle. - Mihály Bárász; Kristóf Bérczi; Tamás Király; Yutaro Yamaguchi 001; Yu Yokoi (CoRR, 2024)