shlomo-moran documents

Message complexity versus space complexity in fault tolerant broadcast protocols
Documents Message complexity versus space complexity in fault tolerant broadcast protocols
Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
Documents Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight
A Lower Bound on Wait-Free Counting
Documents A Lower Bound on Wait-Free Counting
Concurrent Counting
Documents Concurrent Counting
On the length of optimal TSP circuits in sets of bounded diameter
Documents On the length of optimal TSP circuits in sets of bounded diameter
Two-page book embedding of trees under vertex-neighborhood constraints
Documents Two-page book embedding of trees under vertex-neighborhood constraints
The complexity of identifying redundant and essential elements
Documents The complexity of identifying redundant and essential elements
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Documents Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Simple and efficient network decomposition and synchronization
Documents Simple and efficient network decomposition and synchronization
Generalized lower bounds derived from Hastad's main lemma
Documents Generalized lower bounds derived from Hastad's main lemma
A note on ‘is shortest path problem not harder than matrix multiplication?’
Documents A note on ‘is shortest path problem not harder than matrix multiplication?’
Extended impossibility results for asynchronous complete networks
Documents Extended impossibility results for asynchronous complete networks