Cohen, G.
, Damgård, I. B., Ishai, Y., Kölker, J.
, Miltersen, P. B., Raz, R. & Rothblum, R. (2013).
Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed.
Electronic Colloquium on Computational Complexity, (TR13-107).
http://eccc.hpi-web.de/report/2013/107/
Cohen, G.
, Damgård, I. B., Ishai, Y., Kölker, J.
, Miltersen, P. B., Raz, R. & Rothblum, R. D. (2013).
Efficient multiparty protocols via log-depth threshold formulae. I R. Canetti & J. A. Garay (red.),
Advances in Cryptology – CRYPTO 2013: 33rd Annual Conference. Proceedings, Part II (s. 185-202). Springer VS.
https://doi.org/10.1007/978-3-642-40084-1_11
Frandsen, G. S., Husfeldt, T.
, Miltersen, P. B., Rauhe, T. & Skyum, S. (1995).
Dynamic algorithms for the Dyck languages. I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.),
Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (s. 98-108). Springer.
https://doi.org/10.1007/3-540-60220-8_54
Miltersen, P. B., Rajasekaran, S. (red.), Pardalos, P. M. (red.), Reif, J. H. (red.) & Rolim, J. D. P. (red.) (2001).
Derandomizing complexity classes. I
Handbook on Randomized Computing: Combinatorial Optimization, Vol. 9 (chapter 19 udg., Bind II, chapter 19, s. 843-935). Kluwer Academic Publishers (Springer).
Bosansky, B.
, Branzei, S., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2015).
Computation of Stackelberg Equilibria of Finite Sequential Games. I E. Markakis & G. Schäfer (red.),
Web and Internet Economics: 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings (Bind 9470, s. 201-215). Springer VS.
http://arxiv.org/abs/1507.07677
Bosanský, B., Brânzei, S.
, Hansen, K. A., Lund, T. B.
& Miltersen, P. B. (2017).
Computation of Stackelberg Equilibria of Finite Sequential Games.
A C M Transactions on Economics and Computation,
5(4), 23:1-23:24. Artikel 23.
https://doi.org/10.1145/3133242
Blanc, M.
& Hansen, K. A. (2021).
Computational Complexity of Multi-player Evolutionarily Stable Strategies. I R. Santhanam & D. Musatov (red.),
Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings (s. 1-17). Springer.
https://doi.org/10.1007/978-3-030-79416-31
Hansen, K. A., Komarath, B., Sarma M. N., J., Talebanfard, N.
& Skyum, S. (2014).
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. I E. Csuhaj-Varjú, M. Dietzfelbinger & Z. Ésik (red.),
Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (s. 336-347 ). Springer VS.
https://doi.org/10.1007/978-3-662-44465-8_29
Branzei, S., Hosseini, H.
& Miltersen, P. B. (2015).
Characterization and Computation of Equilibria for Indivisible Goods. I
Algorithmic Game Theory: 8th International Symposium, SAGT 2015, Saarbrücken, Germany, September 28–30, 2015, Proceedings (s. 244-255). Springer VS.
https://doi.org/10.1007/978-3-662-48433-3_19
Frederiksen, S. K. S.
& Miltersen, P. B. (2013).
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. I L. Cai, S.-W. Cheng & T.-W. Lam (red.),
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (s. 457-467 ). Springer VS.
https://doi.org/10.1007/978-3-642-45030-3_43