default search action
Elena Stöhr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2003
- [j11]Michael F. P. O'Boyle, Rupert W. Ford, Elena A. Stöhr:
Towards general and exact distributed invalidation. J. Parallel Distributed Comput. 63(11): 1123-1137 (2003) - 2002
- [j10]Dominique de Werra, Christine Eisenbeis, Sylvain Lelait, Elena Stöhr:
Circular-arc graph coloring: On chords and circuits in the meeting graph. Eur. J. Oper. Res. 136(3): 483-500 (2002) - [j9]Michael F. P. O'Boyle, Elena Stöhr:
Compile Time Barrier Synchronization Minimization. IEEE Trans. Parallel Distributed Syst. 13(6): 529-543 (2002) - 2000
- [c11]Rupert W. Ford, Michael F. P. O'Boyle, Elena Stöhr:
Exact Distributed Invalidation. Euro-Par 2000: 395-404
1990 – 1999
- 1999
- [c10]Michel Barreteau, François Bodin, Zbigniew Chamski, Henri-Pierre Charles
, Christine Eisenbeis, John R. Gurd, Jan Hoogerbrugge, Ping Hu, William Jalby, Toru Kisuki, Peter M. W. Knijnenburg, Paul van der Mark, Andy Nisbet, Michael F. P. O'Boyle, Erven Rohou, André Seznec, Elena Stöhr, Menno Treffers, Harry A. G. Wijshoff:
OCEANS - Optimising Compilers for Embedded Applications. Euro-Par 1999: 1171-1175 - 1998
- [j8]Elena A. Stöhr, Michael F. P. O'Boyle:
First Fast Sink: A compiler algorithm for barrier placement optimisation. Future Gener. Comput. Syst. 13(4-5): 397-406 (1998) - [c9]Michel Barreteau, François Bodin, Peter Brinkhaus, Zbigniew Chamski, Henri-Pierre Charles
OCEANS: Optimising Compilers for Embedded Applications. Euro-Par 1998: 1123-1130 - 1997
- [c8]Bas Aarts, Michel Barreteau, François Bodin, Peter Brinkhaus, Zbigniew Chamski, Henri-Pierre Charles
OCEANS: Optimizing Compilers for Embedded Applications. Euro-Par 1997: 1351-1356 - [c7]Elena Stöhr, Michael F. P. O'Boyle:
Barrier Synchronisation Optimisation. HPCN Europe 1997: 791-800 - [c6]Elena Stöhr, Michael F. P. O'Boyle:
A Graph Based Approach to Barrier Synchronisation Minimisation. International Conference on Supercomputing 1997: 156-163 - 1996
- [j7]Juraj Hromkovic, Ralf Klasing, Elena Stöhr:
Dissemination of Information in Vertex-Disjoint Paths Mode. Comput. Artif. Intell. 15(4): 295-318 (1996) - 1995
- [j6]Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener:
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. Inf. Comput. 123(1): 17-28 (1995) - 1994
- [j5]Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr:
Broadcasting in Butterfly and deBruijn Networks. Discret. Appl. Math. 53(1-3): 183-197 (1994) - 1993
- [c5]Juraj Hromkovic, Ralf Klasing, Elena Stöhr, Hubert Wagener:
Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs. ESA 1993: 200-211 - [c4]Juraj Hromkovic, Ralf Klasing, Elena Stöhr:
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks. WG 1993: 288-300 - 1992
- [c3]Ralf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr:
Broadcasting in Butterfly and DeBruijn Networks. STACS 1992: 351-362 - 1991
- [j4]Elena Stöhr:
The pagewidth of trivalent planar graphs. Discret. Math. 89(1): 43-49 (1991) - [j3]Elena Stöhr:
Broadcasting in the Butterfly Network. Inf. Process. Lett. 39(1): 41-43 (1991) - [c2]Elena Stöhr:
On the Broadcast Time of the Butterfly network. WG 1991: 226-229 - 1990
- [j2]Elena Stöhr:
Optimal Book Embeddings of Depth-k Kn-cylinders. J. Inf. Process. Cybern. 26(10): 525-536 (1990)
1980 – 1989
- 1988
- [j1]Elena Stöhr:
A Trade-off between Page Number and Page Width of Book Embeddings of Graphs. Inf. Comput. 79(2): 155-162 (1988) - 1987
- [c1]Elena Stöhr:
A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs. FCT 1987: 420-423
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-04-24 22:45 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: