Search

We found 527 hits for your search of 'Algorithms and Complexity'.
  1. RDF-3X – Fast Searches for Semantic Data

    /news/spotlight-articles/software/rdf-3x-fast-searches-for-semantic-data

    Edinburgh> and <Edinburgh, is in, Scotland> demonstrate that the object “id2” is written by id1, that id1 is born in Edinburgh, and that Edinburgh is in Scotland. Search in RDF graphs Also, complex relationships [...] triplets, each of which corresponds to an edge and an associated node pair in the data graph. A triplet consists in RDF writing of a subject, a predicate and an object. In the graph, this corresponds with [...] data and indexed it using search trees, so that any triple pattern can be evaluated very quickly. But this is not enough, however; the users are mostly interested in larger inter- relationships and thus

  2. Randomized Algorithms and Probabilistic Analysis of Algorithms

    /departments/algorithms-complexity/teaching/winter22/random

    Departments Algorithms and Complexity Teaching Winter 2022/23 Randomized Algorithms and Probabilistic Analysis of Algorithms Randomized Algorithms and Probabilistic Analysis of Algorithms Advanced Course [...] sense to analyze algorithms under probabilistic input models. In this course, we will introduce you to the foundations of randomized algorithms and probabilistic analysis of algorithms. We will cover different [...] lectures will be added after the corresponding lectures.) Randomized Algorithms and Probabilistic Analysis of Algorithms Approximation Algorithms Ideen und Konzepte der Informatik

  3. Randomized Algorithms and Probabilistic Analysis of Algorithms

    /departments/algorithms-complexity/teaching/summer16/random

    Research Departments Algorithms and Complexity Teaching Randomized Algorithms and Probabilistic Analysis of Algorithms Randomized Algorithms and Probabilistic Analysis of Algorithms Advanced Course, 2+1 [...] sense to analyze algorithms under probabilistic input models. In this course, we will introduce you to the foundations of randomized algorithms and probabilistic analysis of algorithms. We will cover different [...] Randomized Algorithms by Motwani/Raghavan Probability and Computing by Mitzenmacher/Upfal Chapter 13 in Algorithm Design by Kleinberg/Tardos available online (see sample chapters) Optimization Complexity Theory

  4. Randomized and Approximation Algorithms

    /departments/algorithms-complexity/teaching/winter18/rand-apx-algo

    Research Departments Algorithms and Complexity Teaching Winter 2018/19 Randomized and Approximation Algorithms Randomized and Approximation Algorithms Advanced Course, 2+2 Basic Information Given by: Antonios [...] to read and understand technical/mathematical texts, and should have basic knowledge in Algorithms and Probability Theory. News The oral exam will take place on February 27th between 10:15 and 15:10 in [...] provably "close" in value to the optimal one. Randomized Algorithms, and Probabilistic Analysis of Algorithms: Often, allowing an algorithm to make random choices during its execution leads to significantly

  5. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/winter18/reading-group

    Research Departments Algorithms and Complexity Teaching Winter 2018/19 Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Daniel Vaz Time: Wednesday, [...] Randomized and Approximation Algorithms Algorithms on Directed Graphs Theory of Distributed Systems Reading Group Algorithms [...] Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation of your talk will require some effort

  6. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/summer19/reading-group

    Research Departments Algorithms and Complexity Teaching Summer 2019 Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Bhaskar Ray Chaudhury Time: (Wednesday [...] Kernel and Improved Approximation Pasin Manurangsi [Jul10] An Illuminating Algorithm for the Light Bulb Problem Josh Alman [Jul17] Separating Monotone VP and VNP Amir Yehudayoff Distributed and Sequential [...] Sequential Graph Algorithms Fine-Grained Complexity Theory Introduction to Boolean Function Complexity Reading Group Algorithms Optimization Keeping Time in Distributed Systems

  7. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/summer16/reading-group

    Research Departments Algorithms and Complexity Teaching Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Marvin Künnemann and Ruben Becker Time: Wednesday [...] nal complexity and structure of solutions for various optimization or decision problems. As a result, dedicated concepts and methods from Statistical physics apply and can be used to gain new and surprising [...] [Jul27] Scaling Algorithms for Weighted Matching in General Graphs Ran Duan, Seth Pettie, Hsin-Hao Su Optimization Complexity Theory of Polynomial-Time Problems Randomized Algorithms and Probabilistic Analysis

  8. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/summer17/reading-group

    Research Departments Algorithms and Complexity Teaching Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Ruben Becker , and Emanuele Natale Time: Wednesday [...] Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation of your talk will require some effort [...] Learning and Efficiency in Games with Dynamic Population [Apr26] May, 3 Gorav Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds [May3] May, 10 Karl Streaming algorithms for embedding

  9. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/winter16/reading-group

    Research Departments Algorithms and Complexity Teaching Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn and Ruben Becker Time: Wednesday, 4:15 PM Room: [...] Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation of your talk will require some effort [...] Distributed Algorithm for Maximal Independent Set [Nov16] Nov, 23 Pavel Approximate Undirected Maximum Flows in O(m polylog(n)) Time [Nov23] Nov, 30 Sebastian Simple parallel and distributed algorithms for spectral

  10. Reading Group Algorithms

    /departments/algorithms-complexity/teaching/summer20/reading-group

    Research Departments Algorithms and Complexity Teaching Summer 2020 Reading Group Algorithms Reading Group Algorithms Seminar Postponed by 4 weeks! Please note that on 11.3., the entire Saarland university [...] Cristi and Tim Oosterwijk Pieter Kleer No A Local-Search Algorithm for Steiner Forest Martin Groß, Anupam Gupta, Amit Kumar and Jannik Matuscke Corinna Coupette No Computation of Hadwiger Number and Related [...] Network Decomposition and Distributed Derandomization Václav Rozhoň, Mohsen Ghaffari Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms