( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Envy-Free Pricing with General Supply Constraints for Unit Demand Consumers.

, , и . J. Comput. Sci. Technol., 27 (4): 702-709 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Bak Im

Hyun Im

Hyoungjin Im

Chan Im

Hermann Im Brahm

 

Другие публикации лиц с тем же именем

A tutorial on amortized local competitiveness in online scheduling, , и . SIGACT News, 42 (2): 83--97 (июня 2011)Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant Scheduling under Polyhedral Constraints., , и . J. ACM, 65 (1): 3:1-3:33 (2018)Non-clairvoyantly Scheduling to Minimize Convex Functions., , , и . Algorithmica, 81 (9): 3746-3764 (2019)Brief announcement: online batch scheduling for flow objectives., и . SPAA, стр. 102-104. ACM, (2013)Competitively scheduling tasks with intermediate parallelizability., , , и . SPAA, стр. 22-29. ACM, (2014)Minimum Latency Submodular Cover., , и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 485-497. Springer, (2012)Shortest-Elapsed-Time-First on a Multiprocessor., , , и . MedAlg, том 7659 из Lecture Notes in Computer Science, стр. 82-92. Springer, (2012)Competitive Analysis of Constrained Queueing Systems., , и . ICALP, том 55 из LIPIcs, стр. 143:1-143:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Stochastic Scheduling of Heavy-tailed Jobs., , и . STACS, том 30 из LIPIcs, стр. 474-486. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Fast and Parallelizable Ranking with Outliers from Pairwise Comparisons., и . ECML/PKDD (1), том 11906 из Lecture Notes in Computer Science, стр. 173-188. Springer, (2019)