Publications

B. Bashari, A. Jamadi and P. Woelfel. “Efficient bounded timestamping from standard synchronization primitives.” Distributed Comput. 38(3): 297–335 (2025).

F. Naderi-Semiromi and P. Woelfel. “Strongly linearizable LL/SC from CAS.” Proceedings of the 43rd ACM symposium on principles of distributed computing, PODC 2024, nantes, france, june 17-21, 2024 : 443–453. ACM (2024).

D. Bencivenga, G. Giakkoupis and P. Woelfel. “Faster randomized repeated choice and DCAS.” Proceedings of the 43rd ACM symposium on principles of distributed computing, PODC 2024, nantes, france, june 17-21, 2024 : 454–464. ACM (2024).

B. Bashari, D. Y. C. Chan and P. Woelfel. “A fully concurrent adaptive snapshot object for RMWable shared-memory.” 38th international symposium on distributed computing, DISC 2024, october 28 to november 1, 2024, madrid, spain 319: 7:1–7:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2024).

D. Y. C. Chan, G. Giakkoupis and P. Woelfel. “Word-size RMR tradeoffs for recoverable mutual exclusion.” Proceedings of the 2023 ACM symposium on principles of distributed computing, PODC 2023, orlando, FL, USA, june 19-23, 2023 : 79–89. ACM (2023).

B. Bashari, A. Jamadi and P. Woelfel. “Efficient bounded timestamping from standard synchronization primitives.” Proceedings of the 2023 ACM symposium on principles of distributed computing, PODC 2023, orlando, FL, USA, june 19-23, 2023 : 113–123. ACM (2023).

M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler and P. Woelfel. “2022 edsger w. Dijkstra prize in distributed computing.” PODC ’22: ACM symposium on principles of distributed computing, salerno, italy, july 25 - 29, 2022 : 1. ACM (2022).

“PODC ’22: ACM symposium on principles of distributed computing, salerno, italy, july 25 - 29, 2022.” ACM (2022).

F. Ellen, R. Gelashvili, P. Woelfel and L. Zhu. “Space lower bounds for the signal detection problem.” Theory Comput. Syst. 65(4): 687–705 (2021).

S. M. Hwang and P. Woelfel. “Strongly linearizable linked list and queue.” 25th international conference on principles of distributed systems, OPODIS 2021, december 13-15, 2021, strasbourg, france 217: 28:1–28:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021).

D. Y. C. Chan and P. Woelfel. “Tight lower bound for the RMR complexity of recoverable mutual exclusion.” PODC ’21: ACM symposium on principles of distributed computing, virtual event, italy, july 26-30, 2021 : 533–543. ACM (2021).

B. Bashari and P. Woelfel. “An efficient adaptive partial snapshot implementation.” PODC ’21: ACM symposium on principles of distributed computing, virtual event, italy, july 26-30, 2021 : 545–555. ACM (2021).

G. Giakkoupis, M. J. Giv and P. Woelfel. “Efficient randomized DCAS.” STOC ’21: 53rd annual ACM SIGACT symposium on theory of computing, virtual event, italy, june 21-25, 2021 : 1221–1234. ACM (2021).

D. Y. C. Chan and P. Woelfel. “Recoverable mutual exclusion with constant amortized RMR complexity from standard primitives.” PODC ’20: ACM symposium on principles of distributed computing, virtual event, italy, august 3-7, 2020 : 181–190. ACM (2020).

G. Giakkoupis and P. Woelfel. “Efficient randomized test-and-set implementations.” Distributed Comput. 32(6): 565–586 (2019).

P. Woelfel. “Towards a theory of randomized shared memory algorithms.” Proceedings of the 2019 ACM symposium on principles of distributed computing, PODC 2019, toronto, ON, canada, july 29 - august 2, 2019 : 156. ACM (2019).

Z. Aghazadeh, D. Imbs, M. Raynal, G. Taubenfeld and P. Woelfel. “Optimal memory-anonymous symmetric deadlock-free mutual exclusion.” Proceedings of the 2019 ACM symposium on principles of distributed computing, PODC 2019, toronto, ON, canada, july 29 - august 2, 2019 : 157–166. ACM (2019).

