default search action
Joseph Naor
Seffi Naor – Joseph (Seffi) Naor
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c149]Yaron Fairstein, Joseph (Seffi) Naor, Tomer Tsachor:
Distributional Online Weighted Paging with Limited Horizon. APPROX/RANDOM 2024: 15:1-15:15 - [c148]Ilan Doron-Arad, Joseph (Seffi) Naor:
Non-Linear Paging. ICALP 2024: 57:1-57:19 - [c147]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
SSD Wear Leveling with Optimal Guarantees. SOSA 2024: 306-320 - [i22]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Packing Partially Ordered Items. CoRR abs/2403.01568 (2024) - [i21]Ilan Doron-Arad, Joseph Naor:
Non-Linear Paging. CoRR abs/2404.13334 (2024) - 2023
- [j103]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
Offline and Online Algorithms for SSD Management. Commun. ACM 66(7): 129-137 (2023) - [j102]Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. 197(2): 499-527 (2023) - [c146]Niv Buchbinder, Joseph (Seffi) Naor, David Wajc:
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). SODA 2023: 2030-2068 - [i20]Joseph Naor, Aravind Srinivasan, David Wajc:
Online Dependent Rounding Schemes. CoRR abs/2301.08680 (2023) - 2022
- [j101]Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. Algorithmica 84(2): 304-324 (2022) - [j100]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. 125: 149-165 (2022) - [c145]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
Offline and Online Algorithms for SSD Management. SIGMETRICS (Abstracts) 2022: 89-90 - [c144]Christian Coester, Roie Levin, Joseph (Seffi) Naor, Ohad Talmon:
Competitive Algorithms for Block-Aware Caching. SPAA 2022: 161-172 - [e2]Joseph (Seffi) Naor, Niv Buchbinder:
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. SIAM 2022, ISBN 978-1-61197-707-3 [contents] - [i19]Christian Coester, Roie Levin, Joseph Naor, Ohad Talmon:
Competitive Algorithms for Block-Aware Caching. CoRR abs/2205.12249 (2022) - 2021
- [j99]Alfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab, Joseph (Seffi) Naor, Nima Anari:
Structured Robust Submodular Maximization: Offline and Online Algorithms. INFORMS J. Comput. 33(4): 1590-1607 (2021) - [j98]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
Offline and Online Algorithms for SSD Management. Proc. ACM Meas. Anal. Comput. Syst. 5(3): 33:1-33:28 (2021) - [j97]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. ACM Trans. Economics and Comput. 9(2): 11:1-11:22 (2021) - [c143]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. APPROX-RANDOM 2021: 15:1-15:18 - [c142]Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor:
Invited Talks. CIAC 2021: 3-19 - [c141]Joseph (Seffi) Naor:
Recent Advances in Competitive Analysis of Online Algorithms. CIAC 2021: 19 - [c140]Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. IPCO 2021: 15-29 - [c139]Itay Hubara, Brian Chmiel, Moshe Island, Ron Banner, Joseph Naor, Daniel Soudry:
Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks. NeurIPS 2021: 21099-21111 - [c138]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor:
Online Virtual Machine Allocation with Lifetime and Load Predictions. SIGMETRICS (Abstracts) 2021: 9-10 - [c137]Nikhil Bansal, Joseph (Seffi) Naor, Ohad Talmon:
Efficient Online Weighted Multi-Level Paging. SPAA 2021: 94-104 - [i18]Itay Hubara, Brian Chmiel, Moshe Island, Ron Banner, Seffi Naor, Daniel Soudry:
Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks. CoRR abs/2102.08124 (2021) - [i17]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. CoRR abs/2105.00882 (2021) - [i16]Niv Buchbinder, Joseph Naor, David Wajc:
A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR abs/2106.04863 (2021) - 2020
- [c136]Yaron Fairstein, Dor Harris, Joseph Naor, Danny Raz:
NFV Placement in Resource-Scarce Edge Nodes. CCGRID 2020: 51-60 - [c135]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA 2020: 44:1-44:19 - [i15]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR abs/2004.12224 (2020) - [i14]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor:
Online Virtual Machine Allocation with Predictions. CoRR abs/2011.06250 (2020) - [i13]Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR abs/2012.02226 (2020)
2010 – 2019
- 2019
- [c134]Nima Anari, Nika Haghtalab, Seffi Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Structured Robust Submodular Maximization: Offline and Online Algorithms. AISTATS 2019: 3128-3137 - [c133]Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. ICALP 2019: 88:1-88:14 - [c132]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor:
k-Servers with a Smile: Online Algorithms via Projections. SODA 2019: 98-116 - [i12]Joseph Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. CoRR abs/1904.11777 (2019) - 2018
- [j96]Niv Buchbinder, Joseph (Seffi) Naor, Roy Schwartz:
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. 47(4): 1463-1482 (2018) - [j95]Joseph (Seffi) Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. ACM Trans. Economics and Comput. 6(3-4): 16:1-16:20 (2018) - [c131]Virajith Jalaparti, Chris Douglas, Mainak Ghosh, Ashvin Agrawal, Avrilia Floratou, Srikanth Kandula, Ishai Menache, Joseph (Seffi) Naor, Sriram Rao:
Netco: Cache and I/O Management for Analytics over Disaggregated Stores. SoCC 2018: 186-198 - [c130]Dor Harris, Joseph Naor, Danny Raz:
Latency Aware Placement in Multi-access Edge Computing. NetSoft 2018: 132-140 - [c129]Yaron Fairstein, Seffi Naor, Danny Raz:
Algorithms for Dynamic NFV Workload. WAOA 2018: 238-258 - [c128]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. WINE 2018: 80-95 - [i11]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor:
k-Servers with a Smile: Online Algorithms via Projections. CoRR abs/1810.07508 (2018) - 2017
- [j94]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20(3): 279-292 (2017) - [j93]Moran Feldman, Joseph (Seffi) Naor:
Non-preemptive buffer management for latency sensitive packets. J. Sched. 20(4): 337-353 (2017) - [c127]Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz:
Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. ICALP 2017: 34:1-34:15 - [c126]Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA 2017: 1235-1244 - [i10]Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR abs/1701.01936 (2017) - [i9]Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Robust Submodular Maximization: Offline and Online Algorithms. CoRR abs/1710.04740 (2017) - 2016
- [j92]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41(2): 612-625 (2016) - [j91]Roee Engelberg, Joseph Naor:
Equilibria in Online Games. SIAM J. Comput. 45(2): 232-267 (2016) - [c125]Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi:
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157 - [c124]Noa Elad, Satyen Kale, Joseph (Seffi) Naor:
Online Semidefinite Programming. ICALP 2016: 40:1-40:13 - [i8]Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. CoRR abs/1611.07745 (2016) - 2015
- [j90]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (2015) - [j89]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [j88]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters. ACM Trans. Parallel Comput. 2(1): 3:1-3:29 (2015) - [j87]Moran Feldman, Liane Lewin-Eytan, Joseph Naor:
Hedonic Clustering Games. ACM Trans. Parallel Comput. 2(1): 4:1-4:48 (2015) - [c123]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
Near optimal placement of virtual network functions. INFOCOM 2015: 1346-1354 - [c122]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. EC 2015: 131-148 - [c121]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. EC 2015: 715-732 - [i7]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. CoRR abs/1507.00773 (2015) - 2014
- [j86]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68(2): 390-403 (2014) - [j85]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. Theory Comput. Syst. 54(3): 388-406 (2014) - [j84]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency capping in online advertising. J. Sched. 17(4): 385-398 (2014) - [j83]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43(2): 872-904 (2014) - [j82]Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor:
Smart Grid Network Optimization: Data-Quality-Aware Volume Reduction. IEEE Syst. J. 8(2): 450-460 (2014) - [c120]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA 2014: 209-221 - [c119]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
On the effect of forwarding table size on SDN network utilization. INFOCOM 2014: 1734-1742 - [c118]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Analysis via Regularization. SODA 2014: 436-444 - [c117]Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar:
Non-Uniform Graph Partitioning. SODA 2014: 1229-1243 - [c116]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [c115]Peter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Brief announcement: deadline-aware scheduling of big-data processing jobs. SPAA 2014: 211-213 - [i6]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. CoRR abs/1409.8670 (2014) - [i5]Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor:
Online Packing and Covering Framework with Convex Objectives. CoRR abs/1412.8347 (2014) - 2013
- [j81]Niv Buchbinder, Joseph Naor:
Fair online load balancing. J. Sched. 16(1): 117-127 (2013) - [c114]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC 2013: 97-109 - [c113]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
Almost optimal virtual machine placement for traffic intense data centers. INFOCOM 2013: 355-359 - [c112]Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Efficient online scheduling for deadline-sensitive jobs: extended abstract. SPAA 2013: 305-314 - [c111]Niv Buchbinder, Joseph Naor, Roy Schwartz:
Simplex partitioning via exponential clocks and the multiway cut problem. STOC 2013: 535-544 - 2012
- [j80]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59(4): 19:1-19:24 (2012) - [j79]Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor:
The load-distance balancing problem. Networks 59(1): 22-29 (2012) - [j78]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012) - [j77]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. 20(2): 477-487 (2012) - [c110]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - [c109]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156 - [c108]Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd:
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. ICALP (2) 2012: 586-597 - [c107]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. SPAA 2012: 255-266 - [c106]Moran Feldman, Liane Lewin-Eytan, Joseph Naor:
Hedonic clustering games. SPAA 2012: 267-276 - [c105]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. COLT 2012: 5.1-5.18 - [i4]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012) - 2011
- [c104]Moran Feldman, Joseph Naor, Roy Schwartz:
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM 2011: 218-229 - [c103]Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward:
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA 2011: 784-798 - [c102]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c101]Joseph Naor, Debmalya Panigrahi, Mohit Singh:
Online Node-Weighted Steiner Tree and Related Problems. FOCS 2011: 210-219 - [c100]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276 - [c99]Moran Feldman, Joseph Naor, Roy Schwartz:
A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS 2011: 570-579 - [c98]Moran Feldman, Joseph Naor, Roy Schwartz:
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) 2011: 342-353 - [c97]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. SAGT 2011: 178-189 - [c96]Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor:
Data-quality-aware volume reduction in smart grid networks. SmartGridComm 2011: 120-125 - [c95]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency Capping in Online Advertising. WADS 2011: 147-158 - [i3]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011) - [i2]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - 2010
- [j76]Joseph Naor, Adi Rosén, Gabriel Scalosub:
Online time-constrained scheduling in linear and ring networks. J. Discrete Algorithms 8(4): 346-355 (2010) - [j75]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47(1): 15-37 (2010) - [j74]Joseph Naor, Roy Schwartz:
The directed circular arrangement problem. ACM Trans. Algorithms 6(3): 47:1-47:22 (2010) - [c94]Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor:
Approximation Algorithms for Diversified Search Ranking. ICALP (2) 2010: 273-284 - [c93]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298 - [c92]Moran Feldman, Joseph Naor:
Non-Preemptive Buffer Management for Latency Sensitive Packets. INFOCOM 2010: 186-190 - [c91]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM 2010: 2402-2410 - [c90]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55
2000 – 2009
- 2009
- [j73]Niv Buchbinder, Joseph Naor:
The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. 3(2-3): 93-263 (2009) - [j72]Niv Buchbinder, Joseph Naor:
Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34(2): 270-286 (2009) - [j71]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009) - [j70]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39(3): 1062-1087 (2009) - [j69]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5(2): 18:1-18:17 (2009) - [c89]