Published in: LIPIcs, Volume 157, 10th International Conference on Fun with Algorithms (FUN 2021) (2020)
Trevor Clokie, Thomas F. Lidbetter, Antonio J. Molina Lovett, Jeffrey Shallit, and Leon Witzman. Computational Fun with Sturdy and Flimsy Numbers. In 10th International Conference on Fun with Algorithms (FUN 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 157, pp. 10:1-10:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{clokie_et_al:LIPIcs.FUN.2021.10, author = {Clokie, Trevor and Lidbetter, Thomas F. and Molina Lovett, Antonio J. and Shallit, Jeffrey and Witzman, Leon}, title = {{Computational Fun with Sturdy and Flimsy Numbers}}, booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)}, pages = {10:1--10:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-145-0}, ISSN = {1868-8969}, year = {2020}, volume = {157}, editor = {Farach-Colton, Martin and Prencipe, Giuseppe and Uehara, Ryuhei}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FUN.2021.10}, URN = {urn:nbn:de:0030-drops-127715}, doi = {10.4230/LIPIcs.FUN.2021.10}, annote = {Keywords: sturdy number, flimsy number, context-free grammar, finite automaton, enumeration} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Nalin Bhardwaj, Antonio J. Molina Lovett, and Bryce Sandlund. A Simple Algorithm for Minimum Cuts in Near-Linear Time. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 12:1-12:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{bhardwaj_et_al:LIPIcs.SWAT.2020.12, author = {Bhardwaj, Nalin and Molina Lovett, Antonio J. and Sandlund, Bryce}, title = {{A Simple Algorithm for Minimum Cuts in Near-Linear Time}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {12:1--12:18}, 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.12}, URN = {urn:nbn:de:0030-drops-122594}, doi = {10.4230/LIPIcs.SWAT.2020.12}, annote = {Keywords: minimum cut, sparsification, near-linear time, packing} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Antonio Molina Lovett and Jeffrey Shallit. Optimal Regular Expressions for Permutations (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 121:1-121:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{molinalovett_et_al:LIPIcs.ICALP.2019.121, author = {Molina Lovett, Antonio and Shallit, Jeffrey}, title = {{Optimal Regular Expressions for Permutations}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {121:1--121:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.121}, URN = {urn:nbn:de:0030-drops-106978}, doi = {10.4230/LIPIcs.ICALP.2019.121}, annote = {Keywords: regular expressions, lower bounds, divide-and-conquer} }
Feedback for Dagstuhl Publishing