Pagh

Results: 86



#Item
1Noname manuscript No. (will be inserted by the editor) Thresholds for Extreme Orientability Po-Shen Loh∗ · Rasmus Pagh

Noname manuscript No. (will be inserted by the editor) Thresholds for Extreme Orientability Po-Shen Loh∗ · Rasmus Pagh

Add to Reading List

Source URL: www.math.cmu.edu

Language: English - Date: 2012-12-21 12:54:27
    2Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes ∗ Rasmus Pagh†

    Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes ∗ Rasmus Pagh†

    Add to Reading List

    Source URL: www.itu.dk

    - Date: 2009-04-24 11:07:33
      3Call for Papers: Spatial Computing special issue of ACM TAAS Guest Editors: Jacob Beal (BBN Technologies), Olivier Michel (U. of Paris 12), Ulrik Pagh Schultz (U. of Southern Denmark) Submission Deadline: August 1st, 200

      Call for Papers: Spatial Computing special issue of ACM TAAS Guest Editors: Jacob Beal (BBN Technologies), Olivier Michel (U. of Paris 12), Ulrik Pagh Schultz (U. of Southern Denmark) Submission Deadline: August 1st, 200

      Add to Reading List

      Source URL: www.spatial-computing.org

      - Date: 2009-01-20 13:29:15
        4GRID: Gender Research in Darmstadt A 2016 HISTORAGE Project Funded by the Goethe Institute The Darmstadt Archive: proof the giants of our tiny world existed, their fossils etched in crackling records, crumpled photos, an

        GRID: Gender Research in Darmstadt A 2016 HISTORAGE Project Funded by the Goethe Institute The Darmstadt Archive: proof the giants of our tiny world existed, their fossils etched in crackling records, crumpled photos, an

        Add to Reading List

        Source URL: griddarmstadt.files.wordpress.com

        Language: English - Date: 2016-08-08 06:10:05
        5LINEAR PROBING WITH CONSTANT INDEPENDENCE ˇ C ´∗ ANNA PAGH∗ , RASMUS PAGH∗, AND MILAN RUZI Abstract. Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years

        LINEAR PROBING WITH CONSTANT INDEPENDENCE ˇ C ´∗ ANNA PAGH∗ , RASMUS PAGH∗, AND MILAN RUZI Abstract. Hashing with linear probing dates back to the 1950s, and is among the most studied algorithms. In recent years

        Add to Reading List

        Source URL: www.it-c.dk

        Language: English - Date: 2009-04-24 10:51:03
          6External String Sorting: Faster and Cache-Oblivious Rolf Fagerberg? , Anna Pagh?? , and Rasmus Pagh∗∗ Abstract. We give a randomized algorithm for sorting strings in external memory. For K binary strings comprising N

          External String Sorting: Faster and Cache-Oblivious Rolf Fagerberg? , Anna Pagh?? , and Rasmus Pagh∗∗ Abstract. We give a randomized algorithm for sorting strings in external memory. For K binary strings comprising N

          Add to Reading List

          Source URL: www.it-c.dk

          Language: English - Date: 2006-01-04 06:45:01
            7Optimization of wear protective DLC coatings by use of nanoindentation and Raman spectroscopy. K. Pagh Almtofta, S. Sønderbyb, A. Nørløv Berthelsenb, L. Pleth Nielsena, J. Bøttigerb a b

            Optimization of wear protective DLC coatings by use of nanoindentation and Raman spectroscopy. K. Pagh Almtofta, S. Sønderbyb, A. Nørløv Berthelsenb, L. Pleth Nielsena, J. Bøttigerb a b

            Add to Reading List

            Source URL: www.ejc-pise.org

            - Date: 2009-04-20 02:42:23
              8Introduction to Database Design, Fall 2012 Rasmus Pagh November 20, 2012 To give an impression of what may come, the below problem is of a form that could be given at the written exam.

              Introduction to Database Design, Fall 2012 Rasmus Pagh November 20, 2012 To give an impression of what may come, the below problem is of a form that could be given at the written exam.

              Add to Reading List

              Source URL: itu.dk

              - Date: 2012-11-20 04:01:23
                9Faster Join-Projects and Sparse Matrix Multiplications Rasmus Resen Amossen Rasmus Pagh IT University of Copenhagen

                Faster Join-Projects and Sparse Matrix Multiplications Rasmus Resen Amossen Rasmus Pagh IT University of Copenhagen

                Add to Reading List

                Source URL: rasmus.resen.org

                - Date: 2009-05-12 14:06:13
                  10Collection of database exam solutions Rasmus Pagh August 27, 2012 This is a supplement to the collection of database exams used in the course Introduction to Database Design, which includes answers. The idea

                  Collection of database exam solutions Rasmus Pagh August 27, 2012 This is a supplement to the collection of database exams used in the course Introduction to Database Design, which includes answers. The idea

                  Add to Reading List

                  Source URL: itu.dk

                  - Date: 2012-08-27 05:48:12