Publications

Sortér efter: Dato | Forfatter | Titel

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

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

Babai, L., Hansen, K. A., Podolskii, V. V. & Sun, X. (2021). Weights of exact threshold functions. Izvestiya: Mathematics, 85(6), 1039-1059. https://doi.org/10.1070/IM9113

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

Hansen, K. A., Liu, T. X. & Malekian, A. (red.) (2022). Web and Internet Economics: 18th International Conference, WINE 2022, Troy, NY, USA, December 12-15, 2022, Proceedings. Springer. Lecture Notes in Computer Science Bind 13778 https://doi.org/10.1007/978-3-031-22832-2

Brânzei, S., Filos-Ratsikas, A., Miltersen, P. B. & Zeng, Y. (2017). Walrasian pricing in multi-unit auctions. I K. G. Larsen, H. L. Bodlaender & J.-F. Raskin (red.), 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 (Bind 83, s. 80:1-80:14). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2017.80

Brânzei, S., Filos-Ratsikas, A., Miltersen, P. B. & Zeng, Y. (2023). Walrasian pricing in multi-unit auctions. Artificial Intelligence, 322, Artikel 103961. https://doi.org/10.1016/j.artint.2023.103961

Branzei, S. & Procaccia, A. D. (2015). Verifiably Truthful Mechanisms. I T. Roughgarden (red.), Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS '15 (s. 297-306 ). Association for Computing Machinery. https://doi.org/10.1145/2688073.2688098

Bhandari, S., Harsha, P., Saptharishi, R. & Srinivasan, S. (2022). Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. I S. Lovett (red.), 37th Computational Complexity Conference, CCC 2022 Artikel 31 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CCC.2022.31

Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S. K. S., Hansen, K. A. & Tan, Z. (2016). Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship. I Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings (Bind 10123, s. 236-250). Springer VS. https://doi.org/10.1007/978-3-662-54110-4_17

Filos-Ratsikas, A. & Miltersen, P. B. (2014). Truthful Approximations to Range Voting. I T.-Y. Liu, Q. Qi & Y. Ye (red.), Web and Internet Economics : 10th Workshop of Internet and Web Economics (WINE), proceedings (s. 175-188 ). Springer VS. https://doi.org/10.1007/978-3-319-13129-0_13

Filos-Ratsika, A. & Miltersen, P. B. (2013). Truthful approximations to range voting. (1307.1766v1 udg.) arxiv.org. http://arxiv.org/pdf/1307.1766v1.pdf

Caragiannis, I., Christodoulou, G. & Protopapas, N. (2022). Truthful Aggregation of Budget Proposals with Proportionality Guarantees. I AAAI-22 Technical Tracks 5 (Bind 11, s. 4917-4924). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20421

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

Brodnik, A., Miltersen, P. B. & Munro, J. I. (1997). Trans-dichotomous algorithms without multiplication - some upper and lower bounds. I F. Dehne, A. Rau-Chaplin, J.-R. Sack & R. Tamassia (red.), Algorithms and Data Structures: 5th International Workshop, WADS'97 Halifax, Nova Scotia, Canada August 6-8, 1997 Proceedings (s. 426-436). Springer. https://doi.org/10.1007/3-540-63307-3_80

Fournier, H., Limaye, N., Malod, G., Srinivasan, S. & Tavenas, S. (2023). Towards Optimal Depth-Reductions for Algebraic Formulas. I A. Ta-Shma (red.), 38th Computational Complexity Conference, CCC 2023 Artikel 28 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CCC.2023.28

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/

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. I H. Karloff & T. Pitassi (red.), STOC '12 Proceedings of the 44th symposium on Theory of Computing (s. 479-494). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214023

Gal, A., Hansen, K. A., Koucky, M., Pudlak, P. & Viola, E. (2013). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. I E E E Transactions on Information Theory, 59(10), 6611-6627. https://doi.org/10.1109/TIT.2013.2270275

Hansen, K. A. (2017). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. I V. Bilò & M. Flammini (red.), Algorithmic Game Theory - 10th International Symposium, SAGT 2017, Proceedings: 10th International Symposium, SAGT 2017 (s. 119-130). Springer VS. https://doi.org/10.1007/978-3-319-66700-3_10

Hansen, K. A. (2019). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. Theory of Computing Systems, 63(7), 1554-1571. https://doi.org/10.1007/s00224-018-9887-9

Caragiannis, I., Shah, N. & Voudouris, A. A. (2022). The Metric Distortion of Multiwinner Voting. I Proceedings of the 36th AAAI Conference on Artificial Intelligence (Bind 11, s. 4900-4907). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20419

Caragiannis, I., Shah, N. & Voudouris, A. A. (2022). The metric distortion of multiwinner voting. Artificial Intelligence, 313, Artikel 103802. https://doi.org/10.1016/j.artint.2022.103802

Branzei, S., Chen, Y., Deng, X., Filos-Ratsikas, A., Frederiksen, S. K. S. & Zhang, J. (2014). The Fisher Market Game: Equilibrium and Welfare. I Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (s. 587-593). AAAI Press. http://www.aaai.org/Library/AAAI/aaai14contents.php

