default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlf-Peter Schroeder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Ulf-Peter Schroeder:
Scientific colloquium in honor of former EATCS President Burkhard Monien on the occasion of his 80th birthday. Bull. EATCS 140 (2023)
2010 – 2019
- 2010
- [j6]Burkhard Monien, Ulf-Peter Schroeder:
Preface. Theory Comput. Syst. 47(1): 1-2 (2010)
2000 – 2009
- 2008
- [e1]Burkhard Monien, Ulf-Peter Schroeder:
Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings. Lecture Notes in Computer Science 4997, Springer 2008, ISBN 978-3-540-79308-3 [contents] - 2001
- [j5]Markus Röttger, Ulf-Peter Schroeder:
Efficient embeddings of grids into grids. Discret. Appl. Math. 108(1-2): 143-173 (2001) - 2000
- [b1]Ulf-Peter Schroeder:
Graph-Einbettungen unter besonderer Berücksichtigung von Gitternetzwerken. Paderborn University, Germany, 2000 - [j4]Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder:
The congestion of n-cube layout on a rectangular grid. Discret. Math. 213(1-3): 13-19 (2000)
1990 – 1999
- 1999
- [j3]Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On k-partitioning of Hamming Graphs. Discret. Appl. Math. 95(1-3): 127-140 (1999) - [c7]Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On Bounds for the k-Partitioning of Graphs. COCOON 1999: 154-163 - 1998
- [j2]Sergei L. Bezrukov, Ulf-Peter Schroeder:
The Cyclic Wirelength of Trees. Discret. Appl. Math. 87(1-3): 275-277 (1998) - [j1]Markus Röttger, Ulf-Peter Schroeder:
Embedding 2-Dimensional Grids into Optimal Hypercubes with Edge-Congestion 1 or 2. Parallel Process. Lett. 8(2): 231-242 (1998) - [c6]Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder:
Embedding of Hypercubes into Grids. MFCS 1998: 693-701 - [c5]Markus Röttger, Ulf-Peter Schroeder:
Efficient Embeddings of Grids into Grids. WG 1998: 257-271 - 1997
- [c4]Fabrizio d'Amore, Luca Becchetti
, Sergei L. Bezrukov, Alberto Marchetti-Spaccamela, M. Ottaviani, Robert Preis, Markus Röttger, Ulf-Peter Schroeder:
On the Embedding of Refinements of 2-dimensional Grids. Euro-Par 1997: 950-957 - 1995
- [c3]Thomas Römke, Markus Röttger, Ulf-Peter Schroeder, Jens Simon:
On Efficient Embeddings of Grids into Grids in PARIX. Euro-Par 1995: 181-192 - [c2]Markus Röttger, Ulf-Peter Schroeder, Jens Simon:
Implementation of a parallel and distributed mapping kernel for PARIX. HPCN Europe 1995: 781-786 - [p1]Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder:
Efficient Use of Parallel & Distributed Systems: From Theory to Practice. Computer Science Today 1995: 62-77 - 1994
- [c1]Markus Röttger, Ulf-Peter Schroeder, Walter Unger:
Embedding 3-dimensional Grids into Optimal Hypercubes. Canada-France Conference on Parallel and Distributed Computing 1994: 81-94
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-08-05 21:13 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:
