The following pages link to John Noga (Q189395):
Displayed 33 items.
- Item:Q189395 (redirect page) (← links)
- Knowledge state algorithms (Q548658) (← links)
- Optimally competitive list batching (Q837154) (← links)
- LRU is better than FIFO (Q1277395) (← links)
- More on randomized on-line algorithms for caching. (Q1401208) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Competitive analysis of randomized paging algorithms (Q1575677) (← links)
- Caching for web searching (Q1601026) (← links)
- A faster off-line algorithm for the TCP acknowledgement problem. (Q1603523) (← links)
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. (Q1853151) (← links)
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022) (← links)
- Uniform metrical task systems with a limited number of states (Q2380010) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- (Q2721975) (← links)
- (Q3185841) (← links)
- Oblivious Medians Via Online Bidding (Q3525769) (← links)
- Equitable Revisited (Q3527231) (← links)
- (Q4250167) (← links)
- (Q4250169) (← links)
- (Q4252304) (← links)
- (Q4263726) (← links)
- Dynamic TCP acknowledgment in the LogP model (Q4458887) (← links)
- (Q4535068) (← links)
- Competitive analysis of randomized paging algorithms (Q4595503) (← links)
- (Q4737209) (← links)
- (Q4796169) (← links)
- (Q4941834) (← links)
- Competitive Algorithms for Relaxed List Update and Multilevel Caching (Q4943079) (← links)
- Algorithm Theory - SWAT 2004 (Q5315404) (← links)
- Fundamentals of Computation Theory (Q5492935) (← links)
- Approximation and Online Algorithms (Q5898467) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)