Published in: LIPIcs, Volume 185, 12th Innovations in Theoretical Computer Science Conference (ITCS 2021)
Sara Ahmadian, Allen Liu, Binghui Peng, and Morteza Zadimoghaddam. Distributed Load Balancing: A New Framework and Improved Guarantees. In 12th Innovations in Theoretical Computer Science Conference (ITCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 185, pp. 79:1-79:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ahmadian_et_al:LIPIcs.ITCS.2021.79, author = {Ahmadian, Sara and Liu, Allen and Peng, Binghui and Zadimoghaddam, Morteza}, title = {{Distributed Load Balancing: A New Framework and Improved Guarantees}}, booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)}, pages = {79:1--79: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.79}, URN = {urn:nbn:de:0030-drops-136186}, doi = {10.4230/LIPIcs.ITCS.2021.79}, annote = {Keywords: Load balancing, Distributed algorithms} }
Published in: LIPIcs, Volume 20, 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)
Amin Karbasi and Morteza Zadimoghaddam. Constrained Binary Identification Problem. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 550-561, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{karbasi_et_al:LIPIcs.STACS.2013.550, author = {Karbasi, Amin and Zadimoghaddam, Morteza}, title = {{Constrained Binary Identification Problem}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {550--561}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.550}, URN = {urn:nbn:de:0030-drops-39647}, doi = {10.4230/LIPIcs.STACS.2013.550}, annote = {Keywords: Network Tomography, Binary Identification Problem, Approximation Algorithms, Graph Algorithms, Tree Search Strategies, Entropy} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, and Morteza Zadimoghaddam. The Price of Anarchy in Cooperative Network Creation Games. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 301-312, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{demaine_et_al:LIPIcs.STACS.2009.1839, author = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi and Mahini, Hamid and Zadimoghaddam, Morteza}, title = {{The Price of Anarchy in Cooperative Network Creation Games}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {301--312}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1839}, URN = {urn:nbn:de:0030-drops-18390}, doi = {10.4230/LIPIcs.STACS.2009.1839}, annote = {Keywords: } }
Feedback for Dagstuhl Publishing