• Publications
  • Influence
Oblivious gossiping in ad-hoc radio networks
TLDR
It is proved that there is an oblivious deterministic algorithm for gossiping working in time and that a known deterministic constructive broadcasting algorithm can be adopted to perform oblivious gossiping in time, and the upper bound attained by the uniform oblivious randomized algorithm is asymptotically optimal. Expand
Satisfying a maximum number of pre-routed requests in all-optical rings
TLDR
This work addresses the problem of maximizing the number of satisfied requests in all-optical networks that use wavelength division multiplexing and presents a (2/3)-approximation algorithm for rings and develops a fast matching technique for a special class of bipartite graphs. Expand
Minimizing request blocking in all-optical rings
TLDR
A chain-and-matching technique for routing requests and coloring the corresponding paths which gives constant approximations for both the undirected and the directed cases and improves upon the (1 $1/e)-approximation algorithm that can be obtained by extending the iterative method of Wan and Liu. Expand
Deterministic Communication in Radio Networks with Large Labels
TLDR
Two new deterministic gossiping algorithms for ad hoc radio networks with large labels are proposed, which are the first such algorithms with subquadratic time for polynomially large N. Expand
The Complexity of Counting Functions with Easy Decision Version
TLDR
It is proved that TotP is exactly the Karp closure of self-reducible functions of #PE, which means that for each of them there exists a polynomial-time nondeterministic Turing machine which has as many computation paths as the output value. Expand
Reliable broadcast with respect to topology knowledge
TLDR
It is shown that Koo’s Certified Propagation Algorithm (CPA) is unique, against locally bounded adversaries in ad hoc networks, among all safe algorithms, i.e., algorithms which never cause a node to decide on an incorrect value. Expand
On the Complexity of Variations of Equal Sum Subsets
TLDR
The results are a step towards determining the dividing lines between polynomial time solvability, pseudo-polynomial time solVability, and strong NP-completeness of subset-sum related problems. Expand
PVM Computation of the Transitive Closure: The Dependency Graph Approach
TLDR
A dependency graph approach to the distributed parallel computation of the generic transitive closure problem by considering conceptual description of dependencies between operations as partial order graphs of events which helps to design a parallel algorithm in a way which guarantees large independence of actions. Expand
Observations on Parallel Computation of Transitive and Max-Closure Problems
TLDR
The main ingredient of the TC problem called the MAX-CLOSURE Problem is identified and the main ingredient is concentrated on parallel computation of this subproblem, also it is shown how to reduce TC to matrix multiplication once theMAX- CLOSURE is computed. Expand
Routing and Path Multi-Coloring
TLDR
A variation to this well known problem, by allowing multiple parallel links, in order to be able to satisfy any set of requests even if the available bandwidth is insufficient, to use a minimum number of active links and thus reduce network pricing. Expand
...
1
2
3
4
5
...