Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Haohong Li and Ge Xia. An 𝒪(3.82^k) Time FPT Algorithm for Convex Flip Distance. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 44:1-44:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{li_et_al:LIPIcs.STACS.2023.44, author = {Li, Haohong and Xia, Ge}, title = {{An 𝒪(3.82^k) Time FPT Algorithm for Convex Flip Distance}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-266-2}, ISSN = {1868-8969}, year = {2023}, volume = {254}, editor = {Berenbrink, Petra and Bouyer, Patricia and Dawar, Anuj and Kant\'{e}, Mamadou Moustapha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.44}, URN = {urn:nbn:de:0030-drops-176965}, doi = {10.4230/LIPIcs.STACS.2023.44}, annote = {Keywords: Flip distance, Rotation distance, Triangulations, Exact algorithms, Parameterized complexity} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Jianer Chen, Qin Huang, Iyad Kanj, Qian Li, and Ge Xia. Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 48:1-48:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{chen_et_al:LIPIcs.ISAAC.2021.48, author = {Chen, Jianer and Huang, Qin and Kanj, Iyad and Li, Qian and Xia, Ge}, title = {{Streaming Algorithms for Graph k-Matching with Optimal or Near-Optimal Update Time}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {48:1--48:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.48}, URN = {urn:nbn:de:0030-drops-154816}, doi = {10.4230/LIPIcs.ISAAC.2021.48}, annote = {Keywords: streaming algorithms, matching, parameterized algorithms, lower bounds} }
Published in: LIPIcs, Volume 193, 12th International Conference on Interactive Theorem Proving (ITP 2021)
Hengchu Zhang, Wolf Honoré, Nicolas Koh, Yao Li, Yishuai Li, Li-Yao Xia, Lennart Beringer, William Mansky, Benjamin Pierce, and Steve Zdancewic. Verifying an HTTP Key-Value Server with Interaction Trees and VST. In 12th International Conference on Interactive Theorem Proving (ITP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 193, pp. 32:1-32:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{zhang_et_al:LIPIcs.ITP.2021.32, author = {Zhang, Hengchu and Honor\'{e}, Wolf and Koh, Nicolas and Li, Yao and Li, Yishuai and Xia, Li-Yao and Beringer, Lennart and Mansky, William and Pierce, Benjamin and Zdancewic, Steve}, title = {{Verifying an HTTP Key-Value Server with Interaction Trees and VST}}, booktitle = {12th International Conference on Interactive Theorem Proving (ITP 2021)}, pages = {32:1--32:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-188-7}, ISSN = {1868-8969}, year = {2021}, volume = {193}, editor = {Cohen, Liron and Kaliszyk, Cezary}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2021.32}, URN = {urn:nbn:de:0030-drops-139273}, doi = {10.4230/LIPIcs.ITP.2021.32}, annote = {Keywords: formal verification, Coq, HTTP, deep specification} }
Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
Jun Wan, Yu Xia, Liang Li, and Thomas Moscibroda. Information Cascades on Arbitrary Topologies. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 64:1-64:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{wan_et_al:LIPIcs.ICALP.2016.64, author = {Wan, Jun and Xia, Yu and Li, Liang and Moscibroda, Thomas}, title = {{Information Cascades on Arbitrary Topologies}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {64:1--64:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.64}, URN = {urn:nbn:de:0030-drops-63417}, doi = {10.4230/LIPIcs.ICALP.2016.64}, annote = {Keywords: Information Cascades, Herding Effect, Random Graphs} }
Published in: LIPIcs, Volume 1, 25th International Symposium on Theoretical Aspects of Computer Science (2008)
Angsheng Li and Mingji Xia. A Theory for Valiant's Matchcircuits (Extended Abstract). In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 491-502, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{li_et_al:LIPIcs.STACS.2008.1368, author = {Li, Angsheng and Xia, Mingji}, title = {{A Theory for Valiant's Matchcircuits}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {491--502}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1368}, URN = {urn:nbn:de:0030-drops-13686}, doi = {10.4230/LIPIcs.STACS.2008.1368}, annote = {Keywords: Pfaffian, Matchgate, Matchcircuit} }
Feedback for Dagstuhl Publishing