Efficient Strongly Universal and Optimally Universal Hashing. - Philipp Woelfel (MFCS, 1999)

New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing - Philipp Woelfel (Electron. Colloquium Comput. Complex., 2000)

A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. - Beate Bollig; Philipp Woelfel (STOC, 2001)

A Lower Bound Technique for Restricted Branching Programs and Applications - Philipp Woelfel (Electron. Colloquium Comput. Complex., 2001)

On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism. - Philipp Woelfel (CCC, 2002)

Multiplikation in eingeschränkten Branchingprogrammmodellen. - Philipp Wölfel (Ausgezeichnete Informatikdissertationen, 2003)

Almost random graphs with simple hash functions. - Martin Dietzfelbinger; Philipp Woelfel (STOC, 2003)

Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. - Martin Sauerhoff; Philipp Woelfel (STOC, 2003)

Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen. - Philipp Wölfel (2003)

Bounds on the OBDD-size of integer multiplication via universal hashing. - Philipp Woelfel (J. Comput. Syst. Sci., 2005)

A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. - Beate Bollig; Philipp Woelfel (Theory Comput. Syst., 2005)

Maintaining External Memory Efficient Hash Tables. - Philipp Woelfel (APPROX-RANDOM, 2006)

An O(1) RMRs leader election algorithm. - Wojciech M. Golab; Danny Hendler; Philipp Woelfel (PODC, 2006)

Asymmetric balanced allocation with simple hash functions. - Philipp Woelfel (SODA, 2006)

Symbolic topological sorting with OBDDs. - Philipp Woelfel (J. Discrete Algorithms, 2006)

Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. - Beate Bollig; Stephan Waack; Philipp Woelfel (Theor. Comput. Sci., 2006)

A construction method for optimally universal hash families and its consequences for the existence of RBIBDs. - Philipp Woelfel (Theor. Comput. Sci., 2006)

Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. - Paul Beame; Matei David; Toniann Pitassi; Philipp Woelfel (ICALP, 2007)

Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. - Wojciech M. Golab; Vassos Hadzilacos; Danny Hendler; Philipp Woelfel (PODC, 2007)

New Results on the Complexity of the Middle Bit of Multiplication. - Ingo Wegener; Philipp Woelfel (Comput. Complex., 2007)

Tight Bounds for Blind Search on the Integers. - Martin Dietzfelbinger; Jonathan E. Rowe; Ingo Wegener; Philipp Woelfel (STACS, 2008)

Tight rmr lower bounds for mutual exclusion and other problems. - Hagit Attiya; Danny Hendler; Philipp Woelfel (STOC, 2008)

Brief announcement: tight lower bounds for greedy routing in uniform small world rings. - Martin Dietzfelbinger; Philipp Woelfel (PODC, 2009)

Randomized mutual exclusion in O(log N / log log N) RMRs. - Danny Hendler; Philipp Woelfel (PODC, 2009)

Tight lower bounds for greedy routing in uniform small world rings. - Martin Dietzfelbinger; Philipp Woelfel (STOC, 2009)

Representation of graphs by OBDDs. - Robin Nunkesser; Philipp Woelfel (Discret. Appl. Math., 2009)

Adaptive randomized mutual exclusion in sub-logarithmic expected time. - Danny Hendler; Philipp Woelfel (PODC, 2010)

Tight Bounds for Blind Search on the Integers and the Reals. - Martin Dietzfelbinger; Jonathan E. Rowe; Ingo Wegener; Philipp Woelfel (Comb. Probab. Comput., 2010)

An O(1) RMRs Leader Election Algorithm. - Wojciech M. Golab; Danny Hendler; Philipp Woelfel (SIAM J. Comput., 2010)

Separating Deterministic from Randomized Multiparty Communication Complexity. - Paul Beame; Matei David; Toniann Pitassi; Philipp Woelfel (Theory Comput., 2010)

On the Randomness Requirements of Rumor Spreading. - George Giakkoupis; Philipp Woelfel (SODA, 2011)

Linearizable implementations do not suffice for randomized distributed computation. - Wojciech M. Golab; Lisa Higham; Philipp Woelfel (STOC, 2011)

