Michael Borokhovich

Orcid: 0000-0002-3367-0401

According to our database1, Michael Borokhovich authored at least 28 papers between 2009 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Fast ReRoute on Programmable Switches.
IEEE/ACM Trans. Netw., 2021

2019
PURR: a primitive for reconfigurable fast reroute: hope for the best and program for the worst.
Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies, 2019

2018
Efficient and Flexible Crowdsourcing of Specialized Tasks With Precedence Constraints.
IEEE/ACM Trans. Netw., 2018

Load-Optimal Local Fast Rerouting for Dense Networks.
IEEE/ACM Trans. Netw., 2018

The show must go on: Fundamental data plane connectivity services for dependable SDNs.
Comput. Commun., 2018

Supporting Emerging Applications With Low-Latency Failover in P4.
Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies, 2018

2017
Distributed computing on core-periphery networks: Axiom-based design.
J. Parallel Distributed Comput., 2017

2016
SplayNet: Towards Locally Self-Adjusting Networks.
IEEE/ACM Trans. Netw., 2016

Distributed Estimation of Graph 4-Profiles.
Proceedings of the 25th International Conference on World Wide Web, 2016

Index-Coded Retransmission for OFDMA Downlink.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

2015
Self-adjusting grid networks to minimize expected path length.
Theor. Comput. Sci., 2015

FrogWild! - Fast PageRank Approximations on Graph Engines.
Proc. VLDB Endow., 2015

Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2014
Bounds for algebraic gossip on graphs.
Random Struct. Algorithms, 2014

Testing the irreducibility of nonsquare Perron-Frobenius systems.
Inf. Process. Lett., 2014

Provable data plane connectivity with local fast failover: introducing openflow graph algorithms.
Proceedings of the third workshop on Hot topics in software defined networking, 2014

Reclaiming the Brain: Useful OpenFlow Functions in the Data Plane.
Proceedings of the 13th ACM Workshop on Hot Topics in Networks, 2014

2013
Order optimal information spreading using algebraic gossip.
Distributed Comput., 2013

Generalized Perron-Frobenius Theorem for Nonsquare Matrices.
CoRR, 2013

Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications.
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs.
Proceedings of the 13th IEEE International Conference on Peer-to-Peer Computing, 2013

How (Not) to Shoot in Your Foot with SDN Local Fast Failover - A Load-Connectivity Tradeoff.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

2012
Optimal virtual traffic light placement.
Proceedings of the FOMC'12, 2012

2011
Efficient Joint Network-Source Coding for Multiple Terminals with Side Information
CoRR, 2011

Self-Adjusting Networks to Minimize Expected Path Length
CoRR, 2011

Efficient distributed source coding for multiple receivers via matrix sparsification.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Tight bounds for algebraic gossip on graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab.
Proceedings of the CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Lisboa, Portugal, March 23-26, 2009, 2009


  Loading...