Dipl.-Inf. Volker Weichert

Institut für Informatik

 

Mail

weichert@cs.uni-frankfurt.de

Publications

1

Gabriel Moruz, Andrei Negoescu, Christian Neumann, and Volker Weichert. Engineering efficient paging algorithms. ACM Journal of Experimental Algorithmics, 2014. View Online doi:10.1145/2670127 @article{DBLP:journals/jea/MoruzNNW14, author = "Moruz, Gabriel and Negoescu, Andrei and Neumann, Christian and Weichert, Volker", biburl = "https://dblp.org/rec/journals/jea/MoruzNNW14.bib", doi = "10.1145/2670127", journal = "{ACM} Journal of Experimental Algorithmics", number = "1", title = "Engineering Efficient Paging Algorithms", url = "https://doi.org/10.1145/2670127", volume = "19", year = "2014" }

2

Ulrich Meyer and Volker Weichert. Algorithm engineering für moderne hardware. Informatik Spektrum, 36(2):153–161, 2013. View Online doi:10.1007/s00287-013-0681-4 @article{DBLP:journals/insk/MeyerW13, author = "Meyer, Ulrich and Weichert, Volker", biburl = "https://dblp.org/rec/journals/insk/MeyerW13.bib", doi = "10.1007/s00287-013-0681-4", journal = "Informatik Spektrum", number = "2", pages = "153--161", title = {Algorithm Engineering f{\"{u}}r moderne Hardware}, url = "https://doi.org/10.1007/s00287-013-0681-4", volume = "36", year = "2013" }

3

Gabriel Moruz, Andrei Negoescu, Christian Neumann, and Volker Weichert. Engineering efficient paging algorithms. In Ralf Klasing, editor, Experimental Algorithms - 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings, volume 7276 of Lecture Notes in Computer Science, 320–331. Springer, 2012. View Online doi:10.1007/978-3-642-30850-5_28 @inproceedings{DBLP:conf/wea/MoruzNNW12, author = "Moruz, Gabriel and Negoescu, Andrei and Neumann, Christian and Weichert, Volker", editor = "Klasing, Ralf", biburl = "https://dblp.org/rec/conf/wea/MoruzNNW12.bib", booktitle = "Experimental Algorithms - 11th International Symposium, {SEA} 2012, Bordeaux, France, June 7-9, 2012. Proceedings", doi = "10.1007/978-3-642-30850-5\_28", pages = "320--331", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "Engineering Efficient Paging Algorithms", url = "https://doi.org/10.1007/978-3-642-30850-5\_28", volume = "7276", year = "2012" }

4

Ulrich Meyer, Andrei Negoescu, and Volker Weichert. New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches. In Alberto Marchetti-Spaccamela and Michael Segal, editors, Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings, volume 6595 of Lecture Notes in Computer Science, 217–228. Springer, 2011. View Online doi:10.1007/978-3-642-19754-3_22 @inproceedings{DBLP:conf/tapas/MeyerNW11, author = "Meyer, Ulrich and Negoescu, Andrei and Weichert, Volker", editor = "Marchetti{-}Spaccamela, Alberto and Segal, Michael", biburl = "https://dblp.org/rec/conf/tapas/MeyerNW11.bib", booktitle = "Theory and Practice of Algorithms in (Computer) Systems - First International {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings", doi = "10.1007/978-3-642-19754-3\_22", pages = "217--228", publisher = "Springer", series = "Lecture Notes in Computer Science", title = "New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches", url = "https://doi.org/10.1007/978-3-642-19754-3\_22", volume = "6595", year = "2011" }