Michael Dinitz
Orcid: 0000-0002-2632-966X
According to our database1,
Michael Dinitz
authored at least 79 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the IEEE INFOCOM 2024, 2024
2023
CoRR, 2023
Proceedings of the Approximation and Online Algorithms - 21st International Workshop, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
2022
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
2020
ACM Trans. Algorithms, 2020
Proceedings of the Approximation and Online Algorithms - 18th International Workshop, 2020
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the 39th IEEE Conference on Computer Communications, 2020
2019
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the Algorithms for Sensor Systems, 2019
2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
2017
Improved Approximation Algorithm for Steiner <i>k</i>-Forest with Nearly Uniform Weights.
ACM Trans. Algorithms, 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017
Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs.
Proceedings of the 37th IEEE International Conference on Distributed Computing Systems, 2017
2016
Label Cover Instances with Large Girth and the Hardness of Approximating Basic <i>k</i>-Spanner.
ACM Trans. Algorithms, 2016
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
Proceedings of the 12th International on Conference on emerging Networking EXperiments and Technologies, 2016
2015
Distributed Comput., 2015
Proceedings of the 14th ACM Workshop on Hot Topics in Networks, Philadelphia, PA, USA, November 16, 2015
2014
Proceedings of the Approximation, 2014
2013
Proceedings of the Distributed Computing - 27th International Symposium, 2013
Proceedings of the Integer Programming and Combinatorial Optimization, 2013
2012
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012
2011
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011
2010
Graphical representations of clutters.
Ars Comb., 2010
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010
2009
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009
Brief announcement: distributed algorithms for approximating wireless network capacity.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009
Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009
2008
Proceedings of the Distributed Computing, 22nd International Symposium, 2008
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
2007
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
2006