Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Anders Aamand
@article{DBLP:journals/talg/AamandARA23,
author = {Anders Aamand and
Mikkel Abrahamsen and
Peter M. R. Rasmussen and
Thomas D. Ahle},
title = {Tiling with Squares and Packing Dominos in Polynomial Time},
journal = {{ACM} Trans. Algorithms},
volume = {19},
number = {3},
pages = {30:1--30:28},
year = {2023},
url = {https://doi.org/10.1145/3597932},
doi = {10.1145/3597932},
timestamp = {Fri, 18 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/AamandARA23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AamandKLPRT23,
author = {Anders Aamand and
Adam Karczmarz and
Jakub Lacki and
Nikos Parotsidis and
Peter M. R. Rasmussen and
Mikkel Thorup},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Optimal Decremental Connectivity in Non-Sparse Graphs},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.6},
doi = {10.4230/LIPICS.ICALP.2023.6},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AamandKLPRT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/AamandACINS23,
author = {Anders Aamand and
Alexandr Andoni and
Justin Y. Chen and
Piotr Indyk and
Shyam Narayanan and
Sandeep Silwal},
editor = {Andreas Krause and
Emma Brunskill and
Kyunghyun Cho and
Barbara Engelhardt and
Sivan Sabato and
Jonathan Scarlett},
title = {Data Structures for Density Estimation},
booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July
2023, Honolulu, Hawaii, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {202},
pages = {1--18},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v202/aamand23a.html},
timestamp = {Mon, 28 Aug 2023 17:23:08 +0200},
biburl = {https://dblp.org/rec/conf/icml/AamandACINS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AamandCLSSVZ23,
author = {Anders Aamand and
Justin Y. Chen and
Allen Liu and
Sandeep Silwal and
Pattara Sukprasert and
Ali Vakilian and
Fred Zhang},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Constant Approximation for Individual Preference Stable Clustering},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/881259965dacb9f42967aae84a157283-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AamandCLSSVZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AamandCNSV23,
author = {Anders Aamand and
Justin Y. Chen and
Huy L{\^{e}} Nguyen and
Sandeep Silwal and
Ali Vakilian},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Improved Frequency Estimation Algorithms with and without Predictions},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/2e49934cac6cb8604b0c67cfa0828718-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AamandCNSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AamandA0K23,
author = {Anders Aamand and
Mikkel Abrahamsen and
Lorenzo Beretta and
Linda Kleist},
editor = {Nikhil Bansal and
Viswanath Nagarajan},
title = {Online Sorting and Translational Packing of Convex Polygons},
booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2023, Florence, Italy, January 22-25, 2023},
pages = {1806--1833},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977554.ch69},
doi = {10.1137/1.9781611977554.CH69},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/AamandA0K23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-01453,
author = {Anders Aamand and
Justin Y. Chen and
Huy L{\^{e}} Nguyen and
Sandeep Silwal},
title = {Improved Space Bounds for Learning with Experts},
journal = {CoRR},
volume = {abs/2303.01453},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.01453},
doi = {10.48550/ARXIV.2303.01453},
eprinttype = {arXiv},
eprint = {2303.01453},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-01453.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-11312,
author = {Anders Aamand and
Alexandr Andoni and
Justin Y. Chen and
Piotr Indyk and
Shyam Narayanan and
Sandeep Silwal},
title = {Data Structures for Density Estimation},
journal = {CoRR},
volume = {abs/2306.11312},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.11312},
doi = {10.48550/ARXIV.2306.11312},
eprinttype = {arXiv},
eprint = {2306.11312},
timestamp = {Fri, 23 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-11312.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-16840,
author = {Anders Aamand and
Justin Y. Chen and
Allen Liu and
Sandeep Silwal and
Pattara Sukprasert and
Ali Vakilian and
Fred Zhang},
title = {Constant Approximation for Individual Preference Stable Clustering},
journal = {CoRR},
volume = {abs/2309.16840},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.16840},
doi = {10.48550/ARXIV.2309.16840},
eprinttype = {arXiv},
eprint = {2309.16840},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-16840.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-07535,
author = {Anders Aamand and
Justin Y. Chen and
Huy L{\^{e}} Nguyen and
Sandeep Silwal and
Ali Vakilian},
title = {Improved Frequency Estimation Algorithms with and without Predictions},
journal = {CoRR},
volume = {abs/2312.07535},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.07535},
doi = {10.48550/ARXIV.2312.07535},
eprinttype = {arXiv},
eprint = {2312.07535},
timestamp = {Thu, 04 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-07535.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/Aamand0KKRT22,
author = {Anders Aamand and
Debarati Das and
Evangelos Kipouridis and
Jakob B{\ae}k Tejs Knudsen and
Peter M. R. Rasmussen and
Mikkel Thorup},
title = {No Repetition: Fast and Reliable Sampling with Highly Concentrated
Hashing},
journal = {Proc. {VLDB} Endow.},
volume = {15},
number = {13},
pages = {3989--4001},
year = {2022},
url = {https://www.vldb.org/pvldb/vol15/p3989-kipouridis.pdf},
doi = {10.14778/3565838.3565851},
timestamp = {Sat, 28 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/Aamand0KKRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AamandAAR22,
author = {Anders Aamand and
Mikkel Abrahamsen and
Thomas D. Ahle and
Peter M. R. Rasmussen},
editor = {Xavier Goaoc and
Michael Kerber},
title = {Tiling with Squares and Packing Dominos in Polynomial Time},
booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
June 7-10, 2022, Berlin, Germany},
series = {LIPIcs},
volume = {224},
pages = {1:1--1:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2022.1},
doi = {10.4230/LIPICS.SOCG.2022.1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/AamandAAR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AamandCI22,
author = {Anders Aamand and
Justin Y. Chen and
Piotr Indyk},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {(Optimal) Online Bipartite Matching with Degree Information},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/25c5133ad2ab138f448b71b3c7345ec3-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AamandCI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/AamandCINRSSW22,
author = {Anders Aamand and
Justin Y. Chen and
Piotr Indyk and
Shyam Narayanan and
Ronitt Rubinfeld and
Nicholas Schiefer and
Sandeep Silwal and
Tal Wagner},
editor = {Sanmi Koyejo and
S. Mohamed and
A. Agarwal and
Danielle Belgrave and
K. Cho and
A. Oh},
title = {Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman
Test with Graph Neural Networks},
booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference
on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans,
LA, USA, November 28 - December 9, 2022},
year = {2022},
url = {http://papers.nips.cc/paper\_files/paper/2022/hash/af0ad514b9cda46bd49e14ee11e2672f-Abstract-Conference.html},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/AamandCINRSSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-03232,
author = {Anders Aamand and
Justin Y. Chen and
Piotr Indyk and
Shyam Narayanan and
Ronitt Rubinfeld and
Nicholas Schiefer and
Sandeep Silwal and
Tal Wagner},
title = {Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman
Test with Graph Neural Networks},
journal = {CoRR},
volume = {abs/2211.03232},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.03232},
doi = {10.48550/ARXIV.2211.03232},
eprinttype = {arXiv},
eprint = {2211.03232},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-03232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/AamandAKR21,
author = {Anders Aamand and
Mikkel Abrahamsen and
Jakob B{\ae}k Tejs Knudsen and
Peter Michael Reichstein Rasmussen},
editor = {Kevin Buchin and
{\'{E}}ric Colin de Verdi{\`{e}}re},
title = {Classifying Convex Bodies by Their Contact and Intersection Graphs},
booktitle = {37th International Symposium on Computational Geometry, SoCG 2021,
June 7-11, 2021, Buffalo, NY, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {189},
pages = {3:1--3:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2021.3},
doi = {10.4230/LIPICS.SOCG.2021.3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/AamandAKR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AamandKT21,
author = {Anders Aamand and
Jakob B{\ae}k Tejs Knudsen and
Mikkel Thorup},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Load balancing with dynamic set of balls and bins},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1262--1275},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451107},
doi = {10.1145/3406325.3451107},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AamandKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-05093,
author = {Anders Aamand and
Jakob B{\ae}k Tejs Knudsen and
Mikkel Thorup},
title = {Load Balancing with Dynamic Set of Balls and Bins},
journal = {CoRR},
volume = {abs/2104.05093},
year = {2021},
url = {https://arxiv.org/abs/2104.05093},
eprinttype = {arXiv},
eprint = {2104.05093},
timestamp = {Mon, 19 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-05093.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-09376,
author = {Anders Aamand and
Adam Karczmarz and
Jakub Lacki and
Nikos Parotsidis and
Peter M. R. Rasmussen and
Mikkel Thorup},
title = {Optimal Decremental Connectivity in Non-Sparse Graphs},
journal = {CoRR},
volume = {abs/2111.09376},
year = {2021},
url = {https://arxiv.org/abs/2111.09376},
eprinttype = {arXiv},
eprint = {2111.09376},
timestamp = {Mon, 22 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-09376.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-03791,
author = {Anders Aamand and
Mikkel Abrahamsen and
Lorenzo Beretta and
Linda Kleist},
title = {Online Sorting and Translational Packing of Convex Polygons},
journal = {CoRR},
volume = {abs/2112.03791},
year = {2021},
url = {https://arxiv.org/abs/2112.03791},
eprinttype = {arXiv},
eprint = {2112.03791},
timestamp = {Mon, 13 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-03791.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/AamandAT20b,
author = {Anders Aamand and
Mikkel Abrahamsen and
Mikkel Thorup},
title = {Disks in Curves of Bounded Convex Curvature},
journal = {Am. Math. Mon.},
volume = {127},
number = {7},
pages = {579--593},
year = {2020},
url = {https://doi.org/10.1080/00029890.2020.1752602},
doi = {10.1080/00029890.2020.1752602},
timestamp = {Tue, 02 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tamm/AamandAT20b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AamandKKRT20,
author = {Anders Aamand and
Jakob B{\ae}k Tejs Knudsen and
Mathias B{\ae}k Tejs Knudsen and
Peter Michael Reichstein Rasmussen and
Mikkel Thorup},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Fast hashing with strong concentration bounds},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1265--1278},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384259},
doi = {10.1145/3357713.3384259},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AamandKKRT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-01156,
author = {Anders Aamand and
Debarati Das and
Evangelos Kipouridis and
Jakob B{\ae}k Tejs Knudsen and
Peter M. R. Rasmussen and
Mikkel Thorup},
title = {No Repetition: Fast Streaming with Highly Concentrated Hashing},
journal = {CoRR},
volume = {abs/2004.01156},
year = {2020},
url = {https://arxiv.org/abs/2004.01156},
eprinttype = {arXiv},
eprint = {2004.01156},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-01156.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-10983,
author = {Anders Aamand and
Mikkel Abrahamsen and
Thomas D. Ahle and
Peter M. R. Rasmussen},
title = {Tiling with Squares and Packing Dominos in Polynomial Time},
journal = {CoRR},
volume = {abs/2011.10983},
year = {2020},
url = {https://arxiv.org/abs/2011.10983},
eprinttype = {arXiv},
eprint = {2011.10983},
timestamp = {Wed, 25 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-10983.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AamandT19,
author = {Anders Aamand and
Mikkel Thorup},
editor = {Timothy M. Chan},
title = {Non-empty Bins with Simple Tabulation Hashing},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {2498--2512},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.153},
doi = {10.1137/1.9781611975482.153},
timestamp = {Thu, 15 Jul 2021 13:49:01 +0200},
biburl = {https://dblp.org/rec/conf/soda/AamandT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-01732,
author = {Anders Aamand and
Mikkel Abrahamsen and
Jakob B{\ae}k Tejs Knudsen and
Peter M. R. Rasmussen},
title = {Classifying Convex Bodies by their Contact and Intersection Graphs},
journal = {CoRR},
volume = {abs/1902.01732},
year = {2019},
url = {http://arxiv.org/abs/1902.01732},
eprinttype = {arXiv},
eprint = {1902.01732},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-01732.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00369,
author = {Anders Aamand and
Jakob B{\ae}k Tejs Knudsen and
Mathias B{\ae}k Tejs Knudsen and
Peter M. R. Rasmussen and
Mikkel Thorup},
title = {Fast hashing with Strong Concentration Bounds},
journal = {CoRR},
volume = {abs/1905.00369},
year = {2019},
url = {http://arxiv.org/abs/1905.00369},
eprinttype = {arXiv},
eprint = {1905.00369},
timestamp = {Thu, 04 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00369.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-05198,
author = {Anders Aamand and
Piotr Indyk and
Ali Vakilian},
title = {(Learned) Frequency Estimation Algorithms under Zipfian Distribution},
journal = {CoRR},
volume = {abs/1908.05198},
year = {2019},
url = {http://arxiv.org/abs/1908.05198},
eprinttype = {arXiv},
eprint = {1908.05198},
timestamp = {Mon, 19 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-05198.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-00852,
author = {Anders Aamand and
Mikkel Abrahamsen and
Mikkel Thorup},
title = {Disks in Curves of Bounded Convex Curvature},
journal = {CoRR},
volume = {abs/1909.00852},
year = {2019},
url = {http://arxiv.org/abs/1909.00852},
eprinttype = {arXiv},
eprint = {1909.00852},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-00852.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AamandKT18,
author = {Anders Aamand and
Mathias B{\ae}k Tejs Knudsen and
Mikkel Thorup},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Power of d Choices with Simple Tabulation},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {5:1--5:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.5},
doi = {10.4230/LIPICS.ICALP.2018.5},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AamandKT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AamandHHR18,
author = {Anders Aamand and
Niklas Hjuler and
Jacob Holm and
Eva Rotenberg},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {One-Way Trail Orientations},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {6:1--6:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.6},
doi = {10.4230/LIPICS.ICALP.2018.6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AamandHHR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-09684,
author = {Anders Aamand and
Mathias B{\ae}k Tejs Knudsen and
Mikkel Thorup},
title = {Power of d Choices with Simple Tabulation},
journal = {CoRR},
volume = {abs/1804.09684},
year = {2018},
url = {http://arxiv.org/abs/1804.09684},
eprinttype = {arXiv},
eprint = {1804.09684},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-09684.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-13187,
author = {Anders Aamand and
Mikkel Thorup},
title = {Non-Empty Bins with Simple Tabulation Hashing},
journal = {CoRR},
volume = {abs/1810.13187},
year = {2018},
url = {http://arxiv.org/abs/1810.13187},
eprinttype = {arXiv},
eprint = {1810.13187},
timestamp = {Thu, 08 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-13187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-07389,
author = {Anders Aamand and
Niklas Hjuler and
Jacob Holm and
Eva Rotenberg},
title = {One-Way Trail Orientations},
journal = {CoRR},
volume = {abs/1708.07389},
year = {2017},
url = {http://arxiv.org/abs/1708.07389},
eprinttype = {arXiv},
eprint = {1708.07389},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-07389.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-08 03:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
