---
_id: '19727'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested
BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In:
Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA). ; 2002:2202-2208.'
apa: 'Bonorden, O., Meyer auf der Heide, F., & Wanka, R. (2002). Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example. In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA) (pp. 2202–2208).'
bibtex: '@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques
and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={2002}, pages={2202–2208} }'
chicago: 'Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition
of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive
Example.” In Int. Conf. on Parallel and Distributed Processing Techniques and
Applications (PDPTA), 2202–8, 2002.'
ieee: 'O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient
Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,”
in Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA), 2002, pp. 2202–2208.'
mla: 'Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum
Spanning Tree Computation as an Instructive Example.” Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp.
2202–08.'
short: 'O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel
and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.'
date_created: 2020-09-28T10:49:50Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
language:
- iso: eng
page: 2202-2208
publication: Int. Conf. on Parallel and Distributed Processing Techniques and Applications
(PDPTA)
status: public
title: 'Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation
as an Instructive Example'
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '19850'
author:
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
Graphs Is Asymptotically Optimal. In: Proc. Workshop on Graph-Theoretic Concepts
in Computer Science (WG). Berlin, Heidelberg; 2002:413-420. doi:10.1007/3-540-36379-3_36'
apa: Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations
on Circulant Graphs Is Asymptotically Optimal. In Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG) (pp. 413–420). Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_36
bibtex: '@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing
Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal},
DOI={10.1007/3-540-36379-3_36},
booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
author={Wanka, Rolf}, year={2002}, pages={413–420} }'
chicago: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations
on Circulant Graphs Is Asymptotically Optimal.” In Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG), 413–20. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-36379-3_36.
ieee: R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
Graphs Is Asymptotically Optimal,” in Proc. Workshop on Graph-Theoretic Concepts
in Computer Science (WG), 2002, pp. 413–420.
mla: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on
Circulant Graphs Is Asymptotically Optimal.” Proc. Workshop on Graph-Theoretic
Concepts in Computer Science (WG), 2002, pp. 413–20, doi:10.1007/3-540-36379-3_36.
short: 'R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science
(WG), Berlin, Heidelberg, 2002, pp. 413–420.'
date_created: 2020-10-02T11:16:31Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/3-540-36379-3_36
language:
- iso: eng
page: 413-420
place: Berlin, Heidelberg
publication: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)
publication_identifier:
isbn:
- '9783540003311'
- '9783540363798'
issn:
- 0302-9743
publication_status: published
status: public
title: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs
Is Asymptotically Optimal
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '19873'
abstract:
- lang: eng
text: We present a new and easy to use framework for navigating through scenes of
arbitrary complexity and topology. In the preprocessing, images for discrete viewpoints
and viewing directions are rendered and stored on an external volume. During navigation
each image can be displayed within a very short time by loading it from the volume.
For acceleration, our prefetching strategy loads possibly needed images for the
next few frames if the viewer takes a break. The measurements show that we achieve
interactive frame rates, whereby the difference between the minimal and maximal
display time is very small. Our system works well with scenes modelled by polygons,
but also digital photos can easily be used for describing a 3D scene.
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Jens
full_name: Krokowski, Jens
last_name: Krokowski
- first_name: Nicolas
full_name: Cuntz, Nicolas
last_name: Cuntz
citation:
ama: 'Klein J, Krokowski J, Cuntz N. Realtime Navigation in Highly Complex 3D-Scenes
Using JPEG Compression. In: Proc. of 4. GI-Informatiktage. ; 2002:224-229.'
apa: Klein, J., Krokowski, J., & Cuntz, N. (2002). Realtime Navigation in Highly
Complex 3D-Scenes Using JPEG Compression. In Proc. of 4. GI-Informatiktage
(pp. 224–229).
bibtex: '@inproceedings{Klein_Krokowski_Cuntz_2002, title={Realtime Navigation in
Highly Complex 3D-Scenes Using JPEG Compression}, booktitle={Proc. of 4. GI-Informatiktage},
author={Klein, Jan and Krokowski, Jens and Cuntz, Nicolas}, year={2002}, pages={224–229}
}'
chicago: Klein, Jan, Jens Krokowski, and Nicolas Cuntz. “Realtime Navigation in
Highly Complex 3D-Scenes Using JPEG Compression.” In Proc. of 4. GI-Informatiktage,
224–29, 2002.
ieee: J. Klein, J. Krokowski, and N. Cuntz, “Realtime Navigation in Highly Complex
3D-Scenes Using JPEG Compression,” in Proc. of 4. GI-Informatiktage, 2002,
pp. 224–229.
mla: Klein, Jan, et al. “Realtime Navigation in Highly Complex 3D-Scenes Using JPEG
Compression.” Proc. of 4. GI-Informatiktage, 2002, pp. 224–29.
short: 'J. Klein, J. Krokowski, N. Cuntz, in: Proc. of 4. GI-Informatiktage, 2002,
pp. 224–229.'
date_created: 2020-10-05T09:51:08Z
date_updated: 2022-01-06T06:54:14Z
department:
- _id: '63'
language:
- iso: eng
page: 224-229
publication: Proc. of 4. GI-Informatiktage
status: public
title: Realtime Navigation in Highly Complex 3D-Scenes Using JPEG Compression
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '2423'
abstract:
- lang: eng
text: 'Wearable computers are embedded into the mobile environment of the human
body. A design challenge for wearable systems is to combine the high performance
required for tasks such as video decoding with low energy consumption required
to maximize battery runtimes and the flexibility demanded by the dynamics of the
environment and the applications. In this paper, we demonstrate that reconfigurable
hardware technology is able to answer this challenge. We present the concept and
the prototype implementation of an autonomous wearable unit with reconfigurable
modules (WURM). We discuss two experiments that show the uses of reconfigurable
hardware in WURM: ASICs-on-demand and adaptive interfaces. Finally, we develop
and evaluate task placement techniques used in the operating system layer of WURM.'
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Rolf
full_name: Enzler, Rolf
last_name: Enzler
- first_name: Herbert
full_name: Walder, Herbert
last_name: Walder
- first_name: Jan
full_name: Beutel, Jan
last_name: Beutel
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Lothar
full_name: Thiele, Lothar
last_name: Thiele
citation:
ama: 'Plessl C, Enzler R, Walder H, Beutel J, Platzner M, Thiele L. Reconfigurable
Hardware in Wearable Computing Nodes. In: Proc. Int. Symp. on Wearable Computers
(ISWC). IEEE Computer Society; 2002:215-222. doi:10.1109/ISWC.2002.1167250'
apa: Plessl, C., Enzler, R., Walder, H., Beutel, J., Platzner, M., & Thiele,
L. (2002). Reconfigurable Hardware in Wearable Computing Nodes. In Proc. Int.
Symp. on Wearable Computers (ISWC) (pp. 215–222). IEEE Computer Society. https://doi.org/10.1109/ISWC.2002.1167250
bibtex: '@inproceedings{Plessl_Enzler_Walder_Beutel_Platzner_Thiele_2002, title={Reconfigurable
Hardware in Wearable Computing Nodes}, DOI={10.1109/ISWC.2002.1167250},
booktitle={Proc. Int. Symp. on Wearable Computers (ISWC)}, publisher={IEEE Computer
Society}, author={Plessl, Christian and Enzler, Rolf and Walder, Herbert and Beutel,
Jan and Platzner, Marco and Thiele, Lothar}, year={2002}, pages={215–222} }'
chicago: Plessl, Christian, Rolf Enzler, Herbert Walder, Jan Beutel, Marco Platzner,
and Lothar Thiele. “Reconfigurable Hardware in Wearable Computing Nodes.” In Proc.
Int. Symp. on Wearable Computers (ISWC), 215–22. IEEE Computer Society, 2002.
https://doi.org/10.1109/ISWC.2002.1167250.
ieee: C. Plessl, R. Enzler, H. Walder, J. Beutel, M. Platzner, and L. Thiele, “Reconfigurable
Hardware in Wearable Computing Nodes,” in Proc. Int. Symp. on Wearable Computers
(ISWC), 2002, pp. 215–222.
mla: Plessl, Christian, et al. “Reconfigurable Hardware in Wearable Computing Nodes.”
Proc. Int. Symp. on Wearable Computers (ISWC), IEEE Computer Society, 2002,
pp. 215–22, doi:10.1109/ISWC.2002.1167250.
short: 'C. Plessl, R. Enzler, H. Walder, J. Beutel, M. Platzner, L. Thiele, in:
Proc. Int. Symp. on Wearable Computers (ISWC), IEEE Computer Society, 2002, pp.
215–222.'
date_created: 2018-04-17T15:13:50Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '518'
- _id: '78'
doi: 10.1109/ISWC.2002.1167250
keyword:
- wearable computing
page: 215-222
publication: Proc. Int. Symp. on Wearable Computers (ISWC)
publication_identifier:
isbn:
- 0-7695-1816-8
publisher: IEEE Computer Society
status: public
title: Reconfigurable Hardware in Wearable Computing Nodes
type: conference
user_id: '24135'
year: '2002'
...
---
_id: '2424'
abstract:
- lang: eng
text: ' Recent generations of high-density and high-speed FPGAs provide a sufficient
capacity for implementing complete configurable systems on a chip (CSoCs). Hybrid
CPUs that combine standard CPU cores with reconfigurable coprocessors are an important
subclass of CSoCs. With partially reconfigurable FPGAs, coprocessors can be loaded
on demand while the CPU remains running. However, the lack of high-level design
tools for partial reconfiguration makes practical implementations a challenging
task. In this paper, we introduce a design flow to implement hybrid processors
on Xilinx Virtex. The design flow is based on two techniques, virtual sockets
and feed-through components, and can efficiently generate partial configurations
from industry-quality cores. We discuss the design flow and present a fully operational
audio streaming prototype to demonstrate its feasibility. '
author:
- first_name: Matthias
full_name: Dyer, Matthias
last_name: Dyer
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Dyer M, Plessl C, Platzner M. Partially Reconfigurable Cores for Xilinx Virtex.
In: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL).
Vol 2438. Lecture Notes in Computer Science (LNCS). Springer; 2002:292-301. doi:10.1007/3-540-46117-5'
apa: Dyer, M., Plessl, C., & Platzner, M. (2002). Partially Reconfigurable Cores
for Xilinx Virtex. In Proc. Int. Conf. on Field Programmable Logic and Applications
(FPL) (Vol. 2438, pp. 292–301). Springer. https://doi.org/10.1007/3-540-46117-5
bibtex: '@inproceedings{Dyer_Plessl_Platzner_2002, series={Lecture Notes in Computer
Science (LNCS)}, title={Partially Reconfigurable Cores for Xilinx Virtex}, volume={2438},
DOI={10.1007/3-540-46117-5},
booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)},
publisher={Springer}, author={Dyer, Matthias and Plessl, Christian and Platzner,
Marco}, year={2002}, pages={292–301}, collection={Lecture Notes in Computer Science
(LNCS)} }'
chicago: Dyer, Matthias, Christian Plessl, and Marco Platzner. “Partially Reconfigurable
Cores for Xilinx Virtex.” In Proc. Int. Conf. on Field Programmable Logic and
Applications (FPL), 2438:292–301. Lecture Notes in Computer Science (LNCS).
Springer, 2002. https://doi.org/10.1007/3-540-46117-5.
ieee: M. Dyer, C. Plessl, and M. Platzner, “Partially Reconfigurable Cores for Xilinx
Virtex,” in Proc. Int. Conf. on Field Programmable Logic and Applications (FPL),
2002, vol. 2438, pp. 292–301.
mla: Dyer, Matthias, et al. “Partially Reconfigurable Cores for Xilinx Virtex.”
Proc. Int. Conf. on Field Programmable Logic and Applications (FPL), vol.
2438, Springer, 2002, pp. 292–301, doi:10.1007/3-540-46117-5.
short: 'M. Dyer, C. Plessl, M. Platzner, in: Proc. Int. Conf. on Field Programmable
Logic and Applications (FPL), Springer, 2002, pp. 292–301.'
date_created: 2018-04-17T15:14:39Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '518'
- _id: '78'
doi: 10.1007/3-540-46117-5
intvolume: ' 2438'
keyword:
- partial reconfiguration
page: 292-301
publication: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)
publisher: Springer
series_title: Lecture Notes in Computer Science (LNCS)
status: public
title: Partially Reconfigurable Cores for Xilinx Virtex
type: conference
user_id: '24135'
volume: 2438
year: '2002'
...
---
_id: '2425'
abstract:
- lang: eng
text: ' We present instance-specific custom computing machines for the set covering
problem. Four accelerator architectures are developed that implement branch \&
bound in 3-valued logic and many of the deduction techniques found in software
solvers. We use set covering benchmarks from two-level logic minimization and
Steiner triple systems to derive and discuss experimental results. The resulting
raw speedups are in the order of four magnitudes on average. Finally, we propose
a hybrid solver architecture that combines the raw speed of instance-specific
reconfigurable hardware with flexible bounding schemes implemented in software. '
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Plessl C, Platzner M. Custom Computing Machines for the Set Covering Problem.
In: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM).
IEEE Computer Society; 2002:163-172. doi:10.1109/FPGA.2002.1106671'
apa: Plessl, C., & Platzner, M. (2002). Custom Computing Machines for the Set
Covering Problem. In Proc. Int. Symp. on Field-Programmable Custom Computing
Machines (FCCM) (pp. 163–172). IEEE Computer Society. https://doi.org/10.1109/FPGA.2002.1106671
bibtex: '@inproceedings{Plessl_Platzner_2002, title={Custom Computing Machines for
the Set Covering Problem}, DOI={10.1109/FPGA.2002.1106671},
booktitle={Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)},
publisher={IEEE Computer Society}, author={Plessl, Christian and Platzner, Marco},
year={2002}, pages={163–172} }'
chicago: Plessl, Christian, and Marco Platzner. “Custom Computing Machines for the
Set Covering Problem.” In Proc. Int. Symp. on Field-Programmable Custom Computing
Machines (FCCM), 163–72. IEEE Computer Society, 2002. https://doi.org/10.1109/FPGA.2002.1106671.
ieee: C. Plessl and M. Platzner, “Custom Computing Machines for the Set Covering
Problem,” in Proc. Int. Symp. on Field-Programmable Custom Computing Machines
(FCCM), 2002, pp. 163–172.
mla: Plessl, Christian, and Marco Platzner. “Custom Computing Machines for the Set
Covering Problem.” Proc. Int. Symp. on Field-Programmable Custom Computing
Machines (FCCM), IEEE Computer Society, 2002, pp. 163–72, doi:10.1109/FPGA.2002.1106671.
short: 'C. Plessl, M. Platzner, in: Proc. Int. Symp. on Field-Programmable Custom
Computing Machines (FCCM), IEEE Computer Society, 2002, pp. 163–172.'
date_created: 2018-04-17T15:15:44Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '518'
- _id: '78'
doi: 10.1109/FPGA.2002.1106671
page: 163-172
publication: Proc. Int. Symp. on Field-Programmable Custom Computing Machines (FCCM)
publisher: IEEE Computer Society
status: public
title: Custom Computing Machines for the Set Covering Problem
type: conference
user_id: '24135'
year: '2002'
...
---
_id: '24336'
abstract:
- lang: eng
text: "We define here a distributed abstract state machine (DASM) [7] of
\r\nthe network or routing layer of mobile ad hoc networks [13]. Such networks
re-\r\nquire routing strategies substantially different from those used in static
commu-\r\nnication networks, since storing and updating large routing tables
\ at mobile \r\nhosts would congest the network with administration packets
\ very fast. In [1], \r\nthe hypercubic location service is presented,
\ which considers a very strong \r\ndefinition of fault-tolerance thereby
\ improving state-of-the-art ad hoc routing \r\nprotocols in several respects.
Our goal in modeling the protocols for the distrib-\r\nuted location service and
the position based routing is twofold. First, we support \r\nthe definition and
\ validation of wireless communication protocols and imple-\r\nmentations
based thereon. Second, we feel that the abstract computation model \r\nnaturally
reflects the layering principle of communication architectures in com-\r\nbination
with an uncompromisingly local view of the application domain. Thus \r\nwe can
identify fundamental semantic concepts, such as concurrency, reactivity \r\nand
\ asynchronism, directly with the related concepts as imposed by the
\ given \r\napplication context. "
author:
- first_name: András
full_name: ' Benczúr, András'
last_name: ' Benczúr'
- first_name: Uwe
full_name: Glässer, Uwe
last_name: Glässer
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
citation:
ama: Benczúr A, Glässer U, Lukovszki T. Formal Description of a Distributed Location
Service for Mobile Ad Hoc Networks. Proc of 10th International Workshop on
Abstract State Machines, LNCS. Published online 2002.
apa: Benczúr, A., Glässer, U., & Lukovszki, T. (2002). Formal Description of
a Distributed Location Service for Mobile Ad Hoc Networks. Proc. of 10th International
Workshop on Abstract State Machines, LNCS.
bibtex: '@article{ Benczúr_Glässer_Lukovszki_2002, title={Formal Description of
a Distributed Location Service for Mobile Ad Hoc Networks}, journal={Proc. of
10th International Workshop on Abstract State Machines, LNCS}, author={ Benczúr,
András and Glässer, Uwe and Lukovszki, Tamás}, year={2002} }'
chicago: Benczúr, András, Uwe Glässer, and Tamás Lukovszki. “Formal Description
of a Distributed Location Service for Mobile Ad Hoc Networks.” Proc. of 10th
International Workshop on Abstract State Machines, LNCS, 2002.
ieee: A. Benczúr, U. Glässer, and T. Lukovszki, “Formal Description of a Distributed
Location Service for Mobile Ad Hoc Networks,” Proc. of 10th International Workshop
on Abstract State Machines, LNCS, 2002.
mla: Benczúr, András, et al. “Formal Description of a Distributed Location Service
for Mobile Ad Hoc Networks.” Proc. of 10th International Workshop on Abstract
State Machines, LNCS, 2002.
short: A. Benczúr, U. Glässer, T. Lukovszki, Proc. of 10th International Workshop
on Abstract State Machines, LNCS (2002).
date_created: 2021-09-14T08:51:39Z
date_updated: 2022-01-06T06:56:18Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2021-09-14T09:09:28Z
date_updated: 2021-09-14T09:09:28Z
file_id: '24337'
file_name: asm03.pdf
file_size: 162215
relation: main_file
success: 1
file_date_updated: 2021-09-14T09:09:28Z
has_accepted_license: '1'
language:
- iso: eng
publication: Proc. of 10th International Workshop on Abstract State Machines, LNCS
publication_status: published
status: public
title: Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks
type: journal_article
user_id: '15415'
year: '2002'
...
---
_id: '24338'
author:
- first_name: Matthias
full_name: Grünewald, Matthias
last_name: Grünewald
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance
of Resource Efficient Wireless Network Topologies. In: Proceedings of the 8th
International Euro-Par Conference. ; 2002. doi:10.1007/3-540-45706-2_134'
apa: Grünewald, M., Lukovszki, T., Schindelhauer, C., & Volbert, K. (2002).
Distributed Maintenance of Resource Efficient Wireless Network Topologies. Proceedings
of the 8th International Euro-Par Conference. https://doi.org/10.1007/3-540-45706-2_134
bibtex: '@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn,
Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network
Topologies}, DOI={10.1007/3-540-45706-2_134},
booktitle={Proceedings of the 8th International Euro-Par Conference}, author={Grünewald,
Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus},
year={2002} }'
chicago: Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus
Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”
In Proceedings of the 8th International Euro-Par Conference. Paderborn,
Germany, 2002. https://doi.org/10.1007/3-540-45706-2_134.
ieee: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed
Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: 10.1007/3-540-45706-2_134.'
mla: Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient
Wireless Network Topologies.” Proceedings of the 8th International Euro-Par
Conference, 2002, doi:10.1007/3-540-45706-2_134.
short: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings
of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.'
date_created: 2021-09-14T09:15:57Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/3-540-45706-2_134
language:
- iso: eng
place: Paderborn, Germany
publication: Proceedings of the 8th International Euro-Par Conference
publication_identifier:
issn:
- 0302-9743
publication_status: published
status: public
title: Distributed Maintenance of Resource Efficient Wireless Network Topologies
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '26412'
author:
- first_name: Klaus
full_name: Volbert, Klaus
last_name: Volbert
citation:
ama: 'Volbert K. A simulation environment for ad hoc networks using sector subdivision.
In: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-Based
Processing. ; 2002. doi:10.1109/empdp.2002.994324'
apa: Volbert, K. (2002). A simulation environment for ad hoc networks using sector
subdivision. Proceedings 10th Euromicro Workshop on Parallel, Distributed and
Network-Based Processing. https://doi.org/10.1109/empdp.2002.994324
bibtex: '@inproceedings{Volbert_2002, title={A simulation environment for ad hoc
networks using sector subdivision}, DOI={10.1109/empdp.2002.994324},
booktitle={Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based
Processing}, author={Volbert, Klaus}, year={2002} }'
chicago: Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector
Subdivision.” In Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002. https://doi.org/10.1109/empdp.2002.994324.
ieee: 'K. Volbert, “A simulation environment for ad hoc networks using sector subdivision,”
2002, doi: 10.1109/empdp.2002.994324.'
mla: Volbert, Klaus. “A Simulation Environment for Ad Hoc Networks Using Sector
Subdivision.” Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002, doi:10.1109/empdp.2002.994324.
short: 'K. Volbert, in: Proceedings 10th Euromicro Workshop on Parallel, Distributed
and Network-Based Processing, 2002.'
date_created: 2021-10-18T15:45:20Z
date_updated: 2022-01-06T06:57:20Z
department:
- _id: '63'
- _id: '26'
doi: 10.1109/empdp.2002.994324
language:
- iso: eng
publication: Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based
Processing
publication_status: published
status: public
title: A simulation environment for ad hoc networks using sector subdivision
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '3241'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Wehrheim H. Relating State-based and Behaviour-oriented Subtyping. Nord
J Comput. 2002;(4):405--435.
apa: Wehrheim, H. (2002). Relating State-based and Behaviour-oriented Subtyping.
Nord. J. Comput., (4), 405--435.
bibtex: '@article{Wehrheim_2002, title={Relating State-based and Behaviour-oriented
Subtyping}, number={4}, journal={Nord. J. Comput.}, author={Wehrheim, Heike},
year={2002}, pages={405--435} }'
chicago: 'Wehrheim, Heike. “Relating State-Based and Behaviour-Oriented Subtyping.”
Nord. J. Comput., no. 4 (2002): 405--435.'
ieee: H. Wehrheim, “Relating State-based and Behaviour-oriented Subtyping,” Nord.
J. Comput., no. 4, pp. 405--435, 2002.
mla: Wehrheim, Heike. “Relating State-Based and Behaviour-Oriented Subtyping.” Nord.
J. Comput., no. 4, 2002, pp. 405--435.
short: H. Wehrheim, Nord. J. Comput. (2002) 405--435.
date_created: 2018-06-14T06:56:20Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
issue: '4'
page: 405--435
publication: Nord. J. Comput.
status: public
title: Relating State-based and Behaviour-oriented Subtyping
type: journal_article
user_id: '29719'
year: '2002'
...
---
_id: '3242'
author:
- first_name: Ernst-Rüdiger
full_name: Olderog, Ernst-Rüdiger
last_name: Olderog
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Olderog E-R, Wehrheim H. Specification and Inheritance in {CSP-OZ}. In: S.
de Boer F, M. Bonsangue M, Graf S, P. de Roever W, eds. Formal Methods for
Components and Objects, First International Symposium, {FMCO} 2002, Leiden, The
Netherlands, November 5-8, 2002, Revised Lectures. Lecture Notes in Computer
Science. ; 2002:361--379. doi:10.1007/978-3-540-39656-7_15'
apa: Olderog, E.-R., & Wehrheim, H. (2002). Specification and Inheritance in
{CSP-OZ}. In F. S. de Boer, M. M. Bonsangue, S. Graf, & W. P. de Roever (Eds.),
Formal Methods for Components and Objects, First International Symposium, {FMCO}
2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures (pp. 361--379).
https://doi.org/10.1007/978-3-540-39656-7_15
bibtex: '@inproceedings{Olderog_Wehrheim_2002, series={Lecture Notes in Computer
Science}, title={Specification and Inheritance in {CSP-OZ}}, DOI={10.1007/978-3-540-39656-7_15},
booktitle={Formal Methods for Components and Objects, First International Symposium,
{FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures}, author={Olderog,
Ernst-Rüdiger and Wehrheim, Heike}, editor={S. de Boer, Frank and M. Bonsangue,
Marcello and Graf, Susanne and P. de Roever, WillemEditors}, year={2002}, pages={361--379},
collection={Lecture Notes in Computer Science} }'
chicago: Olderog, Ernst-Rüdiger, and Heike Wehrheim. “Specification and Inheritance
in {CSP-OZ}.” In Formal Methods for Components and Objects, First International
Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures,
edited by Frank S. de Boer, Marcello M. Bonsangue, Susanne Graf, and Willem P.
de Roever, 361--379. Lecture Notes in Computer Science, 2002. https://doi.org/10.1007/978-3-540-39656-7_15.
ieee: E.-R. Olderog and H. Wehrheim, “Specification and Inheritance in {CSP-OZ},”
in Formal Methods for Components and Objects, First International Symposium,
{FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures,
2002, pp. 361--379.
mla: Olderog, Ernst-Rüdiger, and Heike Wehrheim. “Specification and Inheritance
in {CSP-OZ}.” Formal Methods for Components and Objects, First International
Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures,
edited by Frank S. de Boer et al., 2002, pp. 361--379, doi:10.1007/978-3-540-39656-7_15.
short: 'E.-R. Olderog, H. Wehrheim, in: F. S. de Boer, M. M. Bonsangue, S. Graf,
W. P. de Roever (Eds.), Formal Methods for Components and Objects, First International
Symposium, {FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures,
2002, pp. 361--379.'
date_created: 2018-06-14T07:10:28Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/978-3-540-39656-7_15
editor:
- first_name: Frank
full_name: S. de Boer, Frank
last_name: S. de Boer
- first_name: Marcello
full_name: M. Bonsangue, Marcello
last_name: M. Bonsangue
- first_name: Susanne
full_name: Graf, Susanne
last_name: Graf
- first_name: Willem
full_name: P. de Roever, Willem
last_name: P. de Roever
page: 361--379
publication: Formal Methods for Components and Objects, First International Symposium,
{FMCO} 2002, Leiden, The Netherlands, November 5-8, 2002, Revised Lectures
series_title: Lecture Notes in Computer Science
status: public
title: Specification and Inheritance in {CSP-OZ}
type: conference
user_id: '29719'
year: '2002'
...
---
_id: '3243'
author:
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Wehrheim H. Checking Behavioural Subtypes via Refinement. In: Jacobs B, Rensink
A, eds. Formal Methods for Open Object-Based Distributed Systems V, {IFIP}
{TC6/WG6.1} Fifth International Conference on Formal Methods for Open Object-Based
Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands.
{IFIP} Conference Proceedings. ; 2002:79--93.'
apa: Wehrheim, H. (2002). Checking Behavioural Subtypes via Refinement. In B. Jacobs
& A. Rensink (Eds.), Formal Methods for Open Object-Based Distributed Systems
V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal Methods for Open
Object-Based Distributed Systems {(FMOODS} 2002), March 20-22, 2002, Enschede,
The Netherlands (pp. 79--93).
bibtex: '@inproceedings{Wehrheim_2002, series={{IFIP} Conference Proceedings}, title={Checking
Behavioural Subtypes via Refinement}, booktitle={Formal Methods for Open Object-Based
Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal
Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22,
2002, Enschede, The Netherlands}, author={Wehrheim, Heike}, editor={Jacobs, Bart
and Rensink, ArendEditors}, year={2002}, pages={79--93}, collection={{IFIP} Conference
Proceedings} }'
chicago: Wehrheim, Heike. “Checking Behavioural Subtypes via Refinement.” In Formal
Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth
International Conference on Formal Methods for Open Object-Based Distributed Systems
{(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands, edited by Bart
Jacobs and Arend Rensink, 79--93. {IFIP} Conference Proceedings, 2002.
ieee: H. Wehrheim, “Checking Behavioural Subtypes via Refinement,” in Formal
Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth
International Conference on Formal Methods for Open Object-Based Distributed Systems
{(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands, 2002, pp. 79--93.
mla: Wehrheim, Heike. “Checking Behavioural Subtypes via Refinement.” Formal
Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth
International Conference on Formal Methods for Open Object-Based Distributed Systems
{(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands, edited by Bart
Jacobs and Arend Rensink, 2002, pp. 79--93.
short: 'H. Wehrheim, in: B. Jacobs, A. Rensink (Eds.), Formal Methods for Open Object-Based
Distributed Systems V, {IFIP} {TC6/WG6.1} Fifth International Conference on Formal
Methods for Open Object-Based Distributed Systems {(FMOODS} 2002), March 20-22,
2002, Enschede, The Netherlands, 2002, pp. 79--93.'
date_created: 2018-06-14T07:11:33Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
editor:
- first_name: Bart
full_name: Jacobs, Bart
last_name: Jacobs
- first_name: Arend
full_name: Rensink, Arend
last_name: Rensink
page: 79--93
publication: Formal Methods for Open Object-Based Distributed Systems V, {IFIP} {TC6/WG6.1}
Fifth International Conference on Formal Methods for Open Object-Based Distributed
Systems {(FMOODS} 2002), March 20-22, 2002, Enschede, The Netherlands
series_title: '{IFIP} Conference Proceedings'
status: public
title: Checking Behavioural Subtypes via Refinement
type: conference
user_id: '29719'
year: '2002'
...
---
_id: '3034'
author:
- first_name: Andres
full_name: Albanese, Andres
last_name: Albanese
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Jeff
full_name: Edmonds, Jeff
last_name: Edmonds
- first_name: Michael
full_name: Luby, Michael
last_name: Luby
- first_name: Madhu
full_name: Sudan, Madhu
last_name: Sudan
citation:
ama: Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission.
IEEE Transactions on Information Theory. 2002;42(6):1737-1744. doi:10.1109/18.556670
apa: Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority
encoding transmission. IEEE Transactions on Information Theory, 42(6),
1737–1744. https://doi.org/10.1109/18.556670
bibtex: '@article{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding
transmission}, volume={42}, DOI={10.1109/18.556670},
number={6}, journal={IEEE Transactions on Information Theory}, publisher={Institute
of Electrical and Electronics Engineers (IEEE)}, author={Albanese, Andres and
Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu}, year={2002},
pages={1737–1744} }'
chicago: 'Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu
Sudan. “Priority Encoding Transmission.” IEEE Transactions on Information Theory
42, no. 6 (2002): 1737–44. https://doi.org/10.1109/18.556670.'
ieee: A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding
transmission,” IEEE Transactions on Information Theory, vol. 42, no. 6,
pp. 1737–1744, 2002.
mla: Albanese, Andres, et al. “Priority Encoding Transmission.” IEEE Transactions
on Information Theory, vol. 42, no. 6, Institute of Electrical and Electronics
Engineers (IEEE), 2002, pp. 1737–44, doi:10.1109/18.556670.
short: A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions
on Information Theory 42 (2002) 1737–1744.
date_created: 2018-06-05T08:36:14Z
date_updated: 2022-01-06T06:58:53Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1109/18.556670
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:37:48Z
date_updated: 2018-06-05T08:37:48Z
file_id: '3035'
file_name: pet.pdf
file_size: 260143
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:37:48Z
has_accepted_license: '1'
intvolume: ' 42'
issue: '6'
page: 1737-1744
publication: IEEE Transactions on Information Theory
publication_identifier:
issn:
- 0018-9448
publication_status: published
publisher: Institute of Electrical and Electronics Engineers (IEEE)
status: public
title: Priority encoding transmission
type: journal_article
user_id: '25078'
volume: 42
year: '2002'
...
---
_id: '3040'
author:
- first_name: A.
full_name: Albanese, A.
last_name: Albanese
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: J.
full_name: Edmonds, J.
last_name: Edmonds
- first_name: M.
full_name: Luby, M.
last_name: Luby
- first_name: M.
full_name: Sudan, M.
last_name: Sudan
citation:
ama: 'Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission.
In: Proceedings 35th Annual Symposium on Foundations of Computer Science.
IEEE Comput. Soc. Press; 2002. doi:10.1109/sfcs.1994.365731'
apa: Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority
encoding transmission. In Proceedings 35th Annual Symposium on Foundations
of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731
bibtex: '@inproceedings{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority
encoding transmission}, DOI={10.1109/sfcs.1994.365731},
booktitle={Proceedings 35th Annual Symposium on Foundations of Computer Science},
publisher={IEEE Comput. Soc. Press}, author={Albanese, A. and Blömer, Johannes
and Edmonds, J. and Luby, M. and Sudan, M.}, year={2002} }'
chicago: Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority
Encoding Transmission.” In Proceedings 35th Annual Symposium on Foundations
of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1994.365731.
ieee: A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding
transmission,” in Proceedings 35th Annual Symposium on Foundations of Computer
Science, 2002.
mla: Albanese, A., et al. “Priority Encoding Transmission.” Proceedings 35th
Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press,
2002, doi:10.1109/sfcs.1994.365731.
short: 'A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, in: Proceedings 35th
Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press,
2002.'
date_created: 2018-06-05T08:43:13Z
date_updated: 2022-01-06T06:58:53Z
department:
- _id: '64'
doi: 10.1109/sfcs.1994.365731
extern: '1'
publication: Proceedings 35th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '0818665807'
publication_status: published
publisher: IEEE Comput. Soc. Press
status: public
title: Priority encoding transmission
type: conference
user_id: '25078'
year: '2002'
...
---
_id: '2134'
author:
- first_name: Uriel
full_name: Feige, Uriel
last_name: Feige
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica.
2002;(3):361--399. doi:10.1007/s004930200018
apa: Feige, U., & Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop
Scheduling. Combinatorica, (3), 361--399. https://doi.org/10.1007/s004930200018
bibtex: '@article{Feige_Scheideler_2002, title={Improved Bounds for Acyclic Job
Shop Scheduling}, DOI={10.1007/s004930200018},
number={3}, journal={Combinatorica}, author={Feige, Uriel and Scheideler, Christian},
year={2002}, pages={361--399} }'
chicago: 'Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
Shop Scheduling.” Combinatorica, no. 3 (2002): 361--399. https://doi.org/10.1007/s004930200018.'
ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,”
Combinatorica, no. 3, pp. 361--399, 2002.
mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
Scheduling.” Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.
short: U. Feige, C. Scheideler, Combinatorica (2002) 361--399.
date_created: 2018-04-03T05:43:36Z
date_updated: 2022-01-06T06:54:55Z
department:
- _id: '79'
doi: 10.1007/s004930200018
issue: '3'
page: 361--399
publication: Combinatorica
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling
type: journal_article
user_id: '15504'
year: '2002'
...
---
_id: '2135'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem.
In: SODA. ACM/SIAM; 2002:184--193.'
apa: Kolman, P., & Scheideler, C. (2002). Improved bounds for the unsplittable
flow problem. In SODA (pp. 184--193). ACM/SIAM.
bibtex: '@inproceedings{Kolman_Scheideler_2002, title={Improved bounds for the unsplittable
flow problem}, booktitle={SODA}, publisher={ACM/SIAM}, author={Kolman, Petr and
Scheideler, Christian}, year={2002}, pages={184--193} }'
chicago: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.
ieee: P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,”
in SODA, 2002, pp. 184--193.
mla: Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable
Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.
short: 'P. Kolman, C. Scheideler, in: SODA, ACM/SIAM, 2002, pp. 184--193.'
date_created: 2018-04-03T05:44:11Z
date_updated: 2022-01-06T06:54:55Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:59:58Z
date_updated: 2018-04-12T08:59:58Z
file_id: '2303'
file_name: SODA-02.pdf
file_size: 246604
relation: main_file
file_date_updated: 2018-04-12T08:59:58Z
has_accepted_license: '1'
oa: '1'
page: 184--193
publication: SODA
publisher: ACM/SIAM
status: public
title: Improved bounds for the unsplittable flow problem
type: conference
urn: '21357'
user_id: '15504'
year: '2002'
...
---
_id: '2136'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Salzwedel K, Scheideler C. Compact, adaptive placement schemes
for non-uniform requirements. In: SPAA. ; 2002:53--62.'
apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2002). Compact, adaptive
placement schemes for non-uniform requirements. In SPAA (pp. 53--62).
bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2002, title={Compact, adaptive
placement schemes for non-uniform requirements}, booktitle={SPAA}, author={Brinkmann,
André and Salzwedel, Kay and Scheideler, Christian}, year={2002}, pages={53--62}
}'
chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive
Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.
ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement
schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.
mla: Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform
Requirements.” SPAA, 2002, pp. 53--62.
short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2002, pp. 53--62.'
date_created: 2018-04-03T05:44:56Z
date_updated: 2022-01-06T06:54:56Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:02:22Z
date_updated: 2018-04-12T09:02:22Z
file_id: '2305'
file_name: BSS-SPAA-02.pdf
file_size: 123373
relation: main_file
file_date_updated: 2018-04-12T09:02:22Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 53--62
publication: SPAA
status: public
title: Compact, adaptive placement schemes for non-uniform requirements
type: conference
urn: '21366'
user_id: '14955'
year: '2002'
...
---
_id: '2137'
author:
- first_name: Amitabha
full_name: Bagchi, Amitabha
last_name: Bagchi
- first_name: Amitabh
full_name: Chaudhary, Amitabh
last_name: Chaudhary
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
citation:
ama: 'Bagchi A, Chaudhary A, Scheideler C, Kolman P. Algorithms for fault-tolerant
routing in circuit switched networks. In: SPAA. ; 2002:265--274.'
apa: Bagchi, A., Chaudhary, A., Scheideler, C., & Kolman, P. (2002). Algorithms
for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).
bibtex: '@inproceedings{Bagchi_Chaudhary_Scheideler_Kolman_2002, title={Algorithms
for fault-tolerant routing in circuit switched networks}, booktitle={SPAA}, author={Bagchi,
Amitabha and Chaudhary, Amitabh and Scheideler, Christian and Kolman, Petr}, year={2002},
pages={265--274} }'
chicago: Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman.
“Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA,
265--274, 2002.
ieee: A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant
routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.
mla: Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit
Switched Networks.” SPAA, 2002, pp. 265--274.
short: 'A. Bagchi, A. Chaudhary, C. Scheideler, P. Kolman, in: SPAA, 2002, pp. 265--274.'
date_created: 2018-04-03T05:45:44Z
date_updated: 2022-01-06T06:54:57Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:03:44Z
date_updated: 2018-04-12T09:03:44Z
file_id: '2306'
file_name: BCKS-SPAA-02.pdf
file_size: 187124
relation: main_file
file_date_updated: 2018-04-12T09:03:44Z
has_accepted_license: '1'
oa: '1'
page: 265--274
publication: SPAA
status: public
title: Algorithms for fault-tolerant routing in circuit switched networks
type: conference
urn: '21376'
user_id: '15504'
year: '2002'
...
---
_id: '2138'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Scheideler C. Models and Techniques for Communication in Dynamic Networks.
In: STACS. Vol 2285. Lecture Notes in Computer Science. Springer; 2002:27--49.'
apa: Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks.
In STACS (Vol. 2285, pp. 27--49). Springer.
bibtex: '@inproceedings{Scheideler_2002, series={Lecture Notes in Computer Science},
title={Models and Techniques for Communication in Dynamic Networks}, volume={2285},
booktitle={STACS}, publisher={Springer}, author={Scheideler, Christian}, year={2002},
pages={27--49}, collection={Lecture Notes in Computer Science} }'
chicago: Scheideler, Christian. “Models and Techniques for Communication in Dynamic
Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer,
2002.
ieee: C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,”
in STACS, 2002, vol. 2285, pp. 27--49.
mla: Scheideler, Christian. “Models and Techniques for Communication in Dynamic
Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.
short: 'C. Scheideler, in: STACS, Springer, 2002, pp. 27--49.'
date_created: 2018-04-03T05:46:38Z
date_updated: 2022-01-06T06:54:57Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T09:01:03Z
date_updated: 2018-04-12T09:01:03Z
file_id: '2304'
file_name: STACS-02.pdf
file_size: 273875
relation: main_file
file_date_updated: 2018-04-12T09:01:03Z
has_accepted_license: '1'
intvolume: ' 2285'
oa: '1'
page: 27--49
publication: STACS
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Models and Techniques for Communication in Dynamic Networks
type: conference
urn: '21386'
user_id: '15504'
volume: 2285
year: '2002'
...
---
_id: '18853'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Abstract Combinatorial Programs and Efficient Property
Testers. Proceedings of the 43th Symposium on Foundations of Computer Science
(FOCS). 2002:83-92.
apa: Sohler, C., & Czumaj, A. (2002). Abstract Combinatorial Programs and Efficient
Property Testers. Proceedings of the 43th Symposium on Foundations of Computer
Science (FOCS), 83–92.
bibtex: '@article{Sohler_Czumaj_2002, title={Abstract Combinatorial Programs and
Efficient Property Testers}, journal={Proceedings of the 43th Symposium on Foundations
of Computer Science (FOCS)}, author={Sohler, Christian and Czumaj, Artur}, year={2002},
pages={83–92} }'
chicago: Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and
Efficient Property Testers.” Proceedings of the 43th Symposium on Foundations
of Computer Science (FOCS), 2002, 83–92.
ieee: C. Sohler and A. Czumaj, “Abstract Combinatorial Programs and Efficient Property
Testers,” Proceedings of the 43th Symposium on Foundations of Computer Science
(FOCS), pp. 83–92, 2002.
mla: Sohler, Christian, and Artur Czumaj. “Abstract Combinatorial Programs and Efficient
Property Testers.” Proceedings of the 43th Symposium on Foundations of Computer
Science (FOCS), 2002, pp. 83–92.
short: C. Sohler, A. Czumaj, Proceedings of the 43th Symposium on Foundations of
Computer Science (FOCS) (2002) 83–92.
date_created: 2020-09-02T12:08:22Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
language:
- iso: eng
page: 83-92
publication: Proceedings of the 43th Symposium on Foundations of Computer Science
(FOCS)
status: public
title: Abstract Combinatorial Programs and Efficient Property Testers
type: journal_article
user_id: '15415'
year: '2002'
...