Daniel Allendorf

Orcid: 0000-0002-0549-7576

According to our database1, Daniel Allendorf authored at least 7 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Uniform Sampling of Negative Edge Weights in Shortest Path Networks.
CoRR, 2024

Maintaining Discrete Probability Distributions in Practice.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2024

2023
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees.
J. Parallel Distributed Comput., April, 2023

A Simple Data Structure for Maintaining a Discrete Probability Distribution.
CoRR, 2023

Uniform Generation of Temporal Graphs with Given Degrees.
Proceedings of the Complex Networks & Their Applications XII, 2023

Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022


  Loading...