Published in: LIPIcs, Volume 76, 29th Euromicro Conference on Real-Time Systems (ECRTS 2017)
Prachi Joshi, Haibo Zeng, Unmesh D. Bordoloi, Soheil Samii, S. S. Ravi, and Sandeep K. Shukla. The Multi-Domain Frame Packing Problem for CAN-FD. In 29th Euromicro Conference on Real-Time Systems (ECRTS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 76, pp. 12:1-12:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{joshi_et_al:LIPIcs.ECRTS.2017.12, author = {Joshi, Prachi and Zeng, Haibo and Bordoloi, Unmesh D. and Samii, Soheil and Ravi, S. S. and Shukla, Sandeep K.}, title = {{The Multi-Domain Frame Packing Problem for CAN-FD}}, booktitle = {29th Euromicro Conference on Real-Time Systems (ECRTS 2017)}, pages = {12:1--12:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-037-8}, ISSN = {1868-8969}, year = {2017}, volume = {76}, editor = {Bertogna, Marko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2017.12}, URN = {urn:nbn:de:0030-drops-71551}, doi = {10.4230/LIPIcs.ECRTS.2017.12}, annote = {Keywords: Frame Packing, CAN-FD, Integer Linear Programming, Audsley's Algorithm} }
Published in: LIPIcs, Volume 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Olaf Beyersdorff, Leroy Chew, Meena Mahajan, and Anil Shukla. Understanding Cutting Planes for QBFs. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, pp. 40:1-40:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{beyersdorff_et_al:LIPIcs.FSTTCS.2016.40, author = {Beyersdorff, Olaf and Chew, Leroy and Mahajan, Meena and Shukla, Anil}, title = {{Understanding Cutting Planes for QBFs}}, booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)}, pages = {40:1--40:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-027-9}, ISSN = {1868-8969}, year = {2016}, volume = {65}, editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.40}, URN = {urn:nbn:de:0030-drops-68758}, doi = {10.4230/LIPIcs.FSTTCS.2016.40}, annote = {Keywords: proof complexity, QBF, cutting planes, resolution, simulations} }
Published in: Dagstuhl Seminar Proceedings, Volume 7041, Power-aware Computing Systems (2007)
Gaurav Singh, S. S. Ravi, Sumit Ahuja, and Sandeep Shukla. Complexity of Scheduling in Synthesizing Hardware from Concurrent Action Oriented Specifications. In Power-aware Computing Systems. Dagstuhl Seminar Proceedings, Volume 7041, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{singh_et_al:DagSemProc.07041.6, author = {Singh, Gaurav and Ravi, S. S. and Ahuja, Sumit and Shukla, Sandeep}, title = {{Complexity of Scheduling in Synthesizing Hardware from Concurrent Action Oriented Specifications}}, booktitle = {Power-aware Computing Systems}, pages = {1--25}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7041}, editor = {Luca Benini and Naehyuck Chang and Ulrich Kremer and Christian W. Probst}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07041.6}, URN = {urn:nbn:de:0030-drops-11055}, doi = {10.4230/DagSemProc.07041.6}, annote = {Keywords: Hardware Synthesis, Concurrent Action Oriented Specifications (CAOS), Scheduling, Complexity, Peak Power.} }
Feedback for Dagstuhl Publishing