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., 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
Brânzei, S.
, Filos-Ratsikas, A., Miltersen, P. B. & Zeng, Y. (2017).
Walrasian pricing in multi-unit auctions. In K. G. Larsen, H. L. Bodlaender & J.-F. Raskin (Eds.),
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 (Vol. 83, pp. 80:1-80:14). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.MFCS.2017.80
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. In
Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings (Vol. 10123, pp. 236-250). Springer VS.
https://doi.org/10.1007/978-3-662-54110-4_17
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.
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. In A. Ta-Shma (Ed.),
38th Computational Complexity Conference, CCC 2023 Article 28 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.CCC.2023.28
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
Branzei, S., Chen, Y., Deng, X.
, Filos-Ratsikas, A., Frederiksen, S. K. S. & Zhang, J. (2014).
The Fisher Market Game: Equilibrium and Welfare. In
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (pp. 587-593). AAAI Press.
http://www.aaai.org/Library/AAAI/aaai14contents.php
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. In R. Lavi (Ed.),
Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (pp. 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. In J. C. M. Baeten, J. K. Lenstra, J. Parrow & G. J. Wöeginger (Eds.),
Automata, Languages and Programming: 30th International Colloquium, ICALP 2003 Eindhoven, The Netherlands, June 30 - July 4, 2003 Proceedings (pp. 442-453). Springer.
https://doi.org/10.1007/3-540-45061-0_28
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.
https://doi.org/10.1007/3-540-48686-0_21