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

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Creators | Category | No Grouping
Jump to: A | B | C | F | G | H | K | O | S
Number of items: 26.

A

  • Smaller Cuts, Higher Lower Bounds
    Abboud, Amir and Censor-Hillel, Keren and Khoury, Seri and Paz, Ami pp. 1-40 ISSN 1549-6325 (2021)

  • Resiliency in numerical algorithm design for extreme scale simulations
    Agullo, Emmanuel and Altenbernd, Mirco and Anzt, Hartwig and Bautista-Gomez, Leonardo and Benacchio, Tommaso and Bonaventura, Luca and Bungartz, Hans-Joachim and Chatterjee, Sanjay and Ciorba, Florina M and DeBardeleben, Nathan and Drzisga, Daniel and Eibl, Sebastian and Engelmann, Christian and Gansterer, Wilfried N and Giraud, Luc and Göddeke, Dominik and Heisig, Marco and Jézéquel, Fabienne and Kohl, Nils and Li, Xiaoye Sherry and Lion, Romain and Mehl, Miriam and Mycek, Paul and Obersteiner, Michael and Quintana-Ortí, Enrique S and Rizzi, Francesco and Rüde, Ulrich and Schulz, Martin and Fung, Fred and Speck, Robert and Stals, Linda and Teranishi, Keita and Thibault, Samuel and Thönnes, Dominik and Wagner, Andreas and Wohlmuth, Barbara The International Journal of High Performance Computing Applications. p. 10943420211055188 ISSN 1094-3420 (2021)

    • B

  • New Techniques and Fine-Grained Hardness for Dynamic Near-Additive Spanners
    Bergamaschi, Thiago and Henzinger, Monika and Probst Gutenberg, Maximilian In: ACM-SIAM Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

  • A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
    Bernstein, Aaron and Forster, Sebastian and Henzinger, Monika ISSN 1549-6325 (2021)

  • Dynamic Set Cover: Improved Amortized and Worst-Case Update Time
    Bhattacharya, Sayan and Henzinger, Monika and Nanongkai, Danupon and Wu, Xiaowei In: ACM-SIAM Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

    • C

  • Algorithms and conditional lower bounds for planning problems
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Svozil, Alexander and Henzinger, Monika ISSN 0004-3702 (2021)

  • Symbolic Time and Space Tradeoffs for Probabilistic Verification
    Chatterjee, Krishnendu and Dvořák, Wolfgang and Svozil, Alexander and Henzinger, Monika In: 36th Annual Symposium on Logic in Computer Science (LICS 2021) , 29 June - 02 July, 2021 , Online (2021)

  • Faster Algorithms for Bounded Liveness in Graphs and Game Graphs
    Chatterjee, Krishnendu and Henzinger, Monika and Kale, Sagar and Svozil, Alexander In: 48th International Colloquium on Automata, Languages, and Programming (ICALP) , 12th-16th July , virtual (2021)

    • F

  • Differentially Private Algorithms for Graphs Under Continual Observation
    Fichtenberger, Hendrik and Henzinger, Monika and Ost, Wolfgang In: European Symposium on Algorithms (ESA21) , 06.09.2021 - 10.09.2021 , Virtual conference (2021)

  • Consistent k-Clustering for General Metrics
    Fichtenberger, Hendrik and Lattanzi, Silvio and Norouzi-Fard, Ashkan and Svensson, Ola In: Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

  • Testing stability properties in graphical hedonic games
    Fichtenberger, Hendrik and Rey, Anja ISSN 1387-2532 (2021)

  • Input-Dynamic Distributed Algorithms for Communication Networks
    Foerster, Klaus-Tycho and Korhonen, Janne H. and Paz, Ami and Rybicki, Joel and Schmid, Stefan ISSN 2476-1249 (2021)

  • Input-Dynamic Distributed Algorithms for Communication Networks
    Foerster, Klaus-Tycho and Korhonen, Janne H. and Paz, Ami and Rybicki, Joel and Schmid, Stefan In: 2021 ACM International Conference on Measurement and Modeling of Computer Systems (ACM SIGMETRICS 2021) , 14-18 Jun 2021 , Beijing, China (2021)

  • Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications
    Forster, Sebastian and Goranci, Gramoz and Henzinger, Monika In: ACM-SIAM Symposium on Discrete Algorithms (SODA21) , 10.1.-13.1.2021 , Virtual Conference (2021)

  • Distributed Quantum Proofs for Replicated Data
    Fraigniaud, Pierre and Le Gall, François and Nishimura, Harumichi and Paz, Ami In: ITCS - Innovations in Theoretical Computer Science , January 6-8, 2021 , Virtual Conference (2021)

    • G

  • Fully Dynamic k-Center Clustering in Low Dimensional Metrics
    Goranci, Gramoz and Henzinger, Monika and Leniowski, Dariusz and Schulz, Christian and Svozil, Alexander In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2021) , 10.-11.1.2021 , Virtual Online (Virginia, US) (2021)

    • H

  • Even Faster Reachability in Large Graphs
    Hanauer, Kathrin and Schulz, Christian and Trummer, Jonathan In: 19th Symposium on Experimental Algorithms (SEA 2021) , June 7-9, 2021 , Online (2021)

  • A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
    Henzinger, Monika and Krinninger, Sebastian and Nanongkai, Danupon ISSN 0097-5397 (2021)

  • Tight Bounds for Online Graph Partitioning
    Henzinger, Monika and Neumann, Stefan and Räcke, Harald and Schmid, Stefan In: ACM-SIAM Symposium on Discrete Algorithms (SODA) , January 2021 , Alexandria, Virgina, USA (2021)

  • Faster Parallel Multiterminal Cuts
    Henzinger, Monika and Noe, Alexander and Schulz, Christian In: SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21) , July 19 - 21, 2021 , Virtual Conference (2021)

  • On the Complexity of Weight-Dynamic Network Algorithms
    Henzinger, Monika and Paz, Ami and Schmid, Stefan In: 20th Annual IFIP Networking Conference , 21-24 June 2021 , Online (2021)

  • Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest
    Henzinger, Monika and Peng, Pan ISSN 0890-5401 (2021)

  • Upper and Lower Bounds for Fully Retroactive Graph Problems
    Henzinger, Monika and Wu, Xiaowei In: 17th Algorithms and Data Structures Symposium (WADS 2021) , August 9-11, 2021 , Virtual conference (2021)

    • K

  • Sinkless orientation is hard also in the supported LOCAL model
    Korhonen, Janne H. and Paz, Ami and Rybicki, Joel and Schmid, Stefan and Suomela, Jukka In: International Symposium on Distributed Computing (DISC) , October 2021 , Freiburg, Germany (2021)

    • O

  • Engineering Data Reduction for Nested Dissection
    Ost, Wolfgang and Schulz, Christian and Strash, Darren In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX21) , 10.-11.1.2021 , Virtual Online (Virginia, US) (2021)

    • S

  • On the Complexity of Load Balancing in Dynamic Networks
    Seth, Gilbert and Meir, Uri and Paz, Ami and Schwartzman, Gregory In: 33th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2021) , 6-8 July 2021 , Online (2021)

    • This list was generated on Mon Dec 30 18:08:44 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.