The following pages link to Annamária Kovács (Q388121):
Displaying 17 items.
- A truthful constant approximation for maximizing the minimum load on related machines (Q388122) (← links)
- The optimal structure of algorithms for \(\alpha\)-paging (Q495673) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- A Deterministic Truthful PTAS for Scheduling Related Machines (Q2862203) (← links)
- Mechanism design for fractional scheduling on unrelated machines (Q2930317) (← links)
- Tighter Approximation Bounds for LPT Scheduling in Two Special Cases (Q3434556) (← links)
- Mechanisms with Monitoring for Truthful RAM Allocation (Q3460805) (← links)
- Online Paging for Flash Memory Devices (Q3652223) (← links)
- On the Nisan-Ronen conjecture for submodular valuations (Q5144994) (← links)
- STACS 2004 (Q5309688) (← links)
- (Q5417684) (← links)
- Mechanism Design for Fractional Scheduling on Unrelated Machines (Q5428796) (← links)
- Algorithms – ESA 2005 (Q5475870) (← links)
- Automata, Languages and Programming (Q5716832) (← links)
- Bayesian Combinatorial Auctions (Q5895072) (← links)
- Bayesian Combinatorial Auctions (Q5900245) (← links)
