Publications

Assuming the intractability of solving the discrete logarithm with short exponent problem, it was recently shown that the trailing $n-omega(log n)$ bits of the discrete logarithm modulo an $n$- bit

We consider the following integer feasibility problem: Given positive integer numbers a(0), a(1),..., a(n), with gcd(a(1),...,a(n)) = 1 and a = (a(1),...,a(n)), does there exist a vector x is an el

I'll discuss the role of special-purpose inference mechanisms in commonsense reasoning. The title 'Hard Problems in Soft AI', has a triple meaning.

I'll discuss the role of special-purpose inference mechanisms in commonsense reasoning. The title "Hard Problems in Soft AI", has a triple meaning.

Channel measurements for a 50G passive optical network (PON) show a significant amount of intersymbol interference (ISI) due to chromatic dispersion (CD) and the use of low-cost, bandwidth-limited

The communication industry must adapt to deal with SDN which is set to rewrite the book of networking.

We consider the Buy-at-Bulk network design problem in which we wish to design a network for carrying multicommodity demands from a set of source nodes to a set of destination nodes.

We settle the complexity status of the robust network design problem by showing that a special case of the single-source hose model is coNP-Hard.

We settle the complexity status of the robust network design problem in undirected graphs.

In the Edge-Disjoint Paths problem with Congestion (EDPwC), we are given a graph with $M$ edges and a set of terminal pairs.