---
_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'
...
---
_id: '18961'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: A.
full_name: Benczúr, A.
last_name: Benczúr
citation:
ama: Lukovszki T, Benczúr A. A Degree O(Log Log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing. Paderborn; 2002.
apa: Lukovszki, T., & Benczúr, A. (2002). A Degree O(log log n) Fault Tolerant
Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn.
bibtex: '@book{Lukovszki_Benczúr_2002, place={Paderborn}, title={A Degree O(log
log n) Fault Tolerant Distributed Location Service for Geographic Ad-Hoc Routing},
author={Lukovszki, Tamás and Benczúr, A.}, year={2002} }'
chicago: Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant
Distributed Location Service for Geographic Ad-Hoc Routing. Paderborn, 2002.
ieee: T. Lukovszki and A. Benczúr, A Degree O(log log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing. Paderborn, 2002.
mla: Lukovszki, Tamás, and A. Benczúr. A Degree O(Log Log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing. 2002.
short: T. Lukovszki, A. Benczúr, A Degree O(Log Log n) Fault Tolerant Distributed
Location Service for Geographic Ad-Hoc Routing, Paderborn, 2002.
date_created: 2020-09-03T13:16:48Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
language:
- iso: eng
place: Paderborn
status: public
title: A Degree O(log log n) Fault Tolerant Distributed Location Service for Geographic
Ad-Hoc Routing
type: report
user_id: '15415'
year: '2002'
...
---
_id: '1921'
author:
- first_name: Thu
full_name: Ngo-Quynh, Thu
last_name: Ngo-Quynh
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Adam
full_name: Wolisz, Adam
last_name: Wolisz
- first_name: Klaus
full_name: Rebensburg, Klaus
last_name: Rebensburg
citation:
ama: 'Ngo-Quynh T, Karl H, Wolisz A, Rebensburg K. New Scheduling Algorithm for
Providing Proportional Jitter in Differentiated Service Network . In: Proc.
IST Mobile & Wireless Telecommunications Summit 2002. ; 2002.'
apa: Ngo-Quynh, T., Karl, H., Wolisz, A., & Rebensburg, K. (2002). New Scheduling
Algorithm for Providing Proportional Jitter in Differentiated Service Network
. In Proc. IST Mobile & Wireless Telecommunications Summit 2002.
bibtex: '@inproceedings{Ngo-Quynh_Karl_Wolisz_Rebensburg_2002, title={New Scheduling
Algorithm for Providing Proportional Jitter in Differentiated Service Network
}, booktitle={Proc. IST Mobile & Wireless Telecommunications Summit 2002.},
author={Ngo-Quynh, Thu and Karl, Holger and Wolisz, Adam and Rebensburg, Klaus},
year={2002} }'
chicago: Ngo-Quynh, Thu, Holger Karl, Adam Wolisz, and Klaus Rebensburg. “New Scheduling
Algorithm for Providing Proportional Jitter in Differentiated Service Network
.” In Proc. IST Mobile & Wireless Telecommunications Summit 2002.,
2002.
ieee: T. Ngo-Quynh, H. Karl, A. Wolisz, and K. Rebensburg, “New Scheduling Algorithm
for Providing Proportional Jitter in Differentiated Service Network ,” in Proc.
IST Mobile & Wireless Telecommunications Summit 2002., 2002.
mla: Ngo-Quynh, Thu, et al. “New Scheduling Algorithm for Providing Proportional
Jitter in Differentiated Service Network .” Proc. IST Mobile & Wireless
Telecommunications Summit 2002., 2002.
short: 'T. Ngo-Quynh, H. Karl, A. Wolisz, K. Rebensburg, in: Proc. IST Mobile &
Wireless Telecommunications Summit 2002., 2002.'
date_created: 2018-03-28T11:36:45Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '75'
publication: Proc. IST Mobile & Wireless Telecommunications Summit 2002.
status: public
title: 'New Scheduling Algorithm for Providing Proportional Jitter in Differentiated
Service Network '
type: conference
user_id: '15572'
year: '2002'
...
---
_id: '18169'
abstract:
- lang: ger
text: Die Implementierung von Algorithmen zur Lösung geometrischer Probleme im Euklidischen
Raum (z.B. Berechnung der konvexen Hülle oder des Durchschnitts zweier Polyeder)
stellt sich oftmals als hochgradig nichttrivial heraus. Ob und unter welchen Voraussetzungen
die verursachenden numerischen Instabilitäten überhaupt ini den Griff zu kriegen
oder vielmehr dem Problem inhärent sind, untersucht diese Arbeit in einem auf
Turing zurückgehenden Rechenmodell. Im Gegensatz zu algebraischen Ansätzen geht
jenes nicht von der Verfügbarkeit exakter Tests auf z.B. Gleichheit reeller Zahlen
aus, sondern berücksichtigt die auf Digitalcomputern tatsächlich realisierbare
Approximation durch rationale Zahlen. In diesem Rahmen werden beweisbar stabile
Algorithmen zum Lösen linearer Gleichungssysteme, zur Matrix-Diagonalisierung
und zur linearen wie nichtlinearen Optimierung präsentiert. Als wichtiges technisches
Hilfsmittel dient ein neuer Berechenbarkeitsbegriff für reguläre unendliche Mengen
reller Zahlen, der sich aus dem systematischen Vergleich verschiedener der Literatur
entnommener ad-hoc Ansätze ergibt.
- lang: eng
text: Quite often, the implementation of well-known algorithms for solving geometric
problems in Euclidean space (such as convex hull computation or intersecting two
polyhedra) turns out to be a highly nontrivial task. Whether and under what prerequisites
the underlying numerical numerical instabilities can be avoided or are rather
inherent to the problem is investigated by the present work in a model of computation
dating back to Alan Turing himself. Other than algebraic approaches, this does
not rely on (volatile) exact tests for, e.g., equality of real numbers but reflects
the property of actual digital computers to only approximate real numbers by rationals.
In this framework, we devise and present provably stable algorithms for solving
systems of linear equations, matrix diagonalization, and lineare as well as non-linear
optimization. As major technical tool, a new notion of computability for regular
infinite sets of real numbers is introduced that arises from formalizing and systematically
comparing several ad-hoc notions found in previous literature.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Zur Berechenbarkeit reeller geometrischer Probleme. Vol 115.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2002.
apa: Ziegler, M. (2002). Zur Berechenbarkeit reeller geometrischer Probleme
(Vol. 115). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Ziegler_2002, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Zur Berechenbarkeit reeller geometrischer Probleme}, volume={115},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ziegler,
Martin}, year={2002}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn} }'
chicago: Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme.
Vol. 115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2002.
ieee: M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, vol.
115. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
mla: Ziegler, Martin. Zur Berechenbarkeit reeller geometrischer Probleme.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2002.
short: M. Ziegler, Zur Berechenbarkeit reeller geometrischer Probleme, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2002.
date_created: 2020-08-24T11:36:55Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 115'
language:
- iso: ger
publication_identifier:
isbn:
- 3-935433-24-7
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20020101320
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: Zur Berechenbarkeit reeller geometrischer Probleme
type: dissertation
user_id: '5786'
volume: 115
year: '2002'
...
---
_id: '18176'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Computability on Regular Subsets of Euclidean Space. Mathematical
Logic Quarterly (MLQ). 2002;48(S1):157-181. doi:10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
apa: Ziegler, M. (2002). Computability on Regular Subsets of Euclidean Space. Mathematical
Logic Quarterly (MLQ), 48(S1), 157–181. https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
bibtex: '@article{Ziegler_2002, title={Computability on Regular Subsets of Euclidean
Space}, volume={48}, DOI={10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4},
number={S1}, journal={Mathematical Logic Quarterly (MLQ)}, author={Ziegler, Martin},
year={2002}, pages={157–181} }'
chicago: 'Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.”
Mathematical Logic Quarterly (MLQ) 48, no. S1 (2002): 157–81. https://doi.org/10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4.'
ieee: M. Ziegler, “Computability on Regular Subsets of Euclidean Space,” Mathematical
Logic Quarterly (MLQ), vol. 48, no. S1, pp. 157–181, 2002.
mla: Ziegler, Martin. “Computability on Regular Subsets of Euclidean Space.” Mathematical
Logic Quarterly (MLQ), vol. 48, no. S1, 2002, pp. 157–81, doi:10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4.
short: M. Ziegler, Mathematical Logic Quarterly (MLQ) 48 (2002) 157–181.
date_created: 2020-08-24T12:05:40Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1002/1521-3870(200210)48:1+<157::aid-malq157>3.0.co;2-4
intvolume: ' 48'
issue: S1
language:
- iso: eng
page: 157-181
publication: Mathematical Logic Quarterly (MLQ)
publication_identifier:
issn:
- 0942-5616
- 1521-3870
publication_status: published
status: public
title: Computability on Regular Subsets of Euclidean Space
type: journal_article
user_id: '15415'
volume: 48
year: '2002'
...
---
_id: '18177'
abstract:
- lang: eng
text: 'Consider the classical point location problem: for a fixed arrangement of
m hyperplanes and its induced partition of d-space report, upon input of some
point, which face it lies in. With sufficient memory, this is easy to solve in
logarithmic time O(log m). But how fast can algorithms (formalized as Linear Decision
Trees) of *minimum* size be? The present work gives lower and upper bounds for
the time complexity of point location under this constraint. They show that, in
addition to m, the maximum number w of walls of a cell turns out to be a crucial
parameter. We also consider a relaxation of the strict minimum-size condition
allowing for constant factor overhead.'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Valentina
full_name: Damerow, Valentina
last_name: Damerow
- first_name: Lukas
full_name: Finschi, Lukas
last_name: Finschi
citation:
ama: 'Ziegler M, Damerow V, Finschi L. Point Location Algorithms of Minimum Size.
In: Proceedings of the 14th Canadian Conference on Computational Geometry (CCCG’02).
; 2002.'
apa: Ziegler, M., Damerow, V., & Finschi, L. (2002). Point Location Algorithms
of Minimum Size. In Proceedings of the 14th Canadian Conference on Computational
Geometry (CCCG’02).
bibtex: '@inproceedings{Ziegler_Damerow_Finschi_2002, title={Point Location Algorithms
of Minimum Size}, booktitle={Proceedings of the 14th Canadian Conference on Computational
Geometry (CCCG’02)}, author={Ziegler, Martin and Damerow, Valentina and Finschi,
Lukas}, year={2002} }'
chicago: Ziegler, Martin, Valentina Damerow, and Lukas Finschi. “Point Location
Algorithms of Minimum Size.” In Proceedings of the 14th Canadian Conference
on Computational Geometry (CCCG’02), 2002.
ieee: M. Ziegler, V. Damerow, and L. Finschi, “Point Location Algorithms of Minimum
Size,” in Proceedings of the 14th Canadian Conference on Computational Geometry
(CCCG’02), 2002.
mla: Ziegler, Martin, et al. “Point Location Algorithms of Minimum Size.” Proceedings
of the 14th Canadian Conference on Computational Geometry (CCCG’02), 2002.
short: 'M. Ziegler, V. Damerow, L. Finschi, in: Proceedings of the 14th Canadian
Conference on Computational Geometry (CCCG’02), 2002.'
date_created: 2020-08-24T12:09:15Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of the 14th Canadian Conference on Computational Geometry
(CCCG'02)
publication_status: published
status: public
title: Point Location Algorithms of Minimum Size
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '18179'
abstract:
- lang: eng
text: Do the solutions of linear equations depend computably on their coefficients?
Implicitly, this has been one of the central questions in linear algebra since
the very beginning of the subject and the famous Gauß algorithm is one of its
numerical answers. Today there exists a tremendous number of algorithms which
solve this problem for different types of linear equations. However, actual implementations
in floating point arithmetic keep exhibiting numerical instabilities for ill-conditioned
inputs. This situation raises the question which of these instabilities are intrinsic,
thus caused by the very nature of the problem, and which are just side effects
of specific algorithms. To approach this principle question we revisit linear
equations from the rigorous point of view of computability. Therefore we apply
methods of computable analysis, which is the Turing machine based theory of computable
real number functions. It turns out that, given the coefficients of a system of
linear equations, we can compute the space of solutions, if and only if the dimension
of the solution space is known in advance. Especially, this explains why there
cannot exist any stable algorithms under weaker assumptions.
author:
- first_name: Vasco
full_name: Brattka, Vasco
last_name: Brattka
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Brattka V, Ziegler M. Computability of Linear Equations. In: Proceedings
of the 2nd IFIP International Conference on Theoretical Computer Science.
Boston, MA; 2002:95-106. doi:10.1007/978-0-387-35608-2_9'
apa: Brattka, V., & Ziegler, M. (2002). Computability of Linear Equations. In
Proceedings of the 2nd IFIP International Conference on Theoretical Computer
Science (pp. 95–106). Boston, MA. https://doi.org/10.1007/978-0-387-35608-2_9
bibtex: '@inproceedings{Brattka_Ziegler_2002, place={Boston, MA}, title={Computability
of Linear Equations}, DOI={10.1007/978-0-387-35608-2_9},
booktitle={Proceedings of the 2nd IFIP International Conference on Theoretical
Computer Science}, author={Brattka, Vasco and Ziegler, Martin}, year={2002}, pages={95–106}
}'
chicago: Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.”
In Proceedings of the 2nd IFIP International Conference on Theoretical Computer
Science, 95–106. Boston, MA, 2002. https://doi.org/10.1007/978-0-387-35608-2_9.
ieee: V. Brattka and M. Ziegler, “Computability of Linear Equations,” in Proceedings
of the 2nd IFIP International Conference on Theoretical Computer Science,
2002, pp. 95–106.
mla: Brattka, Vasco, and Martin Ziegler. “Computability of Linear Equations.” Proceedings
of the 2nd IFIP International Conference on Theoretical Computer Science,
2002, pp. 95–106, doi:10.1007/978-0-387-35608-2_9.
short: 'V. Brattka, M. Ziegler, in: Proceedings of the 2nd IFIP International Conference
on Theoretical Computer Science, Boston, MA, 2002, pp. 95–106.'
date_created: 2020-08-24T12:11:07Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1007/978-0-387-35608-2_9
language:
- iso: eng
page: 95-106
place: Boston, MA
publication: Proceedings of the 2nd IFIP International Conference on Theoretical Computer
Science
publication_status: published
status: public
title: Computability of Linear Equations
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '18369'
abstract:
- lang: eng
text: "Visualising is a method used to help experiencing and understanding causal
cohesions in simulation processes. For this purpose, tools for visualising are
already implemented in prevalent simulation systems. The user creates his simulation
model and generates a 3-dimensional (2,5-dimensional) visualising by means of
the simulation system. This helps examining the process which makes it easier
for the viewer to \x93understand\x94 it. Simulation tools usually only provide
the opportunity for a unidirectional visualising. In a 3-dimensional surrounding
the viewer can not implement an interaction with the simulation while the system
is running. Though an interaction during the simulation run enables the user to
gain a better understanding of causal cohesions. Solutions via HLA are sophisticated
and therefore rather suited for extensive projects.\r\nWe present a distributed
system consisting of a commercial manufacturing simulation tool, a coupling module
and a walkthrough system. The distributed system in conjunctions with the coupling
module guarantees generality and a wide field of applications of the walkthrough
system. Further it guarantees flexibility and selection of the specialized graphics
hardware for the walkthrough system. A further contribution of this paper is the
solution of the time synchronisation problem caused by simulation tool and walkthrough
system.\r\n"
author:
- first_name: Bengt
full_name: Mueck, Bengt
last_name: Mueck
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wolfram
full_name: Klemisch, Wolfram
last_name: Klemisch
citation:
ama: 'Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of
Simulation Tools with a Walkthrough-System. In: Simulation Und Visualisierung.
Ghent, BE: SCS European Publishing House; 2002:71-84.'
apa: 'Mueck, B., Dangelmaier, W., Fischer, M., & Klemisch, W. (2002). Bi-directional
Coupling of Simulation Tools with a Walkthrough-System. In Simulation und Visualisierung
(pp. 71–84). Ghent, BE: SCS European Publishing House.'
bibtex: '@inproceedings{Mueck_Dangelmaier_Fischer_Klemisch_2002, place={Ghent, BE},
title={Bi-directional Coupling of Simulation Tools with a Walkthrough-System},
booktitle={Simulation und Visualisierung}, publisher={SCS European Publishing
House}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias and
Klemisch, Wolfram}, year={2002}, pages={71–84} }'
chicago: 'Mueck, Bengt, Wilhelm Dangelmaier, Matthias Fischer, and Wolfram Klemisch.
“Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” In Simulation
Und Visualisierung, 71–84. Ghent, BE: SCS European Publishing House, 2002.'
ieee: B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling
of Simulation Tools with a Walkthrough-System,” in Simulation und Visualisierung,
2002, pp. 71–84.
mla: Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.”
Simulation Und Visualisierung, SCS European Publishing House, 2002, pp.
71–84.
short: 'B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung,
SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.'
date_created: 2020-08-26T13:01:43Z
date_updated: 2022-01-06T06:53:30Z
department:
- _id: '63'
language:
- iso: eng
page: 71-84
place: Ghent, BE
publication: Simulation und Visualisierung
publisher: SCS European Publishing House
status: public
title: Bi-directional Coupling of Simulation Tools with a Walkthrough-System
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '18566'
abstract:
- lang: eng
text: "We analyze a randomized pursuit-evasion game on graphs. This game is played
by two players, a hunter and a rabbit. Let G be any connected, undirected graph
with n nodes. The game is played in rounds and in each round both the hunter and
the rabbit are located at a node of the graph. Between rounds both the hunter
and the rabbit can stay at the current node or move to another node. The hunter
is assumed to be restricted to the graph G: in every round, the hunter can move
using at most one edge. For the rabbit we investigate two models: in one model
the rabbit is restricted to the same graph as the hunter, and in the other model
the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.\r\n\r\nWe
say that the rabbit is caught as soon as hunter and rabbit are located at the
same node in a round. The goal of the hunter is to catch the rabbit in as few
rounds as possible, whereas the rabbit aims to maximize the number of rounds until
it is caught. Given a randomized hunter strategy for G, the escape length for
that strategy is the worst case expected number of rounds it takes the hunter
to catch the rabbit, where the worst case is with regards to all (possibly randomized)
rabbit strategies. Our main result is a hunter strategy for general graphs with
an escape length of only O\r\n(n log (diam(G))) against restricted as well as
unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower
bound on the escape length in both models. Furthermore, we prove that our upper
bound is optimal up to constant factors against unrestricted rabbits."
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Naveen
full_name: Sivadasan, Naveen
last_name: Sivadasan
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion
in Graphs. In: Proceedings of the 29th International Colloquium on Automata,
Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77'
apa: Adler, M., Räcke, H., Sivadasan, N., Sohler, C., & Vöcking, B. (2002).
Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International
Colloquium on Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_77
bibtex: '@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin,
Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={10.1007/3-540-45465-9_77},
booktitle={Proceedings of the 29th International Colloquium on Automata, Languages
and Programming}, author={Adler, Micah and Räcke, Harald and Sivadasan, Naveen
and Sohler, Christian and Vöcking, Berthold}, year={2002} }'
chicago: Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold
Vöcking. “Randomized Pursuit-Evasion in Graphs.” In Proceedings of the 29th
International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg,
2002. https://doi.org/10.1007/3-540-45465-9_77.
ieee: M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion
in Graphs,” in Proceedings of the 29th International Colloquium on Automata,
Languages and Programming, 2002.
mla: Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Proceedings
of the 29th International Colloquium on Automata, Languages and Programming,
2002, doi:10.1007/3-540-45465-9_77.
short: 'M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings
of the 29th International Colloquium on Automata, Languages and Programming, Berlin,
Heidelberg, 2002.'
date_created: 2020-08-28T12:04:12Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/3-540-45465-9_77
language:
- iso: eng
place: Berlin, Heidelberg
publication: Proceedings of the 29th International Colloquium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540438649'
- '9783540454656'
issn:
- 0302-9743
publication_status: published
status: public
title: Randomized Pursuit-Evasion in Graphs
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '7785'
citation:
ama: Heckel R, Mens T, Wermelinger M, eds. Proceedings of the Workshop on Software
Evolution through Transformations, Satellite of the ICGT 2002 Conference, Barcelona
(Spain). Vol 72. Elsevier; 2002.
apa: Heckel, R., Mens, T., & Wermelinger, M. (Eds.). (2002). Proceedings
of the workshop on Software Evolution through Transformations, satellite of the
ICGT 2002 conference, Barcelona (Spain) (Vol. 72). Elsevier.
bibtex: '@book{Heckel_Mens_Wermelinger_2002, series={Electronic Notes in Theoretical
Computer Science}, title={Proceedings of the workshop on Software Evolution through
Transformations, satellite of the ICGT 2002 conference, Barcelona (Spain)}, volume={72},
number={4}, publisher={Elsevier}, year={2002}, collection={Electronic Notes in
Theoretical Computer Science} }'
chicago: Heckel, Reiko, T. Mens, and M. Wermelinger, eds. Proceedings of the
Workshop on Software Evolution through Transformations, Satellite of the ICGT
2002 Conference, Barcelona (Spain). Vol. 72. Electronic Notes in Theoretical
Computer Science. Elsevier, 2002.
ieee: R. Heckel, T. Mens, and M. Wermelinger, Eds., Proceedings of the workshop
on Software Evolution through Transformations, satellite of the ICGT 2002 conference,
Barcelona (Spain), vol. 72, no. 4. Elsevier, 2002.
mla: Heckel, Reiko, et al., editors. Proceedings of the Workshop on Software
Evolution through Transformations, Satellite of the ICGT 2002 Conference, Barcelona
(Spain). Vol. 72, no. 4, Elsevier, 2002.
short: R. Heckel, T. Mens, M. Wermelinger, eds., Proceedings of the Workshop on
Software Evolution through Transformations, Satellite of the ICGT 2002 Conference,
Barcelona (Spain), Elsevier, 2002.
date_created: 2019-02-19T19:07:45Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: T.
full_name: Mens, T.
last_name: Mens
- first_name: M.
full_name: Wermelinger, M.
last_name: Wermelinger
intvolume: ' 72'
issue: '4'
language:
- iso: eng
publisher: Elsevier
series_title: Electronic Notes in Theoretical Computer Science
status: public
title: Proceedings of the workshop on Software Evolution through Transformations,
satellite of the ICGT 2002 conference, Barcelona (Spain)
type: conference_editor
user_id: '52534'
volume: 72
year: '2002'
...
---
_id: '7786'
citation:
ama: Clauss M, Hanenberg S, John I, Mehner K, Van Der Straeten R, eds. Proceedings
of the 4th Young Researchers Workshop, Satellite of the 4th International Symposium
on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA).;
2002.
apa: Clauss, M., Hanenberg, S., John, I., Mehner, K., & Van Der Straeten, R.
(Eds.). (2002). Proceedings of the 4th Young Researchers Workshop, satellite
of the 4th International Symposium on Generative and Component-Based Engineering
(GCSE ’02), Pittsburgh, PA (USA).
bibtex: '@book{Clauss_Hanenberg_John_Mehner_Van Der Straeten_2002, series={IESE-Report},
title={Proceedings of the 4th Young Researchers Workshop, satellite of the 4th
International Symposium on Generative and Component-Based Engineering (GCSE ’02),
Pittsburgh, PA (USA)}, number={053.02/E}, year={2002}, collection={IESE-Report}
}'
chicago: Clauss, M., S. Hanenberg, I. John, Katharina Mehner, and Ragnhild Van Der
Straeten, eds. Proceedings of the 4th Young Researchers Workshop, Satellite
of the 4th International Symposium on Generative and Component-Based Engineering
(GCSE ’02), Pittsburgh, PA (USA). IESE-Report, 2002.
ieee: M. Clauss, S. Hanenberg, I. John, K. Mehner, and R. Van Der Straeten, Eds.,
Proceedings of the 4th Young Researchers Workshop, satellite of the 4th International
Symposium on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh,
PA (USA), no. 053.02/E. 2002.
mla: Clauss, M., et al., editors. Proceedings of the 4th Young Researchers Workshop,
Satellite of the 4th International Symposium on Generative and Component-Based
Engineering (GCSE ’02), Pittsburgh, PA (USA). no. 053.02/E, 2002.
short: M. Clauss, S. Hanenberg, I. John, K. Mehner, R. Van Der Straeten, eds., Proceedings
of the 4th Young Researchers Workshop, Satellite of the 4th International Symposium
on Generative and Component-Based Engineering (GCSE ’02), Pittsburgh, PA (USA),
2002.
date_created: 2019-02-19T19:08:18Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: M.
full_name: Clauss, M.
last_name: Clauss
- first_name: S.
full_name: Hanenberg, S.
last_name: Hanenberg
- first_name: I.
full_name: John, I.
last_name: John
- first_name: Katharina
full_name: Mehner, Katharina
last_name: Mehner
- first_name: Ragnhild
full_name: Van Der Straeten, Ragnhild
last_name: Van Der Straeten
issue: 053.02/E
language:
- iso: eng
series_title: IESE-Report
status: public
title: Proceedings of the 4th Young Researchers Workshop, satellite of the 4th International
Symposium on Generative and Component-Based Engineering (GCSE '02), Pittsburgh,
PA (USA)
type: conference_editor
user_id: '52534'
year: '2002'
...
---
_id: '7895'
author:
- first_name: Luciano
full_name: Baresi, Luciano
last_name: Baresi
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
citation:
ama: 'Baresi L, Heckel R. Tutorial Introduction to Graph Transformation: A Software
Engineering Perspective. In: Proceedings of the 1st International Conference
on Graph Transformation (ICGT 2002), Barcelona (Spain). Vol 2505. LNCS. Berlin/Heidelberg:
Springer; 2002:402-429. doi:https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934'
apa: 'Baresi, L., & Heckel, R. (2002). Tutorial Introduction to Graph Transformation:
A Software Engineering Perspective. In Proceedings of the 1st International
Conference on Graph Transformation (ICGT 2002), Barcelona (Spain) (Vol. 2505,
pp. 402–429). Berlin/Heidelberg: Springer. https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934'
bibtex: '@inproceedings{Baresi_Heckel_2002, place={Berlin/Heidelberg}, series={LNCS},
title={Tutorial Introduction to Graph Transformation: A Software Engineering Perspective},
volume={2505}, DOI={https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934},
booktitle={Proceedings of the 1st International Conference on Graph Transformation
(ICGT 2002), Barcelona (Spain)}, publisher={Springer}, author={Baresi, Luciano
and Heckel, Reiko}, year={2002}, pages={402–429}, collection={LNCS} }'
chicago: 'Baresi, Luciano, and Reiko Heckel. “Tutorial Introduction to Graph Transformation:
A Software Engineering Perspective.” In Proceedings of the 1st International
Conference on Graph Transformation (ICGT 2002), Barcelona (Spain), 2505:402–29.
LNCS. Berlin/Heidelberg: Springer, 2002. https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934.'
ieee: 'L. Baresi and R. Heckel, “Tutorial Introduction to Graph Transformation:
A Software Engineering Perspective,” in Proceedings of the 1st International
Conference on Graph Transformation (ICGT 2002), Barcelona (Spain), 2002, vol.
2505, pp. 402–429.'
mla: 'Baresi, Luciano, and Reiko Heckel. “Tutorial Introduction to Graph Transformation:
A Software Engineering Perspective.” Proceedings of the 1st International Conference
on Graph Transformation (ICGT 2002), Barcelona (Spain), vol. 2505, Springer,
2002, pp. 402–29, doi:https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934.'
short: 'L. Baresi, R. Heckel, in: Proceedings of the 1st International Conference
on Graph Transformation (ICGT 2002), Barcelona (Spain), Springer, Berlin/Heidelberg,
2002, pp. 402–429.'
date_created: 2019-02-21T10:55:19Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
doi: https://groups.uni-paderborn.de/fg-engels/Publications/10.1007/b100934
intvolume: ' 2505'
language:
- iso: eng
page: 402-429
place: Berlin/Heidelberg
publication: Proceedings of the 1st International Conference on Graph Transformation
(ICGT 2002), Barcelona (Spain)
publisher: Springer
series_title: LNCS
status: public
title: 'Tutorial Introduction to Graph Transformation: A Software Engineering Perspective'
type: conference
user_id: '52534'
volume: 2505
year: '2002'
...