Publications

Sort by: Date | Author | Title

Hansen, K. A., Koucky, M., Lauritzen, N., Miltersen, P. B. & Tsigaridas, E. (2012). Exact Algorithms for Solving Stochastic Games. http://arxiv.org/abs/1202.3898

Branzei, S., Michalak, T., Rahwan, T., Larson, K. & Jennings, N. R. (2012). Matching Games with Additive Externalities. http://arxiv.org/abs/1207.3682

Ackerman, M. & Branzei, S. (2012). Research Quality, Fairness, and Authorship Order. http://arxiv.org/abs/1208.3391

Damgård, I. B., Kölker, J. & Miltersen, P. B. (2012). Secret Sharing and Secure Computing from Monotone Formulae. http://eprint.iacr.org/2012/536

Miltersen, P. B. & Sheffet, O. (2012). Send mixed signals : earn more, work less. In B. Faltings, K. Leyton-Brown & P. Ipeirotis (Eds.), EC '12 Proceedings of the 13th ACM Conference on Electronic Commerce (pp. 234-247). Association for Computing Machinery. https://doi.org/10.1145/2229012.2229033

Ibsen-Jensen, R. & Miltersen, P. B. (2012). Solving Simple Stochastic Games with Few Coin Toss Positions. Lecture Notes in Computer Science, 7501, 636-647. https://doi.org/10.1007/978-3-642-33090-2_55

Gál , A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E. (2012). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. In H. Karloff & T. Pitassi (Eds.), STOC '12 Proceedings of the 44th symposium on Theory of Computing (pp. 479-494). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214023

Ackerman, M., Ben-David, S., Branzei, S. & Loker, D. (2012). Weighted Clustering. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (pp. 858-863). AAAI Press.

Hansen, K. A., Koucký, M., Lauritzen, N., Miltersen, P. B. & Tsigaridas, E. (2011). Exact algorithms for solving stochastic games. In STOC'11: proceedings of the 43rd annual ACM symposium on Theory of computing (pp. 205-214). Association for Computing Machinery. https://doi.org/10.1145/1993636.1993665

Chattopadhyay, A., Gavaldá, R., Hansen, K. A. & Thérien, D. (2011). Learning Read-constant Polynomials of Constant Degree modulo Composites. Lecture Notes in Computer Science, 6651, 29-42. https://doi.org/10.1007/978-3-642-20712-9_3

Hansen, K. A., Koucky, M., Lauritzen, N. & Tsigaridas, E. (2011). Separation bounds for real roots of polynomial systems. Paper presented at MEGA 2011: Effective Methods in Algebraic Geometry, Stockholm, Sweden.

Ibsen-Jensen, R. & Miltersen, P. B. (2011). Solving simple stochastic games with few coin toss positions. http://arxiv.org/abs/1112.5255

Hansen, T. D., Miltersen, P. B. & Zwick, U. (2011). Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. In Proceedings of the Second Symposium on Innovations in Computer Science (pp. 253-263). Tsinghua University Press, Beijing. http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/7.html

Hansen, K. A., Miltersen, P. B. & Ibsen-Jensen, R. (2011). The complexity of solving reachability games using value and strategy iteration. Lecture Notes in Computer Science, 6651, 77-90. https://doi.org/10.1007/978-3-642-20712-9_7

Gál, A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E. (2011). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electronic Colloquium on Computational Complexity, 18(150). http://eccc.hpi-web.de/report/2011/150/

Hansen, K. A. & Koucký, M. (2010). A New Characterization of ACC⁰ and Probabilistic CC⁰. Computational Complexity, 19(2), 211-234. https://doi.org/10.1007/s00037-010-0287-z

Miltersen, P. B. & Sørensen, T. B. (2010). Computing a quasi-perfect equilibrium of a two-player game. Economic Theory, 42(1), 175-192. https://doi.org/10.1007/s00199-009-0440-6

