Philipp Woelfel

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 31

Top Venues

Publications

Dante Bencivenga, George Giakkoupis, Philipp Woelfel
Faster Randomized Repeated Choice and DCAS. PODC (2024)
Fatemeh Naderi-Semiromi, Philipp Woelfel
Strongly Linearizable LL/SC from CAS. PODC (2024)
David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. PODC (2023)
Benyamin Bashari, Ali Jamadi, Philipp Woelfel
Efficient Bounded Timestamping from Standard Synchronization Primitives. PODC (2023)
Marcos Aguiliera, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, Philipp Woelfel
2022 Edsger W. Dijkstra Prize in Distributed Computing. PODC (2022)
Benyamin Bashari, Philipp Woelfel
An Efficient Adaptive Partial Snapshot Implementation. PODC (2021)
George Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel
Efficient randomized DCAS. STOC (2021)
David Yu Cheng Chan, Philipp Woelfel
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. PODC (2021)
David Yu Cheng Chan, Philipp Woelfel
Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion. CoRR (2021)
Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu
Space Lower Bounds for the Signal Detection Problem. Theory Comput. Syst. 65 (4) (2021)
Steven Munsu Hwang, Philipp Woelfel
Strongly Linearizable Linked List and Queue. OPODIS (2021)
David Yu Cheng Chan, Philipp Woelfel
Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. PODC (2020)
Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC (2019)
Sean Ovens, Philipp Woelfel
Strongly Linearizable Implementations of Snapshots and Other Types. CoRR (2019)
George Giakkoupis, Philipp Woelfel
Efficient Randomized Test-And-Set Implementations. CoRR (2019)
Sean Ovens, Philipp Woelfel
Strongly Linearizable Implementations of Snapshots and Other Types. PODC (2019)
George Giakkoupis, Philipp Woelfel
Efficient randomized test-and-set implementations. Distributed Comput. 32 (6) (2019)
Philipp Woelfel
Towards a Theory of Randomized Shared Memory Algorithms. PODC (2019)
Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu
Space Lower Bounds for the Signal Detection Problem. STACS (2019)
Aryaz Eghbali, Philipp Woelfel
An Almost Tight RMR Lower Bound for Abortable Test-And-Set. CoRR (2018)
George Giakkoupis, Philipp Woelfel
An Improved Bound for Random Binary Search Trees with Concurrent Insertions. STACS (2018)
Aryaz Eghbali, Philipp Woelfel
An Almost Tight RMR Lower Bound for Abortable Test-And-Set. DISC (2018)
James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel
Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC (2018)
Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR (2018)
George Giakkoupis, Philipp Woelfel
Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. PODC (2017)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs. CoRR (2016)
Maryam Helmi, Lisa Higham, Philipp Woelfel
Space Bounds for Adaptive Renaming. CoRR (2016)
George Giakkoupis, Yasamin Nazari, Philipp Woelfel
How Asynchrony Affects Rumor Spreading Time. PODC (2016)
Zahra Aghazadeh, Philipp Woelfel
Upper Bounds for Boundless Tagging with Bounded Objects. DISC (2016)
Oksana Denysyuk, Philipp Woelfel
Are Shared Objects Composable under an Oblivious Adversary? PODC (2016)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
Deterministic and Fast Randomized Test-and-Set in Optimal Space. CoRR (2016)
Hagit Attiya, Danny Hendler, Philipp Woelfel
Trading Fences with RMRs and Separating Memory Models. PODC (2015)
Oksana Denysyuk, Philipp Woelfel
Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. DISC (2015)
Zahra Aghazadeh, Philipp Woelfel
On the Time and Space Complexity of ABA Prevention and Detection. PODC (2015)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
Test-and-Set in Optimal Space. STOC (2015)
Zahra Aghazadeh, Philipp Woelfel
On the Time and Space Complexity of ABA Prevention and Detection. CoRR (2015)
Zahra Aghazadeh, Philipp Woelfel
Space- and Time-Efficient Long-Lived Test-And-Set Objects. OPODIS (2014)
Maryam Helmi, Lisa Higham, Philipp Woelfel
Space Bounds for Adaptive Renaming. DISC (2014)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. Algorithmica 70 (3) (2014)
George Giakkoupis, Philipp Woelfel
Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. FOCS (2014)
Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations. J. ACM 61 (1) (2014)
B. Maryam Elahi, Carey L. Williamson, Philipp Woelfel
Turbocharged Speed Scaling: Analysis and Evaluation. MASCOTS (2014)
Martin Dietzfelbinger, Philipp Woelfel
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. SODA (2014)
Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel
Making objects writable. PODC (2014)
B. Maryam Elahi, Carey Williamson, Philipp Woelfel
Decoupled speed scaling: Analysis and evaluation. Perform. Evaluation 73 (2014)
George Giakkoupis, Anne-Marie Kermarrec, Philipp Woelfel
Gossip Protocols for Renaming and Sorting. DISC (2013)
Faith Ellen, Philipp Woelfel
An Optimal Implementation of Fetch-and-Increment. DISC (2013)
George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel
An O(sqrt n) Space Bound for Obstruction-Free Leader Election. DISC (2013)
Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel
Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms. PODC (2013)
Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel
) time. PODC (2013)
Martin Dietzfelbinger, Philipp Woelfel
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids CoRR (2013)
Toryn Qwyllyn Klassen, Philipp Woelfel
Independence of Tabulation-Based Hash Classes. LATIN (2012)
George Giakkoupis, Philipp Woelfel
On the time and space complexity of randomized test-and-set. PODC (2012)
B. Maryam Elahi, Carey Williamson, Philipp Woelfel
Meeting the fairness deadline in speed scaling systems: is turbocharging enough? SIGMETRICS Perform. Evaluation Rev. 40 (3) (2012)
George Giakkoupis, Philipp Woelfel
A tight RMR lower bound for randomized mutual exclusion. STOC (2012)
Abhijeet Pareek, Philipp Woelfel
RMR-Efficient Randomized Abortable Mutual Exclusion CoRR (2012)
George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel
Low Randomness Rumor Spreading via Hashing. STACS (2012)
Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel
RMR-efficient implementations of comparison primitives using read and write operations. Distributed Comput. 25 (2) (2012)
George Giakkoupis, Philipp Woelfel
Brief announcement: a tight RMR lower bound for randomized mutual exclusion. PODC (2012)
Faith Ellen, Vijaya Ramachandran, Philipp Woelfel
Efficient Fetch-and-Increment. DISC (2012)
Maryam Helmi, Lisa Higham, Philipp Woelfel
Strongly linearizable implementations: possibilities and impossibilities. PODC (2012)
Abhijeet Pareek, Philipp Woelfel
RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract). DISC (2012)
B. Maryam Elahi, Carey Williamson, Philipp Woelfel
Decoupled Speed Scaling: Analysis and Evaluation. QEST (2012)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. ESA (2012)
Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash CoRR (2012)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Precision, Local Search and Unimodal Functions. Algorithmica 59 (3) (2011)
George Giakkoupis, Philipp Woelfel
On the Randomness Requirements of Rumor Spreading. SODA (2011)
Toryn Qwyllyn Klassen, Philipp Woelfel
Independence of Tabulation-Based Hash Classes CoRR (2011)
Danny Hendler, Philipp Woelfel
Randomized mutual exclusion with sub-logarithmic RMR-complexity. Distributed Comput. 24 (1) (2011)
Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel
The space complexity of long-lived and one-shot timestamp implementations. PODC (2011)
Alex Brodsky, Faith Ellen, Philipp Woelfel
Fully-adaptive algorithms for long-lived renaming. Distributed Comput. 24 (2) (2011)
Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel
The Space Complexity of Long-lived and One-Shot Timestamp Implementations CoRR (2011)
Wojciech M. Golab, Lisa Higham, Philipp Woelfel
Linearizable implementations do not suffice for randomized distributed computation. STOC (2011)
Wojciech M. Golab, Lisa Higham, Philipp Woelfel
Linearizable Implementations Do Not Suffice for Randomized Distributed Computation CoRR (2011)
Danny Hendler, Philipp Woelfel
Adaptive randomized mutual exclusion in sub-logarithmic expected time. PODC (2010)
Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
Separating Deterministic from Randomized Multiparty Communication Complexity. Theory Comput. 6 (1) (2010)
Wojciech M. Golab, Danny Hendler, Philipp Woelfel
An O(1) RMRs Leader Election Algorithm. SIAM J. Comput. 39 (7) (2010)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers and the Reals. Comb. Probab. Comput. 19 (5-6) (2010)
Martin Dietzfelbinger, Philipp Woelfel
Tight lower bounds for greedy routing in uniform small world rings. STOC (2009)
Robin Nunkesser, Philipp Woelfel
Representation of graphs by OBDDs. Discret. Appl. Math. 157 (2) (2009)
Martin Dietzfelbinger, Philipp Woelfel
Brief announcement: tight lower bounds for greedy routing in uniform small world rings. PODC (2009)
Danny Hendler, Philipp Woelfel
Randomized mutual exclusion in O(log N / log log N) RMRs. PODC (2009)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers CoRR (2008)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Precision, local search and unimodal functions. GECCO (2008)
Hagit Attiya, Danny Hendler, Philipp Woelfel
Tight RMR lower bounds for mutual exclusion and other problems. PODC (2008)
Hagit Attiya, Danny Hendler, Philipp Woelfel
Tight rmr lower bounds for mutual exclusion and other problems. STOC (2008)
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel
Tight Bounds for Blind Search on the Integers. STACS (2008)
Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. ICALP (2007)
Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. PODC (2007)
Ingo Wegener, Philipp Woelfel
New Results on the Complexity of the Middle Bit of Multiplication. Comput. Complex. 16 (3) (2007)
Philipp Woelfel
Maintaining External Memory Efficient Hash Tables. APPROX-RANDOM (2006)
Alex Brodsky, Faith Ellen, Philipp Woelfel
Fully-Adaptive Algorithms for Long-Lived Renaming. DISC (2006)
Philipp Woelfel
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs. Theor. Comput. Sci. 363 (1) (2006)
Philipp Woelfel
Asymmetric balanced allocation with simple hash functions. SODA (2006)
Wojciech M. Golab, Danny Hendler, Philipp Woelfel
(1) RMRs leader election algorithm. PODC (2006)
Beate Bollig, Stephan Waack, Philipp Woelfel
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. Theor. Comput. Sci. 362 (1-3) (2006)
Philipp Woelfel
Symbolic topological sorting with OBDDs. J. Discrete Algorithms 4 (1) (2006)
Robin Nunkesser, Philipp Woelfel
Representation of Graphs by OBDDs. ISAAC (2005)
Philipp Woelfel
Bounds on the OBDD-size of integer multiplication via universal hashing. J. Comput. Syst. Sci. 71 (4) (2005)
Ingo Wegener, Philipp Woelfel
New Results on the Complexity of the Middle Bit of Multiplication. Computational Complexity Conference (2005)

Philipp Woelfel.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Philipp Woelfel