Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Borokhovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j11]Marco Chiesa
, Roshan Sedar, Gianni Antichi, Michael Borokhovich, Andrzej Kamisinski, Georgios Nikolaidis, Stefan Schmid:
Fast ReRoute on Programmable Switches. IEEE/ACM Trans. Netw. 29(2): 637-650 (2021)
2010 – 2019
- 2019
- [c18]Marco Chiesa, Roshan Sedar, Gianni Antichi, Michael Borokhovich, Andrzej Kamisinski, Georgios Nikolaidis, Stefan Schmid:
PURR: a primitive for reconfigurable fast reroute: hope for the best and program for the worst. CoNEXT 2019: 1-14 - 2018
- [j10]Michael Borokhovich, Clement Rault, Liron Schiff, Stefan Schmid:
The show must go on: Fundamental data plane connectivity services for dependable SDNs. Comput. Commun. 116: 172-183 (2018) - [j9]Avhishek Chatterjee, Michael Borokhovich, Lav R. Varshney, Sriram Vishwanath:
Efficient and Flexible Crowdsourcing of Specialized Tasks With Precedence Constraints. IEEE/ACM Trans. Netw. 26(2): 879-892 (2018) - [j8]Michael Borokhovich, Yvonne-Anne Pignolet, Stefan Schmid, Gilles Trédan:
Load-Optimal Local Fast Rerouting for Dense Networks. IEEE/ACM Trans. Netw. 26(6): 2583-2597 (2018) - [c17]Roshan Sedar, Michael Borokhovich, Marco Chiesa, Gianni Antichi, Stefan Schmid:
Supporting Emerging Applications With Low-Latency Failover in P4. NEAT@SIGCOMM 2018: 52-57 - 2017
- [j7]Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed computing on core-periphery networks: Axiom-based design. J. Parallel Distributed Comput. 99: 51-67 (2017) - 2016
- [j6]Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw. 24(3): 1421-1433 (2016) - [c16]Muryong Kim, Yitao Chen, Michael Borokhovich, Sriram Vishwanath:
Index-Coded Retransmission for OFDMA Downlink. GLOBECOM 2016: 1-6 - [c15]Avhishek Chatterjee, Michael Borokhovich, Lav R. Varshney, Sriram Vishwanath:
Efficient and flexible crowdsourcing of specialized tasks with precedence constraints. INFOCOM 2016: 1-9 - [c14]Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich, Alexandros G. Dimakis:
Distributed Estimation of Graph 4-Profiles. WWW 2016: 483-493 - [i12]Avhishek Chatterjee, Michael Borokhovich, Lav R. Varshney, Sriram Vishwanath:
Efficient and Flexible Crowdsourcing of Specialized Tasks with Precedence Constraints. CoRR abs/1601.04094 (2016) - 2015
- [j5]Ioannis Mitliagkas, Michael Borokhovich, Alexandros G. Dimakis, Constantine Caramanis:
FrogWild! - Fast PageRank Approximations on Graph Engines. Proc. VLDB Endow. 8(8): 874-885 (2015) - [j4]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting grid networks to minimize expected path length. Theor. Comput. Sci. 584: 91-102 (2015) - [c13]Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich, Alexandros G. Dimakis:
Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs. KDD 2015: 229-238 - [i11]Ioannis Mitliagkas, Michael Borokhovich, Alexandros G. Dimakis, Constantine Caramanis:
FrogWild! - Fast PageRank Approximations on Graph Engines. CoRR abs/1502.04281 (2015) - [i10]Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich, Alexandros G. Dimakis:
Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs. CoRR abs/1506.06671 (2015) - [i9]Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich, Alexandros G. Dimakis:
Distributed Estimation of Graph 4-Profiles. CoRR abs/1510.02215 (2015) - 2014
- [j3]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. 114(12): 728-733 (2014) - [j2]Michael Borokhovich, Chen Avin, Zvi Lotker:
Bounds for algebraic gossip on graphs. Random Struct. Algorithms 45(2): 185-217 (2014) - [c12]Liron Schiff, Michael Borokhovich, Stefan Schmid:
Reclaiming the Brain: Useful OpenFlow Functions in the Data Plane. HotNets 2014: 7:1-7:7 - [c11]Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed Computing on Core-Periphery Networks: Axiom-Based Design. ICALP (2) 2014: 399-410 - [c10]Michael Borokhovich, Liron Schiff, Stefan Schmid:
Provable data plane connectivity with local fast failover: introducing openflow graph algorithms. HotSDN 2014: 121-126 - [i8]Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg:
Distributed Computing on Core-Periphery Networks: Axiom-based Design. CoRR abs/1404.6561 (2014) - 2013
- [j1]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order optimal information spreading using algebraic gossip. Distributed Comput. 26(2): 99-117 (2013) - [c9]Michael Borokhovich, Stefan Schmid:
How (Not) to Shoot in Your Foot with SDN Local Fast Failover - A Load-Connectivity Tradeoff. OPODIS 2013: 68-82 - [c8]Chen Avin, Michael Borokhovich, Stefan Schmid:
OBST: A self-adjusting peer-to-peer overlay based on multiple BSTs. P2P 2013: 1-5 - [c7]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting Grid Networks to Minimize Expected Path Length. SIROCCO 2013: 36-54 - [c6]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and Applications. SODA 2013: 478-497 - [i7]Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Generalized Perron-Frobenius Theorem for Nonsquare Matrices. CoRR abs/1308.5915 (2013) - [i6]Michael Borokhovich, Stefan Schmid:
How (Not) to Shoot in Your Foot with SDN Local Fast Failover: A Load-Connectivity Tradeoff. CoRR abs/1309.3150 (2013) - [i5]Chen Avin, Michael Borokhovich, Stefan Schmid:
OBST: A Self-Adjusting Peer-to-Peer Overlay Based on Multiple BSTs. CoRR abs/1309.3319 (2013) - 2012
- [c5]Chen Avin, Michael Borokhovich, Yoram Haddad, Zvi Lotker:
Optimal virtual traffic light placement. FOMC 2012: 6 - 2011
- [c4]Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker:
Efficient distributed source coding for multiple receivers via matrix sparsification. ISIT 2011: 2045-2049 - [c3]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order optimal information spreading using algebraic gossip. PODC 2011: 363-372 - [i4]Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker:
Order Optimal Information Spreading Using Algebraic Gossip. CoRR abs/1101.4372 (2011) - [i3]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-Adjusting Networks to Minimize Expected Path Length. CoRR abs/1110.0196 (2011) - [i2]Chen Avin, Michael Borokhovich, Asaf Cohen, Zvi Lotker:
Efficient Joint Network-Source Coding for Multiple Terminals with Side Information. CoRR abs/1111.5735 (2011) - 2010
- [c2]Michael Borokhovich, Chen Avin, Zvi Lotker:
Tight bounds for algebraic gossip on graphs. ISIT 2010: 1758-1762 - [i1]Michael Borokhovich, Chen Avin, Zvi Lotker:
Tight Bounds for Algebraic Gossip on Graphs. CoRR abs/1001.3265 (2010)
2000 – 2009
- 2009
- [c1]Chen Avin, Michael Borokhovich, Arik Goldfeld:
Mastering (Virtual) Networks - A Case Study of Virtualizing Internet Lab. CSEDU (2) 2009: 250-257
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
