Forschungsgruppe Theory and Applications of Algorithms (2024)

Table of Contents
Suchergebnisse Adaptive Precision Training (AdaPT): A dynamic quantized training approach for DNNs Almost Tight Error Bounds on Differentially Private Continual Counting Approximate Distance Sensitivity Oracles in Subquadratic Space Assisted Normative Reasoning with Aristotelian Diagrams Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks Bootstrapping Dynamic Distance Oracles Compact Distance Oracles with Large Sensitivity and Low Stretch Crossover for Cardinality Constrained Optimization Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters Efficient Data Structures for Incremental Exact and Approximate Maximum Flow Fair Correlation Clustering in Forests Fast (1+$eps)-Approximation Algorithms for Binary Matrix Factorization Fault-Tolerant ST-Diameter Oracles Fully Dynamic Exact Edge Connectivity in Sublinear Time Lipidomics and Comparative Metabolite Excretion Analysis of Methanogenic Archaea Reveal Organism-Specific Adaptations to Varying Temperatures and Substrate Concentrations Online Min-Max Paging On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries P4RROT: Generating P4 Code for the Application Layer Removing Redundancy in Graph Neural Networks SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree Simple, Scalable and Effective Clustering via One-Dimensional Projections SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures TCP's Third Eye: Leveraging eBPF for Telemetry-Powered Congestion Control Toward Highly Reliable Programmable Data Planes: Verification of P4 Code Generation Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices Approximately Counting Subgraphs in Data Streams Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies Constant-Time Dynamic (∆ + 1)-Coloring Deterministic Self-Adjusting Tree Networks Using Rotor Walks Fair k-Center Clustering in MapReduce and Streaming Settings Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs Fully Dynamic Four-Vertex Subgraph Counting Improved Coresets for Euclidean k-Means Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model Leximax Approximations and Representative Cohort Selection MPLS-Kit: An MPLS Data Plane Toolkit NetStack: A Game Approach to Synthesizing Consistent Network Updates O'Reach: Even Faster Reachability in Large Graphs Practical Fully Dynamic Minimum Cut Algorithms Quantitative Analysis of Core Lipid Production in Methanothermobacter marburgensis at Different Scales Recent Advances in Fully Dynamic Graph Algorithms: A Quick Reference Guide Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk) Resiliency in numerical algorithm design for extreme scale simulations R-MPLS: Recursive Protection for Highly Dependable MPLS Networks Short Paper: A Centrality Analysis of the Lightning Network
  • 251 Beitrag in Konferenzband
  • 107 Artikel
  • 13 Beitrag in Buch/Sammelband
  • 7 Paper
  • Mehr
    • 3 Sonstiger Beitrag zu Buch
    • 2 Eintrag in Nachschlagewerk
    • 2 Meeting Abstract/Conference Paper
    • 1 Buch
    • 1 Konferenz-/Tagungsband
    • 1 Sonstiger Konferenzbeitrag
    • 1 Short Communication
    • 1 Review
    • 1 Webpublikation
  • 1 – 50 von 391 Ergebnissen
    • Erscheinungsjahr, Titel(aufsteigend)
    • Titel
    • Typ

