Published in: LIPIcs, Volume 273, 23rd International Workshop on Algorithms in Bioinformatics (WABI 2023)
Xinyu Gu, Yuanyuan Qi, and Mohammed El-Kebir. Balancing Minimum Free Energy and Codon Adaptation Index for Pareto Optimal RNA Design. In 23rd International Workshop on Algorithms in Bioinformatics (WABI 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 273, pp. 21:1-21:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{gu_et_al:LIPIcs.WABI.2023.21, author = {Gu, Xinyu and Qi, Yuanyuan and El-Kebir, Mohammed}, title = {{Balancing Minimum Free Energy and Codon Adaptation Index for Pareto Optimal RNA Design}}, booktitle = {23rd International Workshop on Algorithms in Bioinformatics (WABI 2023)}, pages = {21:1--21:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-294-5}, ISSN = {1868-8969}, year = {2023}, volume = {273}, editor = {Belazzougui, Djamal and Ouangraoua, A\"{i}da}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2023.21}, URN = {urn:nbn:de:0030-drops-186479}, doi = {10.4230/LIPIcs.WABI.2023.21}, annote = {Keywords: Multi-objective optimization, dynamic programming, RNA sequence design, reverse translation, mRNA vaccine design} }
Published in: LIPIcs, Volume 267, 4th Conference on Information-Theoretic Cryptography (ITC 2023)
Mohammad Mahmoody and Wei Qi. Online Mergers and Applications to Registration-Based Encryption and Accumulators. In 4th Conference on Information-Theoretic Cryptography (ITC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 267, pp. 15:1-15:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{mahmoody_et_al:LIPIcs.ITC.2023.15, author = {Mahmoody, Mohammad and Qi, Wei}, title = {{Online Mergers and Applications to Registration-Based Encryption and Accumulators}}, booktitle = {4th Conference on Information-Theoretic Cryptography (ITC 2023)}, pages = {15:1--15:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-271-6}, ISSN = {1868-8969}, year = {2023}, volume = {267}, editor = {Chung, Kai-Min}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2023.15}, URN = {urn:nbn:de:0030-drops-183432}, doi = {10.4230/LIPIcs.ITC.2023.15}, annote = {Keywords: Registration-based encryption, Accumulators, Merkle Trees} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Spencer Compton, Slobodan Mitrović, and Ronitt Rubinfeld. New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 45:1-45:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{compton_et_al:LIPIcs.ICALP.2023.45, author = {Compton, Spencer and Mitrovi\'{c}, Slobodan and Rubinfeld, Ronitt}, title = {{New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {45:1--45:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.45}, URN = {urn:nbn:de:0030-drops-180978}, doi = {10.4230/LIPIcs.ICALP.2023.45}, annote = {Keywords: interval scheduling, dynamic algorithms, local computation algorithms} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Honghao Fu, Daochen Wang, and Qi Zhao. Parallel Self-Testing of EPR Pairs Under Computational Assumptions. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 64:1-64:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{fu_et_al:LIPIcs.ICALP.2023.64, author = {Fu, Honghao and Wang, Daochen and Zhao, Qi}, title = {{Parallel Self-Testing of EPR Pairs Under Computational Assumptions}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {64:1--64:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.64}, URN = {urn:nbn:de:0030-drops-181160}, doi = {10.4230/LIPIcs.ICALP.2023.64}, annote = {Keywords: Quantum complexity theory, self-testing, LWE} }
Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Benjamin Qi and Richard Qi. New Approximation Algorithms for Touring Regions. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 54:1-54:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{qi_et_al:LIPIcs.SoCG.2023.54, author = {Qi, Benjamin and Qi, Richard}, title = {{New Approximation Algorithms for Touring Regions}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {54:1--54:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.54}, URN = {urn:nbn:de:0030-drops-179047}, doi = {10.4230/LIPIcs.SoCG.2023.54}, annote = {Keywords: shortest paths, convex bodies, fat objects, disks} }
Published in: LIPIcs, Volume 248, 33rd International Symposium on Algorithms and Computation (ISAAC 2022)
Benjamin Qi. On Maximizing Sums of Non-Monotone Submodular and Linear Functions. In 33rd International Symposium on Algorithms and Computation (ISAAC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 248, pp. 41:1-41:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{qi:LIPIcs.ISAAC.2022.41, author = {Qi, Benjamin}, title = {{On Maximizing Sums of Non-Monotone Submodular and Linear Functions}}, booktitle = {33rd International Symposium on Algorithms and Computation (ISAAC 2022)}, pages = {41:1--41:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-258-7}, ISSN = {1868-8969}, year = {2022}, volume = {248}, editor = {Bae, Sang Won and Park, Heejin}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2022.41}, URN = {urn:nbn:de:0030-drops-173263}, doi = {10.4230/LIPIcs.ISAAC.2022.41}, annote = {Keywords: submodular maximization, regularization, continuous greedy, inapproximability} }
Published in: LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision. Leibniz Transactions on Embedded Systems, Volume 8, Issue 1
LITES, Volume 8, Issue 1: Special Issue on Embedded Systems for Computer Vision, pp. 0:i-0:viii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{chakraborty_et_al:LITES.8.1.0, author = {Chakraborty, Samarjit and Rao, Qing}, title = {{Introduction to the Special Issue on Embedded Systems for Computer Vision}}, booktitle = {LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision}, pages = {00:1--00:8}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {1}, editor = {Chakraborty, Samarjit and Rao, Qing}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.1.0}, doi = {10.4230/LITES.8.1.0}, annote = {Keywords: Embedded systems, Computer vision, Cyber-physical systems, Computer architecture} }
Published in: LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision. Leibniz Transactions on Embedded Systems, Volume 8, Issue 1
Manoj-Rohit Vemparala, Nael Fasfous, Alexander Frickenstein, Emanuele Valpreda, Manfredi Camalleri, Qi Zhao, Christian Unger, Naveen-Shankar Nagaraja, Maurizio Martina, and Walter Stechele. HW-Flow: A Multi-Abstraction Level HW-CNN Codesign Pruning Methodology. In LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision. Leibniz Transactions on Embedded Systems, Volume 8, Issue 1, pp. 03:1-03:30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{vemparala_et_al:LITES.8.1.3, author = {Vemparala, Manoj-Rohit and Fasfous, Nael and Frickenstein, Alexander and Valpreda, Emanuele and Camalleri, Manfredi and Zhao, Qi and Unger, Christian and Nagaraja, Naveen-Shankar and Martina, Maurizio and Stechele, Walter}, title = {{HW-Flow: A Multi-Abstraction Level HW-CNN Codesign Pruning Methodology}}, booktitle = {LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision}, pages = {03:1--03:30}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {1}, editor = {Vemparala, Manoj-Rohit and Fasfous, Nael and Frickenstein, Alexander and Valpreda, Emanuele and Camalleri, Manfredi and Zhao, Qi and Unger, Christian and Nagaraja, Naveen-Shankar and Martina, Maurizio and Stechele, Walter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.1.3}, doi = {10.4230/LITES.8.1.3}, annote = {Keywords: Convolutional Neural Networks, Optimization, Hardware Modeling, Pruning} }
Published in: LIPIcs, Volume 240, 15th International Conference on Spatial Information Theory (COSIT 2022)
Yanmin Qi, Heshan Du, Amin Farjudian, and Yunqiang Zhu. Representing Computational Relations in Knowledge Graphs Using Functional Languages (Short Paper). In 15th International Conference on Spatial Information Theory (COSIT 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 240, pp. 29:1-29:7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{qi_et_al:LIPIcs.COSIT.2022.29, author = {Qi, Yanmin and Du, Heshan and Farjudian, Amin and Zhu, Yunqiang}, title = {{Representing Computational Relations in Knowledge Graphs Using Functional Languages}}, booktitle = {15th International Conference on Spatial Information Theory (COSIT 2022)}, pages = {29:1--29:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-257-0}, ISSN = {1868-8969}, year = {2022}, volume = {240}, editor = {Ishikawa, Toru and Fabrikant, Sara Irina and Winter, Stephan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2022.29}, URN = {urn:nbn:de:0030-drops-169147}, doi = {10.4230/LIPIcs.COSIT.2022.29}, annote = {Keywords: spatial relation, computational relation, functional programming, Haskell, geo-knowledge graph} }
Published in: LIPIcs, Volume 221, 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)
Kathrin Hanauer, Monika Henzinger, and Qi Cheng Hua. Fully Dynamic Four-Vertex Subgraph Counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 221, pp. 18:1-18:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{hanauer_et_al:LIPIcs.SAND.2022.18, author = {Hanauer, Kathrin and Henzinger, Monika and Hua, Qi Cheng}, title = {{Fully Dynamic Four-Vertex Subgraph Counting}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {18:1--18:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-224-2}, ISSN = {1868-8969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAND.2022.18}, URN = {urn:nbn:de:0030-drops-159608}, doi = {10.4230/LIPIcs.SAND.2022.18}, annote = {Keywords: Dynamic Graph Algorithms, Subgraph Counting, Motif Search} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Sevag Gharibian and Dorian Rudolph. On Polynomially Many Queries to NP or QMA Oracles. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 75:1-75:27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{gharibian_et_al:LIPIcs.ITCS.2022.75, author = {Gharibian, Sevag and Rudolph, Dorian}, title = {{On Polynomially Many Queries to NP or QMA Oracles}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {75:1--75:27}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.75}, URN = {urn:nbn:de:0030-drops-156717}, doi = {10.4230/LIPIcs.ITCS.2022.75}, annote = {Keywords: admissible weighting function, oracle complexity class, quantum complexity theory, Quantum Merlin Arthur (QMA), simulation of local measurement} }
Published in: OASIcs, Volume 92, 4th International Symposium on Foundations and Applications of Blockchain 2021 (FAB 2021)
Bhaskar Krishnamachari, Qi Feng, and Eugenio Grippo. Dynamic Curves for Decentralized Autonomous Cryptocurrency Exchanges. In 4th International Symposium on Foundations and Applications of Blockchain 2021 (FAB 2021). Open Access Series in Informatics (OASIcs), Volume 92, pp. 5:1-5:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{krishnamachari_et_al:OASIcs.FAB.2021.5, author = {Krishnamachari, Bhaskar and Feng, Qi and Grippo, Eugenio}, title = {{Dynamic Curves for Decentralized Autonomous Cryptocurrency Exchanges}}, booktitle = {4th International Symposium on Foundations and Applications of Blockchain 2021 (FAB 2021)}, pages = {5:1--5:14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-196-2}, ISSN = {2190-6807}, year = {2021}, volume = {92}, editor = {Gramoli, Vincent and Sadoghi, Mohammad}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.FAB.2021.5}, URN = {urn:nbn:de:0030-drops-139911}, doi = {10.4230/OASIcs.FAB.2021.5}, annote = {Keywords: Decentralized Exchange, Automated Market Maker, Decentralized Finance, Dynamic Curves} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Andrew Chi chih Yao. An Incentive Analysis of Some Bitcoin Fee Designs (Invited Talk). In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 1:1-1:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{yao:LIPIcs.ICALP.2020.1, author = {Yao, Andrew Chi chih}, title = {{An Incentive Analysis of Some Bitcoin Fee Designs}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {1:1--1:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-138-2}, ISSN = {1868-8969}, year = {2020}, volume = {168}, editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.1}, URN = {urn:nbn:de:0030-drops-124087}, doi = {10.4230/LIPIcs.ICALP.2020.1}, annote = {Keywords: Bitcoin, blockchain, incentive compatibility, maximum revenue, mechanism design} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Hassene Aissi, Da Qi Chen, and R. Ravi. Vertex Downgrading to Minimize Connectivity. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 5:1-5:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{aissi_et_al:LIPIcs.SWAT.2020.5, author = {Aissi, Hassene and Chen, Da Qi and Ravi, R.}, title = {{Vertex Downgrading to Minimize Connectivity}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.5}, URN = {urn:nbn:de:0030-drops-122527}, doi = {10.4230/LIPIcs.SWAT.2020.5}, annote = {Keywords: Vertex Interdiction, Vertex Downgrading, Network Interdiction, Approximation Algorithm} }
Published in: LIPIcs, Volume 141, 10th International Conference on Interactive Theorem Proving (ITP 2019)
Reynald Affeldt, Jacques Garrigue, Xuanrui Qi, and Kazunari Tanaka. Proving Tree Algorithms for Succinct Data Structures. In 10th International Conference on Interactive Theorem Proving (ITP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 141, pp. 5:1-5:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{affeldt_et_al:LIPIcs.ITP.2019.5, author = {Affeldt, Reynald and Garrigue, Jacques and Qi, Xuanrui and Tanaka, Kazunari}, title = {{Proving Tree Algorithms for Succinct Data Structures}}, booktitle = {10th International Conference on Interactive Theorem Proving (ITP 2019)}, pages = {5:1--5:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-122-1}, ISSN = {1868-8969}, year = {2019}, volume = {141}, editor = {Harrison, John and O'Leary, John and Tolmach, Andrew}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2019.5}, URN = {urn:nbn:de:0030-drops-110609}, doi = {10.4230/LIPIcs.ITP.2019.5}, annote = {Keywords: Coq, small-scale reflection, succinct data structures, LOUDS, bit vectors, self balancing trees} }
Feedback for Dagstuhl Publishing