Hansen, K. A. & Podolskii, V. V. (2010). Exact Threshold Circuits. I E E E Conference on Computational Complexity. Proceedings, 270-279. https://doi.org/10.1109/CCC.2010.33

Hansen, K. A., Miltersen, P. B. & Sørensen, T. B. (2010). The computational complexity of trembling hand perfection and other equilibrium refinements. Lecture Notes in Computer Science, 6386, 198-209. https://doi.org/10.1007/978-3-642-16170-4_18

Babai, L., Hansen, K. A., Podolskii, V. V. & Sun, X. (2010). Weights of Exact Threshold Functions. Lecture Notes in Computer Science, 6281, 66-77. https://doi.org/10.1007/978-3-642-15155-2_8

Hansen, K. A. & Koucký, M. (2009). A new characterization of ACC⁰ and probabilistic CC⁰. I E E E Conference on Computational Complexity. Proceedings, 27-34. https://doi.org/10.1109/CCC.2009.15

Hansen, K. A. (2009). Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. Lecture Notes in Computer Science, 5675, 117-128. https://doi.org/10.1007/978-3-642-03351-3_13

Escamocher, G., Miltersen, P. B. & Santillan, R. (2009). Existence and computation of equilibria of first-price auctions with integral valuations and bids. In K. S. Decker, J. S. Sichman, C. Sierra & C. Castelfranchi (Eds.), Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'09): SESSION: Interactions (Vol. 2, pp. 1227-1228). International Foundation for Autonomous Agents and Multiagent Systems. http://delivery.acm.org/10.1145/1560000/1558225/p1227-escamocher.pdf?key1=1558225&key2=4204373621&coll=GUIDE&dl=GUIDE&CFID=73345521&CFTOKEN=52226755

Hansen, K. A., Lachish, O. & Miltersen, P. B. (2009). Hilbert's thirteenth problem and circuit complexity. Lecture Notes in Computer Science, 5878, 153-162. https://doi.org/10.1007/978-3-642-10631-6_17

Miltersen, P. B., Allender, E., Burgisser, P. & Kjeldgaard-Pedersen, J. (2009). On the complexity of numerical analysis. S I A M Journal on Computing, 38(5), 1987-2006. https://doi.org/10.1137/070697926

Miltersen, P. B., Nielsen, J. B. & Triandopoulos, N. (2009). Privacy-Enhancing Auctions Using Rational Cryptography. Lecture Notes in Computer Science, 5677, 541-558. https://doi.org/10.1007/978-3-642-03356-8_32

Bielikova, M., Nielsen, M., Kucera, A., Miltersen, P. B., Palamidessi, C., Tuma, P. & Valencia, F. (Eds.) (2009). SOFSEM 2009: Theory and Practice of Computer Science: 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings. Springer. Lecture Notes in Computer Science Vol. 5404 https://doi.org/10.1007/978-3-540-95891-8

Andersson, D. & Miltersen, P. B. (2009). The complexity of solving stochastic games on graphs. Lecture Notes in Computer Science, 112-121. https://doi.org/10.1007/978-3-642-10631-6_13

Hansen, K. A., Koucký, M. & Miltersen, P. B. (2009). Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. Symposium on Logic in Computer Science, 332-341. https://doi.org/10.1109/LICS.2009.44

Hansen, K. A., Hansen, T. D., Miltersen, P. B. & Sørensen, T. B. (2008). Approximability and Parameterized Complexity of Minmax Values. Lecture Notes in Computer Science, 5385, 684-695. https://doi.org/10.1007/978-3-540-92185-1_74

Miltersen, P. B. (Ed.) (2008). Conference on Computational Complexity 2007: Guest Editor's Foreword. Computational Complexity, 17(2), 147-148. https://doi.org/10.1007/s00037-008-0247-z

Hansen, K. A. (2008). Constant Width Planar Branching Programs Characterize ACC⁰ in Quasipolynomial Size. I E E E Conference on Computational Complexity. Proceedings, 92-99. https://doi.org/10.1109/CCC.2008.11

