Published in: LIPIcs, Volume 198, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)
Maria Hartmann, László Kozma, Corwin Sinnamon, and Robert E. Tarjan. Analysis of Smooth Heaps and Slim Heaps. In 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 198, pp. 79:1-79:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{hartmann_et_al:LIPIcs.ICALP.2021.79, author = {Hartmann, Maria and Kozma, L\'{a}szl\'{o} and Sinnamon, Corwin and Tarjan, Robert E.}, title = {{Analysis of Smooth Heaps and Slim Heaps}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {79:1--79:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-195-5}, ISSN = {1868-8969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.79}, URN = {urn:nbn:de:0030-drops-141482}, doi = {10.4230/LIPIcs.ICALP.2021.79}, annote = {Keywords: data structure, heap, priority queue, amortized analysis, self-adjusting} }
Published in: Dagstuhl Reports, Volume 9, Issue 1 (2019)
Gerth Stølting Brodal, Ulrich Carsten Meyer, Bernhard E. Nebel, and Robert Sedgewick. Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051). In Dagstuhl Reports, Volume 9, Issue 1, pp. 104-124, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Article{brodal_et_al:DagRep.9.1.104, author = {Brodal, Gerth St{\o}lting and Meyer, Ulrich Carsten and Nebel, Bernhard E. and Sedgewick, Robert}, title = {{Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051)}}, pages = {104--124}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {9}, number = {1}, editor = {Brodal, Gerth St{\o}lting and Meyer, Ulrich Carsten and Nebel, Bernhard E. and Sedgewick, Robert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.9.1.104}, URN = {urn:nbn:de:0030-drops-105722}, doi = {10.4230/DagRep.9.1.104}, annote = {Keywords: algorithms, big data, cloud computing, data structures, external memory methods, large data sets, web-scale} }
Published in: Dagstuhl Reports, Volume 6, Issue 3 (2016)
Alejandro Lopez-Ortiz, Ulrich Carsten Meyer, Markus E. Nebel, and Robert Sedgewick. Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101). In Dagstuhl Reports, Volume 6, Issue 3, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@Article{lopezortiz_et_al:DagRep.6.3.1, author = {Lopez-Ortiz, Alejandro and Meyer, Ulrich Carsten and Nebel, Markus E. and Sedgewick, Robert}, title = {{Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101)}}, pages = {1--23}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2016}, volume = {6}, number = {3}, editor = {Lopez-Ortiz, Alejandro and Meyer, Ulrich Carsten and Nebel, Markus E. and Sedgewick, Robert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.6.3.1}, URN = {urn:nbn:de:0030-drops-61457}, doi = {10.4230/DagRep.6.3.1}, annote = {Keywords: algorithms, big data, cloud services, data structures, external memory methods, information theory, large data sets, streaming, web-scale} }
Published in: Dagstuhl Reports, Volume 4, Issue 2 (2014)
Alejandro López-Ortiz, Ulrich Carsten Meyer, and Robert Sedgewick. Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091). In Dagstuhl Reports, Volume 4, Issue 2, pp. 129-149, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
@Article{lopezortiz_et_al:DagRep.4.2.129, author = {L\'{o}pez-Ortiz, Alejandro and Meyer, Ulrich Carsten and Sedgewick, Robert}, title = {{Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091)}}, pages = {129--149}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2014}, volume = {4}, number = {2}, editor = {L\'{o}pez-Ortiz, Alejandro and Meyer, Ulrich Carsten and Sedgewick, Robert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.2.129}, URN = {urn:nbn:de:0030-drops-45489}, doi = {10.4230/DagRep.4.2.129}, annote = {Keywords: data structures, big data, models of computation, I/O Model, sorting, quicksort, graph algorithms, hashing, compression, succinct data structures, trajectories, text search, GPU algorithms, MapReduce} }
Published in: Dagstuhl Seminar Proceedings, Volume 8081, Data Structures (2008)
Lars Arge, Robert Sedgewick, and Raimund Seidel. 08081 Abstracts Collection – Data Structures. In Data Structures. Dagstuhl Seminar Proceedings, Volume 8081, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{arge_et_al:DagSemProc.08081.1, author = {Arge, Lars and Sedgewick, Robert and Seidel, Raimund}, title = {{08081 Abstracts Collection – Data Structures}}, booktitle = {Data Structures}, pages = {1--18}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8081}, editor = {Lars Arge and Robert Sedgewick and Raimund Seidel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.1}, URN = {urn:nbn:de:0030-drops-15325}, doi = {10.4230/DagSemProc.08081.1}, annote = {Keywords: Data structures, information retrieval, complexity, algorithms, flash memory} }
Published in: Dagstuhl Seminar Proceedings, Volume 8081, Data Structures (2008)
Mohammad Abam, Mark de Berg, and Bettina Speckmann. Kinetic kd-Trees and Longest-Side kd-Trees. In Data Structures. Dagstuhl Seminar Proceedings, Volume 8081, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{abam_et_al:DagSemProc.08081.2, author = {Abam, Mohammad and de Berg, Mark and Speckmann, Bettina}, title = {{Kinetic kd-Trees and Longest-Side kd-Trees}}, booktitle = {Data Structures}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8081}, editor = {Lars Arge and Robert Sedgewick and Raimund Seidel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.2}, URN = {urn:nbn:de:0030-drops-15307}, doi = {10.4230/DagSemProc.08081.2}, annote = {Keywords: Kinetic data structures, kd-tree, longest-side kd-tree} }
Published in: Dagstuhl Seminar Proceedings, Volume 8081, Data Structures (2008)
Alejandro Lopez-Ortiz, Reza Dorrigiv, and Alejandro Salinger. Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM). In Data Structures. Dagstuhl Seminar Proceedings, Volume 8081, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{lopezortiz_et_al:DagSemProc.08081.3, author = {Lopez-Ortiz, Alejandro and Dorrigiv, Reza and Salinger, Alejandro}, title = {{Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM)}}, booktitle = {Data Structures}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8081}, editor = {Lars Arge and Robert Sedgewick and Raimund Seidel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.3}, URN = {urn:nbn:de:0030-drops-15315}, doi = {10.4230/DagSemProc.08081.3}, annote = {Keywords: PRAM, multicore architectures, parallelism, algorithms, dynamic programming, divide and conquer} }
Published in: Dagstuhl Seminar Proceedings, Volume 8081, Data Structures (2008)
Seth Pettie. Sources of Superlinearity in Davenport-Schinzel Sequences. In Data Structures. Dagstuhl Seminar Proceedings, Volume 8081, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{pettie:DagSemProc.08081.4, author = {Pettie, Seth}, title = {{Sources of Superlinearity in Davenport-Schinzel Sequences}}, booktitle = {Data Structures}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2008}, volume = {8081}, editor = {Lars Arge and Robert Sedgewick and Raimund Seidel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.08081.4}, URN = {urn:nbn:de:0030-drops-15291}, doi = {10.4230/DagSemProc.08081.4}, annote = {Keywords: Davenport-Schinzel Sequences, lower envelopes, splay trees} }
Published in: Dagstuhl Seminar Proceedings, Volume 6091, Data Structures (2006)
Lars Arge, Robert Sedgewick, and Dorothea Wagner. 06091 Abstracts Collection – Data Structures. In Data Structures. Dagstuhl Seminar Proceedings, Volume 6091, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{arge_et_al:DagSemProc.06091.1, author = {Arge, Lars and Sedgewick, Robert and Wagner, Dorothea}, title = {{06091 Abstracts Collection – Data Structures}}, booktitle = {Data Structures}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6091}, editor = {Lars Arge and Robert Sedgewick and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06091.1}, URN = {urn:nbn:de:0030-drops-8428}, doi = {10.4230/DagSemProc.06091.1}, annote = {Keywords: Algorithms, data structures} }
Published in: Dagstuhl Seminar Proceedings, Volume 6091, Data Structures (2006)
Lars Arge, Robert Sedgewick, and Dorothea Wagner. 06091 Executive Summary – Data Structures. In Data Structures. Dagstuhl Seminar Proceedings, Volume 6091, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{arge_et_al:DagSemProc.06091.2, author = {Arge, Lars and Sedgewick, Robert and Wagner, Dorothea}, title = {{06091 Executive Summary – Data Structures}}, booktitle = {Data Structures}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6091}, editor = {Lars Arge and Robert Sedgewick and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06091.2}, URN = {urn:nbn:de:0030-drops-8411}, doi = {10.4230/DagSemProc.06091.2}, annote = {Keywords: algorithms, data structures} }
Published in: Dagstuhl Seminar Proceedings, Volume 6091, Data Structures (2006)
Rudolf Fleischer. Die Another Day. In Data Structures. Dagstuhl Seminar Proceedings, Volume 6091, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{fleischer:DagSemProc.06091.3, author = {Fleischer, Rudolf}, title = {{Die Another Day}}, booktitle = {Data Structures}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6091}, editor = {Lars Arge and Robert Sedgewick and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06091.3}, URN = {urn:nbn:de:0030-drops-7652}, doi = {10.4230/DagSemProc.06091.3}, annote = {Keywords: Hydra, Koenig's Lemma, Peano Arithmetic} }
Published in: Dagstuhl Seminar Proceedings, Volume 6091, Data Structures (2006)
Henrik Blunck and Jan Vahrenhold. In-Place Randomized Slope-Selection. In Data Structures. Dagstuhl Seminar Proceedings, Volume 6091, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{blunck_et_al:DagSemProc.06091.4, author = {Blunck, Henrik and Vahrenhold, Jan}, title = {{In-Place Randomized Slope-Selection}}, booktitle = {Data Structures}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6091}, editor = {Lars Arge and Robert Sedgewick and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06091.4}, URN = {urn:nbn:de:0030-drops-8390}, doi = {10.4230/DagSemProc.06091.4}, annote = {Keywords: In-Place Algorithms, Slope Selection} }
Published in: Dagstuhl Seminar Proceedings, Volume 6091, Data Structures (2006)
Seth Pettie. Towards a Final Analysis of Pairing Heaps. In Data Structures. Dagstuhl Seminar Proceedings, Volume 6091, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{pettie:DagSemProc.06091.5, author = {Pettie, Seth}, title = {{Towards a Final Analysis of Pairing Heaps}}, booktitle = {Data Structures}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6091}, editor = {Lars Arge and Robert Sedgewick and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06091.5}, URN = {urn:nbn:de:0030-drops-7642}, doi = {10.4230/DagSemProc.06091.5}, annote = {Keywords: Data structure, heap, self-adjusting, amortized analysis} }
Published in: Dagstuhl Seminar Proceedings, Volume 4091, Data Structures (2005)
Susanne Albers, Robert Sedgewick, and Dorothea Wagner. 04091 Abstracts Collection – Data Structures. In Data Structures. Dagstuhl Seminar Proceedings, Volume 4091, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{albers_et_al:DagSemProc.04091.1, author = {Albers, Susanne and Sedgewick, Robert and Wagner, Dorothea}, title = {{04091 Abstracts Collection – Data Structures}}, booktitle = {Data Structures}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4091}, editor = {Susanne Albers and Robert Sedgewick and Dorothea Wagner}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04091.1}, URN = {urn:nbn:de:0030-drops-1758}, doi = {10.4230/DagSemProc.04091.1}, annote = {Keywords: Cache oblivious algorithms , cell probe model , computational geometry , data compression , dictionaries , finger search , hashing , heaps I/O efficiency , lower bounds} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Susanne Albers, Robert Sedgewick, and Peter Widmayer. Data Structures (Dagstuhl Seminar 02091). Dagstuhl Seminar Report 335, pp. 1-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2002)
@TechReport{albers_et_al:DagSemRep.335, author = {Albers, Susanne and Sedgewick, Robert and Widmayer, Peter}, title = {{Data Structures (Dagstuhl Seminar 02091)}}, pages = {1--36}, ISSN = {1619-0203}, year = {2002}, type = {Dagstuhl Seminar Report}, number = {335}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.335}, URN = {urn:nbn:de:0030-drops-152176}, doi = {10.4230/DagSemRep.335}, }
Feedback for Dagstuhl Publishing