Hansen, T. D. & Ibsen-Jensen, R. (2013).
The complexity of interior point methods for solving discounted turn-based stochastic games. In
The Nature of Computation, Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings (pp. 252-262). Springer VS.
https://doi.org/10.1007/978-3-642-39053-1_29
Fortune, S., Hopcroft, J.
& Schmidt, E. M. (1978).
The complexity of equivalence and containment for free single variable program schemes. In G. Ausiello & C. Böhm (Eds.),
Automata, Languages and Programming: Fifth Colloquium, Udine, Italy, July 17–21, 1978 (pp. 227-240). Springer.
https://doi.org/10.1007/3-540-08860-1_17
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S. & Östlin, A. (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In F. Orejas, P. G. Spirakis & J. van Leeuwen (Eds.),
Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings (pp. 140-151). Springer.
https://doi.org/10.1007/3-540-48224-5_12
Brodal, G. S., Fagerberg, R.
, Pedersen, C. N. S., Östlin, A., Orejas, F. (Ed.), Spirakis, P. G. (Ed.) & Leeuwen, J. V. (Ed.) (2001).
The Complexity of Constructing Evolutionary Trees Using Experiments. In
Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science ed., Vol. 2076/2001, pp. 140-151). Springer.
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
Ghosh, S. & Simkin, M. (2019).
The Communication Complexity of Threshold Private Set Intersection. In A. Boldyreva & D. Micciancio (Eds.),
Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Vol. II, pp. 3-29). Springer.
https://doi.org/10.1007/978-3-030-26951-7_1
Westergaard, M., Kristensen, L. M., Brodal, G. S. & Arge, L. (2007).
The ComBack Method - Extending Hash Compaction with Backtracking. In
Petri Nets and Other Models of Concurrency – ICATPN 2007: 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007. Proceedings (pp. 455-464). Springer.
https://doi.org/10.1007/978-3-540-73094-1_26
Satyanarayan, A., Strazzulla, D.
, Klokmose, C. N., Beaudouin-Lafon, M. & Mackay, W. (2013).
The CHI 2013 interactive schedule. In W. E. Mackay, S. Brewster & S. Brewster (Eds.),
CHI EA '13 CHI '13 Extended Abstracts on Human Factors in Computing Systems (pp. 2987-2990). Association for Computing Machinery.
https://doi.org/10.1145/2468356.2479591
Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2015).
The Chaining Lemma and its application. In A. Lehmann & S. Wolf (Eds.),
Information Theoretic Security: 8th International Conference, ICITS 2015, Lugano, Switzerland, May 2-5, 2015. Proceedings (pp. 181-196). Springer VS.
https://doi.org/10.1007/978-3-319-17470-9_11
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
Eriksen, S. H., Jensen, B. B., Kristensen, B. B.
& Madsen, O. L. (1977).
The BOBS-system. Department of Computer Science, University of Aarhus, Denmark. DAIMI PB No. 71