Philipp Woelfel

According to our database, Philipp Woelfel authored at least 90 papers between 1999 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory.

Benyamin Bashari, David Yu Cheng Chan, Philipp Woelfel

Proceedings of the 38th International Symposium on Distributed Computing, 2024

Strongly Linearizable LL/SC from CAS.

Fatemeh Naderi-Semiromi, Philipp Woelfel

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

Faster Randomized Repeated Choice and DCAS.

Dante Bencivenga, George Giakkoupis, Philipp Woelfel

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion.

David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

Efficient Bounded Timestamping from Standard Synchronization Primitives.

Benyamin Bashari, Ali Jamadi, Philipp Woelfel

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

2022

2022 Edsger W. Dijkstra Prize in Distributed Computing.

Marcos Aguiliera, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, Philipp Woelfel

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Space Lower Bounds for the Signal Detection Problem.

Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu

Theory Comput. Syst., 2021

Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion.

David Yu Cheng Chan, Philipp Woelfel

CoRR, 2021

Efficient randomized DCAS.

George Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion.

David Yu Cheng Chan, Philipp Woelfel

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

An Efficient Adaptive Partial Snapshot Implementation.

Benyamin Bashari, Philipp Woelfel

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Strongly Linearizable Linked List and Queue.

Steven Munsu Hwang, Philipp Woelfel

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

2020

Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives.

David Yu Cheng Chan, Philipp Woelfel

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

2019

Efficient randomized test-and-set implementations.

George Giakkoupis, Philipp Woelfel

Distributed Comput., 2019

Towards a Theory of Randomized Shared Memory Algorithms.

Philipp Woelfel

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Strongly Linearizable Implementations of Snapshots and Other Types.

Sean Ovens, Philipp Woelfel

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion.

Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018

An Almost Tight RMR Lower Bound for Abortable Test-And-Set.

Aryaz Eghbali, Philipp Woelfel

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Allocate-On-Use Space Complexity of Shared-Memory Algorithms.

James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

An Improved Bound for Random Binary Search Trees with Concurrent Insertions.

George Giakkoupis, Philipp Woelfel

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model.

George Giakkoupis, Philipp Woelfel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

Deterministic and Fast Randomized Test-and-Set in Optimal Space.

George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel

CoRR, 2016

A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs.

Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel

CoRR, 2016

Upper Bounds for Boundless Tagging with Bounded Objects.

Zahra Aghazadeh, Philipp Woelfel

Proceedings of the Distributed Computing - 30th International Symposium, 2016

How Asynchrony Affects Rumor Spreading Time.

George Giakkoupis, Yasamin Nazari, Philipp Woelfel

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Are Shared Objects Composable under an Oblivious Adversary?

Oksana Denysyuk, Philipp Woelfel

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015

Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability.

Oksana Denysyuk, Philipp Woelfel

Proceedings of the Distributed Computing - 29th International Symposium, 2015

Test-and-Set in Optimal Space.

George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Trading Fences with RMRs and Separating Memory Models.

Hagit Attiya, Danny Hendler, Philipp Woelfel

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

On the Time and Space Complexity of ABA Prevention and Detection.

Zahra Aghazadeh, Philipp Woelfel

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

Decoupled speed scaling: Analysis and evaluation.

B. Maryam Elahi, Carey Williamson, Philipp Woelfel

Perform. Evaluation, 2014

The Space Complexity of Long-Lived and One-Shot Timestamp Implementations.

Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel

J. ACM, 2014

Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash.

Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel

Algorithmica, 2014

Space Bounds for Adaptive Renaming.

Maryam Helmi, Lisa Higham, Philipp Woelfel

Proceedings of the Distributed Computing - 28th International Symposium, 2014

Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids.

Martin Dietzfelbinger, Philipp Woelfel

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Making objects writable.

Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Space- and Time-Efficient Long-Lived Test-And-Set Objects.

Zahra Aghazadeh, Philipp Woelfel

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Turbocharged Speed Scaling: Analysis and Evaluation.

B. Maryam Elahi, Carey L. Williamson, Philipp Woelfel

Proceedings of the IEEE 22nd International Symposium on Modelling, 2014

Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM.

George Giakkoupis, Philipp Woelfel

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Gossip Protocols for Renaming and Sorting.

George Giakkoupis, Anne-Marie Kermarrec, Philipp Woelfel

Proceedings of the Distributed Computing - 27th International Symposium, 2013

An O(sqrt n) Space Bound for Obstruction-Free Leader Election.

George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel

Proceedings of the Distributed Computing - 27th International Symposium, 2013

An Optimal Implementation of Fetch-and-Increment.

Faith Ellen, Philipp Woelfel

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Randomized loose renaming in <i>O</i>(log log <i>n</i>) time.

Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms.

Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

Meeting the fairness deadline in speed scaling systems: is turbocharging enough?

B. Maryam Elahi, Carey Williamson, Philipp Woelfel

