Kristensen, B. B.
, Madsen, O. L., Møller-Pedersen, B. & Nygaard, K. (1982).
Syntax Directed Program Modularization. In P. Degano & E. Sandewall (Eds.),
Integrated interactive computing systems: European Conference on Integrated Computing Systems, ECICS 82, Stresa, Italy, 1-3 September, 1982 North-Holland.
Kristensen, J., Mai, S. T., Assent, I., Jacobsen, J., Vo, B. & Le, A. (2017).
Interactive exploration of subspace clusters for high dimensional data. In D. Benslimane, E. Damiani, W. I. Grosky, A. Hameurlain, A. Sheth & R. R. Wagner (Eds.),
Database and Expert Systems Applications - 28th International Conference, DEXA 2017, Proceedings (Vol. 10438 LNCS, pp. 327-342). Springer VS.
https://doi.org/10.1007/978-3-319-64468-4_25
Kristensen, E. K. & Møller, A. (2017).
Inference and Evolution of TypeScript Declaration Files. In M. Huisman & J. Rubin (Eds.),
Fundamental Approaches to Software Engineering - 20th International Conference, FASE 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings: 20th International Conference, FASE 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings (Vol. 10202, pp. 99-115). Springer VS.
https://doi.org/10.1007/978-3-662-54494-5_6
Krink, T., Løvbjerg, M., Guervós, J. J. M. (Ed.), Adamidis, P. (Ed.), Beyer, H.-G. (Ed.), Fernández-Villacañas Martin, J.-L. (Ed.) & Schwefel, H.-P. (Ed.) (2002).
The LifeCycle model: Combining Particle Swarm Optimisation, Genetic Algorithms and HillClimbers. In
Lecture Notes in Computer Science: Parallel Problem Solving from Nature --- PPSN VII (Vol. 2439, pp. 621-630). Springer.
Krink, T., Ursem, R. K., Filipic, B., Spector, L. (Ed.), Goodman, E. D. (Ed.), Wu, A. (Ed.), Langdon, W. B. (Ed.), Voigt, H. (Ed.), Gen, M. (Ed.), Sen, S. (Ed.), Dorio, M. (Ed.), Pezeshk, S. (Ed.), Garzon, M. H. (Ed.) & Burke, E. (Ed.) (2001).
Evolutionary Algorithms in Control Optimization: The Greenhouse Problem. In
GECCO 2001: Proceedings of the Genetic and Evolutionary Computation Conference (pp. 440-447). Morgan Kaufmann.
Krink, T., Vesterstrøm, J. S., Riget, J., Fogel, D. B. (Ed.), Yao, X. (Ed.), Greenwood, G. (Ed.), Iba, H. (Ed.), Marrow, P. (Ed.) & Shackleton, M. (Ed.) (2002).
Particle Swarm Optimisation with Spatial Particle Extension. In
Proceedings of the Evolutionary Computation on 2002. CEC '02.: Proceedings of the 2002 Congress (Vol. 02, pp. 1474-1479). IEEE.
Krieg-Brückner, B.
, Mosses, P. D. & Mosses, P. D. (Ed.) (2004).
Casl Summary. In
Casl Reference Manual, The Complete Documentation of the Common Algebraic Specification Language (2960 i Lecture Notes in Computer Science ed., pp. 1-69). Springer.
Krieg-Brückner, B.
, Mosses, P. D. & Mosses, P. D. (Ed.) (2004).
Casl Syntax. In
Casl Reference Manual, The Complete Documentation of the Common Algebraic Specification Language (2960 i Lecture Notes in Computer Science ed., pp. 71-112). Springer.
Kremer, H., Günnemann, S., Ivanescu, A.-M.
, Assent, I. & Seidl, T. (2011).
Efficient Processing of Multiple DTW Queries in Time Series Databases.
Lecture Notes in Computer Science,
6809, 150-167.
https://doi.org/10.1007/978-3-642-22351-8_9Krebbers, R., Jung, R.
, Bizjak, A., Jourdan, J.-H., Dreyer, D.
& Birkedal, L. (2017).
The Essence of Higher-Order Concurrent Separation Logic. In H. Yang (Ed.),
Programming Languages and Systems - 26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings (pp. 696-723). Springer VS.
https://doi.org/10.1007/978-3-662-54434-1_26
Krebbers, R., Timany, A. & Birkedal, L. (2017).
Interactive proofs in higher-order concurrent separation logic. In A. D. Gordon & G. Castagna (Eds.),
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017 (pp. 205-217). Association for Computing Machinery.
https://doi.org/10.1145/3009837.3009855
Kostitsyna, I., Löffler, M., Polishchuk, V.
& Staals, F. (2016).
On the complexity of minimum-link path problems. In S. Fekete & A. Lubiw (Eds.),
32nd International Symposium on Computational Geometry, SoCG 2016 (Vol. 51, pp. 49.1-49.16). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing.
https://doi.org/10.4230/LIPIcs.SoCG.2016.49