S. Ovens and P. Woelfel. “Strongly linearizable implementations of snapshots and other types.” Proceedings of the 2019 ACM symposium on principles of distributed computing, PODC 2019, toronto, ON, canada, july 29 - august 2, 2019 : 197–206. ACM (2019).

F. Ellen, R. Gelashvili, P. Woelfel and L. Zhu. “Space lower bounds for the signal detection problem.” 36th international symposium on theoretical aspects of computer science, STACS 2019, march 13-16, 2019, berlin, germany 126: 26:1–26:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019).

G. Giakkoupis and P. Woelfel. “An improved bound for random binary search trees with concurrent insertions.” 35th symposium on theoretical aspects of computer science, STACS 2018, february 28 to march 3, 2018, caen, france 96: 37:1–37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018).

J. Aspnes, B. Haeupler, A. Tong and P. Woelfel. “Allocate-on-use space complexity of shared-memory algorithms.” 32nd international symposium on distributed computing, DISC 2018, new orleans, LA, USA, october 15-19, 2018 121: 8:1–8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018).

A. Eghbali and P. Woelfel. “An almost tight RMR lower bound for abortable test-and-set.” 32nd international symposium on distributed computing, DISC 2018, new orleans, LA, USA, october 15-19, 2018 121: 21:1–21:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018).

G. Giakkoupis and P. Woelfel. “Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model.” Proceedings of the ACM symposium on principles of distributed computing, PODC 2017, washington, DC, USA, july 25-27, 2017 : 221–229. ACM (2017).

G. Giakkoupis, Y. Nazari and P. Woelfel. “How asynchrony affects rumor spreading time.” Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC 2016, chicago, IL, USA, july 25-28, 2016 : 185–194. ACM (2016).

O. Denysyuk and P. Woelfel. “Are shared objects composable under an oblivious adversary?” Proceedings of the 2016 ACM symposium on principles of distributed computing, PODC 2016, chicago, IL, USA, july 25-28, 2016 : 335–344. ACM (2016).

Z. Aghazadeh and P. Woelfel. “Upper bounds for boundless tagging with bounded objects.” Distributed computing - 30th international symposium, DISC 2016, paris, france, september 27-29, 2016. proceedings 9888: 442–457. Springer (2016).

H. Attiya, D. Hendler and P. Woelfel. “Trading fences with RMRs and separating memory models.” Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC 2015, donostia-san sebastián, spain, july 21 - 23, 2015 : 173–182. ACM (2015).

Z. Aghazadeh and P. Woelfel. “On the time and space complexity of ABA prevention and detection.” Proceedings of the 2015 ACM symposium on principles of distributed computing, PODC 2015, donostia-san sebastián, spain, july 21 - 23, 2015 : 193–202. ACM (2015).

G. Giakkoupis, M. Helmi, L. Higham and P. Woelfel. “Test-and-set in optimal space.” Proceedings of the forty-seventh annual ACM on symposium on theory of computing, STOC 2015, portland, OR, USA, june 14-17, 2015 : 615–623. ACM (2015).

O. Denysyuk and P. Woelfel. “Wait-freedom is harder than lock-freedom under strong linearizability.” Distributed computing - 29th international symposium, DISC 2015, tokyo, japan, october 7-9, 2015, proceedings 9363: 60–74. Springer (2015).

M. Aumüller, M. Dietzfelbinger and P. Woelfel. “Explicit and efficient hash families suffice for cuckoo hashing with a stash.” Algorithmica 70(3): 428–456 (2014).

M. Helmi, L. Higham, E. Pacheco and P. Woelfel. “The space complexity of long-lived and one-shot timestamp implementations.” J. ACM 61(1): 7:1–7:25 (2014).

B. M. Elahi, C. Williamson and P. Woelfel. “Decoupled speed scaling: Analysis and evaluation.” Perform. Evaluation 73: 3–17 (2014).

G. Giakkoupis and P. Woelfel. “Randomized mutual exclusion with constant amortized RMR complexity on the DSM.” 55th IEEE annual symposium on foundations of computer science, FOCS 2014, philadelphia, PA, USA, october 18-21, 2014 : 504–513. IEEE Computer Society (2014).

