Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Dai W, Foerster K, Fuchssteiner D and Schmid S. (2023). Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing. ACM Transactions on Modeling and Performance Evaluation of Computing Systems. 8:3. (1-30). Online publication date: 30-Sep-2023.

    https://doi.org/10.1145/3597200

  • Cohen G and Cohen I. Spectral Expanding Expanders. Proceedings of the conference on Proceedings of the 38th Computational Complexity Conference. (1-19).

    https://doi.org/10.4230/LIPIcs.CCC.2023.8

  • Schweiger O, Foerster K and Schmid S. Improving the Resilience of Fast Failover Routing. Proceedings of the Symposium on Architectures for Networking and Communications Systems. (1-7).

    https://doi.org/10.1145/3493425.3502747

  • Dinitz M, Schapira M and Shahaf G. (2020). Approximate Moore Graphs are good expanders. Journal of Combinatorial Theory Series B. 141:C. (240-263). Online publication date: 1-Mar-2020.

    https://doi.org/10.1016/j.jctb.2019.08.003

  • Zhao S, Wang R, Zhou J, Ong J, Mogul J and Vahdat A. Minimal rewiring. Proceedings of the 16th USENIX Conference on Networked Systems Design and Implementation. (221-234).

    /doi/10.5555/3323234.3323254

  • Foerster K, Ghobadi M and Schmid S. Characterizing the algorithmic complexity of reconfigurable data center architectures. Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems. (89-96).

    https://doi.org/10.1145/3230718.3230722