Danny Vainstein

According to our database1, Danny Vainstein authored at least 14 papers between 2017 and 2023.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Optimization in Matching and Clustering
PhD thesis, 2023

List Update with Delays or Time Windows.
CoRR, 2023

Tree Learning: Optimal Algorithms and Sample Complexity.
CoRR, 2023

Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Tree Learning: Optimal Sample Complexity and Algorithms.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2021
The Min-Cost Matching with Concave Delays Problem.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Hierarchical Clustering of Data Streams: Scalable Algorithms and Approximation Guarantees.
Proceedings of the 38th International Conference on Machine Learning, 2021

Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Customization scenarios for de-identification of clinical notes.
BMC Medical Informatics Decis. Mak., 2020

Active deep learning to detect demographic traits in free-form clinical notes.
J. Biomed. Informatics, 2020

Hierarchical Clustering: A 0.585 Revenue Approximation.
Proceedings of the Conference on Learning Theory, 2020

2019
Tight Bounds for Clairvoyant Dynamic Bin Packing.
ACM Trans. Parallel Comput., 2019

The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2017
Brief Announcement: Object Oriented Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017


  Loading...