Andersson, D., Hansen, K. A., Miltersen, P. B. & Sørensen, T. B. (2008). Deterministic Graphical Games Revisited. Lecture Notes in Computer Science, 5028, 1-10. https://doi.org/10.1007/978-3-540-69407-6_1

Herings, P. J.-J., Jurdzinski, M., Miltersen, P. B., Tardos, É. & von Stengel, B. (2008). Equilibrium Computation: 18.11. - 23.11.2007. Dagstuhl Seminar Proceedings, 07471.

Miltersen, P. B. & Sørensen, T. B. (2008). Fast algorithms for finding proper strategies in game trees. In S.-T. Huang (Ed.), Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 874-883). Society for Industrial and Applied Mathematics.

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.

Miltersen, P. B., Gurvich, V. & Andersson, D. (2008). The Complexity of Solving Stochastic Games on Graphs. Department of Computer Science, Aarhus University. http://www.daimi.au.dk/~bromille/Papers/mean.pdf

Miltersen, P. B. (2008). Trembling hand perfection is NP-hard. http://arxiv.org/PS_cache/arxiv/pdf/0812/0812.0492v1.pdf

Miltersen, P. B. & Sørensen, T. B. (2007). A Near-Optimal Strategy for a Heads-Up No-Limit Texas Hold'em Poker Tournament. In Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (pp. 1168-1175) http://www.daimi.au.dk/~bromille/Papers/aamaspoker.pdf

Miltersen, P. B. & Sørensen, T. B. (2007). Computing Proper Equilibria of Zero-Sum Games. In Proceedings of the 5th International Conference on Computers and Games: Computers and Games (pp. 200-211). Springer. https://doi.org/10.1007/978-3-540-75538-8_18

Hansen, K. A. (2007). Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. In G. Lin (Ed.), Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007. Proceedings (pp. 448-458). Springer. https://doi.org/10.1007/978-3-540-73545-8_44

Brodal, G. S., Georgiadis, L., Hansen, K. A. & Katriel, I. (2007). Dynamic Matchings in Convex Bipartite Graphs. In L. Kucera & A. Kucera (Eds.), Proc. 32nd International Symposium on Mathematical Foundations of Computer Science (pp. 406-417). Springer. https://doi.org/10.1007/978-3-540-74456-6_37

Hansen, K. A., Miltersen, P. B. & Sørensen, T. B. (2007). Finding Equilibria in Games of No Chance. In G. Lin (Ed.), Computing and Combinatorics: Proc. of 13th Annual International Computing and Combinatorics Conference (COCOON 2007) (pp. 274-284). Springer. https://doi.org/10.1007/978-3-540-73545-8_28

Miltersen, P. B. & Gal, A. (2007). The Cell Probe Complexity of Succinct Data Structures. Theoretical Computer Science, 379(3), 405-417. https://doi.org/10.1016/j.tcs.2007.02.047

Miltersen, P. B. (2007). The Computational Complexity of One-dimensional Sandpiles. Theory of Computing Systems, Volume 41(1), 119-125. https://doi.org/10.1007/s00224-006-1341-8

Hansen, K. A., Miltersen, P. B. & Vinay, V. (2006). Circuits on Cylinders. Computational Complexity, 15(1), 62-81. https://doi.org/10.1007/s00037-006-0207-4

Miltersen, P. B. (2006). Computing sequential equilibria for two-player games. In Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'06) (pp. 107-116). ACM-SIAM.

Miltersen, P. B. & Sørensen, T. B. (2006). Computing Sequential Equilibria for Two-Player Games. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms (1 ed., pp. 107-116). Association for Computing Machinery.

Hansen, K. A. (2006). Constant Width and Constant Depth Computation. Daimi PhD Dissertation No. PD-06-13

Hansen, K. A. (2006). Constant Width Planar Computation Characterizes ACC⁰. Theory of Computing Systems, 39(1), 79-92. https://doi.org/10.1007/s00224-005-1258-7

Displaying results 101 to 150 out of 209

Sort by: Date | Author | Title

Revised 23.08.2023