( en | de | ru )

 

Disambiguation of "Khan, Arindam"

Author of the publication

copydeleteadd this publication to your clipboard
Experience with testing and rigorous program analysis for qualification of RTOS.

, , , and . ISEC, page 83-89. ACM, (2013)

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.

Arindam Khan

Arindam Chatterjee

Faheem Khan

Imran Khan

Martin Khan

 

Other publications of authors with the same name

Group Fairness for Knapsack Problems., , and . AAMAS, page 1001-1009. ACM, (2021)Bin Packing under Random-Order: Breaking the Barrier of 3/2., , and . SODA, page 4177-4219. SIAM, (2024)Guaranteeing Envy-Freeness under Generalized Assignment Constraints., , , and . EC, page 242-269. ACM, (2023)Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization., , and . NeurIPS, page 19553-19565. (2021)Improved Online Algorithms for Knapsack and GAP in the Random Order Model., , and . APPROX-RANDOM, volume 145 of LIPIcs, page 22:1-22:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Near-Optimal Algorithms for Stochastic Online Bin Packing., , , and . ICALP, volume 229 of LIPIcs, page 12:1-12:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A PTAS for Packing Hypercubes into a Knapsack., , , and . ICALP, volume 229 of LIPIcs, page 78:1-78:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Finding Fair Allocations under Budget Constraints., , , and . CoRR, (2022)Improved Online Algorithms for Knapsack and GAP in the Random Order Model., , and . CoRR, (2020)Design and Analysis of a Modified Remote Attestation Protocol., , , and . TrustCom/BigDataSE/ICESS, page 578-585. IEEE Computer Society, (2017)