Search results for: Robert Elsässer
Distributed Computing > 2018 > 31 > 6 > 503-513
Lecture Notes in Computer Science > Automata, Languages and Programming > Session A4: Games, Approximation Schemes, Smoothed Analysis > 171-182
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2004 > Scheduling > 586-598
Lecture Notes in Computer Science > Algorithms – ESA 2010 > Session 2b > 134-145
Lecture Notes in Computer Science > Automata, Languages and Programming > Contributed Papers > 415-426
Lecture Notes in Computer Science > Graph-Theoretic Concepts in Computer Science > Regular Papers > 307-318
Lecture Notes in Computer Science > Algorithms – ESA 2004 > Engineering and Applications Track > 640-651
Lecture Notes in Computer Science > Distributed Computing > Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement > 370-384
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2006 > Contributed Papers > 351-362
Lecture Notes in Computer Science > STACS 2007 > Session 3A > 163-174
Lecture Notes in Computer Science > Automata, Languages and Programming > Session 1-Track C. Communication in Networks > 127-138
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2011 > Contributed Papers > 72-83
Lecture Notes in Computer Science > Graph Theoretic Concepts in Computer Science > Regular Talks > 279-291
Lecture Notes in Computer Science > Algorithms and Computation > Session 4B: Games and Networks > 349-358