Suchergebnisse

  • 2023

    Adaptive Precision Training (AdaPT): A dynamic quantized training approach for DNNs

    Kummer, L., Sidak, K., Reichmann, T. & Gansterer, W., 2023, S. 559. 567 S.

    Veröffentlichungen: Beitrag zu KonferenzPaperPeer Reviewed

    Open Access

  • Almost Tight Error Bounds on Differentially Private Continual Counting

    Henzinger, M., Upadhyay, J. & Upadhyay, S., 1 Jan. 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). S. 5003-5039

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Approximate Distance Sensitivity Oracles in Subquadratic Space

    Bilò, D., Chechik, S., Choudhary, K., Cohen, S., Friedrich, T., Krogmann, S. & Schirneck, M., 2 Juni 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (Hrsg.). New York: Association for Computing Machinery (ACM), S. 1396-1409 14 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

    Open Access

  • Assisted Normative Reasoning with Aristotelian Diagrams

    Hanauer, K., Novotná, T. & Pascucci, M., 7 Dez. 2023, Legal Knowledge and Information Systems - JURIX 2023: 36th Annual Conference, Maastricht, the Netherlands, 18–20 December 2023. Sileno, G., Spanakis, J. & van Dijck, G. (Hrsg.). S. 89-94 6 S. (Frontiers in Artificial Intelligence and Applications, Band 379).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

    Open Access

  • Asymptotically tight bounds on the time complexity of broadcast and its variants in dynamic networks

    El-Hayek, A., Henzinger, M. & Schmid, S., 2023.

    Veröffentlichungen: Beitrag zu KonferenzPaperPeer Reviewed

    Open Access

  • Bootstrapping Dynamic Distance Oracles

    Forster, S., Goranci, G., Nazari, Y. & Skarlatos, A., 1 Sep. 2023, 31st Annual European Symposium on Algorithms, ESA 2023. Li Gortz, I., Farach-Colton, M., Puglisi, S. J. & Herman, G. (Hrsg.). 50

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

    Open Access

  • Compact Distance Oracles with Large Sensitivity and Low Stretch

    Bilò, D., Choudhary, K., Cohen, S., Friedrich, T., Krogmann, S. & Schirneck, M., 1 Juli 2023, Algorithms and Data Structures - 18th International Symposium, WADS 2023, Proceedings: 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings. Morin, P. & Suri, S. (Hrsg.). S. 149-163 15 S. (Lecture Notes in Computer Science).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

    Open Access

  • Crossover for Cardinality Constrained Optimization

    Friedrich, T., Kötzing, T., Radhakrishnan, A., Schiller, L., Schirneck, M., Tennigkeit, G. & Wietheger, S., 28 Juni 2023, in: ACM Transactions on Evolutionary Learning and Optimization. 3, 2, S. 1-32 5.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • Duo: A High-Throughput Reconfigurable Datacenter Network Using Local Routing and Control

    Zerwas, J., Györgyi, C., Blenk, A., Schmid, S. & Avin, C., 28 Feb. 2023, in: Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS). 7, 1, S. 1-25 20.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters

    Hanauer, K., Henzinger, M., Ost, L. & Schmid, S., 1 Juni 2023, IEEE International Conference on Computer Communications (INFOCOM 2023).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Efficient Data Structures for Incremental Exact and Approximate Maximum Flow

    Goranci, G. & Henzinger, M., 1 Juli 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (Hrsg.). 69

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Fair Correlation Clustering in Forests

    Casel, K., Friedrich, T., Schirneck, M. & Wietheger, S., 1 Juni 2023, 4th Symposium on Foundations of Responsible Computing (FORC 2023). Talwar, K. (Hrsg.). Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 9. (Leibniz International Proceedings in Informatics (LIPIcs), Band 256).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Fast (1+$eps)-Approximation Algorithms for Binary Matrix Factorization

    Velingker, A., Vötsch, M., Woodruff, D. & Zhou, S., 1 Juli 2023, The 40th International Conference on Machine Learning (ICML 2023). 36 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Fault-Tolerant ST-Diameter Oracles

    Bilò, D., Choudhary, K., Cohen, S., Friedrich, T., Krogmann, S. & Schirneck, M., 1 Juli 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (Hrsg.). Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

    Open Access

  • Fully Dynamic Exact Edge Connectivity in Sublinear Time

    Goranci, G., Henzinger, M., Nanongkai, D., Saranurak, T., Thorup, M. & Wulff-Nilsen, C., 1 Jan. 2023, ACM-SIAM Symposium on Discrete Algorithms (SODA23).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Lipidomics and Comparative Metabolite Excretion Analysis of Methanogenic Archaea Reveal Organism-Specific Adaptations to Varying Temperatures and Substrate Concentrations

    Taubner, R-S., Baumann, L. M. F., Steiner, M., Pfeifer, K., Reischl, B., Korynt, K., Bauersachs, T., Mähnert, B., Clifford, E. L., Peckmann, J., Schuster, B., Birgel, D. & Rittmann, S. K-M. R., Apr. 2023, in: mSystems. 8, 2, e0115922.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

    Open Access

  • Online Min-Max Paging

    Chiplunkar, A., Henzinger, M., Kale, S. S. & Vötsch, M., 1 Jan. 2023, ACM-SIAM Symposium on Discrete Algorithms (SODA23).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance

    Gudmundsson, J., Pfeifer, J. & Seybold, M., 2 Mai 2023, in: ACM Transactions on Spatial Algorithms and Systems. 9, 2, S. 1-24 24 S., 14.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries

    Bateni, M., Esfandiari, H., Fichtenberger, H., Henzinger, M., Jayaram, R., Mirrokni, V. & Wiese, A., 1 Jan. 2023, ACM-SIAM Symposium on Discrete Algorithms (SODA23).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • P4RROT: Generating P4 Code for the Application Layer

    Györgyi, C., Laki, S. & Schmid, S., 1 Apr. 2023, in: Computer Communications Review. 53

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • Removing Redundancy in Graph Neural Networks

    Bause, F., Moustafa, S., Gansterer, W. & Kriege, N. M., 2023, (Unveröffentlicht).

    Veröffentlichungen: Beitrag zu KonferenzPaperPeer Reviewed

  • SeedTree: A Dynamically Optimal and Local Self-Adjusting Tree

    Pourdamghani, A., Avin, C., Sama, R. & Schmid, S., 1 Mai 2023, INFOCOM 2023 - IEEE Conference on Computer Communications.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Simple, Scalable and Effective Clustering via One-Dimensional Projections

    Charikar, M., Henzinger, M., Hu, L., Vötsch, M. & Waingarten, E., 1 Dez. 2023, Thirty-seventh Conference on Neural Information Processing Systems (NeurIPS 2023). 41 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures

    Dai, W. & Schmid, S., 17 Juni 2023, in: Annual ACM Symposium on Parallelism in Algorithms and Architectures.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • SPAA 2023 - Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures

    Dai, W. & Schmid, S., 17 Juni 2023, in: Annual ACM Symposium on Parallelism in Algorithms and Architectures.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • TCP's Third Eye: Leveraging eBPF for Telemetry-Powered Congestion Control

    Hinz, J-T., Addanki, V., Györgyi, C., Jepsen, T. & Schmid, S., 10 Sep. 2023, eBPF 2023 : Proceedings of the ACM SIGCOMM 2023 Workshop on eBPF and Kernel Extensions. New York: Association for Computing Machinery (ACM), S. 1-7 7 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Toward Highly Reliable Programmable Data Planes: Verification of P4 Code Generation

    Györgyi, C., Laki, S. & Schmid, S., 1 Juni 2023, 2023 IEEE 9th International Conference on Network Softwarization: Boosting Future Networks through Advanced Softwarization, NetSoft 2023 - Proceedings. Bernardos, C. J., Martini, B., Rojas, E., Verdi, F. L., Zhu, Z., Oki, E. & Parzyjegla, H. (Hrsg.). S. 247-251 5 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • 2022

    Accuracy vs. Cost in Parallel Fixed-Precision Low-Rank Approximations of Sparse Matrices

    Ernstbrunner, R., Mayer, V. & Gansterer, W., 1 Mai 2022, Proceedings - 2022 IEEE 36th International Parallel and Distributed Processing Symposium, IPDPS 2022. S. 459-469 11 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Approximately Counting Subgraphs in Data Streams

    Fichtenberger, H. & Peng, P., 1 Juni 2022, PODS 2022 - Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. S. 413-425 13 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

    Open Access

  • Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear

    El-Hayek, A., Henzinger, M. & Schmid, S., 20 Juli 2022, PODC 2022 - Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, Inc, S. 54-56 3 S. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Brief Announcement: Minimizing Congestion in Hybrid Demand-Aware Network Topologies

    Dai, W., Dinitz, M., Foerster, K-T. & Schmid, S., 2022, 36th International Symposium on Distributed Computing (DISC 2022). Scheideler, C. (Hrsg.). Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, S. 42:1-42:3 (Leibniz International Proceedings in Informatics (LIPIcs), Band 246).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Constant-Time Dynamic (∆ + 1)-Coloring

    Henzinger, M. & Peng, P., 2022, 37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020): STACS 2020, March 10–13, 2020, Montpellier, France. Paul, C. & Blaser, M. (Hrsg.). Wadern: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Band 154. S. 53.1-53.18 18 S. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Deterministic Self-Adjusting Tree Networks Using Rotor Walks

    Avin, C., Bienkowski, M., Salem, I., Sama, R., Schmid, S. & Schmidt, P., 2022, Proceedings - 2022 IEEE 42nd International Conference on Distributed Computing Systems, ICDCS 2022. Piscataway, NJ: IEEE, S. 67-77 11 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Fair k-Center Clustering in MapReduce and Streaming Settings

    Bera, S., Das, S., Galhotra, S. & Kale, S., Apr. 2022, WWW 2022 - Proceedings of the ACM Web Conference 2022. Laforest, F., Troncy, R. & Simperl, E. (Hrsg.). New York, NY: Association for Computing Machinery (ACM), S. 1414-1422 9 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies

    Hanauer, K., Henzinger, M., Schmid, S. & Trummer, J., 2022, IEEE Conference on Computer Communications (INFOCOM), Virtual Conference, May 2022.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs

    Henzinger, M., Paz, A. & Arunapuram Rangaramanujam, S., 1 Sep. 2022, 30th Annual European Symposium on Algorithms, ESA 2022. Chechik, S., Navarro, G., Rotenberg, E. & Herman, G. (Hrsg.).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Fully Dynamic Four-Vertex Subgraph Counting

    Hanauer, K., Henzinger, M. & Hua, Q. C., 2022, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Aspnes, J. & Michail, O. (Hrsg.). 18

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Improved Coresets for Euclidean k-Means

    Cohen-Addad, V., Larsen, K. G., Saulpic, D., Schwiegelshohn, C. & Sheikh-Omar, O. A., 1 Nov. 2022, Thirty-sixth Conference on Neural Information Processing Systems (NeurIPS 2022).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model

    Feder, E., Rathod, I., Shyamsukha, P., Sama, R., Aksenov, V., Salem, I. & Schmid, S., 1 Mai 2022, INFOCOM 2022 - IEEE Conference on Computer Communications. Piscataway, NJ: IEEE, S. 1089-1098 10 S.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Leximax Approximations and Representative Cohort Selection

    Henzinger, M., Peale, C., Reingold, O. & Shen, J. H., 1 Juli 2022, 3rd Symposium on Foundations of Responsible Computing, FORC 2022. Celis, L. E. (Hrsg.). 2

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • MPLS-Kit: An MPLS Data Plane Toolkit

    Vanerio, J., Schmid, S., Schou, M. K. & Srba, J., 2022, IEEE Global Internet (GI) Symposium 2022.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • NetStack: A Game Approach to Synthesizing Consistent Network Updates

    Schmid, S., Schrenk, B. C. & Torralba, A., Juni 2022, 2022 IFIP Networking Conference (IFIP Networking).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • O'Reach: Even Faster Reachability in Large Graphs

    Hanauer, K., Schulz, C. & Trummer, J., 21 Okt. 2022, in: Journal of Experimental Algorithmics. 27, 5, S. 1-27 28 S., 4.2.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

    Open Access

  • Practical Fully Dynamic Minimum Cut Algorithms

    Henzinger, M., Noe, A. & Schulz, C., 1 Jan. 2022, SIAM Symposium on Algorithm Engineering and Experiments (ALENEX22).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Quantitative Analysis of Core Lipid Production in Methanothermobacter marburgensis at Different Scales

    Baumann, L. M. F., Taubner, R-S., Oláh, K., Rohrweber, A-C., Schuster, B., Birgel, D. & Rittmann, S. K-M. R., 10 Apr. 2022, in: Bioengineering : open access journal. 9, 4, 16 S., 169.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

    Open Access

  • Recent Advances in Fully Dynamic Graph Algorithms: A Quick Reference Guide

    Hanauer, K., Henzinger, M. & Schulz, C., 13 Dez. 2022, in: Journal of Experimental Algorithmics. 27, 11, S. 1-45 46 S., 1.11.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)

    Hanauer, K., Henzinger, M. & Schulz, C., 1 Apr. 2022, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Aspnes, J. & Michail, O. (Hrsg.). 1

    Veröffentlichungen: Beitrag in BuchBeitrag in Konferenzband

  • Resiliency in numerical algorithm design for extreme scale simulations

    Agullo, E., Altenbernd, M., Anzt, H., Bautista-Gomez, L., Benacchio, T., Bonaventura, L., Bungartz, H-J., Chatterjee, S., Ciorba, F. M., DeBardeleben, N., Drzisga, D., Eibl, S., Engelmann, C., Gansterer, W. N., Giraud, L., Göddeke, D., Heisig, M., Jézéquel, F., Kohl, N., Li, X. S., Lion, R., Mehl, M., Mycek, P., Obersteiner, M., Quintana-Ortí, E. S., Rizzi, F., Rüde, U., Schulz, M., Fung, F., Speck, R., Stals, L., Teranishi, K., Thibault, S., Thönnes, D., Wagner, A. & Wohlmuth, B., März 2022, in: International Journal of High Performance Computing Applications (S A H P C). 36, 2, S. 251-285 35 S.

    Veröffentlichungen: Beitrag in FachzeitschriftArtikelPeer Reviewed

  • R-MPLS: Recursive Protection for Highly Dependable MPLS Networks

    Schmid, S., Schou, M. K., Srba, J. & Vanerio, J., 2022, 18th ACM International Conference on Emerging Networking Experiments and Technologies (CoNEXT).

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

  • Short Paper: A Centrality Analysis of the Lightning Network

    Zabka, P., Foerster, K-T., Decker, C. & Schmid, S., 1 Feb. 2022, Financial Cryptography and Data Security 2022.

    Veröffentlichungen: Beitrag in BuchBeitrag in KonferenzbandPeer Reviewed

Forschungsgruppe Theory and Applications of Algorithms (2024)
Top Articles
Latest Posts
Article information

Author: Velia Krajcik

Last Updated:

Views: 6163

Rating: 4.3 / 5 (74 voted)

Reviews: 81% of readers found this page helpful

Author information

Name: Velia Krajcik

Birthday: 1996-07-27

Address: 520 Balistreri Mount, South Armand, OR 60528

Phone: +466880739437

Job: Future Retail Associate

Hobby: Polo, Scouting, Worldbuilding, Cosplaying, Photography, Rowing, Nordic skating

Introduction: My name is Velia Krajcik, I am a handsome, clean, lucky, gleaming, magnificent, proud, glorious person who loves writing and wants to share my knowledge and understanding with you.