受强制性开放获取政策约束的文章 - Ulrich Meyer了解详情
无法在其他位置公开访问的文章：5 篇
Design and engineering of external memory traversal algorithms for general graphs
D Ajwani, U Meyer
Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation …, 2009
强制性开放获取政策： German Research Foundation
An empirical comparison of k-shortest simple path algorithms on multicores
D Ajwani, E Duriakova, N Hurley, U Meyer, A Schickedanz
Proceedings of the 47th International Conference on Parallel Processing, 1-12, 2018
强制性开放获取政策： German Research Foundation, Science Foundation Ireland
Via detours to I/O-efficient shortest paths
U Meyer
Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of …, 2009
强制性开放获取政策： German Research Foundation
New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches
U Meyer, A Negoescu, V Weichert
International Conference on Theory and Practice of Algorithms in (Computer …, 2011
强制性开放获取政策： German Research Foundation
Large-scale graph generation: Recent results of the SPP 1736–Part II
U Meyer, M Penschuck
it-Information Technology 62 (3-4), 135-144, 2020
强制性开放获取政策： German Research Foundation
可在其他位置公开访问的文章：35 篇
Communication-free massively distributed graph generation
D Funke, S Lamm, U Meyer, M Penschuck, P Sanders, C Schulz, D Strash, ...
Journal of Parallel and Distributed Computing 131, 200-217, 2019
强制性开放获取政策： German Research Foundation, European Commission, Federal Ministry of …
From big data to big artificial intelligence? Algorithmic challenges and opportunities of big data
K Kersting, U Meyer
KI-Künstliche Intelligenz 32, 3-8, 2018
强制性开放获取政策： German Research Foundation
A computational study of external-memory BFS algorithms
D Ajwani, R Dementiev, U Meyer
SODA'06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
强制性开放获取政策： German Research Foundation
Characterizing the performance of flash memory storage devices and its impact on algorithm design
D Ajwani, I Malinger, U Meyer, S Toledo
Experimental Algorithms: 7th International Workshop, WEA 2008 Provincetown …, 2008
强制性开放获取政策： German Research Foundation
Improved external memory BFS implementations
D Ajwani, U Meyer, V Osipov
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007
强制性开放获取政策： German Research Foundation
Energy-efficient sorting using solid state disks
A Beckmann, U Meyer, P Sanders, J Singler
Sustainable Computing: Informatics and Systems 1 (2), 151-163, 2011
强制性开放获取政策： German Research Foundation
Design and implementation of a practical i/o-efficient shortest paths algorithm
U Meyer, V Osipov
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009
强制性开放获取政策： German Research Foundation
On computational models for flash memory devices
D Ajwani, A Beckmann, R Jacob, U Meyer, G Moruz
Experimental Algorithms: 8th International Symposium, SEA 2009, Dortmund …, 2009
强制性开放获取政策： German Research Foundation
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
M Hamann, U Meyer, M Penschuck, H Tran, D Wagner
Journal of Experimental Algorithmics (JEA) 23, 1-33, 2018
强制性开放获取政策： German Research Foundation
I/O-efficient undirected shortest paths with unbounded edge lengths
U Meyer, N Zeh
European Symposium on Algorithms, 540-551, 2006
强制性开放获取政策： German Research Foundation
An Algorithm for Online Topological Ordering
D Ajwani, T Friedrich, U Meyer
Scandinavian Workshop on Algorithm Theory, 53-64, 2006
强制性开放获取政策： German Research Foundation
GPU multisplit
S Ashkiani, A Davidson, U Meyer, JD Owens
ACM Sigplan Notices 51 (8), 1-13, 2016
强制性开放获取政策： US National Science Foundation, German Research Foundation
Generating massive scale-free networks under resource constraints
U Meyer, M Penschuck
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and …, 2016
强制性开放获取政策： German Research Foundation, Danish National Research Foundation
Recent advances in scalable network generation
M Penschuck, U Brandes, M Hamann, S Lamm, U Meyer, I Safro, ...
Massive graph analytics, 333-376, 2022
强制性开放获取政策： German Research Foundation, European Commission
GPU Multisplit: an extended study of a parallel algorithm
S Ashkiani, A Davidson, U Meyer, JD Owens
ACM Transactions on Parallel Computing (TOPC) 4 (1), 1-44, 2017
强制性开放获取政策： US National Science Foundation, German Research Foundation
出版信息和资助信息由计算机程序自动确定