Eva Rotenberg
Eva Rotenberg
Associate Professor, DTU Compute, Denmark
Bekræftet mail på dtu.dk - Startside
Titel
Citeret af
Citeret af
År
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
322018
Faster fully-dynamic minimum spanning forest
J Holm, E Rotenberg, C Wulff-Nilsen
Algorithms-ESA 2015, 742-753, 2015
242015
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 (2), 204-215, 2009
192009
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
172015
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
122016
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
102018
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
102015
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
82018
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
62018
Contracting a planar graph efficiently
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg, P Sankowski
arXiv preprint arXiv:1706.10228, 2017
62017
Decremental SPQR-trees for planar graphs
J Holm, GF Italiano, A Karczmarz, J Łącki, E Rotenberg
arXiv preprint arXiv:1806.10772, 2018
52018
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), 2016
52016
Dynamic Planar Embeddings of Dynamic Graphs
J Holm, E Rotenberg
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
52015
String attractors: Verification and optimization
D Kempa, A Policriti, N Prezza, E Rotenberg
arXiv preprint arXiv:1803.01695, 2018
42018
Best laid plans of lions and men
M Abrahamsen, J Holm, E Rotenberg, C Wulff-Nilsen
arXiv preprint arXiv:1703.03687, 2017
42017
Strength of the Reversible, Garbage-Free 2 k ±1 Multiplier
E Rotenberg, J Cranch, MK Thomsen, HB Axelsen
International Conference on Reversible Computation, 46-57, 2013
42013
Fully-dynamic planarity testing in polylogarithmic time
J Holm, E Rotenberg
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
22020
Designing garbage-free reversible implementations of the integer cosine transform
A De Vos, S Burignat, R Glück, TÆ Mogensen, HB Axelsen, MK Thomsen, ...
ACM Journal on Emerging Technologies in Computing Systems (JETC) 11 (2), 1-15, 2014
22014
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
12020
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
12019
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20