Marina Lipshteyn

According to our database, Marina Lipshteyn authored at least 20 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Empowering Azure Storage with RDMA.

Wei Bai, Shanim Sainul Abdeen, Ankit Agrawal, Krishan Kumar Attre, Paramvir Bahl, Ameya Bhagat, Gowri Bhaskara, Tanya Brokhman, Lei Cao, Ahmad Cheema, Rebecca Chow, Jeff Cohen, Mahmoud Elhaddad, Vivek Ette, Igal Figlin, Daniel Firestone, Mathew George, Ilya German, Lakhmeet Ghai, Eric Green, Albert G. Greenberg, Manish Gupta, Randy Haagens, Matthew Hendel, Ridwan Howlader, Neetha John, Julia Johnstone, Tom Jolly, Greg Kramer, David Kruse, Ankit Kumar, Erica Lan, Ivan Lee, Avi Levy, Marina Lipshteyn, Xin Liu, Chen Liu, Guohan Lu, Yuemin Lu, Xiakun Lu, Vadim Makhervaks, Ulad Malashanka, David A. Maltz, Ilias Marinos, Rohan Mehta, Sharda Murthi, Anup Namdhari, Aaron Ogus, Jitendra Padhye, Madhav Pandya, Douglas Phillips, Adrian Power, Suraj Puri, Shachar Raindel, Jordan Rhee, Anthony Russo, Maneesh Sah, Ali Sheriff, Chris Sparacino, Ashutosh Srivastava, Weixiang Sun, Nick Swanson, Fuhou Tian, Lukasz Tomczyk, Vamsi Vadlamuri, Alec Wolman, Ying Xie, Joyce Yom, Lihua Yuan, Yanzhao Zhang, Brian Zill

Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation, 2023

2017

Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2.

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Math., 2017

2016

RDMA over Commodity Ethernet at Scale.

Chuanxiong Guo, Haitao Wu, Zhong Deng, Gaurav Soni, Jianxi Ye, Jitu Padhye, Marina Lipshteyn

Proceedings of the ACM SIGCOMM 2016 Conference, Florianopolis, Brazil, August 22-26, 2016, 2016

2015

Congestion Control for Large-Scale RDMA Deployments.

Yibo Zhu, Haggai Eran, Daniel Firestone, Chuanxiong Guo, Marina Lipshteyn, Yehonatan Liron, Jitendra Padhye, Shachar Raindel, Mohamad Haj Yahia, Ming Zhang

Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, 2015

2013

Single bend paths on a grid have strong helly number 4: <i>errata atque emendationes ad</i> "edge intersection graphs of single bend paths on a grid".

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Networks, 2013

2012

Vertex Intersection Graphs of Paths on a Grid.

Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern

J. Graph Algorithms Appl., 2012

2011

Path-Bicolorable Graphs.

Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn

Graphs Comb., 2011

String graphs of k-bend paths on a grid.

Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn, Michal Stern

Electron. Notes Discret. Math., 2011

Foreword.

Marina Lipshteyn, Ross M. McConnell, Haim Kaplan, Vadim E. Levit

Discret. Appl. Math., 2011

2010

On the bi-enhancement of chordal-bipartite probe graphs.

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Inf. Process. Lett., 2010

2009

Edge intersection graphs of single bend paths on a grid.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Networks, 2009

Intersection models of weakly chordal graphs.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Appl. Math., 2009

2008

Representing edge intersection graphs of paths on degree 4 trees.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Math., 2008

Equivalences and the complete hierarchy of intersection graphs of paths in a tree.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Appl. Math., 2008

The k-edge intersection graphs of paths in a tree.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Discret. Appl. Math., 2008

What Is between Chordal and Weakly Chordal Graphs?.

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007

Recognizing Chordal Probe Graphs and Cycle-Bicolorable Graphs.

Anne Berry, Martin Charles Golumbic, Marina Lipshteyn

SIAM J. Discret. Math., 2007

2006

Finding Intersection Models of Weakly Chordal Graphs.

Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2004

Chordal probe graphs.

Martin Charles Golumbic, Marina Lipshteyn

Discret. Appl. Math., 2004

Two tricks to triangulate chordal probe graphs in polynomial time.

Anne Berry, Martin Charles Golumbic, Marina Lipshteyn

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004