SIGMETRICS Perform. Evaluation Rev., 2012

RMR-efficient implementations of comparison primitives using read and write operations.

Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel

Distributed Comput., 2012

RMR-Efficient Randomized Abortable Mutual Exclusion

Abhijeet Pareek, Philipp Woelfel

CoRR, 2012

RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract).

Abhijeet Pareek, Philipp Woelfel

Proceedings of the Distributed Computing - 26th International Symposium, 2012

Efficient Fetch-and-Increment.

Faith Ellen, Vijaya Ramachandran, Philipp Woelfel

Proceedings of the Distributed Computing - 26th International Symposium, 2012

A tight RMR lower bound for randomized mutual exclusion.

George Giakkoupis, Philipp Woelfel

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Low Randomness Rumor Spreading via Hashing.

George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Strongly linearizable implementations: possibilities and impossibilities.

Maryam Helmi, Lisa Higham, Philipp Woelfel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Brief announcement: a tight RMR lower bound for randomized mutual exclusion.

George Giakkoupis, Philipp Woelfel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

On the time and space complexity of randomized test-and-set.

George Giakkoupis, Philipp Woelfel

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Independence of Tabulation-Based Hash Classes.

Toryn Qwyllyn Klassen, Philipp Woelfel

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

2011

Randomized mutual exclusion with sub-logarithmic RMR-complexity.

Danny Hendler, Philipp Woelfel

Distributed Comput., 2011

Fully-adaptive algorithms for long-lived renaming.

Alex Brodsky, Faith Ellen, Philipp Woelfel

Distributed Comput., 2011

Precision, Local Search and Unimodal Functions.

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel

Algorithmica, 2011

Linearizable implementations do not suffice for randomized distributed computation.

Wojciech M. Golab, Lisa Higham, Philipp Woelfel

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

On the Randomness Requirements of Rumor Spreading.

George Giakkoupis, Philipp Woelfel

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Separating Deterministic from Randomized Multiparty Communication Complexity.

Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel

Theory Comput., 2010

An O(1) RMRs Leader Election Algorithm.

Wojciech M. Golab, Danny Hendler, Philipp Woelfel

SIAM J. Comput., 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

Adaptive randomized mutual exclusion in sub-logarithmic expected time.

Danny Hendler, Philipp Woelfel

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Representation of graphs by OBDDs.

Robin Nunkesser, Philipp Woelfel

Discret. Appl. Math., 2009

Tight lower bounds for greedy routing in uniform small world rings.

Martin Dietzfelbinger, Philipp Woelfel

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

Randomized mutual exclusion in O(log N / log log N) RMRs.

Danny Hendler, Philipp Woelfel

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Brief announcement: tight lower bounds for greedy routing in uniform small world rings.

Martin Dietzfelbinger, Philipp Woelfel

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Tight rmr lower bounds for mutual exclusion and other problems.

Hagit Attiya, Danny Hendler, Philipp Woelfel

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Tight Bounds for Blind Search on the Integers.

Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel

Proceedings of the STACS 2008, 2008

2007

New Results on the Complexity of the Middle Bit of Multiplication.

Ingo Wegener, Philipp Woelfel

Comput. Complex., 2007

Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.

Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel

Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity.

Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

A construction method for optimally universal hash families and its consequences for the existence of RBIBDs.

Philipp Woelfel

Theor. Comput. Sci., 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

Symbolic topological sorting with OBDDs.

Philipp Woelfel

J. Discrete Algorithms, 2006

Asymmetric balanced allocation with simple hash functions.

Philipp Woelfel

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

An <i>O</i>(1) RMRs leader election algorithm.

Wojciech M. Golab, Danny Hendler, Philipp Woelfel

Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Maintaining External Memory Efficient Hash Tables.

Philipp Woelfel

Proceedings of the Approximation, 2006

2005

A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.

Beate Bollig, Philipp Woelfel

Theory Comput. Syst., 2005

Bounds on the OBDD-size of integer multiplication via universal hashing.

Philipp Woelfel

J. Comput. Syst. Sci., 2005

2003

Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen.

Philipp Wölfel

PhD thesis, 2003

Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.

Martin Sauerhoff, Philipp Woelfel

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Almost random graphs with simple hash functions.

Martin Dietzfelbinger, Philipp Woelfel

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Multiplikation in eingeschränkten Branchingprogrammmodellen.

Philipp Wölfel

Proceedings of the Ausgezeichnete Informatikdissertationen 2003, 2003

2002

On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.

Philipp Woelfel

Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001

A Lower Bound Technique for Restricted Branching Programs and Applications

Philipp Woelfel

Electron. Colloquium Comput. Complex., 2001

A read-once branching program lower bound of Omega(2^n/4) for integer multiplication using universal.

Beate Bollig, Philipp Woelfel

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing

Philipp Woelfel

Electron. Colloquium Comput. Complex., 2000

1999

Efficient Strongly Universal and Optimally Universal Hashing.

Philipp Woelfel

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999