Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Parallel Shortest Path Algorithms for Solving Large-Scale Instances.

K. Madduri, D. Bader, J. Berry, and J. Crobak. The Shortest Path Problem, volume 74 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 249-290. DIMACS/AMS, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jonathan Körber University of Stuttgart

Replication Data for "Fluorescence enhancement of single V2 centers in a 4H-SiC cavity antenna"J. Körber, and J. Heiler. Dataset, (2024)Related to: J. Körber, J. Heiler et al., Fluorescence enhancement of single V2 centers in a 4H-SiC cavity antenna (preprint). arXiv: 2406.08208.

Jonathan Böhm University of Stuttgart

Jonathan Eck University of Stuttgart

Jonathan Villing University of Stuttgart

Jonathan Stober University of Stuttgart

Other publications of authors with the same name

Optimizing for KNL Usage Modes When Data Doesn't Fit in MCDRAM.N. Butcher, S. Olivier, J. Berry, S. Hammond, and P. Kogge. ICPP, page 37:1-37:10. ACM, (2018)Software and Algorithms for Graph Queries on Multithreaded Architectures.J. Berry, B. Hendrickson, S. Kahan, and P. Konecny. IPDPS, page 1-14. IEEE, (2007)Limited-Memory Techniques for Sensor Placement in Water Distribution Networks.W. Hart, J. Berry, E. Boman, C. Phillips, L. Riesen, and J. Watson. LION, volume 5313 of Lecture Notes in Computer Science, page 125-137. Springer, (2007)Realizing parallelism in database operations: insights from a massively multithreaded architecture.J. Cieslewicz, J. Berry, B. Hendrickson, and K. Ross. DaMoN, page 4. ACM, (2006)Considerations for Future Designers of General Purpose Graph Software.J. Berry. Graphs and Discovery, volume 69 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 1-6. DIMACS/AMS, (2001)Parallel Shortest Path Algorithms for Solving Large-Scale Instances.K. Madduri, D. Bader, J. Berry, and J. Crobak. The Shortest Path Problem, volume 74 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 249-290. DIMACS/AMS, (2006)Finding Median Set of Tree Structures in Synchronous Distributed Systems.J. Berry, D. Hrozencik, S. Rao, and Z. Shen. Computers and Their Applications, page 7-12. ISCA, (2005)Path Optimization for Graph Partitioning Problems.J. Berry, and M. Goldberg. Discrete Applied Mathematics, 90 (1-3): 27-50 (1999)Challenges in streaming graph analysis.J. Berry, M. Oster, C. Phillips, and S. Plimpton. MILCOM, page 1338. IEEE, (2011)Finding Central Sets of Tree Structures in Synchronous Distributed Systems.J. Berry, D. Hrozencik, S. Rao, and Z. Shen. ISCA PDCS, page 201-208. ISCA, (2004)