The following pages link to Charles U. Martel (Q1062625):
Displaying 37 items.
- (Q581208) (redirect page) (← links)
- Polymatroidal flows with lower bounds (Q581209) (← links)
- (Q976099) (redirect page) (← links)
- Stochastic shortest path with unlimited hops (Q976100) (← links)
- A linear time bin-packing algorithm (Q1062626) (← links)
- Lower bounds on parallel algorithms for finding the first maximal independent set (Q1072703) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- Scheduling periodically occurring tasks on multiple processors (Q1149764) (← links)
- Self-adjusting multi-way search trees (Q1178210) (← links)
- A fast algorithm for the generalized parametric minimum cut problem and applications (Q1186785) (← links)
- Asynchronous PRAMs with memory latency (Q1345653) (← links)
- Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches (Q1349960) (← links)
- (Q1603502) (redirect page) (← links)
- The expected complexity of Prim's minimum spanning tree algorithm (Q1603503) (← links)
- A general model for authenticated data structures (Q1879358) (← links)
- (Q2765457) (← links)
- (Q3024791) (← links)
- Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints (Q3706490) (← links)
- A Generalized Uniform Processor System (Q3714887) (← links)
- Fast Algorithms for Bipartite Network Flow (Q3754450) (← links)
- Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs (Q3826352) (← links)
- A comparison of phase and nonphase network flow algorithms (Q3833846) (← links)
- (Q3885187) (← links)
- Preemptive Scheduling with Release Times, Deadlines, and Due Times (Q3945580) (← links)
- (Q3962462) (← links)
- Computing Maximal “Polymatroidal” Network Flows (Q3964296) (← links)
- Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers (Q4027862) (← links)
- Unsuccessful Search in Self-Adjusting Data Structures (Q4275337) (← links)
- On the Complexity of Certified Write-All Algorithms (Q4290913) (← links)
- A Fast Algorithm for Optimally Increasing the Edge Connectivity (Q4376163) (← links)
- Dynamic prioritized conflict resolution on multiple access broadcast networks (Q4420855) (← links)
- (Q4525732) (← links)
- Optimal circuits for parallel multipliers (Q4571452) (← links)
- Flow Network Formulations of Polymatroid Optimization Problems (Q4740302) (← links)
- (Q4763410) (← links)
- Optimal prioritized conflict resolution on a multiple access channel (Q5375414) (← links)
- The structure and complexity of sports elimination numbers (Q5956833) (← links)