Precision, Local Search and Unimodal Functions. - Martin Dietzfelbinger; Jonathan E. Rowe; Ingo Wegener; Philipp Woelfel (Algorithmica, 2011)

Fully-adaptive algorithms for long-lived renaming. - Alex Brodsky; Faith Ellen; Philipp Woelfel (Distributed Comput., 2011)

Randomized mutual exclusion with sub-logarithmic RMR-complexity. - Danny Hendler; Philipp Woelfel (Distributed Comput., 2011)

Independence of Tabulation-Based Hash Classes. - Toryn Qwyllyn Klassen; Philipp Woelfel (LATIN, 2012)

On the time and space complexity of randomized test-and-set. - George Giakkoupis; Philipp Woelfel (PODC, 2012)

Brief announcement: a tight RMR lower bound for randomized mutual exclusion. - George Giakkoupis; Philipp Woelfel (PODC, 2012)

Strongly linearizable implementations: possibilities and impossibilities. - Maryam Helmi; Lisa Higham; Philipp Woelfel (PODC, 2012)

Low Randomness Rumor Spreading via Hashing. - George Giakkoupis; Thomas Sauerwald; He Sun 001; Philipp Woelfel (STACS, 2012)

A tight RMR lower bound for randomized mutual exclusion. - George Giakkoupis; Philipp Woelfel (STOC, 2012)

Efficient Fetch-and-Increment. - Faith Ellen; Vijaya Ramachandran; Philipp Woelfel (DISC, 2012)

RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract). - Abhijeet Pareek; Philipp Woelfel (DISC, 2012)

RMR-Efficient Randomized Abortable Mutual Exclusion - Abhijeet Pareek; Philipp Woelfel (CoRR, 2012)

RMR-efficient implementations of comparison primitives using read and write operations. - Wojciech M. Golab; Vassos Hadzilacos; Danny Hendler; Philipp Woelfel (Distributed Comput., 2012)

Meeting the fairness deadline in speed scaling systems: is turbocharging enough? - B. Maryam Elahi; Carey Williamson; Philipp Woelfel (SIGMETRICS Perform. Evaluation Rev., 2012)

Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms. - Zahra Aghazadeh; Wojciech M. Golab; Philipp Woelfel (PODC, 2013)

Randomized loose renaming in O(log log n) time. - Dan Alistarh; James Aspnes; George Giakkoupis; Philipp Woelfel (PODC, 2013)

An Optimal Implementation of Fetch-and-Increment. - Faith Ellen; Philipp Woelfel (DISC, 2013)

An O(sqrt n) Space Bound for Obstruction-Free Leader Election. - George Giakkoupis; Maryam Helmi; Lisa Higham; Philipp Woelfel (DISC, 2013)

Gossip Protocols for Renaming and Sorting. - George Giakkoupis; Anne-Marie Kermarrec; Philipp Woelfel (DISC, 2013)

Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. - George Giakkoupis; Philipp Woelfel (FOCS, 2014)

Turbocharged Speed Scaling: Analysis and Evaluation. - B. Maryam Elahi; Carey L. Williamson; Philipp Woelfel (MASCOTS, 2014)

Space- and Time-Efficient Long-Lived Test-And-Set Objects. - Zahra Aghazadeh; Philipp Woelfel (OPODIS, 2014)

Making objects writable. - Zahra Aghazadeh; Wojciech M. Golab; Philipp Woelfel (PODC, 2014)

Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. - Martin Dietzfelbinger; Philipp Woelfel (SODA, 2014)

Space Bounds for Adaptive Renaming. - Maryam Helmi; Lisa Higham; Philipp Woelfel (DISC, 2014)

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. - Martin Aumüller 001; Martin Dietzfelbinger; Philipp Woelfel (Algorithmica, 2014)

The Space Complexity of Long-Lived and One-Shot Timestamp Implementations. - Maryam Helmi; Lisa Higham; Eduardo Pacheco; Philipp Woelfel (J. ACM, 2014)

Decoupled speed scaling: Analysis and evaluation. - B. Maryam Elahi; Carey Williamson; Philipp Woelfel (Perform. Evaluation, 2014)

