---
_id: '16504'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms:
1-optimal multisearch for an extension of the BSP model. Theoretical Computer
Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6'
apa: 'Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient
parallel algorithms: 1-optimal multisearch for an extension of the BSP model.
Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6'
bibtex: '@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient
parallel algorithms: 1-optimal multisearch for an extension of the BSP model},
DOI={10.1016/s0304-3975(98)00020-6},
journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang
and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide.
“Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of
the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.'
ieee: 'A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel
algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical
Computer Science, pp. 175–203, 1998.'
mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch
for an Extension of the BSP Model.” Theoretical Computer Science, 1998,
pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.'
short: A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science
(1998) 175–203.
date_created: 2020-04-14T12:36:47Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(98)00020-6
language:
- iso: eng
page: 175-203
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: 'Truly efficient parallel algorithms: 1-optimal multisearch for an extension
of the BSP model'
type: journal_article
user_id: '15415'
year: '1998'
...
---
_id: '16562'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Gabriel Terán
full_name: Martinez, Gabriel Terán
last_name: Martinez
citation:
ama: 'Meyer auf der Heide F, Martinez GT. Communication-efficient parallel multiway
and approximate minimum cut computation. In: LATIN’98: Theoretical Informatics.
Berlin, Heidelberg; 1998. doi:10.1007/bfb0054332'
apa: 'Meyer auf der Heide, F., & Martinez, G. T. (1998). Communication-efficient
parallel multiway and approximate minimum cut computation. In LATIN’98: Theoretical
Informatics. Berlin, Heidelberg. https://doi.org/10.1007/bfb0054332'
bibtex: '@inbook{Meyer auf der Heide_Martinez_1998, place={Berlin, Heidelberg},
title={Communication-efficient parallel multiway and approximate minimum cut computation},
DOI={10.1007/bfb0054332}, booktitle={LATIN’98:
Theoretical Informatics}, author={Meyer auf der Heide, Friedhelm and Martinez,
Gabriel Terán}, year={1998} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient
Parallel Multiway and Approximate Minimum Cut Computation.” In LATIN’98: Theoretical
Informatics. Berlin, Heidelberg, 1998. https://doi.org/10.1007/bfb0054332.'
ieee: 'F. Meyer auf der Heide and G. T. Martinez, “Communication-efficient parallel
multiway and approximate minimum cut computation,” in LATIN’98: Theoretical
Informatics, Berlin, Heidelberg, 1998.'
mla: 'Meyer auf der Heide, Friedhelm, and Gabriel Terán Martinez. “Communication-Efficient
Parallel Multiway and Approximate Minimum Cut Computation.” LATIN’98: Theoretical
Informatics, 1998, doi:10.1007/bfb0054332.'
short: 'F. Meyer auf der Heide, G.T. Martinez, in: LATIN’98: Theoretical Informatics,
Berlin, Heidelberg, 1998.'
date_created: 2020-04-15T10:34:15Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bfb0054332
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'LATIN''98: Theoretical Informatics'
publication_identifier:
isbn:
- '9783540642756'
- '9783540697152'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Communication-efficient parallel multiway and approximate minimum cut computation
type: book_chapter
user_id: '15415'
year: '1998'
...
---
_id: '16563'
author:
- first_name: Richard
full_name: Cole, Richard
last_name: Cole
- first_name: Bruce M.
full_name: Maggs, Bruce M.
last_name: Maggs
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Mitzenmacher, Michael
last_name: Mitzenmacher
- first_name: Andréa W.
full_name: Richa, Andréa W.
last_name: Richa
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
- first_name: Ramesh K.
full_name: Sitaraman, Ramesh K.
last_name: Sitaraman
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Cole R, Maggs BM, Meyer auf der Heide F, et al. Randomized protocols for low-congestion
circuit routing in multistage interconnection networks. In: Proceedings of
the Thirtieth Annual ACM Symposium on Theory of Computing - STOC ’98. ; 1998.
doi:10.1145/276698.276790'
apa: Cole, R., Maggs, B. M., Meyer auf der Heide, F., Mitzenmacher, M., Richa, A.
W., Schröder, K., … Vöcking, B. (1998). Randomized protocols for low-congestion
circuit routing in multistage interconnection networks. In Proceedings of the
thirtieth annual ACM symposium on Theory of computing - STOC ’98. https://doi.org/10.1145/276698.276790
bibtex: '@inproceedings{Cole_Maggs_Meyer auf der Heide_Mitzenmacher_Richa_Schröder_Sitaraman_Vöcking_1998,
title={Randomized protocols for low-congestion circuit routing in multistage interconnection
networks}, DOI={10.1145/276698.276790},
booktitle={Proceedings of the thirtieth annual ACM symposium on Theory of computing
- STOC ’98}, author={Cole, Richard and Maggs, Bruce M. and Meyer auf der Heide,
Friedhelm and Mitzenmacher, Michael and Richa, Andréa W. and Schröder, Klaus and
Sitaraman, Ramesh K. and Vöcking, Berthold}, year={1998} }'
chicago: Cole, Richard, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher,
Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, and Berthold Vöcking. “Randomized
Protocols for Low-Congestion Circuit Routing in Multistage Interconnection Networks.”
In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing
- STOC ’98, 1998. https://doi.org/10.1145/276698.276790.
ieee: R. Cole et al., “Randomized protocols for low-congestion circuit routing
in multistage interconnection networks,” in Proceedings of the thirtieth annual
ACM symposium on Theory of computing - STOC ’98, 1998.
mla: Cole, Richard, et al. “Randomized Protocols for Low-Congestion Circuit Routing
in Multistage Interconnection Networks.” Proceedings of the Thirtieth Annual
ACM Symposium on Theory of Computing - STOC ’98, 1998, doi:10.1145/276698.276790.
short: 'R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa,
K. Schröder, R.K. Sitaraman, B. Vöcking, in: Proceedings of the Thirtieth Annual
ACM Symposium on Theory of Computing - STOC ’98, 1998.'
date_created: 2020-04-15T10:38:12Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1145/276698.276790
language:
- iso: eng
publication: Proceedings of the thirtieth annual ACM symposium on Theory of computing -
STOC '98
publication_identifier:
isbn:
- '0897919629'
publication_status: published
status: public
title: Randomized protocols for low-congestion circuit routing in multistage interconnection
networks
type: conference
user_id: '15415'
year: '1998'
...
---
_id: '19631'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
citation:
ama: Bäumker A. Communication Efficient Parallel Searching. Vol 28. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1997.
apa: Bäumker, A. (1997). Communication Efficient Parallel Searching (Vol.
28). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Bäumker_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Communication Efficient Parallel Searching}, volume={28}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Bäumker, Armin}, year={1997},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Bäumker, Armin. Communication Efficient Parallel Searching. Vol.
28. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
ieee: A. Bäumker, Communication Efficient Parallel Searching, vol. 28. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
mla: Bäumker, Armin. Communication Efficient Parallel Searching. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
short: A. Bäumker, Communication Efficient Parallel Searching, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:46:17Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 28'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-27-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Communication Efficient Parallel Searching
type: dissertation
user_id: '5786'
volume: 28
year: '1997'
...
---
_id: '19636'
author:
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
citation:
ama: Dittrich W. Communication and I/O Efficient Parallel Data Structures.
Vol 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1997.
apa: Dittrich, W. (1997). Communication and I/O Efficient Parallel Data Structures
(Vol. 27). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Dittrich_1997, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Communication and I/O Efficient Parallel Data Structures},
volume={27}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Dittrich, Wolfgang}, year={1997}, collection={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn} }'
chicago: Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures.
Vol. 27. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
ieee: W. Dittrich, Communication and I/O Efficient Parallel Data Structures,
vol. 27. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
mla: Dittrich, Wolfgang. Communication and I/O Efficient Parallel Data Structures.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1997.
short: W. Dittrich, Communication and I/O Efficient Parallel Data Structures, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:53:00Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 27'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-26-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Communication and I/O Efficient Parallel Data Structures
type: dissertation
user_id: '5786'
volume: 27
year: '1997'
...
---
_id: '19637'
author:
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
citation:
ama: Strothmann W-B. Bounded Degree Spanning Trees. Vol 35. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1997.
apa: Strothmann, W.-B. (1997). Bounded Degree Spanning Trees (Vol. 35). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Strothmann_1997, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Bounded Degree Spanning Trees}, volume={35}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Strothmann, Willy-Bernhard},
year={1997}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}
}'
chicago: Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Vol.
35. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
ieee: W.-B. Strothmann, Bounded Degree Spanning Trees, vol. 35. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
mla: Strothmann, Willy-Bernhard. Bounded Degree Spanning Trees. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1997.
short: W.-B. Strothmann, Bounded Degree Spanning Trees, Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 1997.
date_created: 2020-09-22T12:57:53Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T12:57:43Z
date_updated: 2020-09-22T12:57:43Z
file_id: '19638'
file_name: pub-hni-468.pdf
file_size: 1172216
relation: main_file
success: 1
file_date_updated: 2020-09-22T12:57:43Z
has_accepted_license: '1'
intvolume: ' 35'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-34-5
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Bounded Degree Spanning Trees
type: dissertation
user_id: '5786'
volume: 35
year: '1997'
...
---
_id: '19869'
abstract:
- lang: eng
text: Given a connected graph $G$, let a $dT$-spanning tree of $G$ be a spanning
tree of $G$ of maximum degree bounded by $dT$. It is well known that for each
$dT ge 2$ the problem of deciding whether a connected graph has a $dT$-spanning
tree is NP-complete. In this paper we investigate this problem when additionally
connectivity and maximum degree of the graph are given. A complete characterization
of this problem for 2- and 3-connected graphs, for planar graphs, and for $dT=2$
is provided. Our first result is that given a biconnected graph of maximum degree
$2dT-2$, we can find its $dT$-spanning tree in time $O(m+n^3/2)$. For graphs of
higher connectivity we design a polynomial-time algorithm that finds a $dT$-spanning
tree in any $k$-connected graph of maximum degree $k(dT-2)+2$. On the other hand,
we prove that deciding whether a $k$-connected graph of maximum degree $k(dT-2)+3$
has a $dT$-spanning tree is NP-complete, provided $k le 3$. For arbitrary $k ge
3$ we show that verifying whether a $k$-connected graph of maximum degree $k(dT-1)$
has a $dT$-spanning tree is NP-complete. In particular, we prove that the Hamiltonian
path (cycle) problem is NP-complete for $k$-connected $k$-regular graphs, if $k>2$.
This extends the well known result for $k=3$ and fully characterizes the case
$dT=2$. For planar graphs it is NP-complete to decide whether a $k$-connected
planar graph of maximum degree $dG$ has a $dT$-spanning tree for $k=1$ and $dG
> dT ge 2$, for $k=2$ and $dG > 2(dT-1) ge 2$, and for $k=3$ and $dG > dT = 2$.
On the other hand, we show how to find in polynomial (linear or almost linear)
time a $dT$-spanning tree for all other parameters of $k$, $dG$, and $dT$.
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
citation:
ama: 'Czumaj A, Strothmann W-B. Bounded degree spanning trees. In: Proceedings
of the Fifth Annual European Symposium on Algorithms (ESA’97). ; 1997. doi:10.1007/3-540-63397-9_9'
apa: Czumaj, A., & Strothmann, W.-B. (1997). Bounded degree spanning trees.
Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97).
https://doi.org/10.1007/3-540-63397-9_9
bibtex: '@inproceedings{Czumaj_Strothmann_1997, title={Bounded degree spanning trees},
DOI={10.1007/3-540-63397-9_9},
booktitle={Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97)},
author={Czumaj, Artur and Strothmann, Willy-Bernhard}, year={1997} }'
chicago: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning
Trees.” In Proceedings of the Fifth Annual European Symposium on Algorithms
(ESA’97), 1997. https://doi.org/10.1007/3-540-63397-9_9.
ieee: 'A. Czumaj and W.-B. Strothmann, “Bounded degree spanning trees,” 1997, doi:
10.1007/3-540-63397-9_9.'
mla: Czumaj, Artur, and Willy-Bernhard Strothmann. “Bounded Degree Spanning Trees.”
Proceedings of the Fifth Annual European Symposium on Algorithms (ESA’97),
1997, doi:10.1007/3-540-63397-9_9.
short: 'A. Czumaj, W.-B. Strothmann, in: Proceedings of the Fifth Annual European
Symposium on Algorithms (ESA’97), 1997.'
date_created: 2020-10-05T07:13:42Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
doi: 10.1007/3-540-63397-9_9
language:
- iso: eng
publication: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97)
publication_identifier:
isbn:
- '9783540633976'
- '9783540695363'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Bounded degree spanning trees
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '18955'
abstract:
- lang: eng
text: In this paper we present a (randomized) algorithm for maintaining the biconnected
components of a dynamic planar graph of $n$ vertices under deletions of edges.
The biconnected components can be maintained under any sequence of edge deletions
in a total of $O(n log n)$ time, with high probability. This gives $O(log n)$
amortized time per edge deletion, which improves previous (deterministic) results
due to Giammarresi and Italiano, where $O(n log^2 n)$ amortized time is needed.
Our work describes a simplification of the data structures from [GiIt96] and uses
dynamic perfect hashing to reduce the running time. As in the paper by Giammarresi
and Italiano, we only need $O(n)$ space. Finally we describe some simply additional
operations on the decremental data structure. By aid of them this the data structure
is applicable for finding efficiently a $Delta$-spanning tree in a biconnected
planar graph with a maximum degree $2Delta-2$ do to Czumaj and Strothmann.
author:
- first_name: Willy-Bernhard
full_name: Strothmann, Willy-Bernhard
last_name: Strothmann
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Strothmann W-B, Lukovszki T. Decremental Biconnectivity on Planar Graphs.
Paderborn; 1997.
apa: Strothmann, W.-B., & Lukovszki, T. (1997). Decremental Biconnectivity
on Planar Graphs. Paderborn.
bibtex: '@book{Strothmann_Lukovszki_1997, place={Paderborn}, title={Decremental
Biconnectivity on Planar Graphs}, author={Strothmann, Willy-Bernhard and Lukovszki,
Tamás}, year={1997} }'
chicago: Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity
on Planar Graphs. Paderborn, 1997.
ieee: W.-B. Strothmann and T. Lukovszki, Decremental Biconnectivity on Planar
Graphs. Paderborn, 1997.
mla: Strothmann, Willy-Bernhard, and Tamás Lukovszki. Decremental Biconnectivity
on Planar Graphs. 1997.
short: W.-B. Strothmann, T. Lukovszki, Decremental Biconnectivity on Planar Graphs,
Paderborn, 1997.
date_created: 2020-09-03T12:59:56Z
date_updated: 2022-01-06T06:53:55Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-03T12:59:44Z
date_updated: 2020-09-03T12:59:44Z
file_id: '18957'
file_name: pub-hni-901.pdf
file_size: 222106
relation: main_file
success: 1
file_date_updated: 2020-09-03T12:59:44Z
has_accepted_license: '1'
language:
- iso: eng
place: Paderborn
status: public
title: Decremental Biconnectivity on Planar Graphs
type: report
user_id: '15415'
year: '1997'
...
---
_id: '18575'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Markus
full_name: Denny, Markus
last_name: Denny
citation:
ama: 'Sohler C, Denny M. Encoding a Triangulation as a Permutation of its Point
Set. In: Proceedings of the 9th Canadian Conference on Computational Geometry.
; 1997:39-43.'
apa: Sohler, C., & Denny, M. (1997). Encoding a Triangulation as a Permutation
of its Point Set. In Proceedings of the 9th Canadian Conference on Computational
Geometry (pp. 39–43).
bibtex: '@inproceedings{Sohler_Denny_1997, title={Encoding a Triangulation as a
Permutation of its Point Set}, booktitle={Proceedings of the 9th Canadian Conference
on Computational Geometry}, author={Sohler, Christian and Denny, Markus}, year={1997},
pages={39–43} }'
chicago: Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation
of Its Point Set.” In Proceedings of the 9th Canadian Conference on Computational
Geometry, 39–43, 1997.
ieee: C. Sohler and M. Denny, “Encoding a Triangulation as a Permutation of its
Point Set,” in Proceedings of the 9th Canadian Conference on Computational
Geometry, 1997, pp. 39–43.
mla: Sohler, Christian, and Markus Denny. “Encoding a Triangulation as a Permutation
of Its Point Set.” Proceedings of the 9th Canadian Conference on Computational
Geometry, 1997, pp. 39–43.
short: 'C. Sohler, M. Denny, in: Proceedings of the 9th Canadian Conference on Computational
Geometry, 1997, pp. 39–43.'
date_created: 2020-08-28T14:14:57Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
language:
- iso: eng
page: 39-43
publication: Proceedings of the 9th Canadian Conference on Computational Geometry
status: public
title: Encoding a Triangulation as a Permutation of its Point Set
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '2175'
author:
- first_name: Stefan
full_name: Bock, Stefan
last_name: Bock
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Bock S, Meyer auf der Heide F, Scheideler C. Optimal Wormhole Routing in the
(n, d)-Torus. In: IPPS. IEEE Computer Society; 1997:326--332.'
apa: Bock, S., Meyer auf der Heide, F., & Scheideler, C. (1997). Optimal Wormhole
Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.
bibtex: '@inproceedings{Bock_Meyer auf der Heide_Scheideler_1997, title={Optimal
Wormhole Routing in the (n, d)-Torus}, booktitle={IPPS}, publisher={IEEE Computer
Society}, author={Bock, Stefan and Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={1997}, pages={326--332} }'
chicago: Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler.
“Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE
Computer Society, 1997.
ieee: S. Bock, F. Meyer auf der Heide, and C. Scheideler, “Optimal Wormhole Routing
in the (n, d)-Torus,” in IPPS, 1997, pp. 326--332.
mla: Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS,
IEEE Computer Society, 1997, pp. 326--332.
short: 'S. Bock, F. Meyer auf der Heide, C. Scheideler, in: IPPS, IEEE Computer
Society, 1997, pp. 326--332.'
date_created: 2018-04-03T09:11:47Z
date_updated: 2022-01-06T06:55:13Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:07:20Z
date_updated: 2018-04-12T07:11:50Z
file_id: '2284'
file_name: IPPS97.pdf
file_size: 88749
relation: main_file
file_date_updated: 2018-04-12T07:11:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 326--332
publication: IPPS
publisher: IEEE Computer Society
status: public
title: Optimal Wormhole Routing in the (n, d)-Torus
type: conference
urn: '21759'
user_id: '14955'
year: '1997'
...
---
_id: '2179'
author:
- first_name: Michele
full_name: Flammini, Michele
last_name: Flammini
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical
Networks. In: SPAA. ; 1997:170--179.'
apa: Flammini, M., & Scheideler, C. (1997). Simple, Efficient Routing Schemes
for All-Optical Networks. In SPAA (pp. 170--179).
bibtex: '@inproceedings{Flammini_Scheideler_1997, title={Simple, Efficient Routing
Schemes for All-Optical Networks}, booktitle={SPAA}, author={Flammini, Michele
and Scheideler, Christian}, year={1997}, pages={170--179} }'
chicago: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.
ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
Networks,” in SPAA, 1997, pp. 170--179.
mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
for All-Optical Networks.” SPAA, 1997, pp. 170--179.
short: 'M. Flammini, C. Scheideler, in: SPAA, 1997, pp. 170--179.'
date_created: 2018-04-03T09:17:10Z
date_updated: 2022-01-06T06:55:13Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:06:34Z
date_updated: 2018-04-12T07:11:32Z
file_id: '2283'
file_name: SPAA97.pdf
file_size: 365709
relation: main_file
file_date_updated: 2018-04-12T07:11:32Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 170--179
publication: SPAA
status: public
title: Simple, Efficient Routing Schemes for All-Optical Networks
type: conference
urn: '21792'
user_id: '14955'
year: '1997'
...
---
_id: '16564'
author:
- first_name: Dima
full_name: Grigoriev, Dima
last_name: Grigoriev
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Roman
full_name: Smolensky, Roman
last_name: Smolensky
citation:
ama: Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
for randomized algebraic decision trees. computational complexity. 1997:357-375.
doi:10.1007/bf01270387
apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R.
(1997). A lower bound for randomized algebraic decision trees. Computational
Complexity, 357–375. https://doi.org/10.1007/bf01270387
bibtex: '@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A
lower bound for randomized algebraic decision trees}, DOI={10.1007/bf01270387},
journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek
and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375}
}'
chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” Computational
Complexity, 1997, 357–75. https://doi.org/10.1007/bf01270387.
ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
bound for randomized algebraic decision trees,” computational complexity,
pp. 357–375, 1997.
mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
short: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational
Complexity (1997) 357–375.
date_created: 2020-04-15T10:42:43Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bf01270387
language:
- iso: eng
page: 357-375
publication: computational complexity
publication_identifier:
issn:
- 1016-3328
- 1420-8954
publication_status: published
status: public
title: A lower bound for randomized algebraic decision trees
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16565'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Simulating Shared Memory in Real
Time: On the Computation Power of Reconfigurable Architectures. Information
and Computation. 1997:103-120. doi:10.1006/inco.1997.2642'
apa: 'Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1997). Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.
Information and Computation, 103–120. https://doi.org/10.1006/inco.1997.2642'
bibtex: '@article{Czumaj_Meyer auf der Heide_Stemann_1997, title={Simulating Shared
Memory in Real Time: On the Computation Power of Reconfigurable Architectures},
DOI={10.1006/inco.1997.2642},
journal={Information and Computation}, author={Czumaj, Artur and Meyer auf der
Heide, Friedhelm and Stemann, Volker}, year={1997}, pages={103–120} }'
chicago: 'Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.”
Information and Computation, 1997, 103–20. https://doi.org/10.1006/inco.1997.2642.'
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating Shared Memory
in Real Time: On the Computation Power of Reconfigurable Architectures,” Information
and Computation, pp. 103–120, 1997.'
mla: 'Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation
Power of Reconfigurable Architectures.” Information and Computation, 1997,
pp. 103–20, doi:10.1006/inco.1997.2642.'
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Information and Computation
(1997) 103–120.
date_created: 2020-04-15T11:20:09Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1006/inco.1997.2642
language:
- iso: eng
page: 103-120
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: 'Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable
Architectures'
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16567'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: M.
full_name: Storch, M.
last_name: Storch
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and
Slowdown for Universal Parallel Networks. Theory of Computing Systems.
Published online 1997:627-644. doi:10.1007/s002240000071
apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1997). Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks. Theory of Computing
Systems, 627–644. https://doi.org/10.1007/s002240000071
bibtex: '@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks}, DOI={10.1007/s002240000071},
journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm
and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }'
chicago: Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs
Between Size and Slowdown for Universal Parallel Networks.” Theory of Computing
Systems, 1997, 627–44. https://doi.org/10.1007/s002240000071.
ieee: 'F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between
Size and Slowdown for Universal Parallel Networks,” Theory of Computing Systems,
pp. 627–644, 1997, doi: 10.1007/s002240000071.'
mla: Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and
Slowdown for Universal Parallel Networks.” Theory of Computing Systems,
1997, pp. 627–44, doi:10.1007/s002240000071.
short: F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems
(1997) 627–644.
date_created: 2020-04-15T11:31:05Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/s002240000071
language:
- iso: eng
page: 627-644
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
type: journal_article
user_id: '15415'
year: '1997'
...
---
_id: '16569'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Meyer auf der Heide F, Vöcking B. Static and dynamic data management in networks.
In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002716'
apa: Meyer auf der Heide, F., & Vöcking, B. (1997). Static and dynamic data
management in networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.
https://doi.org/10.1007/bfb0002716
bibtex: '@inbook{Meyer auf der Heide_Vöcking_1997, place={Berlin, Heidelberg}, title={Static
and dynamic data management in networks}, DOI={10.1007/bfb0002716},
booktitle={Euro-Par’97 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
and Vöcking, Berthold}, year={1997} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic
Data Management in Networks.” In Euro-Par’97 Parallel Processing. Berlin,
Heidelberg, 1997. https://doi.org/10.1007/bfb0002716.
ieee: F. Meyer auf der Heide and B. Vöcking, “Static and dynamic data management
in networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “Static and Dynamic Data
Management in Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002716.
short: 'F. Meyer auf der Heide, B. Vöcking, in: Euro-Par’97 Parallel Processing,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-15T11:47:28Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bfb0002716
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
isbn:
- '9783540634409'
- '9783540695493'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Static and dynamic data management in networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16604'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
citation:
ama: 'Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating weighted jobs
in parallel. In: Proceedings of the Ninth Annual ACM Symposium on Parallel
Algorithms and Architectures - SPAA ’97. ; 1997. doi:10.1145/258492.258522'
apa: Berenbrink, P., Meyer auf der Heide, F., & Schröder, K. (1997). Allocating
weighted jobs in parallel. In Proceedings of the ninth annual ACM symposium
on Parallel algorithms and architectures - SPAA ’97. https://doi.org/10.1145/258492.258522
bibtex: '@inproceedings{Berenbrink_Meyer auf der Heide_Schröder_1997, title={Allocating
weighted jobs in parallel}, DOI={10.1145/258492.258522},
booktitle={Proceedings of the ninth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’97}, author={Berenbrink, Petra and Meyer auf der Heide,
Friedhelm and Schröder, Klaus}, year={1997} }'
chicago: Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Allocating
Weighted Jobs in Parallel.” In Proceedings of the Ninth Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’97, 1997. https://doi.org/10.1145/258492.258522.
ieee: P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating weighted
jobs in parallel,” in Proceedings of the ninth annual ACM symposium on Parallel
algorithms and architectures - SPAA ’97, 1997.
mla: Berenbrink, Petra, et al. “Allocating Weighted Jobs in Parallel.” Proceedings
of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures -
SPAA ’97, 1997, doi:10.1145/258492.258522.
short: 'P. Berenbrink, F. Meyer auf der Heide, K. Schröder, in: Proceedings of the
Ninth Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’97,
1997.'
date_created: 2020-04-16T06:18:07Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '63'
doi: 10.1145/258492.258522
language:
- iso: eng
publication: Proceedings of the ninth annual ACM symposium on Parallel algorithms
and architectures - SPAA '97
publication_identifier:
isbn:
- '0897918908'
publication_status: published
status: public
title: Allocating weighted jobs in parallel
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '16605'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bäumker A, Meyer auf der Heide F. Communication efficient parallel searching.
In: Solving Irregularly Structured Problems in Parallel. Berlin, Heidelberg;
1997. doi:10.1007/3-540-63138-0_21'
apa: Bäumker, A., & Meyer auf der Heide, F. (1997). Communication efficient
parallel searching. In Solving Irregularly Structured Problems in Parallel.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-63138-0_21
bibtex: '@inbook{Bäumker_Meyer auf der Heide_1997, place={Berlin, Heidelberg}, title={Communication
efficient parallel searching}, DOI={10.1007/3-540-63138-0_21},
booktitle={Solving Irregularly Structured Problems in Parallel}, author={Bäumker,
Armin and Meyer auf der Heide, Friedhelm}, year={1997} }'
chicago: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
Parallel Searching.” In Solving Irregularly Structured Problems in Parallel.
Berlin, Heidelberg, 1997. https://doi.org/10.1007/3-540-63138-0_21.
ieee: A. Bäumker and F. Meyer auf der Heide, “Communication efficient parallel searching,”
in Solving Irregularly Structured Problems in Parallel, Berlin, Heidelberg,
1997.
mla: Bäumker, Armin, and Friedhelm Meyer auf der Heide. “Communication Efficient
Parallel Searching.” Solving Irregularly Structured Problems in Parallel,
1997, doi:10.1007/3-540-63138-0_21.
short: 'A. Bäumker, F. Meyer auf der Heide, in: Solving Irregularly Structured Problems
in Parallel, Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T06:22:32Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '63'
doi: 10.1007/3-540-63138-0_21
language:
- iso: eng
place: Berlin, Heidelberg
publication: Solving Irregularly Structured Problems in Parallel
publication_identifier:
isbn:
- '9783540631385'
- '9783540691570'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Communication efficient parallel searching
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16687'
author:
- first_name: Efstratios
full_name: Karaivazoglou, Efstratios
last_name: Karaivazoglou
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Karaivazoglou E, Meyer auf der Heide F. Routing on asyncronous processor networks.
In: Euro-Par’97 Parallel Processing. Berlin, Heidelberg; 1997. doi:10.1007/bfb0002741'
apa: Karaivazoglou, E., & Meyer auf der Heide, F. (1997). Routing on asyncronous
processor networks. In Euro-Par’97 Parallel Processing. Berlin, Heidelberg.
https://doi.org/10.1007/bfb0002741
bibtex: '@inbook{Karaivazoglou_Meyer auf der Heide_1997, place={Berlin, Heidelberg},
title={Routing on asyncronous processor networks}, DOI={10.1007/bfb0002741},
booktitle={Euro-Par’97 Parallel Processing}, author={Karaivazoglou, Efstratios
and Meyer auf der Heide, Friedhelm}, year={1997} }'
chicago: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing
on Asyncronous Processor Networks.” In Euro-Par’97 Parallel Processing.
Berlin, Heidelberg, 1997. https://doi.org/10.1007/bfb0002741.
ieee: E. Karaivazoglou and F. Meyer auf der Heide, “Routing on asyncronous processor
networks,” in Euro-Par’97 Parallel Processing, Berlin, Heidelberg, 1997.
mla: Karaivazoglou, Efstratios, and Friedhelm Meyer auf der Heide. “Routing on Asyncronous
Processor Networks.” Euro-Par’97 Parallel Processing, 1997, doi:10.1007/bfb0002741.
short: 'E. Karaivazoglou, F. Meyer auf der Heide, in: Euro-Par’97 Parallel Processing,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:41:06Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bfb0002741
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par'97 Parallel Processing
publication_identifier:
isbn:
- '9783540634409'
- '9783540695493'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Routing on asyncronous processor networks
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '16689'
author:
- first_name: B.M.
full_name: Maggs, B.M.
last_name: Maggs
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Maggs BM, Meyer auf der Heide F, Vöcking B, Westermann M. Exploiting locality
for data management in systems of limited bandwidth. In: Proceedings 38th Annual
Symposium on Foundations of Computer Science. ; 1997. doi:10.1109/sfcs.1997.646117'
apa: Maggs, B. M., Meyer auf der Heide, F., Vöcking, B., & Westermann, M. (1997).
Exploiting locality for data management in systems of limited bandwidth. Proceedings
38th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1997.646117
bibtex: '@inproceedings{Maggs_Meyer auf der Heide_Vöcking_Westermann_1997, title={Exploiting
locality for data management in systems of limited bandwidth}, DOI={10.1109/sfcs.1997.646117},
booktitle={Proceedings 38th Annual Symposium on Foundations of Computer Science},
author={Maggs, B.M. and Meyer auf der Heide, Friedhelm and Vöcking, Berthold and
Westermann, Matthias}, year={1997} }'
chicago: Maggs, B.M., Friedhelm Meyer auf der Heide, Berthold Vöcking, and Matthias
Westermann. “Exploiting Locality for Data Management in Systems of Limited Bandwidth.”
In Proceedings 38th Annual Symposium on Foundations of Computer Science,
1997. https://doi.org/10.1109/sfcs.1997.646117.
ieee: 'B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westermann, “Exploiting
locality for data management in systems of limited bandwidth,” 1997, doi: 10.1109/sfcs.1997.646117.'
mla: Maggs, B. M., et al. “Exploiting Locality for Data Management in Systems of
Limited Bandwidth.” Proceedings 38th Annual Symposium on Foundations of Computer
Science, 1997, doi:10.1109/sfcs.1997.646117.
short: 'B.M. Maggs, F. Meyer auf der Heide, B. Vöcking, M. Westermann, in: Proceedings
38th Annual Symposium on Foundations of Computer Science, 1997.'
date_created: 2020-04-16T10:44:29Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1109/sfcs.1997.646117
language:
- iso: eng
publication: Proceedings 38th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '0818681977'
publication_status: published
status: public
title: Exploiting locality for data management in systems of limited bandwidth
type: conference
user_id: '15415'
year: '1997'
...
---
_id: '16693'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Thomas
full_name: Decker, Thomas
last_name: Decker
citation:
ama: 'Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB
376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik
’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22'
apa: 'Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn:
The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.”
In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-60831-5_22'
bibtex: '@inbook{Meyer auf der Heide_Decker_1997, place={Berlin, Heidelberg}, title={Parallel
Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design
Methods, Applications”}, DOI={10.1007/978-3-642-60831-5_22},
booktitle={Informatik ’97 Informatik als Innovationsmotor}, author={Meyer auf
der Heide, Friedhelm and Decker, Thomas}, year={1997} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing
in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
In Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg,
1997. https://doi.org/10.1007/978-3-642-60831-5_22.'
ieee: 'F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The
SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in
Informatik ’97 Informatik als Innovationsmotor, Berlin, Heidelberg, 1997.'
mla: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in
Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.'
short: 'F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:48:16Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/978-3-642-60831-5_22
language:
- iso: eng
place: Berlin, Heidelberg
publication: Informatik ’97 Informatik als Innovationsmotor
publication_identifier:
isbn:
- '9783540630661'
- '9783642608315'
issn:
- 1431-472X
publication_status: published
status: public
title: 'Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms,
Design Methods, Applications”'
type: book_chapter
user_id: '15415'
year: '1997'
...