Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "rolf fagerberg"
download as .bib file
@article{DBLP:journals/corr/abs-2404-02692,
author = {Jakob L. Andersen and
Akbar Davoodi and
Rolf Fagerberg and
Christoph Flamm and
Walter Fontana and
Juraj Kolc{\'{a}}k and
Christophe V. F. P. Laurent and
Daniel Merkle and
Nikolai N{\o}jgaard},
title = {Automated Inference of Graph Transformation Rules},
journal = {CoRR},
volume = {abs/2404.02692},
year = {2024}
}
@inproceedings{DBLP:conf/isbra/AndersenBFFMS23,
author = {Jakob L. Andersen and
Sissel Banke and
Rolf Fagerberg and
Christoph Flamm and
Daniel Merkle and
Peter F. Stadler},
title = {On the Realisability of Chemical Pathways},
booktitle = {{ISBRA}},
series = {Lecture Notes in Computer Science},
volume = {14248},
pages = {409--419},
publisher = {Springer},
year = {2023}
}
@inproceedings{DBLP:conf/isbra/EriksenAFM23,
author = {Casper Asbj{\o}rn Eriksen and
Jakob Lykke Andersen and
Rolf Fagerberg and
Daniel Merkle},
title = {Reconciling Inconsistent Molecular Structures from Biochemical Databases},
booktitle = {{ISBRA}},
series = {Lecture Notes in Computer Science},
volume = {14248},
pages = {58--71},
publisher = {Springer},
year = {2023}
}
@article{DBLP:journals/corr/abs-2308-12735,
author = {Casper Asbj{\o}rn Eriksen and
Jakob Lykke Andersen and
Rolf Fagerberg and
Daniel Merkle},
title = {Reconciling Inconsistent Molecular Structures from Biochemical Databases},
journal = {CoRR},
volume = {abs/2308.12735},
year = {2023}
}
@article{DBLP:journals/corr/abs-2309-10629,
author = {Jakob L. Andersen and
Sissel Banke and
Rolf Fagerberg and
Christoph Flamm and
Daniel Merkle and
Peter F. Stadler},
title = {On the Realisability of Chemical Pathways},
journal = {CoRR},
volume = {abs/2309.10629},
year = {2023}
}
@article{DBLP:journals/jcisd/AndersenFFFKLMN22,
author = {Jakob L. Andersen and
Rolf Fagerberg and
Christoph Flamm and
Walter Fontana and
Juraj Kolc{\'{a}}k and
Christophe V. F. P. Laurent and
Daniel Merkle and
Nikolai N{\o}jgaard},
title = {Representing Catalytic Mechanisms with Rule Composition},
journal = {J. Chem. Inf. Model.},
volume = {62},
number = {22},
pages = {5513--5524},
year = {2022}
}
@article{DBLP:journals/tcs/BoseCFIJL22,
author = {Prosenjit Bose and
Pilar Cano and
Rolf Fagerberg and
John Iacono and
Riko Jacob and
Stefan Langerman},
title = {Fragile complexity of adaptive algorithms},
journal = {Theor. Comput. Sci.},
volume = {919},
pages = {92--102},
year = {2022}
}
@article{DBLP:journals/corr/abs-2201-04360,
author = {Jakob L. Andersen and
Rolf Fagerberg and
Juraj Kolc{\'{a}}k and
Christophe V. F. P. Laurent and
Daniel Merkle and
Nikolai N{\o}jgaard},
title = {Efficient Modular Graph Transformation Rule Application},
journal = {CoRR},
volume = {abs/2201.04360},
year = {2022}
}
@article{DBLP:journals/corr/abs-2201-04515,
author = {Jakob L. Andersen and
Rolf Fagerberg and
Christoph Flamm and
Walter Fontana and
Juraj Kolc{\'{a}}k and
Christophe V. F. P. Laurent and
Daniel Merkle and
Nikolai N{\o}jgaard},
title = {Characterizing Catalytic Mechanisms with Overlay Graphs},
journal = {CoRR},
volume = {abs/2201.04515},
year = {2022}
}
@article{DBLP:journals/bioinformatics/AndersenFFFKLMN21,
author = {Jakob L. Andersen and
Rolf Fagerberg and
Christoph Flamm and
Walter Fontana and
Juraj Kolc{\'{a}}k and
Christophe V. F. P. Laurent and
Daniel Merkle and
Nikolai N{\o}jgaard},
title = {Graph transformation for enzymatic mechanisms},
journal = {Bioinform.},
volume = {37},
number = {Supplement},
pages = {392--400},
year = {2021}
}
@inproceedings{DBLP:conf/ciac/BoseCFIJL21,
author = {Prosenjit Bose and
Pilar Cano and
Rolf Fagerberg and
John Iacono and
Riko Jacob and
Stefan Langerman},
title = {Fragile Complexity of Adaptive Algorithms},
booktitle = {{CIAC}},
series = {Lecture Notes in Computer Science},
volume = {12701},
pages = {144--157},
publisher = {Springer},
year = {2021}
}
@inproceedings{DBLP:conf/wea/BrodalFH0PT21,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
David Hammer and
Ulrich Meyer and
Manuel Penschuck and
Hung Tran},
title = {An Experimental Study of External Memory Algorithms for Connected
Components},
booktitle = {{SEA}},
series = {LIPIcs},
volume = {190},
pages = {23:1--23:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021}
}
@article{DBLP:journals/corr/abs-2102-00338,
author = {Prosenjit Bose and
Pilar Cano and
Rolf Fagerberg and
John Iacono and
Riko Jacob and
Stefan Langerman},
title = {Fragile Complexity of Adaptive Algorithms},
journal = {CoRR},
volume = {abs/2102.00338},
year = {2021}
}
@article{DBLP:journals/corr/abs-2102-03292,
author = {Jakob L. Andersen and
Rolf Fagerberg and
Christoph Flamm and
Walter Fontana and
Juraj Kolc{\'{a}}k and
Christophe V. F. P. Laurent and
Daniel Merkle and
Nikolai N{\o}jgaard},
title = {Graph Transformation for Enzymatic Mechanisms},
journal = {CoRR},
volume = {abs/2102.03292},
year = {2021}
}
@article{DBLP:journals/algorithmica/BoseFRV19,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {On Plane Constrained Bounded-Degree Spanners},
journal = {Algorithmica},
volume = {81},
number = {4},
pages = {1392--1415},
year = {2019}
}
@article{DBLP:journals/anor/ChiarandiniFG19,
author = {Marco Chiarandini and
Rolf Fagerberg and
Stefano Gualandi},
title = {Handling preferences in student-project allocation},
journal = {Ann. Oper. Res.},
volume = {275},
number = {1},
pages = {39--78},
year = {2019}
}
@inproceedings{DBLP:conf/esa/AfshaniFHJK0PS19,
author = {Peyman Afshani and
Rolf Fagerberg and
David Hammer and
Riko Jacob and
Irina Kostitsyna and
Ulrich Meyer and
Manuel Penschuck and
Nodari Sitchinava},
title = {Fragile Complexity of Comparison-Based Algorithms},
booktitle = {{ESA}},
series = {LIPIcs},
volume = {144},
pages = {2:1--2:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019}
}
@inproceedings{DBLP:conf/isaac/FagerbergH019,
author = {Rolf Fagerberg and
David Hammer and
Ulrich Meyer},
title = {On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect
Shape?},
booktitle = {{ISAAC}},
series = {LIPIcs},
volume = {149},
pages = {35:1--35:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019}
}
@article{DBLP:journals/corr/abs-1901-02857,
author = {Peyman Afshani and
Rolf Fagerberg and
David Hammer and
Riko Jacob and
Irina Kostitsyna and
Ulrich Meyer and
Manuel Penschuck and
Nodari Sitchinava},
title = {Fragile Complexity of Comparison-Based Algorithms},
journal = {CoRR},
volume = {abs/1901.02857},
year = {2019}
}
@article{DBLP:journals/comgeo/BakhsheshBBCDFF18,
author = {Davood Bakhshesh and
Luis Barba and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Mirela Damian and
Rolf Fagerberg and
Mohammad Farshi and
Andr{\'{e}} van Renssen and
Perouz Taslakian and
Sander Verdonschot},
title = {Continuous Yao graphs},
journal = {Comput. Geom.},
volume = {67},
pages = {42--52},
year = {2018}
}
@article{DBLP:journals/jcheminf/FagerbergFKMS18,
author = {Rolf Fagerberg and
Christoph Flamm and
Rojin Kianian and
Daniel Merkle and
Peter F. Stadler},
title = {Finding the {K} best synthesis plans},
journal = {J. Cheminformatics},
volume = {10},
number = {1},
pages = {19:1--19:21},
year = {2018}
}
@article{DBLP:journals/jocg/BoseFRV17,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {Competitive local routing with constraints},
journal = {J. Comput. Geom.},
volume = {8},
number = {1},
pages = {125--152},
year = {2017}
}
@article{DBLP:journals/corr/BoseFHM17,
author = {Prosenjit Bose and
Rolf Fagerberg and
John Howat and
Pat Morin},
title = {Biased Predecessor Search},
journal = {CoRR},
volume = {abs/1707.01182},
year = {2017}
}
@article{DBLP:journals/corr/BoseFRV17,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {On Plane Constrained Bounded-Degree Spanners},
journal = {CoRR},
volume = {abs/1704.03596},
year = {2017}
}
@article{DBLP:journals/algorithmica/BoseFHM16,
author = {Prosenjit Bose and
Rolf Fagerberg and
John Howat and
Pat Morin},
title = {Biased Predecessor Search},
journal = {Algorithmica},
volume = {76},
number = {4},
pages = {1097--1105},
year = {2016}
}
@incollection{DBLP:reference/algo/Fagerberg16,
author = {Rolf Fagerberg},
title = {Cache-Oblivious B-Tree},
booktitle = {Encyclopedia of Algorithms},
pages = {261--264},
year = {2016}
}
@incollection{DBLP:reference/algo/Fagerberg16a,
author = {Rolf Fagerberg},
title = {Cache-Oblivious Model},
booktitle = {Encyclopedia of Algorithms},
pages = {264--269},
year = {2016}
}
@incollection{DBLP:reference/algo/Fagerberg16b,
author = {Rolf Fagerberg},
title = {String Sorting},
booktitle = {Encyclopedia of Algorithms},
pages = {2117--2121},
year = {2016}
}
@article{DBLP:journals/jocg/BarbaBDFKORTVX15,
author = {Luis Barba and
Prosenjit Bose and
Mirela Damian and
Rolf Fagerberg and
Wah Loon Keng and
Joseph O'Rourke and
Andr{\'{e}} van Renssen and
Perouz Taslakian and
Sander Verdonschot and
Ge Xia},
title = {New and improved spanning ratios for Yao graphs},
journal = {J. Comput. Geom.},
volume = {6},
number = {2},
pages = {19--53},
year = {2015}
}
@article{DBLP:journals/siamcomp/BoseFRV15,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {Optimal Local Routing on Delaunay Triangulations Defined by Empty
Equilateral Triangles},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {6},
pages = {1626--1649},
year = {2015}
}
@inproceedings{DBLP:conf/isaac/BoseFRV15,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {Competitive Local Routing with Constraints},
booktitle = {{ISAAC}},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {23--34},
publisher = {Springer},
year = {2015}
}
@inproceedings{DBLP:conf/cccg/BarbaBCDFRTV14,
author = {Luis Barba and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Mirela Damian and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Perouz Taslakian and
Sander Verdonschot},
title = {Continuous Yao Graphs},
booktitle = {{CCCG}},
publisher = {Carleton University, Ottawa, Canada},
year = {2014}
}
@inproceedings{DBLP:conf/compgeom/BarbaBDFKORTVX14,
author = {Luis Barba and
Prosenjit Bose and
Mirela Damian and
Rolf Fagerberg and
Wah Loon Keng and
Joseph O'Rourke and
Andr{\'{e}} van Renssen and
Perouz Taslakian and
Sander Verdonschot and
Ge Xia},
title = {New and Improved Spanning Ratios for Yao Graphs},
booktitle = {SoCG},
pages = {30},
publisher = {{ACM}},
year = {2014}
}
@inproceedings{DBLP:conf/latin/BoseFHM14,
author = {Prosenjit Bose and
Rolf Fagerberg and
John Howat and
Pat Morin},
title = {Biased Predecessor Search},
booktitle = {{LATIN}},
series = {Lecture Notes in Computer Science},
volume = {8392},
pages = {755--764},
publisher = {Springer},
year = {2014}
}
@article{DBLP:journals/corr/BarbaBCDFRTV14,
author = {Luis Barba and
Prosenjit Bose and
Jean{-}Lou De Carufel and
Mirela Damian and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Perouz Taslakian and
Sander Verdonschot},
title = {Continuous Yao Graphs},
journal = {CoRR},
volume = {abs/1408.4099},
year = {2014}
}
@article{DBLP:journals/corr/BoseFRV14,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {Optimal local routing on Delaunay triangulations defined by empty
equilateral triangles},
journal = {CoRR},
volume = {abs/1409.6397},
year = {2014}
}
@article{DBLP:journals/corr/BoseFRV14a,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {Competitive Local Routing with Constraints},
journal = {CoRR},
volume = {abs/1412.0760},
year = {2014}
}
@article{DBLP:journals/bmcbi/SandBFPM13,
author = {Andreas Sand and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Christian N. S. Pedersen and
Thomas Mailund},
title = {A practical O(n log\({}^{\mbox{2 }}\) n) time algorithm for computing
the triplet distance on binary trees},
journal = {{BMC} Bioinform.},
volume = {14},
number = {{S-2}},
pages = {S18},
year = {2013}
}
@article{DBLP:journals/mics/FagerbergFMPS13,
author = {Rolf Fagerberg and
Christoph Flamm and
Daniel Merkle and
Philipp Peters and
Peter F. Stadler},
title = {On the Complexity of Reconstructing Chemical Reaction Networks},
journal = {Math. Comput. Sci.},
volume = {7},
number = {3},
pages = {275--292},
year = {2013}
}
@inproceedings{DBLP:conf/soda/BrodalFMPS13,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Thomas Mailund and
Christian N. S. Pedersen and
Andreas Sand},
title = {Efficient algorithms for computing the triplet and quartet distance
between trees of arbitrary degree},
booktitle = {{SODA}},
pages = {1814--1832},
publisher = {{SIAM}},
year = {2013}
}
@article{DBLP:journals/corr/BarbaBDFORTV13,
author = {Luis Barba and
Prosenjit Bose and
Mirela Damian and
Rolf Fagerberg and
Joseph O'Rourke and
Andr{\'{e}} van Renssen and
Perouz Taslakian and
Sander Verdonschot},
title = {New and Improved Spanning Ratios for Yao Graphs},
journal = {CoRR},
volume = {abs/1307.5829},
year = {2013}
}
@article{DBLP:journals/corr/FagerbergFMPS13,
author = {Rolf Fagerberg and
Christoph Flamm and
Daniel Merkle and
Philipp Peters and
Peter F. Stadler},
title = {On the Complexity of Reconstructing Chemical Reaction Networks},
journal = {CoRR},
volume = {abs/1309.7198},
year = {2013}
}
@inproceedings{DBLP:conf/cccg/BoseFRV12,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {Competitive Routing on a Bounded-Degree Plane Spanner},
booktitle = {{CCCG}},
pages = {285--290},
year = {2012}
}
@inproceedings{DBLP:conf/cp/FagerbergFMP12,
author = {Rolf Fagerberg and
Christoph Flamm and
Daniel Merkle and
Philipp Peters},
title = {Exploring Chemistry Using {SMT}},
booktitle = {{CP}},
series = {Lecture Notes in Computer Science},
volume = {7514},
pages = {900--915},
publisher = {Springer},
year = {2012}
}
@inproceedings{DBLP:conf/icalp/BoseCFL12,
author = {Prosenjit Bose and
S{\'{e}}bastien Collette and
Rolf Fagerberg and
Stefan Langerman},
title = {De-amortizing Binary Search Trees},
booktitle = {{ICALP} {(1)}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {121--132},
publisher = {Springer},
year = {2012}
}
@inproceedings{DBLP:conf/latin/BoseFRV12,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {On Plane Constrained Bounded-Degree Spanners},
booktitle = {{LATIN}},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {85--96},
publisher = {Springer},
year = {2012}
}
@inproceedings{DBLP:conf/soda/BoseFRV12,
author = {Prosenjit Bose and
Rolf Fagerberg and
Andr{\'{e}} van Renssen and
Sander Verdonschot},
title = {Competitive routing in the half-{\texttheta}\({}_{\mbox{6}}\)-graph},
booktitle = {{SODA}},
pages = {1319--1328},
publisher = {{SIAM}},
year = {2012}
}
@article{DBLP:journals/algorithmica/BenderBFGHHIL11,
author = {Michael A. Bender and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Dongdong Ge and
Simai He and
Haodong Hu and
John Iacono and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {The Cost of Cache-Oblivious Searching},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {463--505},
year = {2011}
}
@article{DBLP:journals/corr/abs-1111-1665,
author = {Prosenjit Bose and
S{\'{e}}bastien Collette and
Rolf Fagerberg and
Stefan Langerman},
title = {De-amortizing Binary Search Trees},
journal = {CoRR},
volume = {abs/1111.1665},
year = {2011}
}
@article{DBLP:journals/mst/BenderBFJV10,
author = {Michael A. Bender and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Riko Jacob and
Elias Vicari},
title = {Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model},
journal = {Theory Comput. Syst.},
volume = {47},
number = {4},
pages = {934--962},
year = {2010}
}
@inproceedings{DBLP:conf/swat/BoseDDF10,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
Rolf Fagerberg},
title = {An \emph{O}(log log \emph{n})-Competitive Binary Search Tree with
Optimal Worst-Case Access Times},
booktitle = {{SWAT}},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {38--49},
publisher = {Springer},
year = {2010}
}
@article{DBLP:journals/corr/abs-1003-0139,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
Rolf Fagerberg},
title = {An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case
Access Times},
journal = {CoRR},
volume = {abs/1003.0139},
year = {2010}
}
@article{DBLP:journals/talg/BilleFG09,
author = {Philip Bille and
Rolf Fagerberg and
Inge Li G{\o}rtz},
title = {Improved approximate string matching and regular expression matching
on Ziv-Lempel compressed texts},
journal = {{ACM} Trans. Algorithms},
volume = {6},
number = {1},
pages = {3:1--3:14},
year = {2009}
}
@inproceedings{DBLP:conf/isaac/BrodalFGL09,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Mark Greve and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {Online Sorted Range Reporting},
booktitle = {{ISAAC}},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {173--182},
publisher = {Springer},
year = {2009}
}
@article{DBLP:journals/jbcb/StissingMPBF08,
author = {Martin Stig Stissing and
Thomas Mailund and
Christian N. S. Pedersen and
Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Computing the All-Pairs Quartet Distance on a Set of Evolutionary
Trees},
journal = {J. Bioinform. Comput. Biol.},
volume = {6},
number = {1},
pages = {37--50},
year = {2008}
}
@article{DBLP:journals/jea/BrodalFM08,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Gabriel Moruz},
title = {On the adaptiveness of Quicksort},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {3.2:1--3.2:20},
year = {2008}
}
@incollection{DBLP:reference/algo/Fagerberg08,
author = {Rolf Fagerberg},
title = {Cache-Oblivious B-Tree},
booktitle = {Encyclopedia of Algorithms},
publisher = {Springer},
year = {2008}
}
@incollection{DBLP:reference/algo/Fagerberg08a,
author = {Rolf Fagerberg},
title = {Cache-Oblivious Model},
booktitle = {Encyclopedia of Algorithms},
publisher = {Springer},
year = {2008}
}
@incollection{DBLP:reference/algo/Fagerberg08b,
author = {Rolf Fagerberg},
title = {String Sorting},
booktitle = {Encyclopedia of Algorithms},
publisher = {Springer},
year = {2008}
}
@article{DBLP:journals/jea/BrodalFV07,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Kristoffer Vinther},
title = {Engineering a cache-oblivious sorting algorithm},
journal = {{ACM} J. Exp. Algorithmics},
volume = {12},
pages = {2.2:1--2.2:23},
year = {2007}
}
@inproceedings{DBLP:conf/apbc/StissingMPBF07,
author = {Martin Stig Stissing and
Thomas Mailund and
Christian N. S. Pedersen and
Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Computing the All-Pairs Quartet Distance on a Set of Evolutionary
Trees},
booktitle = {{APBC}},
series = {Advances in Bioinformatics and Computational Biology},
volume = {5},
pages = {91--100},
publisher = {Imperial College Press},
year = {2007}
}
@inproceedings{DBLP:conf/apbc/StissingPMBF07,
author = {Martin Stig Stissing and
Christian N. S. Pedersen and
Thomas Mailund and
Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Computing the Quartet Distance Between Evolutionary Trees of Bounded
Degree},
booktitle = {{APBC}},
series = {Advances in Bioinformatics and Computational Biology},
volume = {5},
pages = {101--110},
publisher = {Imperial College Press},
year = {2007}
}
@inproceedings{DBLP:conf/cpm/BilleFG07,
author = {Philip Bille and
Rolf Fagerberg and
Inge Li G{\o}rtz},
title = {Improved Approximate String Matching and Regular Expression Matching
on Ziv-Lempel Compressed Texts},
booktitle = {{CPM}},
series = {Lecture Notes in Computer Science},
volume = {4580},
pages = {52--62},
publisher = {Springer},
year = {2007}
}
@inproceedings{DBLP:conf/esa/BrodalFFGIJMM07,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Irene Finocchi and
Fabrizio Grandoni and
Giuseppe F. Italiano and
Allan Gr{\o}nlund J{\o}rgensen and
Gabriel Moruz and
Thomas M{\o}lhave},
title = {Optimal Resilient Dynamic Dictionaries},
booktitle = {{ESA}},
series = {Lecture Notes in Computer Science},
volume = {4698},
pages = {347--358},
publisher = {Springer},
year = {2007}
}
@inproceedings{DBLP:conf/spaa/BenderBFJV07,
author = {Michael A. Bender and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Riko Jacob and
Elias Vicari},
title = {Optimal sparse matrix dense vector multiplication in the I/O-model},
booktitle = {{SPAA}},
pages = {61--70},
publisher = {{ACM}},
year = {2007}
}
@article{DBLP:journals/bmcbi/MailundBFPP06,
author = {Thomas Mailund and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Christian N. S. Pedersen and
Derek Phillips},
title = {Recrafting the neighbor-joining method},
journal = {{BMC} Bioinform.},
volume = {7},
pages = {29},
year = {2006}
}
@inproceedings{DBLP:conf/soda/BrodalF06,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Cache-oblivious string dictionaries},
booktitle = {{SODA}},
pages = {581--590},
publisher = {{ACM} Press},
year = {2006}
}
@inproceedings{DBLP:conf/stacs/FagerbergPP06,
author = {Rolf Fagerberg and
Anna Pagh and
Rasmus Pagh},
title = {External String Sorting: Faster and Cache-Oblivious},
booktitle = {{STACS}},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {68--79},
publisher = {Springer},
year = {2006}
}
@article{DBLP:journals/corr/abs-cs-0609085,
author = {Philip Bille and
Rolf Fagerberg and
Inge Li G{\o}rtz},
title = {Improved Approximate String Matching and Regular Expression Matching
on Ziv-Lempel Compressed Texts},
journal = {CoRR},
volume = {abs/cs/0609085},
year = {2006}
}
@inproceedings{DBLP:conf/alenex/BrodalFM05,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Gabriel Moruz},
title = {On the Adaptiveness of Quicksort},
booktitle = {{ALENEX/ANALCO}},
pages = {130--140},
publisher = {{SIAM}},
year = {2005}
}
@inproceedings{DBLP:conf/compgeom/ArgeBFL05,
author = {Lars Arge and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Morten Laustsen},
title = {Cache-oblivious planar orthogonal range searching and counting},
booktitle = {{SCG}},
pages = {160--169},
publisher = {{ACM}},
year = {2005}
}
@inproceedings{DBLP:conf/icalp/BrodalFM05,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Gabriel Moruz},
title = {Cache-Aware and Cache-Oblivious Adaptive Sorting},
booktitle = {{ICALP}},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {576--588},
publisher = {Springer},
year = {2005}
}
@article{DBLP:journals/algorithmica/BrodalFP03,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Christian N. S. Pedersen},
title = {Computing the Quartet Distance between Evolutionary Trees in Time
O(n log n)},
journal = {Algorithmica},
volume = {38},
number = {2},
pages = {377--395},
year = {2004}
}
@inproceedings{DBLP:conf/alenex/BrodalFV04,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Kristoffer Vinther},
title = {Engineering a Cache-Oblivious Sorting Algorith},
booktitle = {{ALENEX/ANALC}},
pages = {4--17},
publisher = {{SIAM}},
year = {2004}
}
@inproceedings{DBLP:conf/swat/BrodalFMZ04,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Ulrich Meyer and
Norbert Zeh},
title = {Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First
Search and Shortest Paths},
booktitle = {{SWAT}},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {480--492},
publisher = {Springer},
year = {2004}
}
@incollection{DBLP:reference/crc/AnderssonFL04,
author = {Arne Andersson and
Rolf Fagerberg and
Kim S. Larsen},
title = {Balanced Binary Search Trees},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC},
year = {2004}
}
@incollection{DBLP:reference/crc/ArgeBF04,
author = {Lars Arge and
Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Cache-Oblivious Data Structures},
booktitle = {Handbook of Data Structures and Applications},
publisher = {Chapman and Hall/CRC},
year = {2004}
}
@inproceedings{DBLP:conf/focs/BenderBFGHHIL03,
author = {Michael A. Bender and
Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Dongdong Ge and
Simai He and
Haodong Hu and
John Iacono and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {The Cost of Cache-Oblivious Searching},
booktitle = {{FOCS}},
pages = {271--282},
publisher = {{IEEE} Computer Society},
year = {2003}
}
@inproceedings{DBLP:conf/soda/BrodalF03,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Lower bounds for external memory dictionaries},
booktitle = {{SODA}},
pages = {546--554},
publisher = {{ACM/SIAM}},
year = {2003}
}
@inproceedings{DBLP:conf/stoc/BrodalF03,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {On the limits of cache-obliviousness},
booktitle = {{STOC}},
pages = {307--315},
publisher = {{ACM}},
year = {2003}
}
@inproceedings{DBLP:conf/wabi/BrodalFOPR03,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Anna {\"{O}}stlin and
Christian N. S. Pedersen and
S. Srinivasa Rao},
title = {Computing Refined Buneman Trees in Cubic Time},
booktitle = {{WABI}},
series = {Lecture Notes in Computer Science},
volume = {2812},
pages = {259--270},
publisher = {Springer},
year = {2003}
}
@inproceedings{DBLP:conf/icalp/BrodalF02,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Cache Oblivious Distribution Sweeping},
booktitle = {{ICALP}},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {426--438},
publisher = {Springer},
year = {2002}
}
@inproceedings{DBLP:conf/isaac/BrodalF02,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Funnel Heap - {A} Cache Oblivious Priority Queue},
booktitle = {{ISAAC}},
series = {Lecture Notes in Computer Science},
volume = {2518},
pages = {219--228},
publisher = {Springer},
year = {2002}
}
@inproceedings{DBLP:conf/soda/BrodalFJ02,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Riko Jacob},
title = {Cache oblivious search trees via binary trees of small height},
booktitle = {{SODA}},
pages = {39--48},
publisher = {{ACM/SIAM}},
year = {2002}
}
@inproceedings{DBLP:conf/icalp/BrodalFPO01,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Christian N. S. Pedersen and
Anna {\"{O}}stlin},
title = {The Complexity of Constructing Evolutionary Trees Using Experiments},
booktitle = {{ICALP}},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {140--151},
publisher = {Springer},
year = {2001}
}
@inproceedings{DBLP:conf/isaac/BrodalFP01,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Christian N. S. Pedersen},
title = {Computing the Quartet Distance between Evolutionary Trees in Time
O(n log\({}^{\mbox{2}}\) n)},
booktitle = {{ISAAC}},
series = {Lecture Notes in Computer Science},
volume = {2223},
pages = {731--742},
publisher = {Springer},
year = {2001}
}
@inproceedings{DBLP:conf/wads/FagerbergJL01,
author = {Rolf Fagerberg and
Rune E. Jensen and
Kim S. Larsen},
title = {Search Trees with Relaxed Balance and Near-Optimal Height},
booktitle = {{WADS}},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {414--425},
publisher = {Springer},
year = {2001}
}
@inproceedings{DBLP:conf/fsttcs/Fagerberg99,
author = {Rolf Fagerberg},
title = {The Complexity of Rebalancing a Binary Search Tree},
booktitle = {{FSTTCS}},
series = {Lecture Notes in Computer Science},
volume = {1738},
pages = {72--83},
publisher = {Springer},
year = {1999}
}
@inproceedings{DBLP:conf/wads/BrodalF99,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg},
title = {Dynamic Representation of Sparse Graphs},
booktitle = {{WADS}},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {342--351},
publisher = {Springer},
year = {1999}
}
@article{DBLP:journals/jcss/BoyarFL97,
author = {Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen},
title = {Amortization Results for Chromatic Search Trees, with an Application
to Priority Queues},
journal = {J. Comput. Syst. Sci.},
volume = {55},
number = {3},
pages = {504--521},
year = {1997}
}
@article{DBLP:journals/ijfcs/LarsenF96,
author = {Kim S. Larsen and
Rolf Fagerberg},
title = {Efficient Rebalancing of B-Trees with Relaxed Balance},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {2},
pages = {169--186},
year = {1996}
}
@article{DBLP:journals/ipl/Fagerberg96,
author = {Rolf Fagerberg},
title = {A Generalization of Binomial Queues},
journal = {Inf. Process. Lett.},
volume = {57},
number = {2},
pages = {109--114},
year = {1996}
}
@inproceedings{DBLP:conf/swat/Fagerberg96,
author = {Rolf Fagerberg},
title = {Binary Search Trees: How Low Can You Go?},
booktitle = {{SWAT}},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {428--439},
publisher = {Springer},
year = {1996}
}
@inproceedings{DBLP:conf/ipps/LarsenF95,
author = {Kim S. Larsen and
Rolf Fagerberg},
title = {B-trees with relaxed balance},
booktitle = {{IPPS}},
pages = {196--202},
publisher = {{IEEE} Computer Society},
year = {1995}
}
@inproceedings{DBLP:conf/wads/BoyarFL95,
author = {Joan Boyar and
Rolf Fagerberg and
Kim S. Larsen},
title = {Amortization Results for Chromatic Search Trees, with an Application
to Priority Queues},
booktitle = {{WADS}},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {270--281},
publisher = {Springer},
year = {1995}
}
a service of 
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.
retrieved on 2024-07-18 13:38 CEST from data curated 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:
