Alex Davydow

According to our database1, Alex Davydow authored at least 15 papers between 2011 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Competitive buffer management for packets with latency constraints.
Comput. Networks, 2021

Formalization and taxonomy of compute-aggregate problems for cloud computing applications.
Comput. Networks, 2021

SRPT-based Congestion Control for Flows with Unknown Sizes.
Proceedings of the IFIP Networking Conference, 2021

2019
New Competitiveness Bounds for the Shared Memory Switch.
CoRR, 2019

2018
Priority Queueing for Packets With Two Characteristics.
IEEE/ACM Trans. Netw., 2018

Formalizing Compute-Aggregate Problems in Cloud Computing.
Proceedings of the Structural Information and Communication Complexity, 2018

Land Cover Classification From Satellite Imagery With U-Net and Lovasz-Softmax Loss.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2018

Building Detection From Satellite Imagery Using a Composite Loss Function.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2018

Land Cover Classification With Superpixels and Jaccard Index Post-Optimization.
Proceedings of the 2018 IEEE Conference on Computer Vision and Pattern Recognition Workshops, 2018

Personal insights on three research directions in networked systems.
Proceedings of the 10th International Conference on Communication Systems & Networks, 2018

2017
Bounds on the Number of Connected Components for Tropical Prevarieties.
Discret. Comput. Geom., 2017

Throughput optimization with latency constraints.
Proceedings of the 2017 IEEE Conference on Computer Communications, 2017

Planning in compute-aggregate problems as optimization problems on graphs.
Proceedings of the 25th IEEE International Conference on Network Protocols, 2017

2013
New Algorithms for Solving Tropical Linear Systems.
CoRR, 2013

2011
Gate Elimination for Linear Functions and New Feebly Secure Constructions.
Proceedings of the Computer Science - Theory and Applications, 2011


  Loading...