| Almost random graphs with simple hash functions M Dietzfelbinger, P Woelfel Proceedings of the thirty-fifth Annual ACM Symposium on Theory of Computing …, 2003 | 99 | 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 | 87 | 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 |
| 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 |
| How asynchrony affects rumor spreading time G Giakkoupis, Y Nazari, P Woelfel Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 35 | 2016 |
| An space bound for obstruction-free leader election G Giakkoupis, M Helmi, L Higham, P Woelfel International Symposium on Distributed Computing, 46-60, 2013 | 32 | 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 |
| Strongly linearizable implementations: possibilities and impossibilities M Helmi, L Higham, P Woelfel Proceedings of the 2012 ACM symposium on Principles of Distributed Computing …, 2012 | 29 | 2012 |
| 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 |
| Separating deterministic from randomized multiparty communication complexity P Beame, M David, T Pitassi, P Woelfel Theory of Computing 6 (1), 201-225, 2010 | 27 | 2010 |
| 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 |
George GiakkoupisResearcher, INRIA Rennes, France在 inria.fr 的电子邮件经过验证
