Items where Research Area is "Theory and Applications of Algorithms" and Year is 2016

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Category | No Grouping
Jump to: Journal Paper | Paper in Conference Proceedings or in Workshop Proceedings | Book Section/Chapter
Number of items: 21.

Journal Paper

  • On rejected arguments and implicit conflicts: The hidden power of argumentation semantics
    Baumann, Ringo and Dvořák, Wolfgang and Linsbichler, Thomas and Spanring, Christof and Strass, Hannes and Woltran, Stefan Artificial Intelligence , 241. 244 - 284 ISSN 0004-3702 (2016)

  • Mining Agile DNS Traffic using Graph Analysis for Cybercrime Detection
    Berger, Andreas and D’Alconzo, Alessandro and Gansterer, Wilfried and Pescapé, Antonio pp. 28-44 ISSN 1389-1286 (2016)

  • Comparing the expressiveness of argumentation semantics
    Dvořák, Wolfgang and Spanring, Christof ISSN 0955-792X (2016)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon pp. 947-1006 ISSN 0097-5397 (2016)

  • Parallel Iterative Refinement Linear Least Squares Solvers based on All-Reduce Operations
    Prikopa, Karl E. and Gansterer, Wilfried and Wimmer, Elias pp. 167-184 ISSN 0167-8191 (2016)

  • Distributed Gram-Schmidt orthogonalization with simultaneous elements refinement
    Sluciak, Ondrej and Strakova, Hana and Rupp, Markus and Gansterer, Wilfried pp. 1-13 ISSN 1687-6180 (2016)

    • Paper in Conference Proceedings or in Workshop Proceedings

  • New Deterministic Approximation Algorithms for Fully Dynamic Matching
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon In: STOC 2016: 48th Annual Symposium on the Theory of Computing , 19-21 Jun 2016 , Cambridge, MA, USA (2016)

  • Conditionally Optimal Algorithms for Generalized Büchi Games
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016) , August 22-26, 2016 , Krakow (Poland) (2016)

  • Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika In: Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) , July 5-8, 2016 , New York City, USA (2016)

  • Better Strategyproof Mechanisms without Payments or Prior --- An Analytic Approach
    Cheung, Yun Kuen In: International Joint Conference on Artificial Intelligence , 9--15 July, 2016 , New York, USA (2016)

  • Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
    Cheung, Yun Kuen and Goranci, Gramoz and Henzinger, Monika In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) , 12-15 July 2016 , Rome, Italy (2016)

  • Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
    Goranci, Gramoz and Henzinger, Monika and Thorup, Mikkel In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • Vertex Sparsification in Trees
    Goranci, Gramoz and Räcke, Harald In: 14th Workshop on Approximation and Online Algorithms (WAOA) 2016 , August 25-26, 2016 , Aarhus, Denmark (2016)

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: STOC 2016: 48th Annual Symposium on the Theory of Computing , 19-21 Jun 2016 , Cambridge, MA, USA (2016)

  • Incremental and Fully Dynamic Subgraph Connectivity For Emergency Planning
    Henzinger, Monika and Neumann, Stefan In: 24th Annual European Symposium on Algorithms (ESA 2016) , 22-26 Aug 2016 , Aarhus, Denmark (2016)

  • ACO-inspired Acceleration of Gossip Averaging
    Janecek, Andreas and Gansterer, Wilfried In: Genetic and Evolutionary Computation Conference 2016 (GECCO '16) , July 20-24 2016 , Denver, USA (2016)

  • Understanding the information flow of ACO-accelerated gossip algorithms
    Janecek, Andreas and Gansterer, Wilfried In: Seventh International Conference on Swarm Intelligence (ICSI’2016) , 25.6.2016-30.6.2016 , Denpasar, Indenesien (2016)

  • What You Will Gain By Rounding: Theory and Algorithms for Rounding Rank
    Neumann, Stefan and Gemulla, Rainer and Miettinen, Pauli In: 16th IEEE International Conference on Data Mining 2016 (ICDM'16) , 12-15 December 2016 , Barcelona (2016)

  • This House Proves That Debating Is Harder Than Soccer
    Neumann, Stefan and Wiese, Andreas In: Eighth International Conference on Fun with Algorithms (FUN 2016) , June 8 – 10, 2016 , La Maddalena, Maddalena Islands, Italy (2016)

    • Book Section/Chapter

  • PageRank Algorithm
    Henzinger, Monika In: Encyclopedia of Algorithms. Springer, pp. 1509-1511 (2016)

  • Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon In: Encyclopedia of Algorithms. Springer, pp. 600-602 (2016)

    • This list was generated on Tue Nov 5 06:11:32 2024 CET.
    Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
    EPrints Logo
    CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.