B. M. Elahi, C. L. Williamson and P. Woelfel. “Turbocharged speed scaling: Analysis and evaluation.” IEEE 22nd international symposium on modelling, analysis & simulation of computer and telecommunication systems, MASCOTS 2014, paris, france, september 9-11, 2014 : 41–50. IEEE Computer Society (2014).

Z. Aghazadeh and P. Woelfel. “Space- and time-efficient long-lived test-and-set objects.” Principles of distributed systems - 18th international conference, OPODIS 2014, cortina d’ampezzo, italy, december 16-19, 2014. proceedings 8878: 404–419. Springer (2014).

Z. Aghazadeh, W. M. Golab and P. Woelfel. “Making objects writable.” ACM symposium on principles of distributed computing, PODC ’14, paris, france, july 15-18, 2014 : 385–395. ACM (2014).

M. Dietzfelbinger and P. Woelfel. “Tight lower bounds for greedy routing in higher-dimensional small-world grids.” Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms, SODA 2014, portland, oregon, USA, january 5-7, 2014 : 816–829. SIAM (2014).

M. Helmi, L. Higham and P. Woelfel. “Space bounds for adaptive renaming.” Distributed computing - 28th international symposium, DISC 2014, austin, TX, USA, october 12-15, 2014. proceedings 8784: 303–317. Springer (2014).

D. Alistarh, J. Aspnes, G. Giakkoupis and P. Woelfel. “Randomized loose renaming in o(log log n) time.” ACM symposium on principles of distributed computing, PODC ’13, montreal, QC, canada, july 22-24, 2013 : 200–209. ACM (2013).

Z. Aghazadeh, W. M. Golab and P. Woelfel. “Brief announcement: Resettable objects and efficient memory reclamation for concurrent algorithms.” ACM symposium on principles of distributed computing, PODC ’13, montreal, QC, canada, july 22-24, 2013 : 322–324. ACM (2013).

G. Giakkoupis, M. Helmi, L. Higham and P. Woelfel. “An o(sqrt n) space bound for obstruction-free leader election.” Distributed computing - 27th international symposium, DISC 2013, jerusalem, israel, october 14-18, 2013. proceedings 8205: 46–60. Springer (2013).

G. Giakkoupis, A.-M. Kermarrec and P. Woelfel. “Gossip protocols for renaming and sorting.” Distributed computing - 27th international symposium, DISC 2013, jerusalem, israel, october 14-18, 2013. proceedings 8205: 194–208. Springer (2013).

F. Ellen and P. Woelfel. “An optimal implementation of fetch-and-increment.” Distributed computing - 27th international symposium, DISC 2013, jerusalem, israel, october 14-18, 2013. proceedings 8205: 284–298. Springer (2013).

W. M. Golab, V. Hadzilacos, D. Hendler and P. Woelfel. “RMR-efficient implementations of comparison primitives using read and write operations.” Distributed Comput. 25(2): 109–162 (2012).

B. M. Elahi, C. Williamson and P. Woelfel. “Meeting the fairness deadline in speed scaling systems: Is turbocharging enough?” SIGMETRICS Perform. Evaluation Rev. 40(3): 89–91 (2012).

M. Aumüller, M. Dietzfelbinger and P. Woelfel. “Explicit and efficient hash families suffice for cuckoo hashing with a stash.” Algorithms - ESA 2012 - 20th annual european symposium, ljubljana, slovenia, september 10-12, 2012. proceedings 7501: 108–120. Springer (2012).

T. Q. Klassen and P. Woelfel. “Independence of tabulation-based hash classes.” LATIN 2012: Theoretical informatics - 10th latin american symposium, arequipa, peru, april 16-20, 2012. proceedings 7256: 506–517. Springer (2012).

G. Giakkoupis and P. Woelfel. “On the time and space complexity of randomized test-and-set.” ACM symposium on principles of distributed computing, PODC ’12, funchal, madeira, portugal, july 16-18, 2012 : 19–28. ACM (2012).

