Æȷοì
Mahsa Eftekhari
Mahsa Eftekhari
Microsoft AI
microsoft.comÀÇ À̸ÞÀÏ È®ÀÎµÊ - ȨÆäÀÌÁö
Á¦¸ñ
Àοë
Àοë
¿¬µµ
A time and space optimal stable population protocol solving exact majority
D Doty, M Eftekhari, L Gąsieniec, E Severson, P Uznański, G Stachowiak
IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 1044-1055, 2022
322022
Efficient size estimation and impossibility of termination in uniform dense population protocols
D Doty, M Eftekhari
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing ¡¦, 2019
302019
Brief announcement: Exact size counting in uniform population protocols in nearly logarithmic time
D Doty, M Eftekhari, O Michail, PG Spirakis, M Theofilatos
International Symposium on Distributed Computing (DISC 2018) 121, 46:1-46:3, 2018
152018
Message Complexity of Population Protocols
T Amir, J Aspnes, D Doty, M Eftekhari, E Severson
International Symposium on Distributed Computing (DISC 2020) 179, 6:1-6:18, 2020
102020
Exact size counting in uniform population protocols in nearly logarithmic time
D Doty, M Eftekhari, O Michail, PG Spirakis, M Theofilatos
arXiv preprint arXiv:1805.04832, 2018
82018
A survey of size counting in population protocols
D Doty, M Eftekhari
Theoretical Computer Science (TCS) 894, 91-102, 2021
72021
Dynamic size counting in population protocols
D Doty, M Eftekhari
Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) 221, 13 ¡¦, 2022
42022
Brief announcement: A time and space optimal stable population protocol solving exact majority
D Doty, M Eftekhari, L Gąsieniec, E Severson, G Stachowiak, P Uznański
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing ¡¦, 2021
22021
A stable majority population protocol using logarithmic time and states
D Doty, M Eftekhari, E Severson
arXiv preprint arXiv:2012.15800, 2020
22020
Computation in population protocols: exact majority, uniform computation, and the dynamic model
M Eftekhari
University of California, Davis, 2022
2022
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–10