Caragiannis, I. & Voudouris, A. (2021). The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users. Mathematics of Operations Research, 46(2), 503-523. https://doi.org/10.1287/moor.2020.1070

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

Miltersen, P. B. (2005). The Computational Complexity of One-Dimensional Sandpiles. I S. B. Cooper, B. Löwe & L. Torenvliet (red.), New Computational Paradigms: First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005. Proceedings (s. 342-350). Springer. https://doi.org/10.1007/11494645_42

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

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

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., Ibsen-Jensen, R. & Miltersen, P. B. (2014). The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory of Computing Systems, 55(2), 380-403. https://doi.org/10.1007/s00224-013-9524-6

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

Miltersen, P. B. (1993). The complexity of malign measures. S I A M Journal on Computing, 22(1), 147-156. https://doi.org/10.1137/0222012

Miltersen, P. B. (1991). The complexity of malign ensembles. I Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991. (s. 164-171). IEEE Computer Society Press. https://doi.org/10.1109/SCT.1991.160257

Caragiannis, I. & Fehrs, K. (2022). The Complexity of Learning Approval-Based Multiwinner Voting Rules. I AAAI-22 Technical Tracks 5 (Bind 11, s. 4925-4932). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20422

Skyum, S., Frandsen, G. S., Miltersen, P. B. & Binderup, P. G. (1999). The Complexity of Identifying Large Equivalence Classes. Fundamenta Informaticae, 38(1-2), 25-37. https://doi.org/10.3233/FI-1999-381203

Frandsen, G. S., Miltersen, P. B. & Skyum, S. (1993). The complexity of finding replicas using equality tests. I A. M. Borzyszkowsji & S. Sokolowski (red.), Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS'93 Gdansk, Poland, August 30-September 3, 1993 Proceedings (s. 463-472). Springer. https://doi.org/10.1007/3-540-57182-5_38

Etessami, K., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2014). The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. I R. Lavi (red.), Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (s. 231-243 ). Springer VS. https://doi.org/10.1007/978-3-662-44803-8_20

Gal, A. & Miltersen, P. B. (2003). The Cell Probe Complexity of Succinct Data Structures. I J. C. M. Baeten, J. K. Lenstra, J. Parrow & G. J. Wöeginger (red.), Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 - July 4, 2003 Proceedings (s. 442-453). Springer. https://doi.org/10.1007/3-540-45061-0_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. (1993). The bit probe complexity measure revisited. I P. Enjalbert, A. Finkel & K. W. Wagner (red.), STACS 93: 10th Annual Symposium on Theoretical Ascpects of Computer Science Würzburg, Germany, February 25-27, 1993 Proceedings (s. 662-671). Springer. https://doi.org/10.1007/3-540-56503-5_65

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2023). The Big Match with a Clock and a Bit of Memory. Mathematics of Operations Research, 48(1), 419-432. https://doi.org/10.1287/moor.2022.1267

Hansen, K. A., Ibsen-Jensen, R. & Koucký, M. (2016). The big match in small space. I M. Gairing & R. Savani (red.), Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings (Bind 9928, s. 64-76). Springer VS. https://doi.org/10.1007/978-3-662-53354-3_6

Ackerman, M. & Branzei, S. (2014). The Authorship Dilemma: Alphabetical or Contribution? I A. Bazzan & M. Huhns (red.), Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems : AAMAS '14 (s. 1487-1488). Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2616025&bnc=1

Miltersen, P. B., Paterson, M. & Tarui, J. (1996). The asymptotic complexity of merging networks. Association for Computing Machinery. Journal, 43(1), 147-165. https://doi.org/10.1145/227595.227693

Miltersen, P. B., Paterson, M. & Tarui, J. (1992). The asymptotic complexity of merging networks. I 33rd Annual Symposium on Foundations of Computer Science, 1992. Proceedings. (s. 236-246). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1992.267768

Aziz, H., Branzei, S., Filos-Ratsikas, A. & Frederiksen, S. K. S. (2015). The Adjusted Winner Procedure: Characterizations and Equilibria. Afhandling præsenteret på International Joint Conference on Artificial Intelligence, Buinos Aires, Argentina.

Fich, F. & Miltersen, P. B. (1995). Tables should be sorted (on random access machines). 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. 482-493). Springer. https://doi.org/10.1007/3-540-60220-8_87

Miltersen, P. B., Vinodchandran, N. V. & Watanabe, O. (1999). Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. I T. Asano, H. Imai, D. T. Lee, S. Nakano & T. Tokuyama (red.), Computing and Combinatorics: 5th Annual International Conference, COCOON'99 Tokyo, Japan, July 26-28, 1999 Proceedings (s. 210-220). Springer. https://doi.org/10.1007/3-540-48686-0_21

Limaye, N., Srinivasan, S. & Tavenas, S. (2022). Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. I Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021 (s. 804-814). IEEE Computer Society. https://doi.org/10.1109/FOCS52979.2021.00083

Viser resultater 1 til 50 ud af 209

Næste

Sortér efter: Dato | Forfatter | Titel

Revideret 23.08.2023