Current Year

[1]
R. Becker, Y. Emek, and C. Lenzen, “Low Diameter Graph Decompositions by Approximate Distance Computation,” in 11th Innovations in Theoretical Computer Science Conference (ITICS 2020), Seattle, WA, USA, 2020.
Export
BibTeX
@inproceedings{Becker_ITCS2020, TITLE = {Low Diameter Graph Decompositions by Approximate Distance Computation}, AUTHOR = {Becker, Ruben and Emek, Yuval and Lenzen, Christoph}, LANGUAGE = {eng}, ISSN = {1868-8969}, ISBN = {978-3-95977-134-4}, URL = {urn:nbn:de:0030-drops-117355}, DOI = {10.4230/LIPIcs.ITCS.2020.50}, PUBLISHER = {Schloss Dagstuhl}, YEAR = {2020}, BOOKTITLE = {11th Innovations in Theoretical Computer Science Conference (ITICS 2020)}, EDITOR = {Vidick, Thomas}, EID = {50}, SERIES = {Leibniz International Proceedings in Informatics}, VOLUME = {151}, ADDRESS = {Seattle, WA, USA}, }
Endnote
%0 Conference Proceedings %A Becker, Ruben %A Emek, Yuval %A Lenzen, Christoph %+ External Organizations External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Low Diameter Graph Decompositions by Approximate Distance Computation : %G eng %U http://hdl.handle.net/21.11116/0000-0005-A7A7-2 %R 10.4230/LIPIcs.ITCS.2020.50 %U urn:nbn:de:0030-drops-117355 %D 2020 %B 11th Innovations in Theoretical Computer Science Conference %Z date of event: 2020-01-12 - 2020-01-14 %C Seattle, WA, USA %B 11th Innovations in Theoretical Computer Science Conference %E Vidick, Thomas %Z sequence number: 50 %I Schloss Dagstuhl %@ 978-3-95977-134-4 %B Leibniz International Proceedings in Informatics %N 151 %@ false %U https://drops.dagstuhl.de/opus/volltexte/2020/11735/https://drops.dagstuhl.de/doku/urheberrecht1.html
[2]
J. Bund, C. Lenzen, and M. Medina, “Optimal Metastability-Containing Sorting via Parallel Prefix Computation,” IEEE Transactions on Computers, vol. 69, no. 2, 2020.
Export
BibTeX
@article{Bund_IEEETOC2020, TITLE = {Optimal Metastability-Containing Sorting via Parallel Prefix Computation}, AUTHOR = {Bund, Johannes and Lenzen, Christoph and Medina, Moti}, LANGUAGE = {eng}, ISSN = {0018-9340}, DOI = {10.1109/TC.2019.2939818}, PUBLISHER = {IEEE}, ADDRESS = {Piscataway, NJ}, YEAR = {2020}, DATE = {2020}, JOURNAL = {IEEE Transactions on Computers}, VOLUME = {69}, NUMBER = {2}, PAGES = {198--211}, }
Endnote
%0 Journal Article %A Bund, Johannes %A Lenzen, Christoph %A Medina, Moti %+ Algorithms and Complexity, MPI for Informatics, Max Planck Society Algorithms and Complexity, MPI for Informatics, Max Planck Society External Organizations %T Optimal Metastability-Containing Sorting via Parallel Prefix Computation : %G eng %U http://hdl.handle.net/21.11116/0000-0005-9E7F-C %R 10.1109/TC.2019.2939818 %7 2020 %D 2020 %J IEEE Transactions on Computers %V 69 %N 2 %& 198 %P 198 - 211 %I IEEE %C Piscataway, NJ %@ false
[3]
M. Roth and P. Wellnitz, “Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory,” in Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), Salt Lake City, UT, USA, 2020.
Export
BibTeX
@inproceedings{Roth_SODA20, TITLE = {Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory}, AUTHOR = {Roth, Marc and Wellnitz, Philip}, LANGUAGE = {eng}, ISBN = {978-1-61197-599-4}, DOI = {10.1137/1.9781611975994.133}, PUBLISHER = {SIAM}, YEAR = {2020}, BOOKTITLE = {Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (SODA 2020)}, EDITOR = {Chawla, Shuchi}, PAGES = {2161--2180}, ADDRESS = {Salt Lake City, UT, USA}, }
Endnote
%0 Conference Proceedings %A Roth, Marc %A Wellnitz, Philip %+ External Organizations Algorithms and Complexity, MPI for Informatics, Max Planck Society %T Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory : %G eng %U http://hdl.handle.net/21.11116/0000-0005-8665-2 %R 10.1137/1.9781611975994.133 %D 2020 %B 31st Annual ACM-SIAM Symposium on Discrete Algorithms %Z date of event: 2020-01-05 - 2020-01-08 %C Salt Lake City, UT, USA %B Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms %E Chawla, Shuchi %P 2161 - 2180 %I SIAM %@ 978-1-61197-599-4