Researcher Portfolio

 
   

Dr. Sibeyn, Jop

Algorithms and Complexity, MPI for Informatics, Max Planck Society  

 

Researcher Profile

 
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons45478

External references

 
WorldCat Search for Sibeyn, Jop
Google Scholar Search for Sibeyn, Jop

Publications

 
  (1 - 25 of 32)
 : Sanders, P. (2003). Memory hierarchies - models and lower bounds. In U. Meyer, P. Sanders, & J. Sibeyn (Eds.), Algorithms for memory hierarchies (pp. 1-10). Berlin, Germany: Springer. [PubMan] : Kärkkäinen, J., & Rao, S. S. (2003). Full-Text Indexes in External Memory. In U. Meyer, P. Sanders, & J. Sibeyn (Eds.), Algorithms for Memory Hierarchies (pp. 149-170). Berlin, Germany: Springer. [PubMan] : Katriel, I., & Meyer, U. (2003). Elementary Graph Algorithms in External Memory. In U. Meyer, P. Sanders, & J. Sibeyn (Eds.), Algorithms for Memory Hierarchies (pp. 62-84). Berlin, Germany: Springer. [PubMan] : Beier, R., & Sibeyn, J.(2000). A powerful heuristic for telephone gossiping (MPI-I-2000-1-002). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sibeyn, J. (1999). Effiziente parallele Algorithmen. Habilitation Thesis, Universität des Saarlandes, Saarbrücken. [PubMan] : Sibeyn, J.(1999). Ultimate parallel list ranking? (MPI-I-1999-1-005). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Meyer, U., & Sibeyn, J.(1998). Time-independent gossiping on full-port tori (MPI-I-1998-1-014). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sibeyn, J., & Kaufmann, M.(1997). BSP-like external-memory computation (MPI-I-1997-1-001). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sibeyn, J., Kaufmann, M., & Chlebus, B. S. (1997). Deterministic Permutation Routing on Meshes. Journal of Algorithms, 22(1), 111-141. doi:10.1006/jagm.1995.0804. [PubMan] : Sibeyn, J.(1997). From parallel to external list ranking (MPI-I-1997-1-021). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sibeyn, J., & Kaufmann, M. (1997). BSP-like External-memory Computation. In G. Bongiovanni, D. P. Bovet, & G. Di Battista (Eds.), Algorithms and Complexity (pp. 229-240). Berlin: Springer. [PubMan] : Sibeyn, J. (1997). Routing with Finite Speeds of Memory and Network. In I. Prívara, & P. Ruzicka (Eds.), Mathematical Foundations of Computer Science 1997 (pp. 488-497). Berlin: Springer. [PubMan] : Sibeyn, J. (1997). Sample Sort on Meshes. In C. Lengauer, M. Griebl, & S. Gorlatch (Eds.), Euro-Par'97 Parallel Processing (pp. 389-398). Berlin: Springer. [PubMan] : Sibeyn, J. (1996). Routing on Triangles, Tori and Honeycombs. In W. Penczek, & A. Szalas (Eds.), Mathematical Foundations of Computer Science 1996 (pp. 529-541). Berlin: Springer. [PubMan] : Sibeyn, J. F., Rao, P. S., & Juurlink, B. H. H.(1996). Gossiping on meshes and tori (MPI-I-1996-1-018). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Kaufmann, M., Schröder, H., & Sibeyn, J. (1995). Routing and Sorting on Reconfigurable Meshes. Parallel Processing Letters, 5(1), 81-95. doi:10.1142/S0129626495000084. [PubMan] : Sibeyn, J. F.(1995). Overview of mesh results (MPI-I-1995-1-018). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sibeyn, J. F.(1995). Sample sort on meshes (MPI-I-1995-1-012). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sibeyn, J. F.(1994). Desnakification of mesh sorting algorithms (MPI-I-94-102). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Sibeyn, J. (1994). Deterministic Routing and Sorting on Rings. In H. J. Siegel (Ed.), Proceedings of the 8th International Parallel Processing Symposium (pp. 406-410). Los Alamitos, CA, USA: IEEE. [PubMan] : Kaufmann, M., Sibeyn, J., & Suel, T. (1994). Derandomizing Algorithms for Routing and Sorting on Meshes. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 669-679). New York, USA: ACM / SIAM. [PubMan] : Sibeyn, J., Chlebus, B. S., & Kaufmann, M. (1994). Shorter Queues for Permutation Routing on Meshes. In I. Prívara, B. Rovan, & P. Ruzicka (Eds.), Mathematical Foundations of Computer Science 1994 (pp. 597-607). Berlin: Springer. [PubMan] : Sibeyn, J., & Kaufmann, M. (1994). Deterministic 1 -k Routing on Meshes with Applications to Worm-hole Routing. In P. Enjalbert, E. W. Mayr, & K. W. Wagner (Eds.), STACS 94 (pp. 237-248). Berlin, Germany: Springer. [PubMan] : Pietracaprina, A., Pucci, G., & Sibeyn, J. (1994). Constructive Deterministic PRAM Simulation on a Mesh-connected Computer. In Proceedings of the 6th Symposium on Parallel Algorithms and Architectures (pp. 248-256). New York, NY: ACM. [PubMan] : Sibeyn, J. (1994). Desnakification of Mesh Sorting Algorithms. In J. van Leeuwen (Ed.), Algorithms - ESA '94 (pp. 377-390). Berlin: Springer. [PubMan]