MPI-INF Logo
  • Home
  • MPI-INF D1 Publications, generated: 14:13, 2 December 2023

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 10 documents:

  1. Balls into bins via local search: cover time and maximum load
    Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, and He Sun
    In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), Lyon, France, 2014
  2. Balls into Bins via Local Search
    Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, and He Sun
    In: 24th ACM-SIAM Symposium on Discrete Algorithms (SODA-13), New Orleans, USA, 2013, 16-34
  3. Multi-Attribute Profit-Maximizing Pricing
    Khaled Elbassioni, Parinya Chalermsook, Danupon Nanongkai, and He Sun

  4. Counting Arbitrary Subgraphs in Data Streams
    Daniel Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 598-609
  5. Low Randomness Rumor Spreading via Hashing
    George Giakkoupis, Thomas Sauerwald, He Sun, and Philipp Woelfel
    In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 314-325
  6. Tight Bounds For Randomized Load Balancing on Arbitrary Network Topologies
    Thomas Sauerwald and He Sun
    In: IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS-12), New Brunswick, USA, 2012, 341-350
  7. Deterministic Polynomial-Time Algorithms for Designing Short DNA Words
    Ming-Yang Kao, Henry C. M. Leung, He Sun, and Yong Zhang
    In: Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, Prague, Czech Republic, 2010, 308-319
  8. Approximate Counting of Cycles in Streams
    Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, and He Sun
    In: 19th Annual European Symposium on Algorithms (ESA-11), Saarbrücken, Germany, 2011, 677-688
  9. Greedy Construction of 2-Approximate Minimum Manhattan Networks
    Zeyu Guo, He Sun, and Hong Zhu
    International Journal of Computational Geometry and Applications 21 (3): 331-350, 2011
  10. Minimum Manhattan Network is NP-Complete
    Francis Y. L. Chin, Zeyu Guo, and He Sun
    Discrete & Computational Geometry 45 (4): 701-722, 2011