Published in: LIPIcs, Volume 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)
Shengyu Huang, Chih-Hung Liu, and Daniel Rutschmann. Approximate Selection with Unreliable Comparisons in Optimal Expected Time. In 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 254, pp. 37:1-37:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{huang_et_al:LIPIcs.STACS.2023.37, author = {Huang, Shengyu and Liu, Chih-Hung and Rutschmann, Daniel}, title = {{Approximate Selection with Unreliable Comparisons in Optimal Expected Time}}, booktitle = {40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023)}, pages = {37:1--37:23}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2023.37}, URN = {urn:nbn:de:0030-drops-176898}, doi = {10.4230/LIPIcs.STACS.2023.37}, annote = {Keywords: Approximate Selection, Unreliable Comparisons, Independent Faults} }
Published in: LIPIcs, Volume 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Louis Esperet and Sergey Norin. Testability and Local Certification of Monotone Properties in Minor-Closed Classes. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 58:1-58:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{esperet_et_al:LIPIcs.ICALP.2022.58, author = {Esperet, Louis and Norin, Sergey}, title = {{Testability and Local Certification of Monotone Properties in Minor-Closed Classes}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {58:1--58:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-235-8}, ISSN = {1868-8969}, year = {2022}, volume = {229}, editor = {Boja\'{n}czyk, Miko{\l}aj and Merelli, Emanuela and Woodruff, David P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.58}, URN = {urn:nbn:de:0030-drops-163997}, doi = {10.4230/LIPIcs.ICALP.2022.58}, annote = {Keywords: Property testing, sparse model, local certification, minor-closed classes} }
Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Jiahui Liu, Qipeng Liu, and Luowen Qian. Beating Classical Impossibility of Position Verification. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 100:1-100:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{liu_et_al:LIPIcs.ITCS.2022.100, author = {Liu, Jiahui and Liu, Qipeng and Qian, Luowen}, title = {{Beating Classical Impossibility of Position Verification}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {100:1--100:11}, 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.100}, URN = {urn:nbn:de:0030-drops-156963}, doi = {10.4230/LIPIcs.ITCS.2022.100}, annote = {Keywords: cryptographic protocol, position verification, quantum cryptography, proof of quantumness, non-locality} }
Published in: LIPIcs, Volume 149, 30th International Symposium on Algorithms and Computation (ISAAC 2019)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, and Guido Proietti. Dual-Mode Greedy Algorithms Can Save Energy. In 30th International Symposium on Algorithms and Computation (ISAAC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 149, pp. 64:1-64:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{geissmann_et_al:LIPIcs.ISAAC.2019.64, author = {Geissmann, Barbara and Leucci, Stefano and Liu, Chih-Hung and Penna, Paolo and Proietti, Guido}, title = {{Dual-Mode Greedy Algorithms Can Save Energy}}, booktitle = {30th International Symposium on Algorithms and Computation (ISAAC 2019)}, pages = {64:1--64:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-130-6}, ISSN = {1868-8969}, year = {2019}, volume = {149}, editor = {Lu, Pinyan and Zhang, Guochuan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2019.64}, URN = {urn:nbn:de:0030-drops-115604}, doi = {10.4230/LIPIcs.ISAAC.2019.64}, annote = {Keywords: matroids, p-extendible systems, greedy algorithm, approximation algorithms, high-low energy} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna. Optimal Sorting with Persistent Comparison Errors. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 49:1-49:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{geissmann_et_al:LIPIcs.ESA.2019.49, author = {Geissmann, Barbara and Leucci, Stefano and Liu, Chih-Hung and Penna, Paolo}, title = {{Optimal Sorting with Persistent Comparison Errors}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {49:1--49:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.49}, URN = {urn:nbn:de:0030-drops-111706}, doi = {10.4230/LIPIcs.ESA.2019.49}, annote = {Keywords: approximate sorting, comparison errors, persistent errors} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Stefano Leucci, Chih-Hung Liu, and Simon Meierhans. Resilient Dictionaries for Randomly Unreliable Memory. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 70:1-70:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{leucci_et_al:LIPIcs.ESA.2019.70, author = {Leucci, Stefano and Liu, Chih-Hung and Meierhans, Simon}, title = {{Resilient Dictionaries for Randomly Unreliable Memory}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {70:1--70:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.70}, URN = {urn:nbn:de:0030-drops-111911}, doi = {10.4230/LIPIcs.ESA.2019.70}, annote = {Keywords: resilient dictionary, unreliable memory, faulty RAM} }
Published in: LIPIcs, Volume 143, 19th International Workshop on Algorithms in Bioinformatics (WABI 2019)
Georgi D. Georgiev, Kevin F. Dodd, and Brian Y. Chen. pClay: A Precise Parallel Algorithm for Comparing Molecular Surfaces. In 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 143, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{georgiev_et_al:LIPIcs.WABI.2019.6, author = {Georgiev, Georgi D. and Dodd, Kevin F. and Chen, Brian Y.}, title = {{pClay: A Precise Parallel Algorithm for Comparing Molecular Surfaces}}, booktitle = {19th International Workshop on Algorithms in Bioinformatics (WABI 2019)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-123-8}, ISSN = {1868-8969}, year = {2019}, volume = {143}, editor = {Huber, Katharina T. and Gusfield, Dan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2019.6}, URN = {urn:nbn:de:0030-drops-110365}, doi = {10.4230/LIPIcs.WABI.2019.6}, annote = {Keywords: Specificity Annotation, Structure Comparison, Cavity Analysis} }
Published in: DARTS, Volume 5, Issue 1, Special Issue of the 31st Euromicro Conference on Real-Time Systems (ECRTS 2019)
Jian-Jia Chen, Tobias Hahn, Ruben Hoeksma, Nicole Megow, and Georg von der Brüggen. Scheduling Self-Suspending Tasks: New and Old Results (Artifact). In Special Issue of the 31st Euromicro Conference on Real-Time Systems (ECRTS 2019). Dagstuhl Artifacts Series (DARTS), Volume 5, Issue 1, pp. 6:1-6:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{chen_et_al:DARTS.5.1.6, author = {Chen, Jian-Jia and Hahn, Tobias and Hoeksma, Ruben and Megow, Nicole and von der Br\"{u}ggen, Georg}, title = {{Scheduling Self-Suspending Tasks: New and Old Results}}, pages = {6:1--6:3}, journal = {Dagstuhl Artifacts Series}, ISSN = {2509-8195}, year = {2019}, volume = {5}, number = {1}, editor = {Chen, Jian-Jia and Hahn, Tobias and Hoeksma, Ruben and Megow, Nicole and von der Br\"{u}ggen, Georg}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DARTS.5.1.6}, URN = {urn:nbn:de:0030-drops-107349}, doi = {10.4230/DARTS.5.1.6}, annote = {Keywords: Self-suspension, master-slave problem, computational complexity, speedup factors} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Chih-Hung Liu. A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 58:1-58:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{liu:LIPIcs.SoCG.2018.58, author = {Liu, Chih-Hung}, title = {{A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.58}, URN = {urn:nbn:de:0030-drops-87717}, doi = {10.4230/LIPIcs.SoCG.2018.58}, annote = {Keywords: Simple polygons, Voronoi diagrams, Geodesic distance} }
Published in: LIPIcs, Volume 96, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna. Optimal Dislocation with Persistent Errors in Subquadratic Time. In 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 96, pp. 36:1-36:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{geissmann_et_al:LIPIcs.STACS.2018.36, author = {Geissmann, Barbara and Leucci, Stefano and Liu, Chih-Hung and Penna, Paolo}, title = {{Optimal Dislocation with Persistent Errors in Subquadratic Time}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {36:1--36:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-062-0}, ISSN = {1868-8969}, year = {2018}, volume = {96}, editor = {Niedermeier, Rolf and Vall\'{e}e, Brigitte}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2018.36}, URN = {urn:nbn:de:0030-drops-85266}, doi = {10.4230/LIPIcs.STACS.2018.36}, annote = {Keywords: sorting, recurrent comparison errors, maximum dislocation} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, and Paolo Penna. Sorting with Recurrent Comparison Errors. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 38:1-38:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{geissmann_et_al:LIPIcs.ISAAC.2017.38, author = {Geissmann, Barbara and Leucci, Stefano and Liu, Chih-Hung and Penna, Paolo}, title = {{Sorting with Recurrent Comparison Errors}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {38:1--38:12}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.38}, URN = {urn:nbn:de:0030-drops-82652}, doi = {10.4230/LIPIcs.ISAAC.2017.38}, annote = {Keywords: sorting, recurrent comparison error, maximum and total dislocation} }
Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)
Cecilia Bohler, Rolf Klein, and Chih-Hung Liu. An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 21:1-21:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bohler_et_al:LIPIcs.SoCG.2016.21, author = {Bohler, Cecilia and Klein, Rolf and Liu, Chih-Hung}, title = {{An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams}}, booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-009-5}, ISSN = {1868-8969}, year = {2016}, volume = {51}, editor = {Fekete, S\'{a}ndor and Lubiw, Anna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21}, URN = {urn:nbn:de:0030-drops-59135}, doi = {10.4230/LIPIcs.SoCG.2016.21}, annote = {Keywords: Order-k Voronoi Diagrams, Abstract Voronoi Diagrams, Randomized Geometric Algorithms} }
Published in: LITES, Volume 2, Issue 2 (2015). Leibniz Transactions on Embedded Systems, Volume 2, Issue 2
Thomas Carle, Dumitru Potop-Butucaru, Yves Sorel, and David Lesens. From Dataflow Specification to Multiprocessor Partitioned Time-triggered Real-time Implementation. In LITES, Volume 2, Issue 2 (2015). Leibniz Transactions on Embedded Systems, Volume 2, Issue 2, pp. 01:1-01:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Article{carle_et_al:LITES-v002-i002-a001, author = {Carle, Thomas and Potop-Butucaru, Dumitru and Sorel, Yves and Lesens, David}, title = {{From Dataflow Specification to Multiprocessor Partitioned Time-triggered Real-time Implementation}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {01:1--01:30}, ISSN = {2199-2002}, year = {2015}, volume = {2}, number = {2}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES-v002-i002-a001}, doi = {10.4230/LITES-v002-i002-a001}, annote = {Keywords: Time-triggered, Off-line real-time scheduling, Temporal partitioning} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Venkatesan Guruswami and Euiwoong Lee. Inapproximability of H-Transversal/Packing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 284-304, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2015.284, author = {Guruswami, Venkatesan and Lee, Euiwoong}, title = {{Inapproximability of H-Transversal/Packing}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {284--304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.284}, URN = {urn:nbn:de:0030-drops-53085}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.284}, annote = {Keywords: Constraint Satisfaction Problems, Approximation resistance} }
Published in: Dagstuhl Seminar Proceedings, Volume 9181, Sampling-based Optimization in the Presence of Uncertainty (2009)
Chun-Hung Chen, Liu Hong, Paul B. Kantor, David P. Morton, Juta Pichitlamken, and Matthias Seeger. 09181 Working Group on Hybridization between R&S, DoE and Optimization. In Sampling-based Optimization in the Presence of Uncertainty. Dagstuhl Seminar Proceedings, Volume 9181, pp. 1-14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{chen_et_al:DagSemProc.09181.3, author = {Chen, Chun-Hung and Hong, Liu and Kantor, Paul B. and Morton, David P. and Pichitlamken, Juta and Seeger, Matthias}, title = {{09181 Working Group on Hybridization between R\&S, DoE and Optimization}}, booktitle = {Sampling-based Optimization in the Presence of Uncertainty}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9181}, editor = {J\"{u}rgen Branke and Barry L. Nelson and Warren Buckler Powell and Thomas J. Santner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09181.3}, URN = {urn:nbn:de:0030-drops-21172}, doi = {10.4230/DagSemProc.09181.3}, annote = {Keywords: } }
Feedback for Dagstuhl Publishing