On the Time and Space Complexity of ABA Prevention and Detection. - Zahra Aghazadeh; Philipp Woelfel (PODC, 2015)

Trading Fences with RMRs and Separating Memory Models. - Hagit Attiya; Danny Hendler; Philipp Woelfel (PODC, 2015)

Test-and-Set in Optimal Space. - George Giakkoupis; Maryam Helmi; Lisa Higham; Philipp Woelfel (STOC, 2015)

Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. - Oksana Denysyuk; Philipp Woelfel (DISC, 2015)

Are Shared Objects Composable under an Oblivious Adversary? - Oksana Denysyuk; Philipp Woelfel (PODC, 2016)

How Asynchrony Affects Rumor Spreading Time. - George Giakkoupis; Yasamin Nazari; Philipp Woelfel (PODC, 2016)

Upper Bounds for Boundless Tagging with Bounded Objects. - Zahra Aghazadeh; Philipp Woelfel (DISC, 2016)

A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs. - Martin Aumüller 001; Martin Dietzfelbinger; Philipp Woelfel (CoRR, 2016)

Deterministic and Fast Randomized Test-and-Set in Optimal Space. - George Giakkoupis; Maryam Helmi; Lisa Higham; Philipp Woelfel (CoRR, 2016)

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. - George Giakkoupis; Philipp Woelfel (PODC, 2017)

An Improved Bound for Random Binary Search Trees with Concurrent Insertions. - George Giakkoupis; Philipp Woelfel (STACS, 2018)

Allocate-On-Use Space Complexity of Shared-Memory Algorithms. - James Aspnes; Bernhard Haeupler; Alexander Tong 001; Philipp Woelfel (DISC, 2018)

An Almost Tight RMR Lower Bound for Abortable Test-And-Set. - Aryaz Eghbali; Philipp Woelfel (DISC, 2018)

Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. - Zahra Aghazadeh; Damien Imbs; Michel Raynal; Gadi Taubenfeld; Philipp Woelfel (PODC, 2019)

Strongly Linearizable Implementations of Snapshots and Other Types. - Sean Ovens; Philipp Woelfel (PODC, 2019)

Towards a Theory of Randomized Shared Memory Algorithms. - Philipp Woelfel (PODC, 2019)

Efficient randomized test-and-set implementations. - George Giakkoupis; Philipp Woelfel (Distributed Comput., 2019)

Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. - David Yu Cheng Chan; Philipp Woelfel (PODC, 2020)

Strongly Linearizable Linked List and Queue. - Steven Munsu Hwang; Philipp Woelfel (OPODIS, 2021)

An Efficient Adaptive Partial Snapshot Implementation. - Benyamin Bashari; Philipp Woelfel (PODC, 2021)

Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. - David Yu Cheng Chan; Philipp Woelfel (PODC, 2021)

Efficient randomized DCAS. - George Giakkoupis; Mehrdad Jafari Giv; Philipp Woelfel (STOC, 2021)

Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion. - David Yu Cheng Chan; Philipp Woelfel (CoRR, 2021)

Space Lower Bounds for the Signal Detection Problem. - Faith Ellen; Rati Gelashvili; Philipp Woelfel; Leqi Zhu (Theory Comput. Syst., 2021)

2022 Edsger W. Dijkstra Prize in Distributed Computing. - Marcos Aguiliera; Andréa W. Richa; Alexander A. Schwarzmann; Alessandro Panconesi; Christian Scheideler; Philipp Woelfel (PODC, 2022)

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. - David Yu Cheng Chan; George Giakkoupis; Philipp Woelfel (PODC, 2023)

Faster Randomized Repeated Choice and DCAS. - Dante Bencivenga; George Giakkoupis; Philipp Woelfel (PODC, 2024)

Strongly Linearizable LL/SC from CAS. - Fatemeh Naderi-Semiromi; Philipp Woelfel (PODC, 2024)

A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory. - Benyamin Bashari; David Yu Cheng Chan; Philipp Woelfel (DISC, 2024)

Efficient bounded timestamping from standard synchronization primitives. - Benyamin Bashari; Ali Jamadi; Philipp Woelfel (Distributed Comput., 2025)