The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ulrich Meyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ulrich Meyer, Christoph Runte, Dieter Dirksen, T. Stamm, T. Fillies, Ulrich Joos, Hans-Peter Wiesmann
    Image-based biomimetric approach to design and fabrication of tissue engineered bone. [Citation Graph (0, 0)][DBLP]
    CARS, 2003, pp:726-732 [Conf]
  2. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
    Randomized External-Memory Algorithms for Some Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:259-268 [Conf]
  3. Irit Katriel, Ulrich Meyer
    Elementary Graph Algorithms in External Memory. [Citation Graph (0, 0)][DBLP]
    Algorithms for Memory Hierarchies, 2002, pp:62-84 [Conf]
  4. Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
    Algorithms and Experiments for the Webgraph. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:703-714 [Conf]
  5. Kurt Mehlhorn, Ulrich Meyer
    External-Memory Breadth-First Search with Sublinear I/O. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:723-735 [Conf]
  6. Ulrich Meyer, Peter Sanders
    Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:393-404 [Conf]
  7. Ulrich Meyer, Norbert Zeh
    I/O-Efficient Undirected Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:434-445 [Conf]
  8. Ulrich Meyer, Norbert Zeh
    I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:540-551 [Conf]
  9. Ulrich Meyer
    Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2001, pp:343-351 [Conf]
  10. Ulrich Meyer, Peter Sanders
    Parallel Shortest Path for Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:461-470 [Conf]
  11. Ulrich Meyer, Jop F. Sibeyn
    Gossiping Large Packets on Full-Port Tori. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:1040-1046 [Conf]
  12. Ulrich Meyer, Jop F. Sibeyn
    Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator. [Citation Graph (0, 0)][DBLP]
    EUROSIM, 1995, pp:285-290 [Conf]
  13. Lars Arge, Ulrich Meyer, Laura Toma
    External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:146-157 [Conf]
  14. Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
    Matrix Transpose on Meshes: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:315-319 [Conf]
  15. Ulrich Meyer
    Buckets Strike Back: Improved Parallel Shortest Paths. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  16. Stefan Edelkamp, Ulrich Meyer
    Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. [Citation Graph (0, 0)][DBLP]
    KI/ÖGAI, 2001, pp:169-184 [Conf]
  17. Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders
    A Parallelization of Dijkstra's Shortest Path Algorithm. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:722-731 [Conf]
  18. Deepak Ajwani, Roman Dementiev, Ulrich Meyer
    A computational study of external-memory BFS algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:601-610 [Conf]
  19. Ulrich Meyer
    External memory BFS on undirected graphs with bounded degree. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:87-88 [Conf]
  20. Ulrich Meyer
    Single-source shortest-paths on arbitrary directed graphs in linear average-case time. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:797-806 [Conf]
  21. Jop F. Sibeyn, James Abello, Ulrich Meyer
    Heuristics for semi-external depth first search on directed graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:282-292 [Conf]
  22. Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
    An O(n2.75) Algorithm for Online Topological Ordering. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:53-64 [Conf]
  23. Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
    Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:480-492 [Conf]
  24. Ulrich Meyer, Thomas Schmidt
    Konzeption und Implementierung eines Expertensystems im Bereich des städtebaulichen Lärmschutzes. [Citation Graph (0, 0)][DBLP]
    Informatik für den Umweltschutz, 1991, pp:596-605 [Conf]
  25. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
    On External-Memory Planar Depth First Search. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:471-482 [Conf]
  26. Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
    An Experimental Study of Priority Queues in External Memory. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 1999, pp:346-360 [Conf]
  27. Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
    Matrix Transpose on Meshes: Theory and Practice. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1997, v:16, n:2, pp:- [Journal]
  28. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
    Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:3, pp:305-337 [Journal]
  29. Ulrich Meyer
    Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:91-134 [Journal]
  30. Ulrich Meyer, Jop F. Sibeyn
    Oblivious Gossiping on Tori. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:42, n:1, pp:1-19 [Journal]
  31. Ulrich Meyer, Peter Sanders
    [Delta]-stepping: a parallelizable shortest path algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:49, n:1, pp:114-152 [Journal]
  32. Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
    An Experimental Study of Priority Queues in External Memory. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:17- [Journal]
  33. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
    On External-Memory Planar Depth First Search. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:2, pp:105-129 [Journal]
  34. Ulrich Meyer
    Philosophische Grundlagen des Intentionalitätsbegriffs in der VKI und Möglichkeiten seiner Modellierung. [Citation Graph (0, 0)][DBLP]
    KI, 1995, v:9, n:2, pp:14-19 [Journal]
  35. Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal
    A simple improved distributed algorithm for minimum CDS in unit disk graphs. [Citation Graph (0, 0)][DBLP]
    TOSN, 2006, v:2, n:3, pp:444-453 [Journal]
  36. Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
    Improved External Memory BFS Implementation. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  37. Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
    An O(n2.75) algorithm for online topological ordering [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  38. Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. [Citation Graph (, )][DBLP]


  39. Via Detours to I/O-Efficient Shortest Paths. [Citation Graph (, )][DBLP]


  40. Design and Engineering of External Memory Traversal Algorithms for General Graphs. [Citation Graph (, )][DBLP]


  41. On Dynamic Breadth-First Search in External-Memory. [Citation Graph (, )][DBLP]


  42. On Trade-Offs in External-Memory Diameter-Approximation. [Citation Graph (, )][DBLP]


  43. Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. [Citation Graph (, )][DBLP]


  44. On Computational Models for Flash Memory Devices. [Citation Graph (, )][DBLP]


  45. On Dynamic Breadth-First Search in External-Memory [Citation Graph (, )][DBLP]


Search in 0.028secs, Finished in 0.030secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002