Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Charilaos Efthymiou and Weiming Feng. On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n,d/n). In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 54:1-54:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{efthymiou_et_al:LIPIcs.ICALP.2023.54, author = {Efthymiou, Charilaos and Feng, Weiming}, title = {{On the Mixing Time of Glauber Dynamics for the Hard-Core and Related Models on G(n,d/n)}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {54:1--54:17}, 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.54}, URN = {urn:nbn:de:0030-drops-181064}, doi = {10.4230/LIPIcs.ICALP.2023.54}, annote = {Keywords: spin-system, spin-glass, sparse random (hyper)graph, approximate sampling, efficient algorithm} }
Published in: LIPIcs, Volume 245, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)
Weiming Feng, Heng Guo, and Jiaheng Wang. Improved Bounds for Randomly Colouring Simple Hypergraphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 245, pp. 25:1-25:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{feng_et_al:LIPIcs.APPROX/RANDOM.2022.25, author = {Feng, Weiming and Guo, Heng and Wang, Jiaheng}, title = {{Improved Bounds for Randomly Colouring Simple Hypergraphs}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-249-5}, ISSN = {1868-8969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.25}, URN = {urn:nbn:de:0030-drops-171477}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.25}, annote = {Keywords: Approximate counting, Markov chain, Mixing time, Hypergraph colouring} }
Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Weiming Feng, Kun He, Xiaoming Sun, and Yitong Yin. Dynamic Inference in Probabilistic Graphical Models. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 25:1-25:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{feng_et_al:LIPIcs.ITCS.2021.25, author = {Feng, Weiming and He, Kun and Sun, Xiaoming and Yin, Yitong}, title = {{Dynamic Inference in Probabilistic Graphical Models}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {25:1--25:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-177-1}, ISSN = {1868-8969}, year = {2021}, volume = {185}, editor = {Lee, James R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.25}, URN = {urn:nbn:de:0030-drops-135643}, doi = {10.4230/LIPIcs.ITCS.2021.25}, annote = {Keywords: Dynamic inference, probabilistic graphical model, Gibbs sampling, Markov random filed} }
Published in: LIPIcs, Volume 184, 24th International Conference on Principles of Distributed Systems (OPODIS 2020)
Haimin Chen and Chaodong Zheng. Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks. In 24th International Conference on Principles of Distributed Systems (OPODIS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 184, pp. 22:1-22:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{chen_et_al:LIPIcs.OPODIS.2020.22, author = {Chen, Haimin and Zheng, Chaodong}, title = {{Broadcasting Competitively Against Adaptive Adversary in Multi-Channel Radio Networks}}, booktitle = {24th International Conference on Principles of Distributed Systems (OPODIS 2020)}, pages = {22:1--22:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-176-4}, ISSN = {1868-8969}, year = {2021}, volume = {184}, editor = {Bramas, Quentin and Oshman, Rotem and Romano, Paolo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.22}, URN = {urn:nbn:de:0030-drops-135076}, doi = {10.4230/LIPIcs.OPODIS.2020.22}, annote = {Keywords: Broadcast, radio networks, resource competitive algorithms} }
Feedback for Dagstuhl Publishing