"Calcul quantique"@fr . "Tomographie discr\u00E8te"@fr . "Non-linear cost function"@en . "Linear search"@en . "Randomization"@en . "Single machine"@en . "Christoph" . "Unrelated machines"@en . "Processing time"@en . "General class"@en . "Makespan"@en . "Identical machines"@en . "Uncertainty"@en . "Algorithm A"@en . "Performance measures"@en . . "Social cost"@en . "Pruning rules"@en . . "Processing time oracle"@en . "Infinite linear programming"@en . "Analysis beyond the worst case"@en . "Lot sizing"@en . "Online computation"@en . "Maximum throughput scheduling"@en . "Coordination mechanisms"@en . "Job completion"@en . "Local policies"@en . "Buffer management"@en . . "And phrases Online computation"@en . "Energy minimization"@en . "Idle time"@en . "Learning Theory"@en . "Algorithmique en ligne"@fr . "Preemptive problems"@en . <135934842> . "Bipartite matching"@en . . "Complexity"@en . . "Competitive ratio"@en . "Scheduling and resource allocation"@en . . <0000-0001-8103-5333> . "Dynamic programming"@en . "N-line algorithms"@en . . "Oblivious adversary"@en . . "Price of anarchy"@en . "Online Learning"@en . "Pure Nash equilibrium"@en . . "Christoph D\u00FCrr" . . "c180ef5eb575595d447b191373ac362f" . "Multistage assembly problem"@en . "Search and exploration problems"@en . "Online algorithms"@en . "Ordonnancement"@fr . "Non-preemptive"@en . "Competitive analysis of online algorithms"@en . "D\u00FCrr" . "Gestion de tampon"@fr . "Algorithmic aspects of networks"@en . "Ordonnancement en ligne"@fr . "Search problems"@en . "Scheduling policies"@en . "Scheduling"@en .