23 citations
- Paderborn UniversityDE19 papers
- Association for Computational LinguisticsUS1 paper
- Friedrich Schiller University JenaDE1 paper
- Google (United States)US1 paper
- Heinrich Heine University DüsseldorfDE1 paper
- Institute of Informatics of the Slovak Academy of SciencesSK1 paper
- Maastricht UniversityNL1 paper
- Max Planck Institute for InformaticsDE1 paper
- Quantitative BioSciencesUS1 paper
- Technische Universität BerlinDE1 paper
- Technische Universität BraunschweigDE1 paper
Showing 2013Show all
2 papers · 1 filter
cs.CC2013
Hierarchies
Friedhelm Meyer auf der Heide, Kamil Swierkot
We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (No…
cs.NI2013★ 2 cited
Routing Games with Progressive Filling
Tobias Harks, Martin Hoefer, Kevin Schewior +1
Max-min fairness (MMF) is a widely known approach to a fair allocation of bandwidth to each of the users in a network. This allocation can be computed by uniformly raising the band…