Evangelos Kipouridis
PhD fellow
ORCID: 0000-0002-5830-5830
1 - 4 out of 4Page size: 10
- 2022
- Published
A Simple Algorithm for Multiple-Source Shortest Paths in Planar Digraphs
Das, D., Kipouridis, Evangelos, Gutenberg, M. P. & Wulff-Nilsen, Christian, 2022, Proceedings, Symposium on Simplicity in Algorithms (SOSA). SIAM, p. 1-11Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Clustering, Weighted Sequences, and Shortest Paths
Kipouridis, Evangelos, 2022, Department of Computer Science, Faculty of Science, University of Copenhagen. 145 p.Research output: Book/Report › Ph.D. thesis › Research
- Published
Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor
Cohen-Addad, V., Das, D., Kipouridis, Evangelos, Parotsidis, N. & Thorup, Mikkel, 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 1-12Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing
Aamand, A., Das, D., Kipouridis, Evangelos, Knudsen, J. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2022, In: Proceedings of the VLDB Endowment. 15, 13, p. 3989-4001Research output: Contribution to journal › Conference article › Research › peer-review
ID: 218700794
Most downloads
-
56
downloads
No Repetition: Fast Streaming with Highly Concentrated Hashing
Research output: Working paper › Research
Published -
36
downloads
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing
Research output: Contribution to journal › Conference article › Research › peer-review
Published -
13
downloads
Longest Common Subsequence on Weighted Sequences.
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review