Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Philipp Woelfel
@inproceedings{DBLP:conf/podc/ChanGW23,
author = {David Yu Cheng Chan and
George Giakkoupis and
Philipp Woelfel},
editor = {Rotem Oshman and
Alexandre Nolin and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Alkida Balliu},
title = {Word-Size {RMR} Tradeoffs for Recoverable Mutual Exclusion},
booktitle = {Proceedings of the 2023 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2023, Orlando, FL, USA, June 19-23, 2023},
pages = {79--89},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583668.3594597},
doi = {10.1145/3583668.3594597},
timestamp = {Fri, 07 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/ChanGW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BashariJW23,
author = {Benyamin Bashari and
Ali Jamadi and
Philipp Woelfel},
editor = {Rotem Oshman and
Alexandre Nolin and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Alkida Balliu},
title = {Efficient Bounded Timestamping from Standard Synchronization Primitives},
booktitle = {Proceedings of the 2023 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2023, Orlando, FL, USA, June 19-23, 2023},
pages = {113--123},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3583668.3594601},
doi = {10.1145/3583668.3594601},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/BashariJW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AguilieraRSPSW22,
author = {Marcos Aguiliera and
Andr{\'{e}}a W. Richa and
Alexander A. Schwarzmann and
Alessandro Panconesi and
Christian Scheideler and
Philipp Woelfel},
editor = {Alessia Milani and
Philipp Woelfel},
title = {2022 Edsger W. Dijkstra Prize in Distributed Computing},
booktitle = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing,
Salerno, Italy, July 25 - 29, 2022},
pages = {1},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519270.3538411},
doi = {10.1145/3519270.3538411},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AguilieraRSPSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/podc/2022,
editor = {Alessia Milani and
Philipp Woelfel},
title = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing,
Salerno, Italy, July 25 - 29, 2022},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519270},
doi = {10.1145/3519270},
isbn = {978-1-4503-9262-4},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EllenGWZ21,
author = {Faith Ellen and
Rati Gelashvili and
Philipp Woelfel and
Leqi Zhu},
title = {Space Lower Bounds for the Signal Detection Problem},
journal = {Theory Comput. Syst.},
volume = {65},
number = {4},
pages = {687--705},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-09993-6},
doi = {10.1007/S00224-020-09993-6},
timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EllenGWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/HwangW21,
author = {Steven Munsu Hwang and
Philipp Woelfel},
editor = {Quentin Bramas and
Vincent Gramoli and
Alessia Milani},
title = {Strongly Linearizable Linked List and Queue},
booktitle = {25th International Conference on Principles of Distributed Systems,
{OPODIS} 2021, December 13-15, 2021, Strasbourg, France},
series = {LIPIcs},
volume = {217},
pages = {28:1--28:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.OPODIS.2021.28},
doi = {10.4230/LIPICS.OPODIS.2021.28},
timestamp = {Mon, 28 Feb 2022 16:25:59 +0100},
biburl = {https://dblp.org/rec/conf/opodis/HwangW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ChanW21,
author = {David Yu Cheng Chan and
Philipp Woelfel},
editor = {Avery Miller and
Keren Censor{-}Hillel and
Janne H. Korhonen},
title = {Tight Lower Bound for the {RMR} Complexity of Recoverable Mutual Exclusion},
booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, July 26-30, 2021},
pages = {533--543},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3465084.3467938},
doi = {10.1145/3465084.3467938},
timestamp = {Mon, 26 Jul 2021 09:04:22 +0200},
biburl = {https://dblp.org/rec/conf/podc/ChanW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BashariW21,
author = {Benyamin Bashari and
Philipp Woelfel},
editor = {Avery Miller and
Keren Censor{-}Hillel and
Janne H. Korhonen},
title = {An Efficient Adaptive Partial Snapshot Implementation},
booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, July 26-30, 2021},
pages = {545--555},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3465084.3467939},
doi = {10.1145/3465084.3467939},
timestamp = {Mon, 26 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/BashariW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GiakkoupisGW21,
author = {George Giakkoupis and
Mehrdad Jafari Giv and
Philipp Woelfel},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Efficient randomized {DCAS}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1221--1234},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451133},
doi = {10.1145/3406325.3451133},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GiakkoupisGW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-03185,
author = {David Yu Cheng Chan and
Philipp Woelfel},
title = {Tight Lower Bounds for the {RMR} Complexity of Recoverable Mutual
Exclusion},
journal = {CoRR},
volume = {abs/2106.03185},
year = {2021},
url = {https://arxiv.org/abs/2106.03185},
eprinttype = {arXiv},
eprint = {2106.03185},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-03185.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/ChanW20,
author = {David Yu Cheng Chan and
Philipp Woelfel},
editor = {Yuval Emek and
Christian Cachin},
title = {Recoverable Mutual Exclusion with Constant Amortized {RMR} Complexity
from Standard Primitives},
booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,
Virtual Event, Italy, August 3-7, 2020},
pages = {181--190},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3382734.3405736},
doi = {10.1145/3382734.3405736},
timestamp = {Tue, 04 Aug 2020 16:04:51 +0200},
biburl = {https://dblp.org/rec/conf/podc/ChanW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/GiakkoupisW19,
author = {George Giakkoupis and
Philipp Woelfel},
title = {Efficient randomized test-and-set implementations},
journal = {Distributed Comput.},
volume = {32},
number = {6},
pages = {565--586},
year = {2019},
url = {https://doi.org/10.1007/s00446-019-00349-z},
doi = {10.1007/S00446-019-00349-Z},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/GiakkoupisW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/Woelfel19,
author = {Philipp Woelfel},
editor = {Peter Robinson and
Faith Ellen},
title = {Towards a Theory of Randomized Shared Memory Algorithms},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {156},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3338838},
doi = {10.1145/3293611.3338838},
timestamp = {Fri, 19 Jul 2019 08:02:49 +0200},
biburl = {https://dblp.org/rec/conf/podc/Woelfel19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AghazadehIRTW19,
author = {Zahra Aghazadeh and
Damien Imbs and
Michel Raynal and
Gadi Taubenfeld and
Philipp Woelfel},
editor = {Peter Robinson and
Faith Ellen},
title = {Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {157--166},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3331594},
doi = {10.1145/3293611.3331594},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/AghazadehIRTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/OvensW19,
author = {Sean Ovens and
Philipp Woelfel},
editor = {Peter Robinson and
Faith Ellen},
title = {Strongly Linearizable Implementations of Snapshots and Other Types},
booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019},
pages = {197--206},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3293611.3331632},
doi = {10.1145/3293611.3331632},
timestamp = {Fri, 19 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/OvensW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EllenGWZ19,
author = {Faith Ellen and
Rati Gelashvili and
Philipp Woelfel and
Leqi Zhu},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Space Lower Bounds for the Signal Detection Problem},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {26:1--26:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.26},
doi = {10.4230/LIPICS.STACS.2019.26},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/EllenGWZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04002,
author = {George Giakkoupis and
Philipp Woelfel},
title = {Efficient Randomized Test-And-Set Implementations},
journal = {CoRR},
volume = {abs/1902.04002},
year = {2019},
url = {http://arxiv.org/abs/1902.04002},
eprinttype = {arXiv},
eprint = {1902.04002},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-04002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-10826,
author = {Sean Ovens and
Philipp Woelfel},
title = {Strongly Linearizable Implementations of Snapshots and Other Types},
journal = {CoRR},
volume = {abs/1908.10826},
year = {2019},
url = {http://arxiv.org/abs/1908.10826},
eprinttype = {arXiv},
eprint = {1908.10826},
timestamp = {Thu, 29 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-10826.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GiakkoupisW18,
author = {George Giakkoupis and
Philipp Woelfel},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {An Improved Bound for Random Binary Search Trees with Concurrent Insertions},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {37:1--37:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.37},
doi = {10.4230/LIPICS.STACS.2018.37},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GiakkoupisW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AspnesHTW18,
author = {James Aspnes and
Bernhard Haeupler and
Alexander Tong and
Philipp Woelfel},
editor = {Ulrich Schmid and
Josef Widder},
title = {Allocate-On-Use Space Complexity of Shared-Memory Algorithms},
booktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018,
New Orleans, LA, USA, October 15-19, 2018},
series = {LIPIcs},
volume = {121},
pages = {8:1--8:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.DISC.2018.8},
doi = {10.4230/LIPICS.DISC.2018.8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wdag/AspnesHTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EghbaliW18,
author = {Aryaz Eghbali and
Philipp Woelfel},
editor = {Ulrich Schmid and
Josef Widder},
title = {An Almost Tight {RMR} Lower Bound for Abortable Test-And-Set},
booktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018,
New Orleans, LA, USA, October 15-19, 2018},
series = {LIPIcs},
volume = {121},
pages = {21:1--21:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.DISC.2018.21},
doi = {10.4230/LIPICS.DISC.2018.21},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/EghbaliW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-04840,
author = {Aryaz Eghbali and
Philipp Woelfel},
title = {An Almost Tight {RMR} Lower Bound for Abortable Test-And-Set},
journal = {CoRR},
volume = {abs/1805.04840},
year = {2018},
url = {http://arxiv.org/abs/1805.04840},
eprinttype = {arXiv},
eprint = {1805.04840},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-04840.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-03723,
author = {Zahra Aghazadeh and
Damien Imbs and
Michel Raynal and
Gadi Taubenfeld and
Philipp Woelfel},
title = {Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion},
journal = {CoRR},
volume = {abs/1810.03723},
year = {2018},
url = {http://arxiv.org/abs/1810.03723},
eprinttype = {arXiv},
eprint = {1810.03723},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-03723.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GiakkoupisW17,
author = {George Giakkoupis and
Philipp Woelfel},
editor = {Elad Michael Schiller and
Alexander A. Schwarzmann},
title = {Randomized Abortable Mutual Exclusion with Constant Amortized {RMR}
Complexity on the {CC} Model},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,
{PODC} 2017, Washington, DC, USA, July 25-27, 2017},
pages = {221--229},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3087801.3087837},
doi = {10.1145/3087801.3087837},
timestamp = {Tue, 06 Nov 2018 11:07:18 +0100},
biburl = {https://dblp.org/rec/conf/podc/GiakkoupisW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GiakkoupisNW16,
author = {George Giakkoupis and
Yasamin Nazari and
Philipp Woelfel},
editor = {George Giakkoupis},
title = {How Asynchrony Affects Rumor Spreading Time},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {185--194},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933117},
doi = {10.1145/2933057.2933117},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/GiakkoupisNW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DenysyukW16,
author = {Oksana Denysyuk and
Philipp Woelfel},
editor = {George Giakkoupis},
title = {Are Shared Objects Composable under an Oblivious Adversary?},
booktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
pages = {335--344},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933057.2933115},
doi = {10.1145/2933057.2933115},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/DenysyukW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/AghazadehW16,
author = {Zahra Aghazadeh and
Philipp Woelfel},
editor = {Cyril Gavoille and
David Ilcinkas},
title = {Upper Bounds for Boundless Tagging with Bounded Objects},
booktitle = {Distributed Computing - 30th International Symposium, {DISC} 2016,
Paris, France, September 27-29, 2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9888},
pages = {442--457},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53426-7\_32},
doi = {10.1007/978-3-662-53426-7\_32},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/AghazadehW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HelmiHW16,
author = {Maryam Helmi and
Lisa Higham and
Philipp Woelfel},
title = {Space Bounds for Adaptive Renaming},
journal = {CoRR},
volume = {abs/1603.04067},
year = {2016},
url = {http://arxiv.org/abs/1603.04067},
eprinttype = {arXiv},
eprint = {1603.04067},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HelmiHW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GiakkoupisHHW16,
author = {George Giakkoupis and
Maryam Helmi and
Lisa Higham and
Philipp Woelfel},
title = {Deterministic and Fast Randomized Test-and-Set in Optimal Space},
journal = {CoRR},
volume = {abs/1608.06033},
year = {2016},
url = {http://arxiv.org/abs/1608.06033},
eprinttype = {arXiv},
eprint = {1608.06033},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GiakkoupisHHW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AumullerDW16,
author = {Martin Aum{\"{u}}ller and
Martin Dietzfelbinger and
Philipp Woelfel},
title = {A Simple Hash Class with Strong Randomness Properties in Graphs and
Hypergraphs},
journal = {CoRR},
volume = {abs/1611.00029},
year = {2016},
url = {http://arxiv.org/abs/1611.00029},
eprinttype = {arXiv},
eprint = {1611.00029},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AumullerDW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AttiyaHW15,
author = {Hagit Attiya and
Danny Hendler and
Philipp Woelfel},
editor = {Chryssis Georgiou and
Paul G. Spirakis},
title = {Trading Fences with RMRs and Separating Memory Models},
booktitle = {Proceedings of the 2015 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2015, Donostia-San Sebasti{\'{a}}n, Spain,
July 21 - 23, 2015},
pages = {173--182},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2767386.2767427},
doi = {10.1145/2767386.2767427},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/podc/AttiyaHW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AghazadehW15,
author = {Zahra Aghazadeh and
Philipp Woelfel},
editor = {Chryssis Georgiou and
Paul G. Spirakis},
title = {On the Time and Space Complexity of {ABA} Prevention and Detection},
booktitle = {Proceedings of the 2015 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2015, Donostia-San Sebasti{\'{a}}n, Spain,
July 21 - 23, 2015},
pages = {193--202},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2767386.2767403},
doi = {10.1145/2767386.2767403},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AghazadehW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GiakkoupisHHW15,
author = {George Giakkoupis and
Maryam Helmi and
Lisa Higham and
Philipp Woelfel},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Test-and-Set in Optimal Space},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {615--623},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746627},
doi = {10.1145/2746539.2746627},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GiakkoupisHHW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/DenysyukW15,
author = {Oksana Denysyuk and
Philipp Woelfel},
editor = {Yoram Moses},
title = {Wait-Freedom is Harder Than Lock-Freedom Under Strong Linearizability},
booktitle = {Distributed Computing - 29th International Symposium, {DISC} 2015,
Tokyo, Japan, October 7-9, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9363},
pages = {60--74},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48653-5\_5},
doi = {10.1007/978-3-662-48653-5\_5},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/DenysyukW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AghazadehW15,
author = {Zahra Aghazadeh and
Philipp Woelfel},
title = {On the Time and Space Complexity of {ABA} Prevention and Detection},
journal = {CoRR},
volume = {abs/1507.02722},
year = {2015},
url = {http://arxiv.org/abs/1507.02722},
eprinttype = {arXiv},
eprint = {1507.02722},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AghazadehW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AumullerDW14,
author = {Martin Aum{\"{u}}ller and
Martin Dietzfelbinger and
Philipp Woelfel},
title = {Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with
a Stash},
journal = {Algorithmica},
volume = {70},
number = {3},
pages = {428--456},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9840-x},
doi = {10.1007/S00453-013-9840-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AumullerDW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HelmiHPW14,
author = {Maryam Helmi and
Lisa Higham and
Eduardo Pacheco and
Philipp Woelfel},
title = {The Space Complexity of Long-Lived and One-Shot Timestamp Implementations},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {7:1--7:25},
year = {2014},
url = {https://doi.org/10.1145/2559904},
doi = {10.1145/2559904},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HelmiHPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pe/ElahiWW14,
author = {B. Maryam Elahi and
Carey Williamson and
Philipp Woelfel},
title = {Decoupled speed scaling: Analysis and evaluation},
journal = {Perform. Evaluation},
volume = {73},
pages = {3--17},
year = {2014},
url = {https://doi.org/10.1016/j.peva.2013.04.002},
doi = {10.1016/J.PEVA.2013.04.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pe/ElahiWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GiakkoupisW14,
author = {George Giakkoupis and
Philipp Woelfel},
title = {Randomized Mutual Exclusion with Constant Amortized {RMR} Complexity
on the {DSM}},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {504--513},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.60},
doi = {10.1109/FOCS.2014.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GiakkoupisW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mascots/ElahiWW14,
author = {B. Maryam Elahi and
Carey L. Williamson and
Philipp Woelfel},
title = {Turbocharged Speed Scaling: Analysis and Evaluation},
booktitle = {{IEEE} 22nd International Symposium on Modelling, Analysis {\&}
Simulation of Computer and Telecommunication Systems, {MASCOTS} 2014,
Paris, France, September 9-11, 2014},
pages = {41--50},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/MASCOTS.2014.14},
doi = {10.1109/MASCOTS.2014.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mascots/ElahiWW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/AghazadehW14,
author = {Zahra Aghazadeh and
Philipp Woelfel},
editor = {Marcos K. Aguilera and
Leonardo Querzoni and
Marc Shapiro},
title = {Space- and Time-Efficient Long-Lived Test-And-Set Objects},
booktitle = {Principles of Distributed Systems - 18th International Conference,
{OPODIS} 2014, Cortina d'Ampezzo, Italy, December 16-19, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8878},
pages = {404--419},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-14472-6\_27},
doi = {10.1007/978-3-319-14472-6\_27},
timestamp = {Mon, 15 Jun 2020 17:10:01 +0200},
biburl = {https://dblp.org/rec/conf/opodis/AghazadehW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AghazadehGW13a,
author = {Zahra Aghazadeh and
Wojciech M. Golab and
Philipp Woelfel},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Shlomi Dolev},
title = {Making objects writable},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '14,
Paris, France, July 15-18, 2014},
pages = {385--395},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2611462.2611483},
doi = {10.1145/2611462.2611483},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AghazadehGW13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DietzfelbingerW14,
author = {Martin Dietzfelbinger and
Philipp Woelfel},
editor = {Chandra Chekuri},
title = {Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World
Grids},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {816--829},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.60},
doi = {10.1137/1.9781611973402.60},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/DietzfelbingerW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/HelmiHW14,
author = {Maryam Helmi and
Lisa Higham and
Philipp Woelfel},
editor = {Fabian Kuhn},
title = {Space Bounds for Adaptive Renaming},
booktitle = {Distributed Computing - 28th International Symposium, {DISC} 2014,
Austin, TX, USA, October 12-15, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8784},
pages = {303--317},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-45174-8\_21},
doi = {10.1007/978-3-662-45174-8\_21},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/HelmiHW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AlistarhAGW13,
author = {Dan Alistarh and
James Aspnes and
George Giakkoupis and
Philipp Woelfel},
editor = {Panagiota Fatourou and
Gadi Taubenfeld},
title = {Randomized loose renaming in \emph{O}(log log \emph{n}) time},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '13,
Montreal, QC, Canada, July 22-24, 2013},
pages = {200--209},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2484239.2484240},
doi = {10.1145/2484239.2484240},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AlistarhAGW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AghazadehGW13,
author = {Zahra Aghazadeh and
Wojciech M. Golab and
Philipp Woelfel},
editor = {Panagiota Fatourou and
Gadi Taubenfeld},
title = {Brief announcement: resettable objects and efficient memory reclamation
for concurrent algorithms},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '13,
Montreal, QC, Canada, July 22-24, 2013},
pages = {322--324},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2484239.2484286},
doi = {10.1145/2484239.2484286},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AghazadehGW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/GiakkoupisHHW13,
author = {George Giakkoupis and
Maryam Helmi and
Lisa Higham and
Philipp Woelfel},
editor = {Yehuda Afek},
title = {An O(sqrt n) Space Bound for Obstruction-Free Leader Election},
booktitle = {Distributed Computing - 27th International Symposium, {DISC} 2013,
Jerusalem, Israel, October 14-18, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8205},
pages = {46--60},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41527-2\_4},
doi = {10.1007/978-3-642-41527-2\_4},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/GiakkoupisHHW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/GiakkoupisKW13,
author = {George Giakkoupis and
Anne{-}Marie Kermarrec and
Philipp Woelfel},
editor = {Yehuda Afek},
title = {Gossip Protocols for Renaming and Sorting},
booktitle = {Distributed Computing - 27th International Symposium, {DISC} 2013,
Jerusalem, Israel, October 14-18, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8205},
pages = {194--208},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41527-2\_14},
doi = {10.1007/978-3-642-41527-2\_14},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/GiakkoupisKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EllenW13,
author = {Faith Ellen and
Philipp Woelfel},
editor = {Yehuda Afek},
title = {An Optimal Implementation of Fetch-and-Increment},
booktitle = {Distributed Computing - 27th International Symposium, {DISC} 2013,
Jerusalem, Israel, October 14-18, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8205},
pages = {284--298},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-41527-2\_20},
doi = {10.1007/978-3-642-41527-2\_20},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/EllenW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-1295,
author = {Martin Dietzfelbinger and
Philipp Woelfel},
title = {Tight Lower Bounds for Greedy Routing in Higher-Dimensional Small-World
Grids},
journal = {CoRR},
volume = {abs/1305.1295},
year = {2013},
url = {http://arxiv.org/abs/1305.1295},
eprinttype = {arXiv},
eprint = {1305.1295},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-1295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/GolabHHW12,
author = {Wojciech M. Golab and
Vassos Hadzilacos and
Danny Hendler and
Philipp Woelfel},
title = {RMR-efficient implementations of comparison primitives using read
and write operations},
journal = {Distributed Comput.},
volume = {25},
number = {2},
pages = {109--162},
year = {2012},
url = {https://doi.org/10.1007/s00446-011-0150-8},
doi = {10.1007/S00446-011-0150-8},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/GolabHHW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmetrics/ElahiWW12,
author = {B. Maryam Elahi and
Carey Williamson and
Philipp Woelfel},
title = {Meeting the fairness deadline in speed scaling systems: is turbocharging
enough?},
journal = {{SIGMETRICS} Perform. Evaluation Rev.},
volume = {40},
number = {3},
pages = {89--91},
year = {2012},
url = {https://doi.org/10.1145/2425248.2425272},
doi = {10.1145/2425248.2425272},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigmetrics/ElahiWW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AumullerDW12,
author = {Martin Aum{\"{u}}ller and
Martin Dietzfelbinger and
Philipp Woelfel},
editor = {Leah Epstein and
Paolo Ferragina},
title = {Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with
a Stash},
booktitle = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
Slovenia, September 10-12, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7501},
pages = {108--120},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33090-2\_11},
doi = {10.1007/978-3-642-33090-2\_11},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/AumullerDW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/KlassenW12,
author = {Toryn Qwyllyn Klassen and
Philipp Woelfel},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Independence of Tabulation-Based Hash Classes},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {506--517},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_43},
doi = {10.1007/978-3-642-29344-3\_43},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/KlassenW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GiakkoupisW12,
author = {George Giakkoupis and
Philipp Woelfel},
editor = {Darek Kowalski and
Alessandro Panconesi},
title = {On the time and space complexity of randomized test-and-set},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '12,
Funchal, Madeira, Portugal, July 16-18, 2012},
pages = {19--28},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2332432.2332436},
doi = {10.1145/2332432.2332436},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GiakkoupisW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GiakkoupisW12a,
author = {George Giakkoupis and
Philipp Woelfel},
editor = {Darek Kowalski and
Alessandro Panconesi},
title = {Brief announcement: a tight {RMR} lower bound for randomized mutual
exclusion},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '12,
Funchal, Madeira, Portugal, July 16-18, 2012},
pages = {239--240},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2332432.2332479},
doi = {10.1145/2332432.2332479},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GiakkoupisW12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/HelmiHW12,
author = {Maryam Helmi and
Lisa Higham and
Philipp Woelfel},
editor = {Darek Kowalski and
Alessandro Panconesi},
title = {Strongly linearizable implementations: possibilities and impossibilities},
booktitle = {{ACM} Symposium on Principles of Distributed Computing, {PODC} '12,
Funchal, Madeira, Portugal, July 16-18, 2012},
pages = {385--394},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2332432.2332508},
doi = {10.1145/2332432.2332508},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/HelmiHW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/qest/ElahiWW12,
author = {B. Maryam Elahi and
Carey Williamson and
Philipp Woelfel},
title = {Decoupled Speed Scaling: Analysis and Evaluation},
booktitle = {Ninth International Conference on Quantitative Evaluation of Systems,
{QEST} 2012, London, United Kingdom, September 17-20, 2012},
pages = {2--12},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/QEST.2012.35},
doi = {10.1109/QEST.2012.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/qest/ElahiWW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GiakkoupisSSW12,
author = {George Giakkoupis and
Thomas Sauerwald and
He Sun and
Philipp Woelfel},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Low Randomness Rumor Spreading via Hashing},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {314--325},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.314},
doi = {10.4230/LIPICS.STACS.2012.314},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GiakkoupisSSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GiakkoupisW12,
author = {George Giakkoupis and
Philipp Woelfel},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {A tight {RMR} lower bound for randomized mutual exclusion},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {983--1002},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214066},
doi = {10.1145/2213977.2214066},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GiakkoupisW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/EllenRW12,
author = {Faith Ellen and
Vijaya Ramachandran and
Philipp Woelfel},
editor = {Marcos K. Aguilera},
title = {Efficient Fetch-and-Increment},
booktitle = {Distributed Computing - 26th International Symposium, {DISC} 2012,
Salvador, Brazil, October 16-18, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7611},
pages = {16--30},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33651-5\_2},
doi = {10.1007/978-3-642-33651-5\_2},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/EllenRW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/PareekW12,
author = {Abhijeet Pareek and
Philipp Woelfel},
editor = {Marcos K. Aguilera},
title = {RMR-Efficient Randomized Abortable Mutual Exclusion - (Extended Abstract)},
booktitle = {Distributed Computing - 26th International Symposium, {DISC} 2012,
Salvador, Brazil, October 16-18, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7611},
pages = {267--281},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33651-5\_19},
doi = {10.1007/978-3-642-33651-5\_19},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/PareekW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-4431,
author = {Martin Aum{\"{u}}ller and
Martin Dietzfelbinger and
Philipp Woelfel},
title = {Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with
a Stash},
journal = {CoRR},
volume = {abs/1204.4431},
year = {2012},
url = {http://arxiv.org/abs/1204.4431},
eprinttype = {arXiv},
eprint = {1204.4431},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-4431.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-1723,
author = {Abhijeet Pareek and
Philipp Woelfel},
title = {RMR-Efficient Randomized Abortable Mutual Exclusion},
journal = {CoRR},
volume = {abs/1208.1723},
year = {2012},
url = {http://arxiv.org/abs/1208.1723},
eprinttype = {arXiv},
eprint = {1208.1723},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-1723.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DietzfelbingerRWW11,
author = {Martin Dietzfelbinger and
Jonathan E. Rowe and
Ingo Wegener and
Philipp Woelfel},
title = {Precision, Local Search and Unimodal Functions},
journal = {Algorithmica},
volume = {59},
number = {3},
pages = {301--322},
year = {2011},
url = {https://doi.org/10.1007/s00453-009-9352-x},
doi = {10.1007/S00453-009-9352-X},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DietzfelbingerRWW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/HendlerW11,
author = {Danny Hendler and
Philipp Woelfel},
title = {Randomized mutual exclusion with sub-logarithmic RMR-complexity},
journal = {Distributed Comput.},
volume = {24},
number = {1},
pages = {3--19},
year = {2011},
url = {https://doi.org/10.1007/s00446-011-0128-6},
doi = {10.1007/S00446-011-0128-6},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/HendlerW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/BrodskyEW11,
author = {Alex Brodsky and
Faith Ellen and
Philipp Woelfel},
title = {Fully-adaptive algorithms for long-lived renaming},
journal = {Distributed Comput.},
volume = {24},
number = {2},
pages = {119--134},
year = {2011},
url = {https://doi.org/10.1007/s00446-011-0137-5},
doi = {10.1007/S00446-011-0137-5},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/BrodskyEW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/HelmiHPW11,
author = {Maryam Helmi and
Lisa Higham and
Eduardo Pacheco and
Philipp Woelfel},
editor = {Cyril Gavoille and
Pierre Fraigniaud},
title = {The space complexity of long-lived and one-shot timestamp implementations},
booktitle = {Proceedings of the 30th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2011, San Jose, CA, USA, June 6-8, 2011},
pages = {139--148},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993806.1993826},
doi = {10.1145/1993806.1993826},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/HelmiHPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GiakkoupisW11,
author = {George Giakkoupis and
Philipp Woelfel},
editor = {Dana Randall},
title = {On the Randomness Requirements of Rumor Spreading},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {449--461},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.36},
doi = {10.1137/1.9781611973082.36},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/GiakkoupisW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GolabHW11,
author = {Wojciech M. Golab and
Lisa Higham and
Philipp Woelfel},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Linearizable implementations do not suffice for randomized distributed
computation},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {373--382},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993687},
doi = {10.1145/1993636.1993687},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GolabHW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-4690,
author = {Wojciech M. Golab and
Lisa Higham and
Philipp Woelfel},
title = {Linearizable Implementations Do Not Suffice for Randomized Distributed
Computation},
journal = {CoRR},
volume = {abs/1103.4690},
year = {2011},
url = {http://arxiv.org/abs/1103.4690},
eprinttype = {arXiv},
eprint = {1103.4690},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-4690.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-5794,
author = {Maryam Helmi and
Lisa Higham and
Eduardo Pacheco and
Philipp Woelfel},
title = {The Space Complexity of Long-lived and One-Shot Timestamp Implementations},
journal = {CoRR},
volume = {abs/1103.5794},
year = {2011},
url = {http://arxiv.org/abs/1103.5794},
eprinttype = {arXiv},
eprint = {1103.5794},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-5794.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-3323,
author = {Toryn Qwyllyn Klassen and
Philipp Woelfel},
title = {Independence of Tabulation-Based Hash Classes},
journal = {CoRR},
volume = {abs/1112.3323},
year = {2011},
url = {http://arxiv.org/abs/1112.3323},
eprinttype = {arXiv},
eprint = {1112.3323},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-3323.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DietzfelbingerRWW10,
author = {Martin Dietzfelbinger and
Jonathan E. Rowe and
Ingo Wegener and
Philipp Woelfel},
title = {Tight Bounds for Blind Search on the Integers and the Reals},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {5-6},
pages = {711--728},
year = {2010},
url = {https://doi.org/10.1017/S0963548309990599},
doi = {10.1017/S0963548309990599},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DietzfelbingerRWW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GolabHW10,
author = {Wojciech M. Golab and
Danny Hendler and
Philipp Woelfel},
title = {An {O(1)} RMRs Leader Election Algorithm},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {7},
pages = {2726--2760},
year = {2010},
url = {https://doi.org/10.1137/070686445},
doi = {10.1137/070686445},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GolabHW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/BeameDPW10,
author = {Paul Beame and
Matei David and
Toniann Pitassi and
Philipp Woelfel},
title = {Separating Deterministic from Randomized Multiparty Communication
Complexity},
journal = {Theory Comput.},
volume = {6},
number = {1},
pages = {201--225},
year = {2010},
url = {https://doi.org/10.4086/toc.2010.v006a009},
doi = {10.4086/TOC.2010.V006A009},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/BeameDPW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/HendlerW10,
author = {Danny Hendler and
Philipp Woelfel},
editor = {Andr{\'{e}}a W. Richa and
Rachid Guerraoui},
title = {Adaptive randomized mutual exclusion in sub-logarithmic expected time},
booktitle = {Proceedings of the 29th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2010, Zurich, Switzerland, July 25-28, 2010},
pages = {141--150},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1835698.1835737},
doi = {10.1145/1835698.1835737},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/HendlerW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NunkesserW09,
author = {Robin Nunkesser and
Philipp Woelfel},
title = {Representation of graphs by OBDDs},
journal = {Discret. Appl. Math.},
volume = {157},
number = {2},
pages = {247--261},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.02.012},
doi = {10.1016/J.DAM.2008.02.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NunkesserW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/HendlerW09,
author = {Danny Hendler and
Philipp Woelfel},
editor = {Srikanta Tirthapura and
Lorenzo Alvisi},
title = {Randomized mutual exclusion in O(log {N} / log log {N)} RMRs},
booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009},
pages = {26--35},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1582716.1582727},
doi = {10.1145/1582716.1582727},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/HendlerW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/DietzfelbingerW09,
author = {Martin Dietzfelbinger and
Philipp Woelfel},
editor = {Srikanta Tirthapura and
Lorenzo Alvisi},
title = {Brief announcement: tight lower bounds for greedy routing in uniform
small world rings},
booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009},
pages = {300--301},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1582716.1582776},
doi = {10.1145/1582716.1582776},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/DietzfelbingerW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DietzfelbingerW09,
author = {Martin Dietzfelbinger and
Philipp Woelfel},
editor = {Michael Mitzenmacher},
title = {Tight lower bounds for greedy routing in uniform small world rings},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {591--600},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536494},
doi = {10.1145/1536414.1536494},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DietzfelbingerW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/DietzfelbingerRWW08,
author = {Martin Dietzfelbinger and
Jonathan E. Rowe and
Ingo Wegener and
Philipp Woelfel},
editor = {Conor Ryan and
Maarten Keijzer},
title = {Precision, local search and unimodal functions},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2008, Proceedings,
Atlanta, GA, USA, July 12-16, 2008},
pages = {771--778},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1389095.1389249},
doi = {10.1145/1389095.1389249},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/DietzfelbingerRWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AttiyaHW08,
author = {Hagit Attiya and
Danny Hendler and
Philipp Woelfel},
editor = {Rida A. Bazzi and
Boaz Patt{-}Shamir},
title = {Tight {RMR} lower bounds for mutual exclusion and other problems},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2008, Toronto, Canada, August 18-21,
2008},
pages = {447},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1400751.1400843},
doi = {10.1145/1400751.1400843},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AttiyaHW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DietzfelbingerRWW08,
author = {Martin Dietzfelbinger and
Jonathan E. Rowe and
Ingo Wegener and
Philipp Woelfel},
editor = {Susanne Albers and
Pascal Weil},
title = {Tight Bounds for Blind Search on the Integers},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {241--252},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1348},
doi = {10.4230/LIPICS.STACS.2008.1348},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DietzfelbingerRWW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AttiyaHW08,
author = {Hagit Attiya and
Danny Hendler and
Philipp Woelfel},
editor = {Cynthia Dwork},
title = {Tight rmr lower bounds for mutual exclusion and other problems},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {217--226},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374410},
doi = {10.1145/1374376.1374410},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AttiyaHW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2852,
author = {Martin Dietzfelbinger and
Jonathan E. Rowe and
Ingo Wegener and
Philipp Woelfel},
title = {Tight Bounds for Blind Search on the Integers},
journal = {CoRR},
volume = {abs/0802.2852},
year = {2008},
url = {http://arxiv.org/abs/0802.2852},
eprinttype = {arXiv},
eprint = {0802.2852},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2852.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/WegenerW07,
author = {Ingo Wegener and
Philipp Woelfel},
title = {New Results on the Complexity of the Middle Bit of Multiplication},
journal = {Comput. Complex.},
volume = {16},
number = {3},
pages = {298--323},
year = {2007},
url = {https://doi.org/10.1007/s00037-007-0231-z},
doi = {10.1007/S00037-007-0231-Z},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/WegenerW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeameDPW07,
author = {Paul Beame and
Matei David and
Toniann Pitassi and
Philipp Woelfel},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Separating Deterministic from Nondeterministic {NOF} Multiparty Communication
Complexity},
booktitle = {Automata, Languages and Programming, 34th International Colloquium,
{ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4596},
pages = {134--145},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_14},
doi = {10.1007/978-3-540-73420-8\_14},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeameDPW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GolabHHW07,
author = {Wojciech M. Golab and
Vassos Hadzilacos and
Danny Hendler and
Philipp Woelfel},
editor = {Indranil Gupta and
Roger Wattenhofer},
title = {Constant-RMR implementations of {CAS} and other synchronization primitives
using read and write operations},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2007, Portland, Oregon, USA, August
12-15, 2007},
pages = {3--12},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1281100.1281105},
doi = {10.1145/1281100.1281105},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GolabHHW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/Woelfel06,
author = {Philipp Woelfel},
title = {Symbolic topological sorting with OBDDs},
journal = {J. Discrete Algorithms},
volume = {4},
number = {1},
pages = {51--71},
year = {2006},
url = {https://doi.org/10.1016/j.jda.2005.01.008},
doi = {10.1016/J.JDA.2005.01.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/Woelfel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BolligWW06,
author = {Beate Bollig and
Stephan Waack and
Philipp Woelfel},
title = {Parity graph-driven read-once branching programs and an exponential
lower bound for integer multiplication},
journal = {Theor. Comput. Sci.},
volume = {362},
number = {1-3},
pages = {86--99},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.05.035},
doi = {10.1016/J.TCS.2006.05.035},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BolligWW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Woelfel06,
author = {Philipp Woelfel},
title = {A construction method for optimally universal hash families and its
consequences for the existence of RBIBDs},
journal = {Theor. Comput. Sci.},
volume = {363},
number = {1},
pages = {76--84},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.06.008},
doi = {10.1016/J.TCS.2006.06.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Woelfel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Woelfel06,
author = {Philipp Woelfel},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Maintaining External Memory Efficient Hash Tables},
booktitle = {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},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {508--519},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_46},
doi = {10.1007/11830924\_46},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Woelfel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/GolabHW06,
author = {Wojciech M. Golab and
Danny Hendler and
Philipp Woelfel},
editor = {Eric Ruppert and
Dahlia Malkhi},
title = {An \emph{O}(1) RMRs leader election algorithm},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Principles
of Distributed Computing, {PODC} 2006, Denver, CO, USA, July 23-26,
2006},
pages = {238--247},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1146381.1146417},
doi = {10.1145/1146381.1146417},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/GolabHW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Woelfel06,
author = {Philipp Woelfel},
title = {Asymmetric balanced allocation with simple hash functions},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {424--433},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109605},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Woelfel06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BrodskyEW06,
author = {Alex Brodsky and
Faith Ellen and
Philipp Woelfel},
editor = {Shlomi Dolev},
title = {Fully-Adaptive Algorithms for Long-Lived Renaming},
booktitle = {Distributed Computing, 20th International Symposium, {DISC} 2006,
Stockholm, Sweden, September 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4167},
pages = {413--427},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11864219\_29},
doi = {10.1007/11864219\_29},
timestamp = {Sat, 19 Oct 2019 20:32:37 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BrodskyEW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Woelfel05,
author = {Philipp Woelfel},
title = {Bounds on the OBDD-size of integer multiplication via universal hashing},
journal = {J. Comput. Syst. Sci.},
volume = {71},
number = {4},
pages = {520--534},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2005.05.004},
doi = {10.1016/J.JCSS.2005.05.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Woelfel05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BolligW05,
author = {Beate Bollig and
Philipp Woelfel},
title = {A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching
Programs and Its Applications},
journal = {Theory Comput. Syst.},
volume = {38},
number = {6},
pages = {671--685},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1130-1},
doi = {10.1007/S00224-004-1130-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BolligW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/WegenerW05,
author = {Ingo Wegener and
Philipp Woelfel},
title = {New Results on the Complexity of the Middle Bit of Multiplication},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {100--110},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.14},
doi = {10.1109/CCC.2005.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/WegenerW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/NunkesserW05,
author = {Robin Nunkesser and
Philipp Woelfel},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Representation of Graphs by OBDDs},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {1132--1142},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_112},
doi = {10.1007/11602613\_112},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/NunkesserW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Woelfel04,
author = {Philipp Woelfel},
editor = {Kyung{-}Yong Chwa and
J. Ian Munro},
title = {A Construction Method for Optimally Universal Hash Families and Its
Consequences for the Existence of RBIBDs},
booktitle = {Computing and Combinatorics, 10th Annual International Conference,
{COCOON} 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3106},
pages = {23--32},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27798-9\_5},
doi = {10.1007/978-3-540-27798-9\_5},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Woelfel04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-107,
author = {Ingo Wegener and
Philipp Woelfel},
title = {New Results on the Complexity of the Middle Bit of Multiplication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-107}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-107/index.html},
eprinttype = {ECCC},
eprint = {TR04-107},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-107.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Wolfel2004,
author = {Philipp W{\"{o}}lfel},
title = {{\"{U}}ber die Komplexit{\"{a}}t der Multiplikation in eingeschr{\"{a}}nkten
Branchingprogrammmodellen},
school = {Technical University of Dortmund, Germany},
year = {2003},
url = {https://hdl.handle.net/2003/2539},
urn = {urn:nbn:de:101:1-201105055109},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Wolfel2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Woelfel03,
author = {Philipp Woelfel},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {Symbolic Topological Sorting with {OBDDS}},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {671--680},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_61},
doi = {10.1007/978-3-540-45138-9\_61},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Woelfel03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SauerhoffW03,
author = {Martin Sauerhoff and
Philipp Woelfel},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Time-space tradeoff lower bounds for integer multiplication and graphs
of arithmetic functions},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {186--195},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780571},
doi = {10.1145/780542.780571},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SauerhoffW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DietzfelbingerW03,
author = {Martin Dietzfelbinger and
Philipp Woelfel},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Almost random graphs with simple hash functions},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {629--638},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780634},
doi = {10.1145/780542.780634},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DietzfelbingerW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/gi/Wolfel03,
author = {Philipp W{\"{o}}lfel},
editor = {Heinz Beilner and
Thomas Dreier and
Markus Gross and
Oliver G{\"{u}}nther and
Steffen H{\"{o}}lldobler and
Klaus{-}Peter L{\"{o}}hr and
R{\"{u}}diger Reischuk and
Dorothea Wagner},
title = {Multiplikation in eingeschr{\"{a}}nkten Branchingprogrammmodellen},
booktitle = {Ausgezeichnete Informatikdissertationen 2003},
series = {{LNI}},
volume = {{D-4}},
pages = {199--208},
publisher = {{GI}},
year = {2003},
url = {https://dl.gi.de/handle/20.500.12116/4483},
timestamp = {Tue, 04 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gi/Wolfel03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Woelfel02,
author = {Philipp Woelfel},
title = {On the Complexity of Integer Multiplication in Branching Programs
with Multiple Tests and in Read-Once Branching Programs with Limited
Nondeterminism},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {80--89},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004343},
doi = {10.1109/CCC.2002.1004343},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Woelfel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/BolligWW02,
author = {Beate Bollig and
Stephan Waack and
Philipp Woelfel},
editor = {Ricardo A. Baeza{-}Yates and
Ugo Montanari and
Nicola Santoro},
title = {Parity Graph-driven Read-Once Branching Programs and an Exponential
Lower Bound for Integer Multiplication},
booktitle = {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{\'{e}}al, Qu{\'{e}}bec, Canada},
series = {{IFIP} Conference Proceedings},
volume = {223},
pages = {83--94},
publisher = {Kluwer},
year = {2002},
url = {https://doi.org/10.1007/978-0-387-35608-2\_8},
doi = {10.1007/978-0-387-35608-2\_8},
timestamp = {Fri, 27 Sep 2019 10:35:17 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/BolligWW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BolligW02,
author = {Beate Bollig and
Philipp Woelfel},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching
Programs and Its Applications},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {131--142},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_10},
doi = {10.1007/3-540-45687-2\_10},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BolligW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Woelfel02,
author = {Philipp Woelfel},
editor = {Helmut Alt and
Afonso Ferreira},
title = {A Lower Bound Technique for Restricted Branching Programs and Applications},
booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2285},
pages = {431--442},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45841-7\_35},
doi = {10.1007/3-540-45841-7\_35},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Woelfel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Woelfel01,
author = {Philipp Woelfel},
editor = {Afonso Ferreira and
Horst Reichel},
title = {New Bounds on the OBDD-Size of Integer Multiplication via Universal
Hashing},
booktitle = {{STACS} 2001, 18th Annual Symposium on Theoretical Aspects of Computer
Science, Dresden, Germany, February 15-17, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2010},
pages = {563--574},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44693-1\_49},
doi = {10.1007/3-540-44693-1\_49},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Woelfel01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BolligW01,
author = {Beate Bollig and
Philipp Woelfel},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A read-once branching program lower bound of Omega(2\({}^{\mbox{n/4}}\))
for integer multiplication using universal},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {419--424},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380835},
doi = {10.1145/380752.380835},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BolligW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-073,
author = {Beate Bollig and
Philipp Woelfel and
Stephan Waack},
title = {Parity Graph-driven Read-Once Branching Programs and an Exponential
Lower Bound for Integer Multiplication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-073}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-073/index.html},
eprinttype = {ECCC},
eprint = {TR01-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-101,
author = {Philipp Woelfel},
title = {A Lower Bound Technique for Restricted Branching Programs and Applications},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-101}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-101/index.html},
eprinttype = {ECCC},
eprint = {TR01-101},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-101.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-046,
author = {Philipp Woelfel},
title = {New Bounds on the OBDD-Size of Integer Multiplication via Universal
Hashing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-046}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-046/index.html},
eprinttype = {ECCC},
eprint = {TR00-046},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-046.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Woelfel99,
author = {Philipp Woelfel},
editor = {Miroslaw Kutylowski and
Leszek Pacholski and
Tomasz Wierzbicki},
title = {Efficient Strongly Universal and Optimally Universal Hashing},
booktitle = {Mathematical Foundations of Computer Science 1999, 24th International
Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1672},
pages = {262--272},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48340-3\_24},
doi = {10.1007/3-540-48340-3\_24},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Woelfel99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:51 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:
