The following pages link to Shmuel Zaks (Q248937):
Displaying 45 items.
- Graphs of edge-intersecting and non-splitting paths (Q288788) (← links)
- Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
- Approximating the traffic grooming problem in tree and star networks (Q436821) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Tight bounds on the round complexity of distributed 1-solvable tasks (Q673104) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- The cycle lemma and some applications (Q751658) (← links)
- A new algorithm for generation of permutations (Q795511) (← links)
- Hierarchical \(b\)-matching (Q831805) (← links)
- On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing (Q878685) (← links)
- On the intersection of tolerance and cocomparability graphs (Q896656) (← links)
- On-line maximum matching in complete multi-partite graphs with an application to optical networks (Q896661) (← links)
- On the complexity of the regenerator location problem treewidth and other parameters (Q896670) (← links)
- Selfishness, collusion and power of local search for the ADMs minimization problem (Q931111) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- On minimizing the number of ADMs in a general topology optical network (Q967313) (← links)
- Optimal on-line colorings for minimizing the number of ADMs in optical networks (Q972358) (← links)
- On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion and related algorithms (Q992514) (← links)
- Approximating the traffic grooming problem (Q1018099) (← links)
- On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective (Q1055392) (← links)
- (Q1098290) (redirect page) (← links)
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Ordered trees and non-crossing partitions (Q1103619) (← links)
- Bit complexity of order statistics on a distributed star network (Q1116337) (← links)
- Lexicographic generation of ordered trees (Q1133548) (← links)
- Enumerations of ordered trees (Q1144044) (← links)
- Golden ratios in a pairs covering problem (Q1166533) (← links)
- An NP-complete matching problem (Q1166935) (← links)
- Efficient elections in chordal ring networks (Q1262125) (← links)
- Labelled trees and pairs of input--output permutations in priority queues (Q1275072) (← links)
- Scheduling in synchronous networks and the greedy algorithm (Q1292430) (← links)
- Optimal bounds for the change-making problem (Q1314390) (← links)
- The bit complexity of distributed sorting (Q1361409) (← links)
- Optimal layouts on a chain ATM network (Q1392534) (← links)
- On the total\(_k\)-diameter of connection networks (Q1583253) (← links)
- Flexible bandwidth assignment with application to optical networks (Q1617285) (← links)
- Optimal lower bounds for some distributed algorithms for a complete network of processors (Q1823691) (← links)
- The complexity of the characterization of networks supporting shortest-path interval routing. (Q1853562) (← links)
- Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony (Q1938370) (← links)
- On the Online Coalition Structure Generation Problem (Q5026232) (← links)
- Minimum dominating sets of intervals on lines (Q6064049) (← links)