G. Giakkoupis and P. Woelfel. “Brief announcement: A tight RMR lower bound for randomized mutual exclusion.” ACM symposium on principles of distributed computing, PODC ’12, funchal, madeira, portugal, july 16-18, 2012 : 239–240. ACM (2012).

M. Helmi, L. Higham and P. Woelfel. “Strongly linearizable implementations: Possibilities and impossibilities.” ACM symposium on principles of distributed computing, PODC ’12, funchal, madeira, portugal, july 16-18, 2012 : 385–394. ACM (2012).

B. M. Elahi, C. Williamson and P. Woelfel. “Decoupled speed scaling: Analysis and evaluation.” Ninth international conference on quantitative evaluation of systems, QEST 2012, london, united kingdom, september 17-20, 2012 : 2–12. IEEE Computer Society (2012).

G. Giakkoupis, T. Sauerwald, H. Sun and P. Woelfel. “Low randomness rumor spreading via hashing.” 29th international symposium on theoretical aspects of computer science, STACS 2012, february 29th - march 3rd, 2012, paris, france 14: 314–325. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012).

G. Giakkoupis and P. Woelfel. “A tight RMR lower bound for randomized mutual exclusion.” Proceedings of the 44th symposium on theory of computing conference, STOC 2012, new york, NY, USA, may 19 - 22, 2012 : 983–1002. ACM (2012).

F. Ellen, V. Ramachandran and P. Woelfel. “Efficient fetch-and-increment.” Distributed computing - 26th international symposium, DISC 2012, salvador, brazil, october 16-18, 2012. proceedings 7611: 16–30. Springer (2012).

A. Pareek and P. Woelfel. “RMR-efficient randomized abortable mutual exclusion - (extended abstract).” Distributed computing - 26th international symposium, DISC 2012, salvador, brazil, october 16-18, 2012. proceedings 7611: 267–281. Springer (2012).

M. Dietzfelbinger, J. E. Rowe, I. Wegener and P. Woelfel. “Precision, local search and unimodal functions.” Algorithmica 59(3): 301–322 (2011).

D. Hendler and P. Woelfel. “Randomized mutual exclusion with sub-logarithmic RMR-complexity.” Distributed Comput. 24(1): 3–19 (2011).

A. Brodsky, F. Ellen and P. Woelfel. “Fully-adaptive algorithms for long-lived renaming.” Distributed Comput. 24(2): 119–134 (2011).

M. Helmi, L. Higham, E. Pacheco and P. Woelfel. “The space complexity of long-lived and one-shot timestamp implementations.” Proceedings of the 30th annual ACM symposium on principles of distributed computing, PODC 2011, san jose, CA, USA, june 6-8, 2011 : 139–148. ACM (2011).

G. Giakkoupis and P. Woelfel. “On the randomness requirements of rumor spreading.” Proceedings of the twenty-second annual ACM-SIAM symposium on discrete algorithms, SODA 2011, san francisco, california, USA, january 23-25, 2011 : 449–461. SIAM (2011).

W. M. Golab, L. Higham and P. Woelfel. “Linearizable implementations do not suffice for randomized distributed computation.” Proceedings of the 43rd ACM symposium on theory of computing, STOC 2011, san jose, CA, USA, 6-8 june 2011 : 373–382. ACM (2011).

M. Dietzfelbinger, J. E. Rowe, I. Wegener and P. Woelfel. “Tight bounds for blind search on the integers and the reals.” Comb. Probab. Comput. 19(5-6): 711–728 (2010).

W. M. Golab, D. Hendler and P. Woelfel. “An O(1) RMRs leader election algorithm.” SIAM J. Comput. 39(7): 2726–2760 (2010).

P. Beame, M. David, T. Pitassi and P. Woelfel. “Separating deterministic from randomized multiparty communication complexity.” Theory Comput. 6(1): 201–225 (2010).

D. Hendler and P. Woelfel. “Adaptive randomized mutual exclusion in sub-logarithmic expected time.” Proceedings of the 29th annual ACM symposium on principles of distributed computing, PODC 2010, zurich, switzerland, july 25-28, 2010 : 141–150. ACM (2010).

