Philipp Woelfel

119 papers A* 44A 22B 8Misc 1Journal 41Unranked 3

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