Philipp Woelfel

Cited by

	All	Since 2019
Citations	1566	494
h-index	24	12
i10-index	53	16

160

120

2001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320247 13 27 34 15 27 23 47 34 55 73 84 66 142 94 90 78 131 89 63 82 74 105 80

Public access

View all

35 articles

3 articles

available

not available

Based on funding mandates

Co-authors

George GiakkoupisResearcher, INRIA Rennes, FranceVerified email at inria.fr
Danny HendlerProfessor of Computer Science, Ben-Gurion UniversityVerified email at cs.bgu.ac.il
Martin DietzfelbingerProfessor of Computer Science, Technische Universität IlmenauVerified email at tu-ilmenau.de
Wojciech GolabUniversity of WaterlooVerified email at uwaterloo.ca
Zahra AghazadehUniversity of CalgaryVerified email at ucalgary.ca
Hagit AttiyaDepartment of Computer Science, TechnionVerified email at cs.technion.ac.il
Maryam ElahiAssistant Professor, Mount Royal UniversityVerified email at mtroyal.ca
Carey WilliamsonUniversity of CalgaryVerified email at cpsc.ucalgary.ca
Martin AumüllerIT University of CopenhagenVerified email at itu.dk
Matei DavidOntario Institute for Cancer ResearchVerified email at oicr.on.ca
Paul BeameProfessor of Computer Science and Engineering, University of WashingtonVerified email at cs.washington.edu
Stephan WaackProfessor für Informatik, Universität GöttingenVerified email at informatik.uni-goettingen.de
James AspnesYale UniversityVerified email at yale.edu
Robin NunkesserProfessor of Computer Science, Hamm-Lippstadt University of Applied SciencesVerified email at hshl.de
Dan AlistarhProfessor at IST AustriaVerified email at ist.ac.at
Eduardo PachecoOracle Analytics CloudVerified email at oracle.com
Anne-Marie KermarrecProfessor, EPFLVerified email at epfl.ch
He SunReader in Algorithms & Complexity, University of EdinburghVerified email at ed.ac.uk
Thomas SauerwaldUniversity Lecturer in Computer Science, University of CambridgeVerified email at cl.cam.ac.uk
Toryn Q. KlassenUniversity of Toronto, Vector InstituteVerified email at cs.toronto.edu

Philipp Woelfel

University of Calgary

Verified email at ucalgary.ca - Homepage

Computer Science Theory Theoretical Computer Science Algorithms Distributed Computing


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Almost random graphs with simple hash functions M Dietzfelbinger, P Woelfel Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing …, 2003	101	2003
Linearizable implementations do not suffice for randomized distributed computation W Golab, L Higham, P Woelfel Proceedings of the 43rd annual ACM symposium on Theory of computing, 373-382, 2011	95	2011
Tight RMR lower bounds for mutual exclusion and other problems H Attiya, D Hendler, P Woelfel Proceedings of the 40th annual ACM symposium on Theory of computing, 217-226, 2008	83	2008
Explicit and efficient hash families suffice for cuckoo hashing with a stash M Aumüller, M Dietzfelbinger, P Woelfel Algorithmica 70 (3), 428-456, 2014	52	2014
On the time and space complexity of randomized test-and-set G Giakkoupis, P Woelfel Proceedings of the 2012 ACM symposium on Principles of Distributed Computing …, 2012	43	2012
Making objects writable Z Aghazadeh, W Golab, P Woelfel Proceedings of the 2014 ACM symposium on Principles of distributed computing …, 2014	40	2014
Symbolic topological sorting with OBDDs P Woelfel Journal of Discrete Algorithms 4 (1), 51-71, 2006	37	2006
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions M Sauerhoff, P Woelfel Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing …, 2003	37	2003
A read-once branching program lower bound of Ω(2^n/4) for integer multiplication using universal hashing B Bollig, P Woelfel Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	37	2001
How asynchrony affects rumor spreading time G Giakkoupis, Y Nazari, P Woelfel Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016	36	2016
Constant-RMR implementations of CAS and other synchronization primitives using read and write operations W Golab, V Hadzilacos, D Hendler, P Woelfel Proceedings of the twenty-sixth annual ACM symposium on Principles of …, 2007	36	2007
Strongly linearizable implementations: possibilities and impossibilities M Helmi, L Higham, P Woelfel Proceedings of the 2012 ACM symposium on Principles of Distributed Computing …, 2012	35	2012
An space bound for obstruction-free leader election G Giakkoupis, M Helmi, L Higham, P Woelfel International Symposium on Distributed Computing, 46-60, 2013	33	2013
Tight lower bounds for greedy routing in uniform small world rings M Dietzfelbinger, P Woelfel Proceedings of the 41st annual ACM symposium on Theory of computing, 591-600, 2009	31	2009
Bounds on the OBDD-size of integer multiplication via universal hashing P Woelfel Journal of Computer and System Sciences 71 (4), 520-534, 2005	30	2005
Efficient strongly universal and optimally universal hashing P Woelfel International Symposium on Mathematical Foundations of Computer Science, 262-272, 1999	30	1999
Separating deterministic from randomized multiparty communication complexity P Beame, M David, T Pitassi, P Woelfel Theory of Computing 6 (1), 201-225, 2010	29	2010
A tight RMR lower bound for randomized mutual exclusion G Giakkoupis, P Woelfel Proceedings of the 44th symposium on Theory of Computing, 983-1002, 2012	27	2012
Randomized mutual exclusion with sub-logarithmic RMR-complexity D Hendler, P Woelfel Distributed Computing 24, 3-19, 2011	25	2011
New bounds on the OBDD-size of integer multiplication via universal hashing P Woelfel Annual Symposium on Theoretical Aspects of Computer Science, 563-574, 2001	25	2001

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors