Hansen, K. A. & Chattopadhyay, A. (2005).
Lower Bounds for Circuits with Few Modular and Symmetric Gates. In L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi & M. Yung (Eds.),
Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings (pp. 994-1005). Springer.
https://doi.org/10.1007/11523468_80
Hansen, T. D.
, Miltersen, P. B. & Sørensen, T. B. (2008).
On Range of Skill. In
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence: Constraints, Satisfiability, and Search (pp. 277-282). AAAI Press.
Hansen, T. D., Ibsen-Jensen, R.
& Miltersen, P. B. (2013).
A Faster Algorithm for Solving One-Clock Priced Timed Games. In P. R. D*Argenio & H. Melgratti (Eds.),
CONCUR 2013 – Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings (pp. 531-545). Springer VS.
https://doi.org/10.1007/978-3-642-40184-8_37
Hansen, K. A., Komarath, B., Sarma M. N., J., Talebanfard, N.
& Skyum, S. (2014).
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. In E. Csuhaj-Varjú, M. Dietzfelbinger & Z. Ésik (Eds.),
Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (pp. 336-347 ). Springer VS.
https://doi.org/10.1007/978-3-662-44465-8_29
Hansen, K. A., Liu, T. X. & Malekian, A. (Eds.) (2022).
Web and Internet Economics: 18th International Conference, WINE 2022, Troy, NY, USA, December 12-15, 2022, Proceedings. Springer. Lecture Notes in Computer Science Vol. 13778
https://doi.org/10.1007/978-3-031-22832-2