The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jop F. Sibeyn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jop F. Sibeyn, Michael Kaufmann
    BSP-Like External-Memory Computation. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:229-240 [Conf]
  2. Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
    Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:75-88 [Conf]
  3. 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]
  4. Jop F. Sibeyn
    Desnakification of Mesh Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:377-390 [Conf]
  5. Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman
    Randomized Routing on Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:333-344 [Conf]
  6. Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn
    Routing on the PADAM: Degrees of Optimality. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:272-279 [Conf]
  7. Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking
    Routing and Communication in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2002, pp:735- [Conf]
  8. Ben H. H. Juurlink, P. S. Rao, Jop F. Sibeyn
    Worm-Hole Gossiping on Meshes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:361-369 [Conf]
  9. Jörg Keller, Jop F. Sibeyn
    Beyond External Computing: Analysis of the Cycle Structure of Permutations. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2001, pp:333-342 [Conf]
  10. Ulrich Meyer, Jop F. Sibeyn
    Gossiping Large Packets on Full-Port Tori. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1998, pp:1040-1046 [Conf]
  11. Peter Sanders, Jop F. Sibeyn
    A Bandwidth Latency Tradeoff for Broadcast and Reduction. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2000, pp:918-926 [Conf]
  12. Jop F. Sibeyn
    Minimizing Global Communication in Parallel List Ranking. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2003, pp:894-902 [Conf]
  13. Jop F. Sibeyn
    List Ranking on Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. I, 1996, pp:799-808 [Conf]
  14. Jop F. Sibeyn
    Sample Sort on Meshes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:389-398 [Conf]
  15. 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]
  16. Jop F. Sibeyn
    Ultimate Parallel List Ranking? [Citation Graph (0, 0)][DBLP]
    HiPC, 1999, pp:197-201 [Conf]
  17. Jop F. Sibeyn
    Faster Gossiping on Butterflies. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:785-796 [Conf]
  18. Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn
    Engineering an External Memory Minimum Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:195-208 [Conf]
  19. Yosi Ben-Asher, Aviad Cohen, Assaf Schuster, Jop F. Sibeyn
    The Impact of Task-Length Parameters on the Performance of the Random Load-Balancing Algorithm. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:82-85 [Conf]
  20. Bogdan S. Chlebus, Jop F. Sibeyn
    Routing on Meshes in Optimum Time and with Really Small Queues. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:56- [Conf]
  21. 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]
  22. Jop F. Sibeyn
    Better Deterministic Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:420-425 [Conf]
  23. Jop F. Sibeyn
    Deterministic Routing and Sorting on Rings. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:406-410 [Conf]
  24. Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel
    Practical Parallel List Ranking. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1997, pp:25-36 [Conf]
  25. Jop F. Sibeyn, Michael Kaufmann
    Solving Cheap Graph Problems an Meshes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:412-422 [Conf]
  26. Jop F. Sibeyn
    Routing on Triangles, Tori and Honeycombs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:529-541 [Conf]
  27. Jop F. Sibeyn
    Routing with Finite Speeds of Memory and Network. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:488-497 [Conf]
  28. Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
    Shorter Queues for Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:597-607 [Conf]
  29. René Beier, Jop F. Sibeyn
    A powerful heuristic for telephone gossiping. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:17-35 [Conf]
  30. Flaminia L. Luccio, Jop F. Sibeyn
    Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:209-220 [Conf]
  31. Jop F. Sibeyn
    Power and Limitations of Optical Reconfigurable Arrays. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:249-265 [Conf]
  32. Michael Kaufmann, Jop F. Sibeyn, Torsten Suel
    Derandomizing Algorithms for Routing and Sorting on Meshes. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:669-679 [Conf]
  33. Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn
    Matching the Bisection Bound for Routing and Sorting on the Mesh. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:31-40 [Conf]
  34. Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
    Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:248-256 [Conf]
  35. Jop F. Sibeyn
    Better Trade-Offs for Parallel List Ranking. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:221-230 [Conf]
  36. 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]
  37. Michael Kaufmann, Jop F. Sibeyn
    Deterministic Routing on Circular Arrays. [Citation Graph (0, 0)][DBLP]
    SPDP, 1992, pp:376-383 [Conf]
  38. Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn
    Deterministic Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:284- [Conf]
  39. Jop F. Sibeyn
    Routing Permutations on MESH Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:94-97 [Conf]
  40. Jop F. Sibeyn
    External Selection. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:291-301 [Conf]
  41. Jop F. Sibeyn, Michael Kaufmann
    Deterministic 1-k Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:237-248 [Conf]
  42. Michael Kaufmann, Jop F. Sibeyn
    Optimal Multi-Packet Routing on the Torus. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:118-129 [Conf]
  43. Jop F. Sibeyn
    External Connected Components. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:468-479 [Conf]
  44. Jop F. Sibeyn
    Solving Fundamental Problems on Sparse-Meshes. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:288-299 [Conf]
  45. Jop F. Sibeyn, Tim J. Harris
    Exploiting Locality in LT-RAM Computations. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:338-349 [Conf]
  46. Jop F. Sibeyn
    List Ranking on Meshes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:7, pp:543-566 [Journal]
  47. Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn
    Routing on Meshes with Buses. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:3, pp:417-444 [Journal]
  48. Michael Kaufmann, Jop F. Sibeyn
    Randomized Multipacket Routing and Sorting on Meshes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:3, pp:224-244 [Journal]
  49. Jop F. Sibeyn
    One-by-One Cleaning for Practical Parallel List Ranking. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:3, pp:345-363 [Journal]
  50. 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]
  51. Jop F. Sibeyn
    List-ranking on interconnection networks. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:181, n:2, pp:75-87 [Journal]
  52. Jop F. Sibeyn
    Routing or Triangles, Tori and Honeycombs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:3, pp:269-287 [Journal]
  53. Peter Sanders, Jop F. Sibeyn
    A bandwidth latency tradeoff for broadcast and reduction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:1, pp:33-38 [Journal]
  54. Jop F. Sibeyn
    External matrix multiplication and all-pairs shortest path. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:2, pp:99-106 [Journal]
  55. 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]
  56. Jop F. Sibeyn
    External selection. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:58, n:2, pp:104-117 [Journal]
  57. Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
    Deterministic Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:111-141 [Journal]
  58. Miltos D. Grammatikakis, D. Frank Hsu, Jop F. Sibeyn
    Packet Routing in Fixed-Connection Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:54, n:2, pp:77-132 [Journal]
  59. Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel
    Practical Parallel List Ranking. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:56, n:2, pp:156-180 [Journal]
  60. Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn
    Routing and Sorting on Reconfigurable Meshes. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:81-95 [Journal]
  61. Jop F. Sibeyn
    Optimal List Ranking on One-Dimensional Arrays. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2002, v:12, n:3-4, pp:375-383 [Journal]
  62. Jop F. Sibeyn, Michal Soch
    Optimal Gossiping on CCCs of Even Dimension. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2003, v:13, n:1, pp:35-42 [Journal]
  63. Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
    Constructive, Deterministic Implementation of Shared Memory on Meshes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:625-648 [Journal]
  64. Jop F. Sibeyn
    Row-Major Sorting on Meshes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:847-863 [Journal]
  65. David Peleg, Jop F. Sibeyn
    Preface: Structural Information and Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:3, pp:329-330 [Journal]
  66. Jop F. Sibeyn
    Faster deterministic sorting through better sampling. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1829-1850 [Journal]
  67. Jop F. Sibeyn
    Faster gossiping on butterfly networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:53-72 [Journal]
  68. Ben H. H. Juurlink, Jop F. Sibeyn, P. S. Rao
    Gossiping on Meshes and Tori. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:6, pp:513-525 [Journal]
  69. Jop F. Sibeyn
    Solving Fundamental Problems on Sparse-Meshes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2000, v:11, n:12, pp:1324-1332 [Journal]
  70. Flaminia L. Luccio, Jop F. Sibeyn
    Feedback vertex sets in mesh-based networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:1, pp:86-101 [Journal]

Search in 0.037secs, Finished in 0.039secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002