R. Nunkesser and P. Woelfel. “Representation of graphs by OBDDs.” Discret. Appl. Math. 157(2): 247–261 (2009).

D. Hendler and P. Woelfel. “Randomized mutual exclusion in o(log N / log log N) RMRs.” Proceedings of the 28th annual ACM symposium on principles of distributed computing, PODC 2009, calgary, alberta, canada, august 10-12, 2009 : 26–35. ACM (2009).

M. Dietzfelbinger and P. Woelfel. “Brief announcement: Tight lower bounds for greedy routing in uniform small world rings.” Proceedings of the 28th annual ACM symposium on principles of distributed computing, PODC 2009, calgary, alberta, canada, august 10-12, 2009 : 300–301. ACM (2009).

M. Dietzfelbinger and P. Woelfel. “Tight lower bounds for greedy routing in uniform small world rings.” Proceedings of the 41st annual ACM symposium on theory of computing, STOC 2009, bethesda, MD, USA, may 31 - june 2, 2009 : 591–600. ACM (2009).

M. Dietzfelbinger, J. E. Rowe, I. Wegener and P. Woelfel. “Precision, local search and unimodal functions.” Genetic and evolutionary computation conference, GECCO 2008, proceedings, atlanta, GA, USA, july 12-16, 2008 : 771–778. ACM (2008).

H. Attiya, D. Hendler and P. Woelfel. “Tight RMR lower bounds for mutual exclusion and other problems.” Proceedings of the twenty-seventh annual ACM symposium on principles of distributed computing, PODC 2008, toronto, canada, august 18-21, 2008 : 447. ACM (2008).

M. Dietzfelbinger, J. E. Rowe, I. Wegener and P. Woelfel. “Tight bounds for blind search on the integers.” STACS 2008, 25th annual symposium on theoretical aspects of computer science, bordeaux, france, february 21-23, 2008, proceedings 1: 241–252. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany (2008).

H. Attiya, D. Hendler and P. Woelfel. “Tight rmr lower bounds for mutual exclusion and other problems.” Proceedings of the 40th annual ACM symposium on theory of computing, victoria, british columbia, canada, may 17-20, 2008 : 217–226. ACM (2008).

I. Wegener and P. Woelfel. “New results on the complexity of the middle bit of multiplication.” Comput. Complex. 16(3): 298–323 (2007).

P. Beame, M. David, T. Pitassi and P. Woelfel. “Separating deterministic from nondeterministic NOF multiparty communication complexity.” Automata, languages and programming, 34th international colloquium, ICALP 2007, wroclaw, poland, july 9-13, 2007, proceedings 4596: 134–145. Springer (2007).

W. M. Golab, V. Hadzilacos, D. Hendler and P. Woelfel. “Constant-RMR implementations of CAS and other synchronization primitives using read and write operations.” Proceedings of the twenty-sixth annual ACM symposium on principles of distributed computing, PODC 2007, portland, oregon, USA, august 12-15, 2007 : 3–12. ACM (2007).

P. Woelfel. “Symbolic topological sorting with OBDDs.” J. Discrete Algorithms 4(1): 51–71 (2006).

B. Bollig, S. Waack and P. 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).

P. 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).

P. Woelfel. “Maintaining external memory efficient hash tables.” Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006 and 10th international workshop on randomization and computation, RANDOM 2006, barcelona, spain, august 28-30 2006, proceedings 4110: 508–519. Springer (2006).

W. M. Golab, D. Hendler and P. Woelfel. “An o(1) RMRs leader election algorithm.” Proceedings of the twenty-fifth annual ACM symposium on principles of distributed computing, PODC 2006, denver, CO, USA, july 23-26, 2006 : 238–247. ACM (2006).

P. Woelfel. “Asymmetric balanced allocation with simple hash functions.” Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, miami, florida, USA, january 22-26, 2006 : 424–433. ACM Press (2006).

A. Brodsky, F. Ellen and P. Woelfel. “Fully-adaptive algorithms for long-lived renaming.” Distributed computing, 20th international symposium, DISC 2006, stockholm, sweden, september 18-20, 2006, proceedings 4167: 413–427. Springer (2006).

