Published in: LIPIcs, Volume 291, 12th International Conference on Fun with Algorithms (FUN 2024)
Alessandro Panconesi, Pietro Maria Posta, and Mirko Giacchini. Coordinating "7 Billion Humans" Is Hard. In 12th International Conference on Fun with Algorithms (FUN 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 291, pp. 26:1-26:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{panconesi_et_al:LIPIcs.FUN.2024.26, author = {Panconesi, Alessandro and Posta, Pietro Maria and Giacchini, Mirko}, title = {{Coordinating "7 Billion Humans" Is Hard}}, booktitle = {12th International Conference on Fun with Algorithms (FUN 2024)}, pages = {26:1--26:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-314-0}, ISSN = {1868-8969}, year = {2024}, volume = {291}, editor = {Broder, Andrei Z. and Tamir, Tami}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2024.26}, URN = {urn:nbn:de:0030-drops-199342}, doi = {10.4230/LIPIcs.FUN.2024.26}, annote = {Keywords: video games, computational complexity, NP, PSPACE} }
Published in: LIPIcs, Volume 100, 9th International Conference on Fun with Algorithms (FUN 2018)
Matteo Almanza, Stefano Leucci, and Alessandro Panconesi. Tracks from hell - when finding a proof may be easier than checking it. In 9th International Conference on Fun with Algorithms (FUN 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 100, pp. 4:1-4:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{almanza_et_al:LIPIcs.FUN.2018.4, author = {Almanza, Matteo and Leucci, Stefano and Panconesi, Alessandro}, title = {{Tracks from hell - when finding a proof may be easier than checking it}}, booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)}, pages = {4:1--4:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-067-5}, ISSN = {1868-8969}, year = {2018}, volume = {100}, editor = {Ito, Hiro and Leonardi, Stefano and Pagli, Linda and Prencipe, Giuseppe}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2018.4}, URN = {urn:nbn:de:0030-drops-87954}, doi = {10.4230/LIPIcs.FUN.2018.4}, annote = {Keywords: puzzle games, solitaire games, Trainyard, verification} }
Published in: LIPIcs, Volume 67, 8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, and Erisa Terolli. The Distortion of Locality Sensitive Hashing. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 67, pp. 54:1-54:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{chierichetti_et_al:LIPIcs.ITCS.2017.54, author = {Chierichetti, Flavio and Kumar, Ravi and Panconesi, Alessandro and Terolli, Erisa}, title = {{The Distortion of Locality Sensitive Hashing}}, booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)}, pages = {54:1--54:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-029-3}, ISSN = {1868-8969}, year = {2017}, volume = {67}, editor = {Papadimitriou, Christos H.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.54}, URN = {urn:nbn:de:0030-drops-81688}, doi = {10.4230/LIPIcs.ITCS.2017.54}, annote = {Keywords: locality sensitive hashing, distortion, similarity} }
Published in: LIPIcs, Volume 49, 8th International Conference on Fun with Algorithms (FUN 2016)
Matteo Almanza, Stefano Leucci, and Alessandro Panconesi. Trainyard is NP-hard. In 8th International Conference on Fun with Algorithms (FUN 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 49, pp. 2:1-2:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{almanza_et_al:LIPIcs.FUN.2016.2, author = {Almanza, Matteo and Leucci, Stefano and Panconesi, Alessandro}, title = {{Trainyard is NP-hard}}, booktitle = {8th International Conference on Fun with Algorithms (FUN 2016)}, pages = {2:1--2:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-005-7}, ISSN = {1868-8969}, year = {2016}, volume = {49}, editor = {Demaine, Erik D. and Grandoni, Fabrizio}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2016.2}, URN = {urn:nbn:de:0030-drops-58796}, doi = {10.4230/LIPIcs.FUN.2016.2}, annote = {Keywords: Complexity of Games, Trainyard} }
Feedback for Dagstuhl Publishing