- Randomized and Symmetric Catalytic Computationeccc, 27:24, 2020. [doi]

- Unambiguous Catalytic Computationeccc, 26:95, 2019. [doi]

- 5-free Bipartite Graphseccc, 21:161, 2014. [doi]
- New Time-Space Upperbounds for Directed Reachability in High-genus and $H$-minor-free Graphseccc, 21:35, 2014. [doi]
- New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphsfsttcs 2014: 585-595 [doi]
- ReachFewL = ReachULcc, 23(1):85-98, 2014. [doi]
- Review of additive combinatorics by Terence Tao and Van H. Vusigact, 45(1):24-26, 2014. [doi]

- Space complexity of perfect matching in bounded genus bipartite graphsjcss, 78(3):765-779, 2012. [doi]
- On the power of unambiguity in log-spacecc, 21(4):643-670, 2012. [doi]
- Green's theorem and isolation in planar graphsiandc, 215:1-7, 2012. [doi]

- ReachFewL = ReachULeccc, 18:60, 2011. [doi]
- ReachFewL = ReachULcocoon 2011: 252-258 [doi]

- Perfect Matching in Bipartite Planar Graphs is in ULeccc, 17:201, 2010. [doi]
- On the Power of Unambiguity in Logspaceeccc, 17:9, 2010. [doi]
- Green s Theorem and Isolation in Planar Graphseccc, 17:151, 2010. [doi]