default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilipp Woelfel
Philipp Wölfel
Person information
- affiliation: University of Calgary, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c77]Fatemeh Naderi-Semiromi
, Philipp Woelfel:
Strongly Linearizable LL/SC from CAS. PODC 2024: 443-453- [c76]Dante Bencivenga, George Giakkoupis, Philipp Woelfel:
Faster Randomized Repeated Choice and DCAS. PODC 2024: 454-464 - [c75]Benyamin Bashari, David Yu Cheng Chan, Philipp Woelfel:
A Fully Concurrent Adaptive Snapshot Object for RMWable Shared-Memory. DISC 2024: 7:1-7:22 - 2023
- [c74]David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel:
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. PODC 2023: 79-89 - [c73]Benyamin Bashari, Ali Jamadi, Philipp Woelfel:
Efficient Bounded Timestamping from Standard Synchronization Primitives. PODC 2023: 113-123 - 2022
- [c72]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: 1 - [e1]Alessia Milani, Philipp Woelfel:
PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022. ACM 2022, ISBN 978-1-4503-9262-4 [contents] - 2021
- [j20]Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. Theory Comput. Syst. 65(4): 687-705 (2021) - [c71]Steven Munsu Hwang, Philipp Woelfel:
Strongly Linearizable Linked List and Queue. OPODIS 2021: 28:1-28:20 - [c70]David Yu Cheng Chan, Philipp Woelfel:
Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. PODC 2021: 533-543 - [c69]Benyamin Bashari, Philipp Woelfel:
An Efficient Adaptive Partial Snapshot Implementation. PODC 2021: 545-555 - [c68]George Giakkoupis, Mehrdad Jafari Giv, Philipp Woelfel:
Efficient randomized DCAS. STOC 2021: 1221-1234 - [i20]David Yu Cheng Chan, Philipp Woelfel:
Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion. CoRR abs/2106.03185 (2021) - 2020
- [c67]David Yu Cheng Chan, Philipp Woelfel:
Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. PODC 2020: 181-190
2010 – 2019
- 2019
- [j19]George Giakkoupis, Philipp Woelfel:
Efficient randomized test-and-set implementations. Distributed Comput. 32(6): 565-586 (2019) - [c66]Philipp Woelfel:
Towards a Theory of Randomized Shared Memory Algorithms. PODC 2019: 156 - [c65]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. PODC 2019: 157-166 - [c64]Sean Ovens, Philipp Woelfel:
Strongly Linearizable Implementations of Snapshots and Other Types. PODC 2019: 197-206 - [c63]Faith Ellen, Rati Gelashvili, Philipp Woelfel, Leqi Zhu:
Space Lower Bounds for the Signal Detection Problem. STACS 2019: 26:1-26:13 - [i19]George Giakkoupis, Philipp Woelfel:
Efficient Randomized Test-And-Set Implementations. CoRR abs/1902.04002 (2019) - [i18]Sean Ovens, Philipp Woelfel:
Strongly Linearizable Implementations of Snapshots and Other Types. CoRR abs/1908.10826 (2019) - 2018
- [c62]George Giakkoupis, Philipp Woelfel:
An Improved Bound for Random Binary Search Trees with Concurrent Insertions. STACS 2018: 37:1-37:13 - [c61]James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel:
Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC 2018: 8:1-8:17 - [c60]Aryaz Eghbali, Philipp Woelfel:
An Almost Tight RMR Lower Bound for Abortable Test-And-Set. DISC 2018: 21:1-21:19 - [i17]Aryaz Eghbali, Philipp Woelfel:
An Almost Tight RMR Lower Bound for Abortable Test-And-Set. CoRR abs/1805.04840 (2018) - [i16]Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel:
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion. CoRR abs/1810.03723 (2018) - 2017
- [c59]George Giakkoupis, Philipp Woelfel:
Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model. PODC 2017: 221-229 - 2016
- [c58]George Giakkoupis, Yasamin Nazari, Philipp Woelfel:
How Asynchrony Affects Rumor Spreading Time. PODC 2016: 185-194 - [c57]Oksana Denysyuk, Philipp Woelfel:
Are Shared Objects Composable under an Oblivious Adversary? PODC 2016: 335-344 - [c56]Zahra Aghazadeh, Philipp Woelfel:
Upper Bounds for Boundless Tagging with Bounded Objects. DISC 2016: 442-457 - [i15]Maryam Helmi, Lisa Higham, Philipp Woelfel:
Space Bounds for Adaptive Renaming. CoRR abs/1603.04067 (2016) - [i14]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
Deterministic and Fast Randomized Test-and-Set in Optimal Space. CoRR abs/1608.06033 (2016) - [i13]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
A Simple Hash Class with Strong Randomness Properties in Graphs and Hypergraphs. CoRR abs/1611.00029 (2016) - 2015
- [c55]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Trading Fences with RMRs and Separating Memory Models. PODC 2015: 173-182 - [c54]Zahra Aghazadeh, Philipp Woelfel:
On the Time and Space Complexity of ABA Prevention and Detection. PODC 2015: 193-202 - [c53]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
Test-and-Set in Optimal Space. STOC 2015: 615-623 - [c52]Oksana Denysyuk, Philipp Woelfel:
Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability. DISC 2015: 60-74 - [i12]Zahra Aghazadeh, Philipp Woelfel:
On the Time and Space Complexity of ABA Prevention and Detection. CoRR abs/1507.02722 (2015) - 2014
- [j18]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. Algorithmica 70(3): 428-456 (2014) - [j17]Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations. J. ACM 61(1): 7:1-7:25 (2014) - [j16]B. Maryam Elahi, Carey Williamson, Philipp Woelfel:
Decoupled speed scaling: Analysis and evaluation. Perform. Evaluation 73: 3-17 (2014) - [c51]George Giakkoupis, Philipp Woelfel:
Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. FOCS 2014: 504-513 - [c50]B. Maryam Elahi, Carey L. Williamson, Philipp Woelfel:
Turbocharged Speed Scaling: Analysis and Evaluation. MASCOTS 2014: 41-50 - [c49]Zahra Aghazadeh, Philipp Woelfel:
Space- and Time-Efficient Long-Lived Test-And-Set Objects. OPODIS 2014: 404-419 - [c48]Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel:
Making objects writable. PODC 2014: 385-395 - [c47]Martin Dietzfelbinger, Philipp Woelfel:
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. SODA 2014: 816-829 - [c46]Maryam Helmi, Lisa Higham, Philipp Woelfel:
Space Bounds for Adaptive Renaming. DISC 2014: 303-317 - 2013
- [c45]Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel:
Randomized loose renaming in O(log log n) time. PODC 2013: 200-209 - [c44]Zahra Aghazadeh, Wojciech M. Golab, Philipp Woelfel:
Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms. PODC 2013: 322-324 - [c43]George Giakkoupis, Maryam Helmi, Lisa Higham, Philipp Woelfel:
An O(sqrt n) Space Bound for Obstruction-Free Leader Election. DISC 2013: 46-60 - [c42]George Giakkoupis, Anne-Marie Kermarrec, Philipp Woelfel:
Gossip Protocols for Renaming and Sorting. DISC 2013: 194-208 - [c41]Faith Ellen, Philipp Woelfel:
An Optimal Implementation of Fetch-and-Increment. DISC 2013: 284-298 - [i11]Martin Dietzfelbinger, Philipp Woelfel:
Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World Grids. CoRR abs/1305.1295 (2013) - 2012
- [j15]Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel:
RMR-efficient implementations of comparison primitives using read and write operations. Distributed Comput. 25(2): 109-162 (2012) - [j14]B. Maryam Elahi, Carey Williamson, Philipp Woelfel:
Meeting the fairness deadline in speed scaling systems: is turbocharging enough? SIGMETRICS Perform. Evaluation Rev. 40(3): 89-91 (2012) - [c40]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. ESA 2012: 108-120 - [c39]Toryn Qwyllyn Klassen, Philipp Woelfel:
Independence of Tabulation-Based Hash Classes. LATIN 2012: 506-517 - [c38]George Giakkoupis, Philipp Woelfel:
On the time and space complexity of randomized test-and-set. PODC 2012: 19-28 - [c37]George Giakkoupis, Philipp Woelfel:
Brief announcement: a tight RMR lower bound for randomized mutual exclusion. PODC 2012: 239-240 - [c36]Maryam Helmi, Lisa Higham, Philipp Woelfel:
Strongly linearizable implementations: possibilities and impossibilities. PODC 2012: 385-394 - [c35]B. Maryam Elahi, Carey Williamson, Philipp Woelfel:
Decoupled Speed Scaling: Analysis and Evaluation. QEST 2012: 2-12 - [c34]George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel:
Low Randomness Rumor Spreading via Hashing. STACS 2012: 314-325 - [c33]George Giakkoupis, Philipp Woelfel:
A tight RMR lower bound for randomized mutual exclusion. STOC 2012: 983-1002 - [c32]Faith Ellen, Vijaya Ramachandran, Philipp Woelfel:
Efficient Fetch-and-Increment. DISC 2012: 16-30 - [c31]Abhijeet Pareek, Philipp Woelfel:
RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract). DISC 2012: 267-281 - [i10]Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel:
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. CoRR abs/1204.4431 (2012) - [i9]Abhijeet Pareek, Philipp Woelfel:
RMR-Efficient Randomized Abortable Mutual Exclusion. CoRR abs/1208.1723 (2012) - 2011
- [j13]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Precision, Local Search and Unimodal Functions. Algorithmica 59(3): 301-322 (2011) - [j12]Danny Hendler, Philipp Woelfel:
Randomized mutual exclusion with sub-logarithmic RMR-complexity. Distributed Comput. 24(1): 3-19 (2011) - [j11]Alex Brodsky, Faith Ellen, Philipp Woelfel:
Fully-adaptive algorithms for long-lived renaming. Distributed Comput. 24(2): 119-134 (2011) - [c30]Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
The space complexity of long-lived and one-shot timestamp implementations. PODC 2011: 139-148 - [c29]George Giakkoupis, Philipp Woelfel:
On the Randomness Requirements of Rumor Spreading. SODA 2011: 449-461 - [c28]Wojciech M. Golab, Lisa Higham, Philipp Woelfel:
Linearizable implementations do not suffice for randomized distributed computation. STOC 2011: 373-382 - [i8]Wojciech M. Golab, Lisa Higham, Philipp Woelfel:
Linearizable Implementations Do Not Suffice for Randomized Distributed Computation. CoRR abs/1103.4690 (2011) - [i7]Maryam Helmi, Lisa Higham, Eduardo Pacheco, Philipp Woelfel:
The Space Complexity of Long-lived and One-Shot Timestamp Implementations. CoRR abs/1103.5794 (2011) - [i6]Toryn Qwyllyn Klassen, Philipp Woelfel:
Independence of Tabulation-Based Hash Classes. CoRR abs/1112.3323 (2011) - 2010
- [j10]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): 711-728 (2010) - [j9]Wojciech M. Golab, Danny Hendler, Philipp Woelfel:
An O(1) RMRs Leader Election Algorithm. SIAM J. Comput. 39(7): 2726-2760 (2010) - [j8]Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel:
Separating Deterministic from Randomized Multiparty Communication Complexity. Theory Comput. 6(1): 201-225 (2010) - [c27]Danny Hendler, Philipp Woelfel:
Adaptive randomized mutual exclusion in sub-logarithmic expected time. PODC 2010: 141-150
2000 – 2009
- 2009
- [j7]Robin Nunkesser, Philipp Woelfel:
Representation of graphs by OBDDs. Discret. Appl. Math. 157(2): 247-261 (2009) - [c26]Danny Hendler, Philipp Woelfel:
Randomized mutual exclusion in O(log N / log log N) RMRs. PODC 2009: 26-35 - [c25]Martin Dietzfelbinger, Philipp Woelfel:
Brief announcement: tight lower bounds for greedy routing in uniform small world rings. PODC 2009: 300-301 - [c24]Martin Dietzfelbinger, Philipp Woelfel:
Tight lower bounds for greedy routing in uniform small world rings. STOC 2009: 591-600 - 2008
- [c23]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Precision, local search and unimodal functions. GECCO 2008: 771-778 - [c22]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Tight RMR lower bounds for mutual exclusion and other problems. PODC 2008: 447 - [c21]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers. STACS 2008: 241-252 - [c20]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226 - [i5]Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Tight Bounds for Blind Search on the Integers. CoRR abs/0802.2852 (2008) - 2007
- [j6]Ingo Wegener, Philipp Woelfel:
New Results on the Complexity of the Middle Bit of Multiplication. Comput. Complex. 16(3): 298-323 (2007) - [c19]Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel:
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. ICALP 2007: 134-145 - [c18]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: 3-12 - 2006
- [j5]Philipp Woelfel:
Symbolic topological sorting with OBDDs. J. Discrete Algorithms 4(1): 51-71 (2006) - [j4]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): 86-99 (2006) - [j3]Philipp Woelfel:
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs. Theor. Comput. Sci. 363(1): 76-84 (2006) - [c17]Philipp Woelfel:
Maintaining External Memory Efficient Hash Tables. APPROX-RANDOM 2006: 508-519 - [c16]Wojciech M. Golab, Danny Hendler, Philipp Woelfel:
An O(1) RMRs leader election algorithm. PODC 2006: 238-247 - [c15]Philipp Woelfel:
Asymmetric balanced allocation with simple hash functions. SODA 2006: 424-433 - [c14]Alex Brodsky, Faith Ellen, Philipp Woelfel:
Fully-Adaptive Algorithms for Long-Lived Renaming. DISC 2006: 413-427 - 2005
- [j2]Philipp Woelfel:
Bounds on the OBDD-size of integer multiplication via universal hashing. J. Comput. Syst. Sci. 71(4): 520-534 (2005) - [j1]Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. Theory Comput. Syst. 38(6): 671-685 (2005) - [c13]Ingo Wegener, Philipp Woelfel:
New Results on the Complexity of the Middle Bit of Multiplication. CCC 2005: 100-110 - [c12]Robin Nunkesser, Philipp Woelfel:
Representation of Graphs by OBDDs. ISAAC 2005: 1132-1142 - 2004
- [c11]Philipp Woelfel:
A Construction Method for Optimally Universal Hash Families and Its Consequences for the Existence of RBIBDs. COCOON 2004: 23-32 - [i4]Ingo Wegener, Philipp Woelfel:
New Results on the Complexity of the Middle Bit of Multiplication. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [b1]Philipp Wölfel:
Über die Komplexität der Multiplikation in eingeschränkten Branchingprogrammmodellen. Technical University of Dortmund, Germany, 2003, pp. 1-77 - [c10]Philipp Woelfel:
Symbolic Topological Sorting with OBDDS. MFCS 2003: 671-680 - [c9]Martin Sauerhoff, Philipp Woelfel:
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions. STOC 2003: 186-195 - [c8]Martin Dietzfelbinger, Philipp Woelfel:
Almost random graphs with simple hash functions. STOC 2003: 629-638 - [p1]Philipp Wölfel:
Multiplikation in eingeschränkten Branchingprogrammmodellen. Ausgezeichnete Informatikdissertationen 2003: 199-208 - 2002
- [c7]Philipp Woelfel:
On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism. CCC 2002: 80-89 - [c6]Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. IFIP TCS 2002: 83-94 - [c5]Beate Bollig, Philipp Woelfel:
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. MFCS 2002: 131-142 - [c4]Philipp Woelfel:
A Lower Bound Technique for Restricted Branching Programs and Applications. STACS 2002: 431-442 - 2001
- [c3]Philipp Woelfel:
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. STACS 2001: 563-574 - [c2]Beate Bollig, Philipp Woelfel:
A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. STOC 2001: 419-424 - [i3]Beate Bollig, Philipp Woelfel, Stephan Waack:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. Electron. Colloquium Comput. Complex. TR01 (2001) - [i2]Philipp Woelfel:
A Lower Bound Technique for Restricted Branching Programs and Applications. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [i1]Philipp Woelfel:
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c1]Philipp Woelfel:
Efficient Strongly Universal and Optimally Universal Hashing. MFCS 1999: 262-272
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
