| 2026 | PODC | Simple and Efficient Randomized Wait-Free Locks. | Kahbod Aeini, Dante Bencivenga, George Giakkoupis, Philipp Woelfel |
| 2024 | PODC | Faster Randomized Repeated Choice and DCAS. | Dante Bencivenga, George Giakkoupis, Philipp Woelfel |
| 2024 | PODC | Strongly Linearizable LL/SC from CAS. | Fatemeh Naderi-Semiromi, Philipp Woelfel |
| 2023 | PODC | Efficient Bounded Timestamping from Standard Synchronization Primitives. | Benyamin Bashari, Ali Jamadi, Philipp Woelfel |
| 2023 | PODC | Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. | David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel |
| 2022 | PODC | 2022 Edsger W. Dijkstra Prize in Distributed Computing. | Marcos Aguiliera, Andra W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, Philipp Woelfel |
| 2021 | OPODIS | Strongly Linearizable Linked List and Queue. | Steven Munsu Hwang, Philipp Woelfel |
| 2021 | PODC | An Efficient Adaptive Partial Snapshot Implementation. | Benyamin Bashari, Philipp Woelfel |
| 2021 | PODC | Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. | David Yu Cheng Chan, Philipp Woelfel |
| 2021 | STOC | Efficient randomized DCAS. | George Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel |
| 2020 | PODC | Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. | David Yu Cheng Chan, Philipp Woelfel |
| 2019 | PODC | Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. | Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel |
| 2019 | PODC | Strongly Linearizable Implementations of Snapshots and Other Types. | Sean Ovens, Philipp Woelfel |
| 2019 | PODC | Towards a Theory of Randomized Shared Memory Algorithms. | Philipp Woelfel |
| 2019 | STACS | Space Lower Bounds for the Signal Detection Problem. | Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu |
| 2018 | STACS | An Improved Bound for Random Binary Search Trees with Concurrent Insertions. | George Giakkoupis, Philipp Woelfel |
| 2017 | PODC | Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. | George Giakkoupis, Philipp Woelfel |
| 2016 | PODC | Are Shared Objects Composable under an Oblivious Adversary? | Oksana Denysyuk, Philipp Woelfel |
| 2016 | PODC | How Asynchrony Affects Rumor Spreading Time. | George Giakkoupis, Yasamin Nazari, Philipp Woelfel |
| 2015 | PODC | On the Time and Space Complexity of ABA Prevention and Detection. | Zahra Aghazadeh, Philipp Woelfel |
| 2015 | PODC | Trading Fences with RMRs and Separating Memory Models. | Hagit Attiya, Danny Hendler, Philipp Woelfel |
| 2015 | STOC | Test-and-Set in Optimal Space. | George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel |
| 2014 | FOCS | Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. | George Giakkoupis, Philipp Woelfel |
| 2014 | MASCOTS | Turbocharged Speed Scaling: Analysis and Evaluation. | B. Maryam Elahi, Carey L. Williamson, Philipp Woelfel |
| 2014 | OPODIS | Space- and Time-Efficient Long-Lived Test-And-Set Objects. | Zahra Aghazadeh, Philipp Woelfel |
| 2014 | PODC | Making objects writable. | Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel |
| 2014 | SODA | Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. | Martin Dietzfelbinger, Philipp Woelfel |
| 2013 | PODC | Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms. | Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel |
| 2013 | PODC | Randomized loose renaming in | Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel |
| 2012 | ESA | Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. | Martin Aumller, Martin Dietzfelbinger, Philipp Woelfel |
| 2012 | LATIN | Independence of Tabulation-Based Hash Classes. | Toryn Qwyllyn Klassen, Philipp Woelfel |
| 2012 | PODC | On the time and space complexity of randomized test-and-set. | George Giakkoupis, Philipp Woelfel |
| 2012 | PODC | Brief announcement: a tight RMR lower bound for randomized mutual exclusion. | George Giakkoupis, Philipp Woelfel |
| 2012 | PODC | Strongly linearizable implementations: possibilities and impossibilities. | Maryam Helmi, Lisa Higham, Philipp Woelfel |
| 2012 | STOC | A tight RMR lower bound for randomized mutual exclusion. | George Giakkoupis, Philipp Woelfel |
| 2012 | STACS | Low Randomness Rumor Spreading via Hashing. | George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel |
| 2011 | PODC | The space complexity of long-lived and one-shot timestamp implementations. | Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel |
| 2011 | SODA | On the Randomness Requirements of Rumor Spreading. | George Giakkoupis, Philipp Woelfel |
| 2011 | STOC | Linearizable implementations do not suffice for randomized distributed computation. | Wojciech M. Golab, Lisa Higham, Philipp Woelfel |
| 2010 | PODC | Adaptive randomized mutual exclusion in sub-logarithmic expected time. | Danny Hendler, Philipp Woelfel |
| 2009 | PODC | Brief announcement: tight lower bounds for greedy routing in uniform small world rings. | Martin Dietzfelbinger, Philipp Woelfel |
| 2009 | PODC | Randomized mutual exclusion in O(log N / log log N) RMRs. | Danny Hendler, Philipp Woelfel |
| 2009 | STOC | Tight lower bounds for greedy routing in uniform small world rings. | Martin Dietzfelbinger, Philipp Woelfel |
| 2008 | GECCO | Precision, local search and unimodal functions. | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
| 2008 | PODC | Tight RMR lower bounds for mutual exclusion and other problems. | Hagit Attiya, Danny Hendler, Philipp Woelfel |
| 2008 | STOC | Tight rmr lower bounds for mutual exclusion and other problems. | Hagit Attiya, Danny Hendler, Philipp Woelfel |
| 2008 | STACS | Tight Bounds for Blind Search on the Integers. | Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel |
| 2007 | ICALP | Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. | Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel |
| 2007 | PODC | Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. | Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel |
| 2006 | PODC | An | Wojciech M. Golab, Danny Hendler, Philipp Woelfel |
| 2006 | SODA | Asymmetric balanced allocation with simple hash functions. | Philipp Woelfel |
| 2005 | ISAAC | Representation of Graphs by OBDDs. | Robin Nunkesser, Philipp Woelfel |
| 2004 | COCOON | A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs. | Philipp Woelfel |
| 2003 | MFCS | Symbolic Topological Sorting with OBDDS. | Philipp Woelfel |
| 2003 | STOC | Almost random graphs with simple hash functions. | Martin Dietzfelbinger, Philipp Woelfel |
| 2003 | STOC | Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. | Martin Sauerhoff, Philipp Woelfel |
| 2002 | MFCS | A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. | Beate Bollig, Philipp Woelfel |
| 2002 | STACS | A Lower Bound Technique for Restricted Branching Programs and Applications. | Philipp Woelfel |
| 2001 | STOC | A read-once branching program lower bound of Omega(2 | Beate Bollig, Philipp Woelfel |
| 2001 | STACS | New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. | Philipp Woelfel |
| 1999 | MFCS | Efficient Strongly Universal and Optimally Universal Hashing. | Philipp Woelfel |