default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJop F. Sibeyn
Person information
- affiliation: Martin Luther University of Halle-Wittenberg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2007
[j27]Flaminia L. Luccio
, Jop F. Sibeyn:
Feedback vertex sets in mesh-based networks. Theor. Comput. Sci. 383(1): 86-101 (2007)- 2006
- [j26]Jop F. Sibeyn:
External selection. J. Algorithms 58(2): 104-117 (2006) - [j25]Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph. J. Graph Algorithms Appl. 10(2): 219-236 (2006) - 2005
- [j24]Jop F. Sibeyn:
Faster gossiping on butterfly networks. Theor. Comput. Sci. 331(1): 53-72 (2005) - [j23]David Peleg, Jop F. Sibeyn:
Preface: Structural Information and Communication Complexity. Theor. Comput. Sci. 333(3): 329-330 (2005) - 2004
- [j22]Jop F. Sibeyn:
External matrix multiplication and all-pairs shortest path. Inf. Process. Lett. 91(2): 99-106 (2004) - 2003
- [j21]Jop F. Sibeyn:
List-ranking on interconnection networks. Inf. Comput. 181(2): 75-87 (2003) - [j20]Peter Sanders, Jop F. Sibeyn:
A bandwidth latency tradeoff for broadcast and reduction. Inf. Process. Lett. 86(1): 33-38 (2003) - [j19]Jop F. Sibeyn, Michal Soch:
Optimal Gossiping on CCCs of Even Dimension. Parallel Process. Lett. 13(1): 35-42 (2003) - [j18]Jop F. Sibeyn:
Faster deterministic sorting through better sampling. Theor. Comput. Sci. 290(3): 1829-1850 (2003) - 2002
- [j17]Jop F. Sibeyn:
One-by-One Cleaning for Practical Parallel List Ranking. Algorithmica 32(3): 345-363 (2002) - [j16]Ulrich Meyer, Jop F. Sibeyn:
Oblivious Gossiping on Tori. J. Algorithms 42(1): 1-19 (2002) - [j15]Jop F. Sibeyn:
Optimal List Ranking on One-Dimensional Arrays. Parallel Process. Lett. 12(3-4): 375-383 (2002) - 2000
- [j14]Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn:
Constructive, Deterministic Implementation of Shared Memory on Meshes. SIAM J. Comput. 30(2): 625-648 (2000) - [j13]Jop F. Sibeyn:
Solving Fundamental Problems on Sparse-Meshes. IEEE Trans. Parallel Distributed Syst. 11(12): 1324-1332 (2000) - 1999
- [j12]Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel:
Practical Parallel List Ranking. J. Parallel Distributed Comput. 56(2): 156-180 (1999) - 1998
- [j11]Jop F. Sibeyn:
List Ranking on Meshes. Acta Informatica 35(7): 543-566 (1998) - [j10]Miltos D. Grammatikakis, D. Frank Hsu, Jop F. Sibeyn:
Packet Routing in Fixed-Connection Networks: A Survey. J. Parallel Distributed Comput. 54(2): 77-132 (1998) - [j9]Jop F. Sibeyn:
Row-Major Sorting on Meshes. SIAM J. Comput. 28(3): 847-863 (1998) - [j8]Ben H. H. Juurlink, Jop F. Sibeyn, P. S. Rao:
Gossiping on Meshes and Tori. IEEE Trans. Parallel Distributed Syst. 9(6): 513-525 (1998) - 1997
- [j7]Michael Kaufmann, Jop F. Sibeyn:
Randomized Multipacket Routing and Sorting on Meshes. Algorithmica 17(3): 224-244 (1997) - [j6]Michael Kaufmann, Rajeev Raman, Jop F. Sibeyn:
Routing on Meshes with Buses. Algorithmica 18(3): 417-444 (1997) - [j5]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice. Comput. Artif. Intell. 16(2): 107-140 (1997) - [j4]Jop F. Sibeyn:
Routing or Triangles, Tori and Honeycombs. Int. J. Found. Comput. Sci. 8(3): 269-287 (1997) - [j3]Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Deterministic Permutation Routing on Meshes. J. Algorithms 22(1): 111-141 (1997) - 1995
- [j2]Yosi Ben-Asher, Assaf Schuster, Jop F. Sibeyn:
Load Balancing: a Programmer's Approach or the Impact of Task-Length Parameters on the Load Balancing Performance of Parallel Programs. Int. J. High Speed Comput. 7(2): 303-325 (1995) - [j1]Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn:
Routing and Sorting on Reconfigurable Meshes. Parallel Process. Lett. 5: 81-95 (1995)
Conference and Workshop Papers
- 2004
- [c46]Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn:
Engineering an External Memory Minimum Spanning Tree Algorithm. IFIP TCS 2004: 195-208 - [c45]Flaminia L. Luccio, Jop F. Sibeyn:
Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks. SIROCCO 2004: 209-220 - [c44]Jop F. Sibeyn:
External Connected Components. SWAT 2004: 468-479 - 2003
- [c43]Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph. ESA 2003: 703-714 - [c42]Jop F. Sibeyn:
Minimizing Global Communication in Parallel List Ranking. Euro-Par 2003: 894-902 - [c41]Bogdan S. Chlebus, Jop F. Sibeyn:
Routing on Meshes in Optimum Time and with Really Small Queues. IPDPS 2003: 56 - 2002
- [c40]Michele Flammini, Bruce M. Maggs, Jop F. Sibeyn, Berthold Vöcking:
Routing and Communication in Interconnection Networks. Euro-Par 2002: 735 - [c39]Jop F. Sibeyn, James Abello, Ulrich Meyer:
Heuristics for semi-external depth first search on directed graphs. SPAA 2002: 282-292 - 2001
- [c38]Jörg Keller, Jop F. Sibeyn:
Beyond External Computing: Analysis of the Cycle Structure of Permutations. Euro-Par 2001: 333-342 - [c37]Jop F. Sibeyn:
Faster Gossiping on Butterflies. ICALP 2001: 785-796 - 2000
- [c36]Peter Sanders, Jop F. Sibeyn:
A Bandwidth Latency Tradeoff for Broadcast and Reduction. Euro-Par 2000: 918-926 - [c35]René Beier, Jop F. Sibeyn:
A powerful heuristic for telephone gossiping. SIROCCO 2000: 17-35 - 1999
- [c34]Jop F. Sibeyn:
Ultimate Parallel List Ranking? HiPC 1999: 197-201 - [c33]Jop F. Sibeyn:
Better Deterministic Routing on Meshes. IPPS/SPDP 1999: 420-425 - [c32]Jop F. Sibeyn:
Power and Limitations of Optical Reconfigurable Arrays. SIROCCO 1999: 249-265 - [c31]Jop F. Sibeyn:
External Selection. STACS 1999: 291-301 - 1998
- [c30]Ulrich Meyer, Jop F. Sibeyn:
Gossiping Large Packets on Full-Port Tori. Euro-Par 1998: 1040-1046 - [c29]Jop F. Sibeyn:
Solving Fundamental Problems on Sparse-Meshes. SWAT 1998: 288-299 - 1997
- [c28]Jop F. Sibeyn, Michael Kaufmann:
BSP-Like External-Memory Computation. CIAC 1997: 229-240 - [c27]Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn:
Routing on the PADAM: Degrees of Optimality. Euro-Par 1997: 272-279 - [c26]Jop F. Sibeyn:
Sample Sort on Meshes. Euro-Par 1997: 389-398 - [c25]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice. IPPS 1997: 315-319 - [c24]Jop F. Sibeyn, Frank Guillaume, Tillmann Seidel:
Practical Parallel List Ranking. IRREGULAR 1997: 25-36 - [c23]Jop F. Sibeyn:
Routing with Finite Speeds of Memory and Network. MFCS 1997: 488-497 - [c22]Jop F. Sibeyn:
Better Trade-Offs for Parallel List Ranking. SPAA 1997: 221-230 - 1996
- [c21]Ben H. H. Juurlink, P. S. Rao, Jop F. Sibeyn:
Worm-Hole Gossiping on Meshes. Euro-Par, Vol. I 1996: 361-369 - [c20]Jop F. Sibeyn:
List Ranking on Interconnection Networks. Euro-Par, Vol. I 1996: 799-808 - [c19]Jop F. Sibeyn:
Routing on Triangles, Tori and Honeycombs. MFCS 1996: 529-541 - 1995
- [c18]Michael Kaufmann, Jop F. Sibeyn, Torsten Suel:
Beyond the Worst-Case Bisection Bound: Fast Sorting and Ranking on Meshes. ESA 1995: 75-88 - [c17]Ulrich Meyer, Jop F. Sibeyn:
Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator. EUROSIM 1995: 285-290 - [c16]Jop F. Sibeyn, Michael Kaufmann:
Solving Cheap Graph Problems an Meshes. MFCS 1995: 412-422 - 1994
- [c15]Jop F. Sibeyn:
Desnakification of Mesh Sorting Algorithms. ESA 1994: 377-390 - [c14]Jop F. Sibeyn:
Deterministic Routing and Sorting on Rings. IPPS 1994: 406-410 - [c13]Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Shorter Queues for Permutation Routing on Meshes. MFCS 1994: 597-607 - [c12]Michael Kaufmann, Jop F. Sibeyn, Torsten Suel:
Derandomizing Algorithms for Routing and Sorting on Meshes. SODA 1994: 669-679 - [c11]Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn:
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. SPAA 1994: 248-256 - [c10]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Towards practical permutation routing on meshes. SPDP 1994: 664-671 - [c9]Jop F. Sibeyn, Michael Kaufmann:
Deterministic 1-k Routing on Meshes. STACS 1994: 237-248 - [c8]Jop F. Sibeyn, Tim J. Harris:
Exploiting Locality in LT-RAM Computations. SWAT 1994: 338-349 - 1993
- [c7]Jop F. Sibeyn, Michael Kaufmann, Rajeev Raman:
Randomized Routing on Meshes with Buses. ESA 1993: 333-344 - [c6]Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn:
Deterministic Permutation Routing on Meshes. SPDP 1993: 284 - 1992
- [c5]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. IPPS 1992: 82-85 - [c4]Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. Sibeyn:
Matching the Bisection Bound for Routing and Sorting on the Mesh. SPAA 1992: 31-40 - [c3]Michael Kaufmann, Jop F. Sibeyn:
Deterministic Routing on Circular Arrays. SPDP 1992: 376-383 - [c2]Michael Kaufmann, Jop F. Sibeyn:
Optimal Multi-Packet Routing on the Torus. SWAT 1992: 118-129 - 1990
- [c1]Jop F. Sibeyn:
Routing Permutations on MESH Interconnection Networks. SPDP 1990: 94-97
Editorship
- 2003
- [e2]Ulrich Meyer, Peter Sanders, Jop F. Sibeyn:
Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]. Lecture Notes in Computer Science 2625, Springer 2003, ISBN 3-540-00883-7 [contents] - [e1]Jop F. Sibeyn:
SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, June 18-20, 2003, Umeå Sweden. Proceedings in Informatics 17, Carleton Scientific 2003, ISBN 1-894145-16-X [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
