Obserwuj
Eva Rotenberg
Eva Rotenberg
Associate Professor, DTU Compute, Denmark
Zweryfikowany adres z dtu.dk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Online Bipartite Matching with Amortized O(log^2 n) Replacements
A Bernstein, J Holm, E Rotenberg
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
702018
Faster fully-dynamic minimum spanning forest
J Holm, E Rotenberg, C Wulff-Nilsen
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
432015
Hashing for statistics over k-partitions
S Dahlgaard, MBT Knudsen, E Rotenberg, M Thorup
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1292-1310, 2015
322015
Dynamic bridge-finding in Õ(log^2 n) amortized time
J Holm, E Rotenberg, M Thorup
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
282018
Skeletonization via local separators
A Bærentzen, E Rotenberg
ACM Transactions on Graphics (TOG) 40 (5), 1-18, 2021
252021
Fully-dynamic planarity testing in polylogarithmic time
J Holm, E Rotenberg
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
242020
Graph reconstruction with a betweenness oracle
M Abrahamsen, G Bodwin, E Rotenberg, M Stöckel
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, 5, 2016
212016
GeneWiz browser: an interactive tool for visualizing sequenced chromosomes
PF Hallin, HH Stærfeldt, E Rotenberg, TT Binnewies, CJ Benham, ...
Standards in genomic sciences 1, 204-215, 2009
212009
The power of two choices with simple tabulation
S Dahlgaard, MBT Knudsen, E Rotenberg, M Thorup
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
202016
Planar reachability in linear space and constant time
J Holm, E Rotenberg, M Thorup
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 370-389, 2015
192015
Worst-case polylog incremental spqr-trees: Embeddings, planarity, and triconnectivity
J Holm, E Rotenberg
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
172020
String attractors: Verification and optimization
D Kempa, A Policriti, N Prezza, E Rotenberg
arXiv preprint arXiv:1803.01695, 2018
152018
The bane of low-dimensionality clustering
V Cohen-Addad, A De Mesmay, E Rotenberg, A Roytman
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
152018
Dynamic Dynamic Time Warping
K Bringmann, N Fischer, I van der Hoog, E Kipouridis, T Kociumaka, ...
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
132024
Space efficient construction of Lyndon arrays in linear time
P Bille, J Ellert, J Fischer, IL Gørtz, F Kurpicz, I Munro, E Rotenberg
arXiv preprint arXiv:1911.03542, 2019
132019
Fast fencing
M Abrahamsen, A Adamaszek, K Bringmann, V Cohen-Addad, M Mehr, ...
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
132018
Dynamic Planar Embeddings of Dynamic Graphs
J Holm, E Rotenberg
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
132015
Contracting a planar graph efficiently
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski
arXiv preprint arXiv:1706.10228, 2017
122017
String indexing for top-k close consecutive occurrences
P Bille, IL Gørtz, MR Pedersen, E Rotenberg, TA Steiner
Theoretical Computer Science 927, 133-147, 2022
102022
Fully-dynamic Arboricity Decomposition and Implicit Colouring
ABG Christiansen, E Rotenberg
arXiv preprint arXiv:2203.06039, 2022
102022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20