Department of Computer Science

Read more
1681 - 1690 out of 1,698Page size: 10
Sort by: Title
  1. Published

    Project proposal: Associative containers with strong guarantees. CPH STL Report 2007-4

    Katajainen, J., 2007, 39 p.

    Research output: Working paper › Research

  2. Published

    Proceedings of the 9th Scandinavian Workshop on Algorithm Theory: Lecture Notes in Computer Science 3111

    Katajainen, J. & Hagerup, T., 2004, Springer-Verlag. 506 p.

    Research output: Book/Report › Anthology › Research › peer-review

  3. Published

    Priority-queue framework: Programs

    Katajainen, J., 2009, 7 ed., København, 122 p.

    Research output: Working paper › Research

  4. Published

    Mini-project: Safe standard-library containers

    Katajainen, J., 2008, 2 ed., 6 p.

    Research output: Working paper › Research

  5. Published

    Making operations on standard-library containers strongly exception safe

    Katajainen, J., 2007, Proceedings of the 3rd DIKU-IST Joint Workshop on Foundations of Software. Vol. 07. p. 158-169

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  6. Published

    Essays on C++ concepts

    Katajainen, J., 2008, 14 p.

    Research output: Working paper › Research

  7. Published

    Compositional specification of commercial contracts

    Andersen, J., Elsborg, E., Henglein, Fritz, Simonsen, Jakob Grue & Stefansen, C. O. E., 2006, In: International Journal on Software Tools for Technology Transfer. p. 485 - 516 31 p.

    Research output: Contribution to journal › Journal article › Research › peer-review

  8. Published

    Bayes estimation of shape model with application to vertebrae boundaries

    Crimi, A., Ghosh, A., Sporring, Jon & Nielsen, Mads, 2009, Medical Imaging 2009: Image Processing (Proceedings Volume). Vol. 7259. 8 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  9. Published

    A Note on the Flow Extended 0-1 Knapsack Cover Inequalities for the Elementary Shortest Path Problem with a Capacity Constraint

    Jepsen, M. K. & Spoorendonk, S., 2008, København: Department of Computer Science, University of Copenhagen. 7 p. (Department of Computer Science. University of Copenhagen. Technical Report; No. 08/02).

    Research output: Book/Report › Report › Research

  10. Published

    A Branch-and-Cut Algorithm for the Elementary Shortest Path Problem with a Capacity Constraint

    Jepsen, M. K., Petersen, B. & Spoorendonk, S., 2008, Copenhagen: Department of Computer Science, University of Copenhagen. 15 p. (Department of Computer Science. University of Copenhagen. Technical Report; No. 08-01).

    Research output: Book/Report › Report › Research

Previous 1...165 166 167 168 169 170 Next