Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Philipp Woelfel
Observed names:
P. Woelfel,
PHILIPP WOELFEL,
Woelfel, Philipp
Institutions:
Natural Sciences and Engineering Research Council of Canada,
University of Calgary
Observed institutions:
Technische Universität Ilmenau,
Natural Sciences and Engineering Research Council of Canada,
University of Calgary,
University of Toronto,
TU Dortmund University,
Centre Inria de l'Université de Rennes
show all 6
ORCID:
0000-0002-7847-4631
Observed ORCID:
0000-0002-7847-4631
OpenAlex ID:
A5009422307
Almost random graphs with simple hash functions
2003
·
Martin Dietzfelbinger
, Philipp Woelfel
·
ACM Symposium on Theory of Computing (STOC)
·
86
Tight RMR lower bounds for mutual exclusion and other problems
2008
·
Hagit Attiya
, Danny Hendler
, et al.
·
74
Linearizable implementations do not suffice for randomized distributed computation
2011
·
Wojciech Golab
, Lisa Higham
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
69
PDF
Symbolic topological sorting with OBDDs
2005
·
Philipp Woelfel
·
Journal of Discrete Algorithms
·
42
PDF
On the time and space complexity of randomized test-and-set
2012
·
George Giakkoupis
, Philipp Woelfel
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
33
Making objects writable
2014
·
Zahra Aghazadeh
, Wojciech Golab
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
31
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
2007
·
Wojciech Golab
, Vassos Hadzilacos
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
30
PDF
A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal hashing
2001
·
Beate Bollig
, Philipp Woelfel
·
ACM Symposium on Theory of Computing (STOC)
·
29
Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash
2013
·
Martin Aumüller
, Martin Dietzfelbinger
, et al.
·
Algorithmica
·
28
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
2003
·
Martin Sauerhoff
, Philipp Woelfel
·
ACM Symposium on Theory of Computing (STOC)
·
26
Strongly linearizable implementations
2012
·
Maryam Helmi
, Lisa Higham
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
24
A tight RMR lower bound for randomized mutual exclusion
2012
·
George Giakkoupis
, Philipp Woelfel
·
ACM Symposium on Theory of Computing (STOC)
·
24
RMR-efficient implementations of comparison primitives using read and write operations
2011
·
Wojciech Golab
, Vassos Hadzilacos
, et al.
·
Distributed Computing
·
24
An $O(1)$ RMRs Leader Election Algorithm
2010
·
Wojciech Golab
, Danny Hendler
, et al.
·
SIAM Journal on Computing
·
24
Bounds on the OBDD-size of integer multiplication via universal hashing
2005
·
Philipp Woelfel
·
Journal of Computer and System Sciences
·
23
PDF
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
2001
·
Philipp Woelfel
·
Lecture notes in computer science
·
23
An $O(\sqrt n)$ Space Bound for Obstruction-Free Leader Election
2013
·
George Giakkoupis
, Maryam Helmi
, et al.
·
Lecture notes in computer science
·
21
Fully-adaptive algorithms for long-lived renaming
2011
·
Alex Brodsky
, Faith Ellen
, et al.
·
Distributed Computing
·
21
Randomized mutual exclusion with sub-logarithmic RMR-complexity
2011
·
Danny Hendler
, Philipp Woelfel
·
Distributed Computing
·
21
An Optimal Implementation of Fetch-and-Increment
2013
·
Faith Ellen
, Philipp Woelfel
·
Lecture notes in computer science
·
20
How Asynchrony Affects Rumor Spreading Time
2016
·
George Giakkoupis
, Yasamin Nazari
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
19
Efficient Strongly Universal and Optimally Universal Hashing
1999
·
Philipp Woelfel
·
Lecture notes in computer science
·
19
Parity Graph-Driven Read-Once Branching Programs and An Exponential Lower Bound for Integer Multiplication
2002
·
Beate Bollig
, Stephan Waack
, et al.
·
Springer eBooks
·
18
PDF
Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability
2015
·
Oksana Denysyuk
, Philipp Woelfel
·
Lecture notes in computer science
·
17
On the Randomness Requirements of Rumor Spreading
2011
·
George Giakkoupis
, Philipp Woelfel
·
17
Show more works
View as search
Works count:
144
Citation count:
1,270
H-index:
20
I10-index:
49
Year
Topic
Type
