Publications by Javad Ebrahimi Boroojeni

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

Nisheeth Vishnoi, Javad Ebrahimi Boroojeni, Damian Mateusz Straszak

Several fundamental problems that arise in optimization and computer science can be cast as follows: Given vectors v(1), ..., v(m) is an element of R-d and a constraint family B subset of 2([m]), find a set S. B that maximizes the squared volume of the sim ...

Ieee2017

Independence number of generalized Petersen graphs

Javad Ebrahimi Boroojeni

Determining the size of a maximum independent set of a graph G, denoted by alpha(G), is an NP-hard problem. Therefore many attempts are made to find upper and lower bounds, or exact values of alpha(G) for special classes of graphs. This paper is aimed towa ...

Charles Babbage Res Ctr2016

Algebraic algorithms for network information flow

Javad Ebrahimi Boroojeni

Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...

EPFL2013

Combinatorial algorithms for wireless information flow

Christina Fragouli, Javad Ebrahimi Boroojeni

long-standing open question in information theory is to characterize the unicast capacity of a wireless relay network. The difficulty arises due to the complex signal interactions induced in the network, since the wireless channel inherently broadcasts the ...

Assoc Computing Machinery2012

Properties of Network Polynomials

Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

Ieee2012

Properties of Network Polynomials

Christina Fragouli, Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

2012

Algebraic Algorithms for Vector Network Coding

Christina Fragouli, Javad Ebrahimi Boroojeni

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

Institute of Electrical and Electronics Engineers2011

Network simplification: the Gaussian diamond network with Multiple Antennas

Christina Fragouli, Ayfer Özgür Aydin, Javad Ebrahimi Boroojeni

We consider the N-relay Gaussian diamond network when the source and the destination have ns ≥ 2 and nd ≥ 2 antennas respectively. We show that when ns = nd = 2 and when the individual MISO channels from the source to each relay and the SIMO channels from ...

2011

Algebraic techniques for deterministic networks

Christina Fragouli, Javad Ebrahimi Boroojeni

We here summarize some recent advances in the study of linear deterministic networks, recently proposed as approximations for wireless channels. This work started by extending the algebraic framework developed for multicasting over graphs in [1] to include ...

2010

Vector Network Coding

Christina Fragouli, Javad Ebrahimi Boroojeni

We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying th ...

2010

Javad Ebrahimi Boroojeni

Graph Chatbot

Chat with Graph Search

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

Independence number of generalized Petersen graphs

Algebraic algorithms for network information flow

Combinatorial algorithms for wireless information flow

Properties of Network Polynomials

Properties of Network Polynomials

Algebraic Algorithms for Vector Network Coding

Network simplification: the Gaussian diamond network with Multiple Antennas

Algebraic techniques for deterministic networks

Vector Network Coding

Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration

Independence number of generalized Petersen graphs

Algebraic algorithms for network information flow

Properties of Network Polynomials

Properties of Network Polynomials

Combinatorial algorithms for wireless information flow

Algebraic Algorithms for Vector Network Coding

Network simplification: the Gaussian diamond network with Multiple Antennas

Algebraic techniques for deterministic networks

Vector Network Coding