P. Woelfel. “Bounds on the OBDD-size of integer multiplication via universal hashing.” J. Comput. Syst. Sci. 71(4): 520–534 (2005).

B. Bollig and P. Woelfel. “A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications.” Theory Comput. Syst. 38(6): 671–685 (2005).

I. Wegener and P. Woelfel. “New results on the complexity of the middle bit of multiplication.” 20th annual IEEE conference on computational complexity (CCC 2005), 11-15 june 2005, san jose, CA, USA : 100–110. IEEE Computer Society (2005).

R. Nunkesser and P. Woelfel. “Representation of graphs by OBDDs.” Algorithms and computation, 16th international symposium, ISAAC 2005, sanya, hainan, china, december 19-21, 2005, proceedings 3827: 1132–1142. Springer (2005).

P. Woelfel. “A construction method for optimally universal hash families and its consequences for the existence of RBIBDs.” Computing and combinatorics, 10th annual international conference, COCOON 2004, jeju island, korea, august 17-20, 2004, proceedings 3106: 23–32. Springer (2004).

P. Wölfel. “Über die komplexität der multiplikation in eingeschränkten branchingprogrammmodellen.” Technical University of Dortmund, Germany (2003).

P. Woelfel. “Symbolic topological sorting with OBDDS.” Mathematical foundations of computer science 2003, 28th international symposium, MFCS 2003, bratislava, slovakia, august 25-29, 2003, proceedings 2747: 671–680. Springer (2003).

M. Sauerhoff and P. Woelfel. “Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions.” Proceedings of the 35th annual ACM symposium on theory of computing, june 9-11, 2003, san diego, CA, USA : 186–195. ACM (2003).

M. Dietzfelbinger and P. Woelfel. “Almost random graphs with simple hash functions.” Proceedings of the 35th annual ACM symposium on theory of computing, june 9-11, 2003, san diego, CA, USA : 629–638. ACM (2003).

P. Wölfel. “Multiplikation in eingeschränkten branchingprogrammmodellen.” Ausgezeichnete informatikdissertationen 2003 D-4: 199–208. GI (2003).

P. Woelfel. “On the complexity of integer multiplication in branching programs with multiple tests and in read-once branching programs with limited nondeterminism.” Proceedings of the 17th annual IEEE conference on computational complexity, montréal, québec, canada, may 21-24, 2002 : 80–89. IEEE Computer Society (2002).

B. Bollig, S. Waack and P. Woelfel. “Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication.” Foundations of information technology in the era of networking and mobile computing, IFIP 17\({}^{\mbox{th}}\) world computer congress - TC1 stream / 2\({}^{\mbox{nd}}\) IFIP international conference on theoretical computer science (TCS 2002), august 25-30, 2002, montréal, québec, canada 223: 83–94. Kluwer (2002).

B. Bollig and P. Woelfel. “A lower bound technique for nondeterministic graph-driven read-once-branching programs and its applications.” Mathematical foundations of computer science 2002, 27th international symposium, MFCS 2002, warsaw, poland, august 26-30, 2002, proceedings 2420: 131–142. Springer (2002).

P. Woelfel. “A lower bound technique for restricted branching programs and applications.” STACS 2002, 19th annual symposium on theoretical aspects of computer science, antibes - juan les pins, france, march 14-16, 2002, proceedings 2285: 431–442. Springer (2002).

P. Woelfel. “New bounds on the OBDD-size of integer multiplication via universal hashing.” STACS 2001, 18th annual symposium on theoretical aspects of computer science, dresden, germany, february 15-17, 2001, proceedings 2010: 563–574. Springer (2001).

B. Bollig and P. Woelfel. “A read-once branching program lower bound of omega(2\({}^{\mbox{n/4}}\)) for integer multiplication using universal.” Proceedings on 33rd annual ACM symposium on theory of computing, july 6-8, 2001, heraklion, crete, greece : 419–424. ACM (2001).

P. Woelfel. “Efficient strongly universal and optimally universal hashing.” Mathematical foundations of computer science 1999, 24th international symposium, MFCS’99, szklarska poreba, poland, september 6-10, 1999, proceedings 1672: 262–272. Springer (1999).