Published in: LIPIcs, Volume 283, 34th International Symposium on Algorithms and Computation (ISAAC 2023)
Ben Jourdan, Peter Macgregor, and He Sun. Is the Algorithmic Kadison-Singer Problem Hard?. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 43:1-43:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{jourdan_et_al:LIPIcs.ISAAC.2023.43, author = {Jourdan, Ben and Macgregor, Peter and Sun, He}, title = {{Is the Algorithmic Kadison-Singer Problem Hard?}}, booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)}, pages = {43:1--43:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-289-1}, ISSN = {1868-8969}, year = {2023}, volume = {283}, editor = {Iwata, Satoru and Kakimura, Naonori}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.43}, URN = {urn:nbn:de:0030-drops-193457}, doi = {10.4230/LIPIcs.ISAAC.2023.43}, annote = {Keywords: Kadison-Singer problem, spectral sparsification} }
Published in: LIPIcs, Volume 265, 21st International Symposium on Experimental Algorithms (SEA 2023)
Jarno N. Alanko, Elena Biagi, Simon J. Puglisi, and Jaakko Vuohtoniemi. Subset Wavelet Trees. In 21st International Symposium on Experimental Algorithms (SEA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 265, pp. 4:1-4:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{alanko_et_al:LIPIcs.SEA.2023.4, author = {Alanko, Jarno N. and Biagi, Elena and Puglisi, Simon J. and Vuohtoniemi, Jaakko}, title = {{Subset Wavelet Trees}}, booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-279-2}, ISSN = {1868-8969}, year = {2023}, volume = {265}, editor = {Georgiadis, Loukas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.4}, URN = {urn:nbn:de:0030-drops-183549}, doi = {10.4230/LIPIcs.SEA.2023.4}, annote = {Keywords: degenerate strings, compressed data structures, succinct data structures, string processing, data structures, efficient algorithms} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Thomas Sauerwald, He Sun, and Danny Vagnozzi. The Support of Open Versus Closed Random Walks. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 103:1-103:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{sauerwald_et_al:LIPIcs.ICALP.2023.103, author = {Sauerwald, Thomas and Sun, He and Vagnozzi, Danny}, title = {{The Support of Open Versus Closed Random Walks}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {103:1--103:21}, 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.103}, URN = {urn:nbn:de:0030-drops-181556}, doi = {10.4230/LIPIcs.ICALP.2023.103}, annote = {Keywords: support of random walks, eigenvalue multiplicity} }
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
Martin Knoche, Stefan Hörmann, and Gerhard Rigoll. Susceptibility to Image Resolution in Face Recognition and Training Strategies to Enhance Robustness. 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. 01:1-01:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{knoche_et_al:LITES.8.1.1, author = {Knoche, Martin and H\"{o}rmann, Stefan and Rigoll, Gerhard}, title = {{Susceptibility to Image Resolution in Face Recognition and Training Strategies to Enhance Robustness}}, booktitle = {LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision}, pages = {01:1--01:20}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {1}, editor = {Knoche, Martin and H\"{o}rmann, Stefan and Rigoll, Gerhard}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.1.1}, doi = {10.4230/LITES.8.1.1}, annote = {Keywords: recognition, resolution, cross, face, identification} }
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
Friedrich Kruber, Eduardo Sánchez Morales, Robin Egolf, Jonas Wurst, Samarjit Chakraborty, and Michael Botsch. Micro- and Macroscopic Road Traffic Analysis using Drone Image Data. 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. 02:1-02:27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@Article{kruber_et_al:LITES.8.1.2, author = {Kruber, Friedrich and S\'{a}nchez Morales, Eduardo and Egolf, Robin and Wurst, Jonas and Chakraborty, Samarjit and Botsch, Michael}, title = {{Micro- and Macroscopic Road Traffic Analysis using Drone Image Data}}, booktitle = {LITES, Volume 8, Issue 1 (2022): Special Issue on Embedded Systems for Computer Vision}, pages = {02:1--02:27}, journal = {Leibniz Transactions on Embedded Systems}, ISSN = {2199-2002}, year = {2022}, volume = {8}, number = {1}, editor = {Kruber, Friedrich and S\'{a}nchez Morales, Eduardo and Egolf, Robin and Wurst, Jonas and Chakraborty, Samarjit and Botsch, Michael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LITES.8.1.2}, doi = {10.4230/LITES.8.1.2}, annote = {Keywords: traffic data analysis, trajectory data, drone image data} }
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 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 229, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)
Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, and He Sun. Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. In 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 229, pp. 20:1-20:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{bernstein_et_al:LIPIcs.ICALP.2022.20, author = {Bernstein, Aaron and van den Brand, Jan and Probst Gutenberg, Maximilian and Nanongkai, Danupon and Saranurak, Thatchaphol and Sidford, Aaron and Sun, He}, title = {{Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary}}, booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)}, pages = {20:1--20:20}, 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.20}, URN = {urn:nbn:de:0030-drops-163611}, doi = {10.4230/LIPIcs.ICALP.2022.20}, annote = {Keywords: dynamic graph algorithm, adaptive adversary, spanner, sparsifier} }
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 173, 28th Annual European Symposium on Algorithms (ESA 2020)
Bogdan-Adrian Manghiuc, Pan Peng, and He Sun. Augmenting the Algebraic Connectivity of Graphs. In 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 173, pp. 70:1-70:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{manghiuc_et_al:LIPIcs.ESA.2020.70, author = {Manghiuc, Bogdan-Adrian and Peng, Pan and Sun, He}, title = {{Augmenting the Algebraic Connectivity of Graphs}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {70:1--70:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-162-7}, ISSN = {1868-8969}, year = {2020}, volume = {173}, editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.70}, URN = {urn:nbn:de:0030-drops-129367}, doi = {10.4230/LIPIcs.ESA.2020.70}, annote = {Keywords: Graph sparsification, Algebraic connectivity, Semidefinite programming} }
Published in: LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)
Shuai Shao and Yuxin Sun. Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems. In 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 168, pp. 96:1-96:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{shao_et_al:LIPIcs.ICALP.2020.96, author = {Shao, Shuai and Sun, Yuxin}, title = {{Contraction: A Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems}}, booktitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)}, pages = {96:1--96:15}, 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.96}, URN = {urn:nbn:de:0030-drops-125036}, doi = {10.4230/LIPIcs.ICALP.2020.96}, annote = {Keywords: 2-Spin system, Correlation decay, Zero-freeness, Phase transition, Contraction} }
Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Huan Li, He Sun, and Luca Zanetti. Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 71:1-71:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{li_et_al:LIPIcs.ESA.2019.71, author = {Li, Huan and Sun, He and Zanetti, Luca}, title = {{Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {71:1--71: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.71}, URN = {urn:nbn:de:0030-drops-111926}, doi = {10.4230/LIPIcs.ESA.2019.71}, annote = {Keywords: Spectral methods, Hermitian Laplacians, the Max-2-Lin problem, Unique Games} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Xiaoming Sun, David P. Woodruff, Guang Yang, and Jialin Zhang. Querying a Matrix Through Matrix-Vector Products. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 94:1-94:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{sun_et_al:LIPIcs.ICALP.2019.94, author = {Sun, Xiaoming and Woodruff, David P. and Yang, Guang and Zhang, Jialin}, title = {{Querying a Matrix Through Matrix-Vector Products}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {94:1--94:16}, 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.94}, URN = {urn:nbn:de:0030-drops-106709}, doi = {10.4230/LIPIcs.ICALP.2019.94}, annote = {Keywords: Communication complexity, linear algebra, sketching} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Xiaoyu He, Neng Huang, and Xiaoming Sun. On the Decision Tree Complexity of String Matching. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 45:1-45:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{he_et_al:LIPIcs.ESA.2018.45, author = {He, Xiaoyu and Huang, Neng and Sun, Xiaoming}, title = {{On the Decision Tree Complexity of String Matching}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {45:1--45:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah 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.2018.45}, URN = {urn:nbn:de:0030-drops-95082}, doi = {10.4230/LIPIcs.ESA.2018.45}, annote = {Keywords: String Matching, Decision Tree Complexity, Boolean Function, Algebraic Method} }
Published in: LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, and He Sun. Balls into bins via local search: cover time and maximum load. In 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 25, pp. 187-198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{bringmann_et_al:LIPIcs.STACS.2014.187, author = {Bringmann, Karl and Sauerwald, Thomas and Stauffer, Alexandre and Sun, He}, title = {{Balls into bins via local search: cover time and maximum load}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)}, pages = {187--198}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-65-1}, ISSN = {1868-8969}, year = {2014}, volume = {25}, editor = {Mayr, Ernst W. and Portier, Natacha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.187}, URN = {urn:nbn:de:0030-drops-44570}, doi = {10.4230/LIPIcs.STACS.2014.187}, annote = {Keywords: Balls and Bins, Stochastic Process, Randomized Algorithm} }
Feedback for Dagstuhl Publishing