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
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
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
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
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
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
Dan, C.
, Hansen, K. A., Jiang, H., Wang, L. & Zhou, Y. (2018).
Low rank approximation of binary matrices: Column subset selection and generalizations. I I. Potapov, J. Worrell & P. Spirakis (red.),
43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (Bind 117, s. 41:1-41:16). Artikel 41 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.MFCS.2018.41
Cryan, M.
& Miltersen, P. B. (2001).
On pseudorandom generators in NC0. I J. Sgall, A. Pultr & P. Kolman (red.),
Mathematical Foundations of Computer Science 2001: Lecture Notes in Computer Science (Lecture Notes in Computer Science 2136 udg., Bind 2136/2001, s. 272-284). Springer.
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
Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A.
& Srinivasan, S. (2023).
Schur Polynomials Do Not Have Small Formulas If the Determinant does not.
Computational Complexity,
32(1), Artikel 3.
https://doi.org/10.1007/s00037-023-00236-x
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
Caragiannis, I., Gravin, N., Lu, P. & Wang, Z. (2022).
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. I M. Feldman, H. Fu & I. Talgam-Cohen (red.),
Web and Internet Economics : 17th International Conference, WINE 2021 (s. 131-148). Springer.
https://doi.org/10.1007/978-3-030-94676-0_8