default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnders Aamand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i18]Anders Aamand, Justin Y. Chen, Mina Dalirrooyfard, Slobodan Mitrovic, Yuriy Nevmyvaka, Sandeep Silwal, Yinzhan Xu:
Differentially Private Gomory-Hu Trees. CoRR abs/2408.01798 (2024)- 2023
- [j3]Anders Aamand
, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. ACM Trans. Algorithms 19(3): 30:1-30:28 (2023) - [c14]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. ICALP 2023: 6:1-6:17 - [c13]Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal:
Data Structures for Density Estimation. ICML 2023: 1-18 - [c12]Anders Aamand, Justin Y. Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, Fred Zhang:
Constant Approximation for Individual Preference Stable Clustering. NeurIPS 2023 - [c11]Anders Aamand, Justin Y. Chen, Huy Lê Nguyen, Sandeep Silwal, Ali Vakilian:
Improved Frequency Estimation Algorithms with and without Predictions. NeurIPS 2023 - [c10]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. SODA 2023: 1806-1833 - [i17]Anders Aamand, Justin Y. Chen, Huy Lê Nguyen, Sandeep Silwal:
Improved Space Bounds for Learning with Experts. CoRR abs/2303.01453 (2023) - [i16]Anders Aamand, Alexandr Andoni, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Sandeep Silwal:
Data Structures for Density Estimation. CoRR abs/2306.11312 (2023) - [i15]Anders Aamand, Justin Y. Chen, Allen Liu, Sandeep Silwal, Pattara Sukprasert, Ali Vakilian, Fred Zhang:
Constant Approximation for Individual Preference Stable Clustering. CoRR abs/2309.16840 (2023) - [i14]Anders Aamand, Justin Y. Chen, Huy Lê Nguyen, Sandeep Silwal, Ali Vakilian:
Improved Frequency Estimation Algorithms with and without Predictions. CoRR abs/2312.07535 (2023) - 2022
- [j2]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing. Proc. VLDB Endow. 15(13): 3989-4001 (2022) - [c9]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. SoCG 2022: 1:1-1:17 - [c8]Anders Aamand, Justin Y. Chen, Piotr Indyk:
(Optimal) Online Bipartite Matching with Degree Information. NeurIPS 2022 - [c7]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. NeurIPS 2022 - [i13]Anders Aamand, Justin Y. Chen, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Nicholas Schiefer, Sandeep Silwal, Tal Wagner:
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks. CoRR abs/2211.03232 (2022) - 2021
- [c6]Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen:
Classifying Convex Bodies by Their Contact and Intersection Graphs. SoCG 2021: 3:1-3:16 - [c5]Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup:
Load balancing with dynamic set of balls and bins. STOC 2021: 1262-1275 - [i12]Anders Aamand, Jakob Bæk Tejs Knudsen, Mikkel Thorup:
Load Balancing with Dynamic Set of Balls and Bins. CoRR abs/2104.05093 (2021) - [i11]Anders Aamand, Adam Karczmarz, Jakub Lacki, Nikos Parotsidis, Peter M. R. Rasmussen, Mikkel Thorup:
Optimal Decremental Connectivity in Non-Sparse Graphs. CoRR abs/2111.09376 (2021) - [i10]Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta, Linda Kleist:
Online Sorting and Translational Packing of Convex Polygons. CoRR abs/2112.03791 (2021) - 2020
- [j1]Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup:
Disks in Curves of Bounded Convex Curvature. Am. Math. Mon. 127(7): 579-593 (2020) - [c4]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, Mikkel Thorup:
Fast hashing with strong concentration bounds. STOC 2020: 1265-1278 - [i9]Anders Aamand, Debarati Das, Evangelos Kipouridis, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
No Repetition: Fast Streaming with Highly Concentrated Hashing. CoRR abs/2004.01156 (2020) - [i8]Anders Aamand, Mikkel Abrahamsen, Thomas D. Ahle, Peter M. R. Rasmussen:
Tiling with Squares and Packing Dominos in Polynomial Time. CoRR abs/2011.10983 (2020)
2010 – 2019
- 2019
- [c3]Anders Aamand, Mikkel Thorup:
Non-empty Bins with Simple Tabulation Hashing. SODA 2019: 2498-2512 - [i7]Anders Aamand, Mikkel Abrahamsen, Jakob Bæk Tejs Knudsen, Peter M. R. Rasmussen:
Classifying Convex Bodies by their Contact and Intersection Graphs. CoRR abs/1902.01732 (2019) - [i6]Anders Aamand, Jakob Bæk Tejs Knudsen, Mathias Bæk Tejs Knudsen, Peter M. R. Rasmussen, Mikkel Thorup:
Fast hashing with Strong Concentration Bounds. CoRR abs/1905.00369 (2019) - [i5]Anders Aamand, Piotr Indyk, Ali Vakilian:
(Learned) Frequency Estimation Algorithms under Zipfian Distribution. CoRR abs/1908.05198 (2019) - [i4]Anders Aamand, Mikkel Abrahamsen, Mikkel Thorup:
Disks in Curves of Bounded Convex Curvature. CoRR abs/1909.00852 (2019) - 2018
- [c2]Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Power of d Choices with Simple Tabulation. ICALP 2018: 5:1-5:14 - [c1]Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg:
One-Way Trail Orientations. ICALP 2018: 6:1-6:13 - [i3]Anders Aamand, Mathias Bæk Tejs Knudsen, Mikkel Thorup:
Power of d Choices with Simple Tabulation. CoRR abs/1804.09684 (2018) - [i2]Anders Aamand, Mikkel Thorup:
Non-Empty Bins with Simple Tabulation Hashing. CoRR abs/1810.13187 (2018) - 2017
- [i1]Anders Aamand, Niklas Hjuler, Jacob Holm, Eva Rotenberg:
One-Way Trail Orientations. CoRR abs/1708.07389 (2017)
Coauthor Index
aka: Peter Michael Reichstein Rasmussen
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:42 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:
