default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJop F. Sibeyn
- > Home > Persons > Jop F. Sibeyn
Publications
- 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) - [j3]Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Deterministic Permutation Routing on Meshes. J. Algorithms 22(1): 111-141 (1997) - [c28]Jop F. Sibeyn, Michael Kaufmann:
BSP-Like External-Memory Computation. CIAC 1997: 229-240 - [c25]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice. IPPS 1997: 315-319 - 1995
- [j1]Michael Kaufmann, Heiko Schröder, Jop F. Sibeyn:
Routing and Sorting on Reconfigurable Meshes. Parallel Process. Lett. 5: 81-95 (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 - [c16]Jop F. Sibeyn, Michael Kaufmann:
Solving Cheap Graph Problems an Meshes. MFCS 1995: 412-422 - 1994
- [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 - [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 - 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
- [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
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-04-24 22:58 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:
