PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Li, Minming"

Author of the publication

copydeleteadd this publication to your clipboard
Admission Control and Channel Allocation of Multi-item Requests for Real-Time Data Broadcast.

, , , and . RTCSA, page 202-211. IEEE Computer Society, (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. You can also use the button next to the name to display some publications already assigned to the person.

M.Sc. Yunxuan Li University of Stuttgart

Yu Li University of Stuttgart

Zheng Li University of Stuttgart

Jie Li University of Stuttgart

Congxin Li University of Stuttgart

 

Other publications of authors with the same name

Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics.. Theor. Comput. Sci., 412 (32): 4074-4080 (2011)Approximately optimal trees for group key management with batch updates., , , , and . Theor. Comput. Sci., 410 (11): 1013-1021 (2009)Performance-aware energy optimization on mobile devices in cellular network., , , , , and . INFOCOM, page 1123-1131. IEEE, (2014)Network Pollution Games., , , , , and . Algorithmica, 81 (1): 124-166 (2019)Energy Optimal Task Scheduling with Normally-Off Local Memory and Sleep-Aware Shared Memory with Access Conflict., , , , and . IEEE Trans. Computers, 67 (8): 1121-1135 (2018)Network Pollution Games., , , , , and . AAMAS, page 23-31. ACM, (2016)Single and Multiple Device DSA Problem, Complexities and Online Algorithms., , , , and . ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 218-229. Springer, (2010)An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint., , , and . ISAAC, volume 92 of LIPIcs, page 19:1-19:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Voltage Scheduling.. Encyclopedia of Algorithms, Springer, (2008)Scheduling fully parallel jobs., , and . J. Scheduling, 21 (6): 619-631 (2018)