Published in: LIPIcs, Volume 298, 36th Euromicro Conference on Real-Time Systems (ECRTS 2024)
Mohammad Fakhruddin Babar and Monowar Hasan. DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!. In 36th Euromicro Conference on Real-Time Systems (ECRTS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 298, pp. 13:1-13:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{babar_et_al:LIPIcs.ECRTS.2024.13, author = {Babar, Mohammad Fakhruddin and Hasan, Monowar}, title = {{DeepTrust^RT: Confidential Deep Neural Inference Meets Real-Time!}}, booktitle = {36th Euromicro Conference on Real-Time Systems (ECRTS 2024)}, pages = {13:1--13:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-324-9}, ISSN = {1868-8969}, year = {2024}, volume = {298}, editor = {Pellizzoni, Rodolfo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2024.13}, URN = {urn:nbn:de:0030-drops-203161}, doi = {10.4230/LIPIcs.ECRTS.2024.13}, annote = {Keywords: DNN, TrustZone, Real-Time Systems} }
Published in: LIPIcs, Volume 297, 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)
Junjie Chen, Minming Li, Haifeng Xu, and Song Zuo. Bayesian Calibrated Click-Through Auctions. In 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 297, pp. 44:1-44:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{chen_et_al:LIPIcs.ICALP.2024.44, author = {Chen, Junjie and Li, Minming and Xu, Haifeng and Zuo, Song}, title = {{Bayesian Calibrated Click-Through Auctions}}, booktitle = {51st International Colloquium on Automata, Languages, and Programming (ICALP 2024)}, pages = {44:1--44:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-322-5}, ISSN = {1868-8969}, year = {2024}, volume = {297}, editor = {Bringmann, Karl and Grohe, Martin and Puppis, Gabriele and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2024.44}, URN = {urn:nbn:de:0030-drops-201878}, doi = {10.4230/LIPIcs.ICALP.2024.44}, annote = {Keywords: information design, ad auctions, online advertising, mechanism design} }
Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Irvan Jahja, Haifeng Yu, and Yuda Zhao. Some Lower Bounds in Dynamic Networks with Oblivious Adversaries. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 29:1-29:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jahja_et_al:LIPIcs.DISC.2017.29, author = {Jahja, Irvan and Yu, Haifeng and Zhao, Yuda}, title = {{Some Lower Bounds in Dynamic Networks with Oblivious Adversaries}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {29:1--29:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.29}, URN = {urn:nbn:de:0030-drops-79690}, doi = {10.4230/LIPIcs.DISC.2017.29}, annote = {Keywords: dynamic networks, oblivious adversary, adaptive adversary, lower bounds, communication complexity} }