The following pages link to Serge A. Plotkin (Q689129):
Displaying 48 items.
- (Q202105) (redirect page) (← links)
- An improved lower bound for load balancing of tasks with unknown duration (Q287100) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- A \(k\)-median algorithm with running time independent of data size (Q703077) (← links)
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- Approximating matchings in parallel (Q1261482) (← links)
- A sublinear parallel algorithm for stable matching (Q1575960) (← links)
- Fast approximation algorithms for multicommodity flow problems (Q1892218) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q1900189) (← links)
- (Q2768320) (← links)
- (Q2768323) (← links)
- (Q2768355) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q2819545) (← links)
- Approximate majorization and fair online load balancing (Q2944501) (← links)
- On-Line Load Balancing of Temporary Tasks (Q3125220) (← links)
- Approximation Algorithms for Steiner and Directed Multicuts (Q3128195) (← links)
- (Q3128880) (← links)
- (Q3128891) (← links)
- (Q3128907) (← links)
- (Q3128926) (← links)
- (Q3138913) (← links)
- (Q3138915) (← links)
- Combining fairness with throughput (Q3192040) (← links)
- Combinatorial Algorithms for the Generalized Circulation Problem (Q3362078) (← links)
- Cost-Distance: Two Metric Network Design (Q3395048) (← links)
- Parallel Symmetry-Breaking in Sparse Graphs (Q3824434) (← links)
- (Q3840370) (← links)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (Q3990106) (← links)
- Using separation algorithms in fixed dimension (Q3990616) (← links)
- Sublinear-Time Parallel Algorithms for Matching and Related Problems (Q4033764) (← links)
- Routing and Admission Control in General Topology Networks with Poisson Arrivals (Q4216136) (← links)
- (Q4234047) (← links)
- (Q4250170) (← links)
- Time-Lapse Snapshots (Q4268845) (← links)
- Faster Approximation Algorithms For the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts (Q4302277) (← links)
- Local management of a global resource in a communication network (Q4371514) (← links)
- On-line routing of virtual circuits with applications to load balancing and machine scheduling (Q4376979) (← links)
- Scheduling data transfers in a network and the set scheduling problem (Q4458883) (← links)
- An online throughput-competitive algorithm for multicast routing and admission control (Q4675485) (← links)
- Fast Approximation Algorithms for Fractional Packing and Covering Problems (Q4848416) (← links)
- (Q4875194) (← links)
- (Q4886083) (← links)
- Online load balancing of temporary tasks (Q5060106) (← links)
- On-line load balancing with applications to machine scheduling and virtual circuit routing (Q5248533) (← links)
- Excluded minors, network decomposition, and multicommodity flow (Q5248539) (← links)
- Improved bounds on the max-flow min-cut ratio for multicommodity flows (Q5248540) (← links)
- Competitive routing of virtual circuits with unknown duration (Q5943097) (← links)
- Combining fairness with throughput: Online routing with multiple objectives (Q5952452) (← links)
