Published in: LITES, Volume 2, Issue 2 (2015). Leibniz Transactions on Embedded Systems, Volume 2, Issue 2
Thomas Carle, Dumitru Potop-Butucaru, Yves Sorel, and David Lesens. From Dataflow Specification to Multiprocessor Partitioned Time-triggered Real-time Implementation. In LITES, Volume 2, Issue 2 (2015). Leibniz Transactions on Embedded Systems, Volume 2, Issue 2, pp. 01:1-01:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Article{carle_et_al:LITES-v002-i002-a001, author = {Carle, Thomas and Potop-Butucaru, Dumitru and Sorel, Yves and Lesens, David}, title = {{From Dataflow Specification to Multiprocessor Partitioned Time-triggered Real-time Implementation}}, journal = {Leibniz Transactions on Embedded Systems}, pages = {01:1--01:30}, ISSN = {2199-2002}, year = {2015}, volume = {2}, number = {2}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LITES-v002-i002-a001}, doi = {10.4230/LITES-v002-i002-a001}, annote = {Keywords: Time-triggered, Off-line real-time scheduling, Temporal partitioning} }
Published in: Dagstuhl Seminar Proceedings, Volume 10111, Practical Software Testing : Tool Automation and Human Factors (2010)
Antonia Bertolino, Wolfgang Grieskamp, Robert Hierons, Yves Le Traon, Bruno Legeard, Henry Muccini, Amit Paradkar, David Rosenblum, and Jan Tretmans. Model-Based Testing for the Cloud. In Practical Software Testing : Tool Automation and Human Factors. Dagstuhl Seminar Proceedings, Volume 10111, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{bertolino_et_al:DagSemProc.10111.8, author = {Bertolino, Antonia and Grieskamp, Wolfgang and Hierons, Robert and Le Traon, Yves and Legeard, Bruno and Muccini, Henry and Paradkar, Amit and Rosenblum, David and Tretmans, Jan}, title = {{Model-Based Testing for the Cloud}}, booktitle = {Practical Software Testing : Tool Automation and Human Factors}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10111}, editor = {Mark Harman and Henry Muccini and Wolfram Schulte and Tao Xie}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10111.8}, URN = {urn:nbn:de:0030-drops-26251}, doi = {10.4230/DagSemProc.10111.8}, annote = {Keywords: Cloud computing, Model based testing, Non-functional properties} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
László Babai, Anandam Banerjee, Raghav Kulkarni, and Vipul Naik. Evasiveness and the Distribution of Prime Numbers. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 71-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{babai_et_al:LIPIcs.STACS.2010.2445, author = {Babai, L\'{a}szl\'{o} and Banerjee, Anandam and Kulkarni, Raghav and Naik, Vipul}, title = {{Evasiveness and the Distribution of Prime Numbers}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {71--82}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2445}, URN = {urn:nbn:de:0030-drops-24451}, doi = {10.4230/LIPIcs.STACS.2010.2445}, annote = {Keywords: Decision tree complexity, evasiveness, graph property, group action, Dirichlet primes, Extended Riemann Hypothesis} }
Published in: LIPIcs, Volume 5, 27th International Symposium on Theoretical Aspects of Computer Science (2010)
François Le Gall. An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 549-560, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{legall:LIPIcs.STACS.2010.2484, author = {Le Gall, Fran\c{c}ois}, title = {{An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {549--560}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-16-3}, ISSN = {1868-8969}, year = {2010}, volume = {5}, editor = {Marion, Jean-Yves and Schwentick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2484}, URN = {urn:nbn:de:0030-drops-24843}, doi = {10.4230/LIPIcs.STACS.2010.2484}, annote = {Keywords: Quantum algorithms, group isomorphism problem, black-box groups} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Babak Farzad, Lap Chi Lau, Van Bang Le, and Nguyen Ngoc Tuy. Computing Graph Roots Without Short Cycles. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 397-408, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{farzad_et_al:LIPIcs.STACS.2009.1827, author = {Farzad, Babak and Lau, Lap Chi and Le, Van Bang and Tuy, Nguyen Ngoc}, title = {{Computing Graph Roots Without Short Cycles}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {397--408}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1827}, URN = {urn:nbn:de:0030-drops-18279}, doi = {10.4230/LIPIcs.STACS.2009.1827}, annote = {Keywords: Graph roots, Graph powers, Recognition algorithms, NP-completeness} }
Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Francois Le Gall. Efficient Isomorphism Testing for a Class of Group Extensions. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 625-636, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{legall:LIPIcs.STACS.2009.1830, author = {Le Gall, Francois}, title = {{Efficient Isomorphism Testing for a Class of Group Extensions}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {625--636}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1830}, URN = {urn:nbn:de:0030-drops-18303}, doi = {10.4230/LIPIcs.STACS.2009.1830}, annote = {Keywords: Polynomial-time algorithms, Group isomorphism, Black-box groups} }
Feedback for Dagstuhl Publishing