Published in: LIPIcs, Volume 264, 38th Computational Complexity Conference (CCC 2023)
Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, and Yu-Ching Shen. On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. In 38th Computational Complexity Conference (CCC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 264, pp. 33:1-33:45, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{chia_et_al:LIPIcs.CCC.2023.33, author = {Chia, Nai-Hui and Chung, Kai-Min and Hsieh, Yao-Ching and Lin, Han-Hsuan and Lin, Yao-Ting and Shen, Yu-Ching}, title = {{On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation}}, booktitle = {38th Computational Complexity Conference (CCC 2023)}, pages = {33:1--33:45}, 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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2023.33}, URN = {urn:nbn:de:0030-drops-183038}, doi = {10.4230/LIPIcs.CCC.2023.33}, annote = {Keywords: Hamiltonian simulation, Depth lower bound, Parallel query lower bound} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, and D. T. Lee. Tight Approximation for Partial Vertex Cover with Hard Capacities. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 64:1-64:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{shiau_et_al:LIPIcs.ISAAC.2017.64, author = {Shiau, Jia-Yau and Kao, Mong-Jen and Lin, Ching-Chi and Lee, D. T.}, title = {{Tight Approximation for Partial Vertex Cover with Hard Capacities}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {64:1--64:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.64}, URN = {urn:nbn:de:0030-drops-82694}, doi = {10.4230/LIPIcs.ISAAC.2017.64}, annote = {Keywords: Approximation Algorithm, Capacitated Vertex Cover, Hard Capacities} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Hung-I Yu, Tien-Ching Lin, and Der-Tsai Lee. The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 64:1-64:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{yu_et_al:LIPIcs.ISAAC.2016.64, author = {Yu, Hung-I and Lin, Tien-Ching and Lee, Der-Tsai}, title = {{The (1|1)-Centroid Problem on the Plane Concerning Distance Constraints}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {64:1--64: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-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.64}, URN = {urn:nbn:de:0030-drops-68337}, doi = {10.4230/LIPIcs.ISAAC.2016.64}, annote = {Keywords: competitive facility, Euclidean plane, parametric search} }
Feedback for Dagstuhl Publishing