Published in: LIPIcs, Volume 316, 6th Conference on Advances in Financial Technologies (AFT 2024)
Miranda Christ, Foteini Baldimtsi, Konstantinos Kryptos Chalkias, Deepak Maram, Arnab Roy, and Joy Wang. SoK: Zero-Knowledge Range Proofs. In 6th Conference on Advances in Financial Technologies (AFT 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 316, pp. 14:1-14:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{christ_et_al:LIPIcs.AFT.2024.14, author = {Christ, Miranda and Baldimtsi, Foteini and Chalkias, Konstantinos Kryptos and Maram, Deepak and Roy, Arnab and Wang, Joy}, title = {{SoK: Zero-Knowledge Range Proofs}}, booktitle = {6th Conference on Advances in Financial Technologies (AFT 2024)}, pages = {14:1--14:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-345-4}, ISSN = {1868-8969}, year = {2024}, volume = {316}, editor = {B\"{o}hme, Rainer and Kiffer, Lucianna}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AFT.2024.14}, URN = {urn:nbn:de:0030-drops-209504}, doi = {10.4230/LIPIcs.AFT.2024.14}, annote = {Keywords: Range proofs, zero knowledge} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Mitchell Black and William Maxwell. Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 31:1-31:27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{black_et_al:LIPIcs.ISAAC.2021.31, author = {Black, Mitchell and Maxwell, William}, title = {{Effective Resistance and Capacitance in Simplicial Complexes and a Quantum Algorithm}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {31:1--31:27}, 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.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.31}, URN = {urn:nbn:de:0030-drops-154641}, doi = {10.4230/LIPIcs.ISAAC.2021.31}, annote = {Keywords: Simplicial complexes, quantum computing} }
Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
William Maxwell and Amir Nayyeri. Generalized Max-Flows and Min-Cuts in Simplicial Complexes. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 69:1-69:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{maxwell_et_al:LIPIcs.ESA.2021.69, author = {Maxwell, William and Nayyeri, Amir}, title = {{Generalized Max-Flows and Min-Cuts in Simplicial Complexes}}, booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)}, pages = {69:1--69:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-204-4}, ISSN = {1868-8969}, year = {2021}, volume = {204}, editor = {Mutzel, Petra and Pagh, Rasmus 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.2021.69}, URN = {urn:nbn:de:0030-drops-146509}, doi = {10.4230/LIPIcs.ESA.2021.69}, annote = {Keywords: Max-flow min-cut, simplicial complexes, algebraic topology} }
Published in: LIPIcs, Volume 157, 10th International Conference on Fun with Algorithms (FUN 2021) (2020)
David Eppstein, Daniel Frishberg, and William Maxwell. On the Treewidth of Hanoi Graphs. In 10th International Conference on Fun with Algorithms (FUN 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 157, pp. 13:1-13:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{eppstein_et_al:LIPIcs.FUN.2021.13, author = {Eppstein, David and Frishberg, Daniel and Maxwell, William}, title = {{On the Treewidth of Hanoi Graphs}}, booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)}, pages = {13:1--13: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.13}, URN = {urn:nbn:de:0030-drops-127741}, doi = {10.4230/LIPIcs.FUN.2021.13}, annote = {Keywords: Hanoi graph, Treewidth, Graph separators, Kneser graph, Vertex expansion, Haven, Tensor product} }
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Glencora Borradaile, Erin Wolf Chambers, David Eppstein, William Maxwell, and Amir Nayyeri. Low-Stretch Spanning Trees of Graphs with Bounded Width. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 15:1-15:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{borradaile_et_al:LIPIcs.SWAT.2020.15, author = {Borradaile, Glencora and Chambers, Erin Wolf and Eppstein, David and Maxwell, William and Nayyeri, Amir}, title = {{Low-Stretch Spanning Trees of Graphs with Bounded Width}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {15:1--15:19}, 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.15}, URN = {urn:nbn:de:0030-drops-122622}, doi = {10.4230/LIPIcs.SWAT.2020.15}, annote = {Keywords: Treewidth, low-stretch spanning tree, fundamental cycle basis} }
Published in: LIPIcs, Volume 164, 36th International Symposium on Computational Geometry (SoCG 2020)
Glencora Borradaile, William Maxwell, and Amir Nayyeri. Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{borradaile_et_al:LIPIcs.SoCG.2020.21, author = {Borradaile, Glencora and Maxwell, William and Nayyeri, Amir}, title = {{Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes}}, booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-143-6}, ISSN = {1868-8969}, year = {2020}, volume = {164}, editor = {Cabello, Sergio and Chen, Danny Z.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.21}, URN = {urn:nbn:de:0030-drops-121799}, doi = {10.4230/LIPIcs.SoCG.2020.21}, annote = {Keywords: computational topology, algorithmic complexity, simplicial complexes} }
Feedback for Dagstuhl Publishing