Videbech, P., Ravnkilde, B., Pedersen, T. H., Hartvig, H., Egander, A.
, Clemmensen, K., Rasmussen, N. A.
, Andersen, F., Gjedde, A. & Rosenberg, R. (2002).
The Danish PET/depression project: clinical symptoms and cerebral blood flow. A regions-of-interest analysis. Acta Psychiatrica Scandinavica,
106(1), 35-44.
Vermeulen, J., Lim, B. Y.
, Avdic, M., Wang, D. & Abdul, A. (2019).
The Curious Case of Providing Intelligibility for Smart Speakers. Abstract from The 2019 ACM CHI Conference on Human Factors in Computing Systems (CHI'19), Glasgow, United Kingdom.
Gambs, S.
, Ranellucci, S. & Tapp, A. (2015).
The crypto-democracy and the trustworthy (position paper). In
Data Privacy Management, Autonomous Spontaneous Security, and Security Assurance: 9th International Workshop, DPM 2014, 7th International Workshop, SETOP 2014, and 3rd International Workshop, QASA 2014, Wroclaw, Poland, September 10-11, 2014. Revised Selected Papers (Vol. 8872, pp. 58-76). Springer VS.
https://doi.org/10.1007/978-3-319-17016-9_5Bender, M. A.
, Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2003).
The Cost of Cache-Oblivious Searching. In
Proc. 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS): IEEE Computer Society Press, Washington D.C. (Vol. Session 6, pp. 271-282). IEEE Computer Society Press.
Bender, M. A.
, Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2011).
The Cost of Cache-Oblivious Searching.
Algorithmica,
61(2), 463-505.
https://doi.org/10.1007/s00453-010-9394-0Hansen, 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_17Brodal, 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_20Ghosh, 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.2479591Damgå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
