Miltersen, P. B., Vinodchandran, N. V. & Watanabe, O. (1999).
Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. In T. Asano, H. Imai, D. T. Lee, S. Nakano & T. Tokuyama (Eds.),
Computing and Combinatorics: 5th Annual International Conference, COCOON'99 Tokyo, Japan, July 26-28, 1999 Proceedings (pp. 210-220). Springer. Lecture Notes in Computer Science Vol. 1627
https://doi.org/10.1007/3-540-48686-0_21
Barrington, D. A. M., Lu, C-J.
, Miltersen, P. B. & Skyum, S. (1998).
Searching constant width mazes captures the AC0 hierarchy. In M. Morvan, C. Meinel & D. Krob (Eds.),
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 25-27, 1998 Proceedings (pp. 73-83). Springer. Lecture Notes in Computer Science Vol. 1373
https://doi.org/10.1007/BFb0028550
Brodnik, A.
, Miltersen, P. B. & Munro, J. I. (1997).
Trans-dichotomous algorithms without multiplication - some upper and lower bounds. In F. Dehne, A. Rau-Chaplin, J-R. Sack & R. Tamassia (Eds.),
Algorithms and Data Structures: 5th International Workshop, WADS'97 Halifax, Nova Scotia, Canada August 6-8, 1997 Proceedings (pp. 426-436). Springer. Lecture Notes in Computer Science Vol. 1272
https://doi.org/10.1007/3-540-63307-3_80
Frandsen, G. S., Husfeldt, T.
, Miltersen, P. B., Rauhe, T. & Skyum, S. (1995).
Dynamic algorithms for the Dyck languages. In S. G. Akl, F. Dehne, J-R. Sack & N. Santoro (Eds.),
Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (pp. 98-108). Springer.
https://doi.org/10.1007/3-540-60220-8_54