The following pages link to Ephraim Korach (Q216241):
Displaying 36 items.
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- (Q937410) (redirect page) (← links)
- Anticoloring of a family of grid graphs (Q937411) (← links)
- Minimal cutwidth linear arrangements of abelian Cayley graphs (Q942098) (← links)
- Anticoloring and separation of graphs (Q960942) (← links)
- Tight integral duality gap in the Chinese postman problem (Q1196167) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- A fast algorithm for maximum integral two-commodity flow in planar graphs (Q1314324) (← links)
- Two-trees optimal \(T\)-join and integral packing of \(T\)-cuts (Q1333320) (← links)
- Equistable series-parallel graphs (Q1414590) (← links)
- Tree-width, path-width, and cutwidth (Q1801672) (← links)
- Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691) (← links)
- On extremal multiflows (Q1850477) (← links)
- Tabu search for the BWC problem (Q1928269) (← links)
- Anticoloring of the rook's graph (Q2345624) (← links)
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- The Capacitated p-facility Location Problem on the Real Line (Q3146129) (← links)
- (Q3319762) (← links)
- Distributed algorithms for finding centers and medians in networks (Q3332262) (← links)
- Distributed election in a circle without a global sense of orientation (Q3339287) (← links)
- On the Optimal Stars Clustering Tree Problem (Q3439552) (← links)
- A Reduction of the Anticoloring Problem to Connected Graphs (Q3439618) (← links)
- Lower Bounds for Distributed Maximum-Finding Algorithms (Q3765249) (← links)
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors (Q3769980) (← links)
- (Q3814791) (← links)
- Optimal and myopic search in a binary random vector (Q4215691) (← links)
- Testing Shared Memories (Q4376172) (← links)
- (Q4745251) (← links)
- On the existence of special depth first search trees (Q4842707) (← links)
- (Q4928166) (← links)
- Applications of a special polynomial class of TSP (Q4928244) (← links)
- (Q5485315) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897561) (← links)
- The sound of silence: Guessing games for saving energy in a mobile environment (Q5949539) (← links)
