TCS-1

Results: 148



#Item
11

Type Inference for Sublinear Space Functional Programming Ugo Dal Lago1? and Ulrich Sch¨opp2?? 1 University of Bologna, Italy

Add to Reading List

Source URL: www2.tcs.ifi.lmu.de

- Date: 2010-06-17 04:35:38
    12

    Algorithms and Data Structures Winter TermExercises for Unit 3 1. We have seen that any algorithm that finds the minimum and maximum of n keys simulta 3n 

    Add to Reading List

    Source URL: www-tcs.cs.uni-sb.de

    - Date: 2016-02-29 11:55:50
      13

      Algorithms and Data Structures (WS15/16) Example Solutions for Unit 7 Question 1 We will use here the following fact that was mentioned in class: Polynomial division can be done in O(n log n).

      Add to Reading List

      Source URL: www-tcs.cs.uni-sb.de

      - Date: 2016-03-04 12:57:33
        14

        Algorithms and Data Structures Winter TermExercises for Units 34 & 35 1. Consider a single-item auction with n ≥ 3 bidders and assume that the item is given to the highest bidder. Suppose the payment of the hi

        Add to Reading List

        Source URL: www-tcs.cs.uni-sb.de

        - Date: 2016-03-29 17:41:18
          15

          Algorithms and Data Structures (WS15/16) Example Solutions for Units 18 & 19 Problem 4 Point a) extract = [4, 3, 2, 6, 8, 1]

          Add to Reading List

          Source URL: www-tcs.cs.uni-sb.de

          - Date: 2016-03-14 16:34:09
            16

            Algorithms and Data Structures Winter TermExercises for UnitLet A and B be two multisets containing integers from the range 1 through K. We want to test, whether A and B are the same, i.e. they contain th

            Add to Reading List

            Source URL: www-tcs.cs.uni-sb.de

            - Date: 2016-03-23 08:36:41
              17

              On the interaction of TCS and Math∗ Avi Wigderson June 29, 2016 1

              Add to Reading List

              Source URL: thmatters.files.wordpress.com

              - Date: 2016-07-04 21:07:05
                18

                Algorithms and Data Structures Winter TermExercises for Units 18 & 19 1. Assume a UNION-FIND strategy as described in class is used where each partition is described by a forest of rooted trees and the root of e

                Add to Reading List

                Source URL: www-tcs.cs.uni-sb.de

                - Date: 2016-03-10 16:07:08
                  19

                  XML Template2013–1:10pm] [1–22] //blrnas3/cenpro/ApplicationFiles/Journals/SAGE/3B2/TCSJ/Vol00000APPFile/SGTCSJ130090.3d (TCS) [PREPRINTER stage]

                  Add to Reading List

                  Source URL: www.abdoumaliqsimone.com

                  - Date: 2013-12-02 00:37:15
                    20

                    Algorithms and Data Structures (WS15/16) Example Solutions for Units 29 & 30 Problem 1 In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a

                    Add to Reading List

                    Source URL: www-tcs.cs.uni-sb.de

                    - Date: 2016-03-23 14:38:31
                      UPDATE