Published in: LIPIcs, Volume 264, 38th Computational Complexity Conference (CCC 2023)
Dorit Aharonov and Sandy Irani. Translationally Invariant Constraint Optimization Problems. In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 23:1-23:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{aharonov_et_al:LIPIcs.CCC.2023.23, author = {Aharonov, Dorit and Irani, Sandy}, title = {{Translationally Invariant Constraint Optimization Problems}}, booktitle = {38th Computational Complexity Conference (CCC 2023)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-282-2}, ISSN = {1868-8969}, year = {2023}, volume = {264}, editor = {Ta-Shma, Amnon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.23}, URN = {urn:nbn:de:0030-drops-182932}, doi = {10.4230/LIPIcs.CCC.2023.23}, annote = {Keywords: Constraint satisfaction, Tiling, Translational-invariance} }
Published in: LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)
Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, and Henry Yuen. Quantum Search-To-Decision Reductions and the State Synthesis Problem. In 37th Computational Complexity Conference (CCC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 234, pp. 5:1-5:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{irani_et_al:LIPIcs.CCC.2022.5, author = {Irani, Sandy and Natarajan, Anand and Nirkhe, Chinmay and Rao, Sujit and Yuen, Henry}, title = {{Quantum Search-To-Decision Reductions and the State Synthesis Problem}}, booktitle = {37th Computational Complexity Conference (CCC 2022)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-241-9}, ISSN = {1868-8969}, year = {2022}, volume = {234}, editor = {Lovett, Shachar}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.5}, URN = {urn:nbn:de:0030-drops-165674}, doi = {10.4230/LIPIcs.CCC.2022.5}, annote = {Keywords: Search-to-decision, state synthesis, quantum computing} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Shahram Ghandeharizadeh, Sandy Irani, and Jenny Lam. The Subset Assignment Problem for Data Placement in Caches. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 35:1-35:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{ghandeharizadeh_et_al:LIPIcs.ISAAC.2016.35, author = {Ghandeharizadeh, Shahram and Irani, Sandy and Lam, Jenny}, title = {{The Subset Assignment Problem for Data Placement in Caches}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {35:1--35:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.35}, URN = {urn:nbn:de:0030-drops-68058}, doi = {10.4230/LIPIcs.ISAAC.2016.35}, annote = {Keywords: Memory management, caching, simplex method, linear programming, min-cost flow} }
Feedback for Dagstuhl Publishing