Search results for: Philipp Woelfel
Distributed Computing > 2019 > 32 > 6 > 565-586
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 > 413-427
Lecture Notes in Computer Science > Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques > Contributed Talks of RANDOM > 508-519
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 1999 > Algorithms and Complexity > 262-272
Lecture Notes in Computer Science > Algorithms and Computation > Algorithmic Problems in Wireless Ad Hoc Networks > 1132-1142
Lecture Notes in Computer Science > STACS 2001 > Contributions > 563-574
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2002 > Contributed Talks > 131-142
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2003 > Contributed Papers > 671-680
Lecture Notes in Computer Science > Computing and Combinatorics > Data Structures and Algorithms I > 23-32
Algorithmica > 2014 > 70 > 3 > 428-456
Distributed Computing > 2012 > 25 > 2 > 109-162
Distributed Computing > 2011 > 24 > 2 > 119-134
Distributed Computing > 2011 > 24 > 1 > 3-19
Algorithmica > 2011 > 59 > 3 > 301-322
Discrete Applied Mathematics > 2009 > 157 > 2 > 247-261