Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Shany Infanto
Claudia Calabrese
Miodrag Kapetanovic
María de Lourdes Martínez-Villaseñor
Hao Mao
Peter Malec
Giovanni Venturelli
Chen Ma
Radu Timofte
Kuanrui Yin
Home
/
Author
/
ELENA STÖHR
Author Info
Open Visualization
Name
Affiliation
Papers
ELENA STÖHR
Univ Manchester, Dept Comp Sci, Oxford Rd, Manchester M13 9PL, Lancs, England
16
Collaborators
Citations
PageRank
29
64
9.52
Referers
Referees
References
120
236
128
Search Limit
100
236
Publications (16 rows)
Collaborators (29 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Compile Time Barrier Synchronization Minimization
6
0.63
2002
Circular-arc graph coloring: On chords and circuits in the meeting graph
3
0.40
2002
Exact Distributed Invalidation
2
0.39
2000
OCEANS - Optimising Compilers for Embedded Applications
3
0.39
1999
First fast sink: a compiler algorithm for barrier placement optimisation
1
0.36
1998
OCEANS: Optimizing Compilers for Embedded Applications
17
2.00
1997
Barrier Synchronisation Optimisation
2
0.42
1997
A graph based approach to barrier synchronisation minimisation
6
0.65
1997
Dissemination of Information in Vertex-Disjoint Paths Mode
9
0.62
1996
Gossiping in Vertex-Disjoint Path Mode in Interconnection Networks
4
0.58
1993
Broadcasting in the butterfly network
4
0.64
1991
On the Broadcast Time of the Butterfly network
2
0.54
1991
The pagewidth of trivalent planar graphs
2
0.62
1991
Optimal book embeddings of depth-k Kn-cylinders
0
0.34
1990
A trade-off between page number and page width of book embeddings of graphs
3
0.61
1988
A Tradeoff Between Pagenumber and Width of Book Embedding of Graphs
0
0.34
1987
1