Published in: LIPIcs, Volume 144, 27th Annual European Symposium on Algorithms (ESA 2019)
Stefano Leucci, Chih-Hung Liu, and Simon Meierhans. Resilient Dictionaries for Randomly Unreliable Memory. In 27th Annual European Symposium on Algorithms (ESA 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 144, pp. 70:1-70:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{leucci_et_al:LIPIcs.ESA.2019.70, author = {Leucci, Stefano and Liu, Chih-Hung and Meierhans, Simon}, title = {{Resilient Dictionaries for Randomly Unreliable Memory}}, booktitle = {27th Annual European Symposium on Algorithms (ESA 2019)}, pages = {70:1--70:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-124-5}, ISSN = {1868-8969}, year = {2019}, volume = {144}, editor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2019.70}, URN = {urn:nbn:de:0030-drops-111911}, doi = {10.4230/LIPIcs.ESA.2019.70}, annote = {Keywords: resilient dictionary, unreliable memory, faulty RAM} }
Published in: Dagstuhl Reports, Volume 5, Issue 1 (2015)
Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, and Aaron Quigley. Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052). In Dagstuhl Reports, Volume 5, Issue 1, pp. 243-258, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Article{brandes_et_al:DagRep.5.1.243, author = {Brandes, Ulrik and Finocchi, Irene and N\"{o}llenburg, Martin and Quigley, Aaron}, title = {{Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052)}}, pages = {243--258}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2015}, volume = {5}, number = {1}, editor = {Brandes, Ulrik and Finocchi, Irene and N\"{o}llenburg, Martin and Quigley, Aaron}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.1.243}, URN = {urn:nbn:de:0030-drops-50414}, doi = {10.4230/DagRep.5.1.243}, annote = {Keywords: graph drawing, experimental design, algorithm engineering, user studies, empirical evaluation, information visualization} }
Published in: LIPIcs, Volume 13, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, and Francesco Silvestri. Dynamic programming in faulty memory hierarchies (cache-obliviously). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, pp. 433-444, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{caminiti_et_al:LIPIcs.FSTTCS.2011.433, author = {Caminiti, Saverio and Finocchi, Irene and Fusco, Emanuele G. and Silvestri, Francesco}, title = {{Dynamic programming in faulty memory hierarchies (cache-obliviously)}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)}, pages = {433--444}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-34-7}, ISSN = {1868-8969}, year = {2011}, volume = {13}, editor = {Chakraborty, Supratik and Kumar, Amit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.433}, URN = {urn:nbn:de:0030-drops-33241}, doi = {10.4230/LIPIcs.FSTTCS.2011.433}, annote = {Keywords: Unreliable memories, fault-tolerant algorithms, dynamic programming, cache-oblivious algorithms, Gaussian elimination paradigm} }
Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)
Saverio Caminiti, Irene Finocchi, and Emanuele G. Fusco. Local dependency dynamic programming in the presence of memory faults. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 45-56, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{caminiti_et_al:LIPIcs.STACS.2011.45, author = {Caminiti, Saverio and Finocchi, Irene and Fusco, Emanuele G.}, title = {{Local dependency dynamic programming in the presence of memory faults}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {45--56}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.45}, URN = {urn:nbn:de:0030-drops-29988}, doi = {10.4230/LIPIcs.STACS.2011.45}, annote = {Keywords: unreliable memories, fault-tolerant algorithms, local dependency dynamic programming, edit distance} }
Feedback for Dagstuhl Publishing