暂无分享,去创建一个
Stefan Schmid | Monika Henzinger | Harald Räcke | Stefan Neumann | Harald Räcke | M. Henzinger | S. Schmid | S. Neumann
[1] Martin Skutella,et al. Online Scheduling with Bounded Migration , 2004, ICALP.
[2] Stefan Schmid,et al. Efficient Distributed Workload (Re-)Embedding , 2019, SIGMETRICS.
[3] Robert Krauthgamer,et al. A polylogarithmic approximation of the minimum bisection , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[4] Stefan Schmid,et al. Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning , 2020, PODC.
[5] Emmanuel Abbe,et al. Community detection and stochastic block models: recent developments , 2017, Found. Trends Commun. Inf. Theory.
[6] Félix Cuadrado,et al. Adaptive Partitioning for Large-Scale Dynamic Graphs , 2013, 2014 IEEE 34th International Conference on Distributed Computing Systems.
[7] Stefan Schmid,et al. Dynamic Balanced Graph Partitioning , 2015, SIAM J. Discret. Math..
[8] Amit Kumar,et al. Fully-Dynamic Bin Packing with Little Repacking , 2018, ICALP.
[9] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[10] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[11] David A. Maltz,et al. Network traffic characteristics of data centers in the wild , 2010, IMC '10.
[12] Konstantin Andreev,et al. Balanced Graph Partitioning , 2004, SPAA '04.
[13] Stefan Schmid,et al. Competitive Clustering of Stochastic Communication Patterns on a Ring , 2017, NETYS.
[14] Leah Epstein,et al. Online File Caching with Rejection Penalties , 2015, Algorithmica.
[15] Isabelle Stanton,et al. Streaming Balanced Graph Partitioning Algorithms for Random Graphs , 2012, SODA.
[16] Artur Czumaj,et al. An O(log k)-Competitive Algorithm for Generalized Caching , 2012, SODA.
[17] PopaLucian,et al. What we talk about when we talk about cloud network performance , 2012 .
[18] H. P. Williams. THEORY OF LINEAR AND INTEGER PROGRAMMING (Wiley-Interscience Series in Discrete Mathematics and Optimization) , 1989 .
[19] Neal E. Young,et al. On-line caching as cache size varies , 1991, SODA '91.
[20] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[21] Dan Alistarh,et al. Streaming Min-max Hypergraph Partitioning , 2015, NIPS.
[22] Lucian Popa,et al. What we talk about when we talk about cloud network performance , 2012, CCRV.
[23] Allan Borodin,et al. An optimal on-line algorithm for metrical task system , 1992, JACM.
[24] Stefan Schmid,et al. Online Balanced Repartitioning of Dynamic Communication Patterns in Polynomial Time , 2021, APOCS.
[25] Adam Tauman Kalai,et al. Finely-competitive paging , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[26] David B. Shmoys,et al. Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[27] Stefan Schmid,et al. Online Balanced Repartitioning , 2015, DISC.
[28] Emmanuel Abbe,et al. Community Detection and Stochastic Block Models , 2017, Found. Trends Commun. Inf. Theory.
[29] Yuval Rabani,et al. Competitive k-server algorithms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[30] Manor Mendel,et al. Online Companion Caching , 2002, ESA.