---
_id: '2139'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers:
Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138.
doi:10.1007/s004930170007'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica,
21(1), 95--138. https://doi.org/10.1007/s004930170007'
bibtex: '@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1},
journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={2001}, pages={95--138} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica
21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded
Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21,
no. 1, pp. 95--138, 2001.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica,
vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.'
short: F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
date_created: 2018-04-03T05:47:20Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s004930170007
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 95--138
publication: Combinatorica
status: public
title: 'Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols'
type: journal_article
user_id: '14955'
volume: 21
year: '2001'
...
---
_id: '2140'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies
for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.'
apa: Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple
Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE
Computer Society.
bibtex: '@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple
Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE
Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann,
André and Scheideler, Christian}, year={2001}, pages={158--167} }'
chicago: Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler.
“Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167.
IEEE Computer Society, 2001.
ieee: B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing
Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.
mla: Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.”
FOCS, IEEE Computer Society, 2001, pp. 158--167.
short: 'B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE
Computer Society, 2001, pp. 158--167.'
date_created: 2018-04-03T05:48:28Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:59:00Z
date_updated: 2018-04-12T08:59:00Z
file_id: '2302'
file_name: FOCS-01.pdf
file_size: 151156
relation: main_file
file_date_updated: 2018-04-12T08:59:00Z
has_accepted_license: '1'
oa: '1'
page: 158--167
publication: FOCS
publisher: IEEE Computer Society
status: public
title: Simple Routing Strategies for Adversarial Systems
type: conference
urn: '21406'
user_id: '15504'
year: '2001'
...
---
_id: '2141'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for
Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation
Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer
Society.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation
Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer
Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian},
year={2001}, pages={227--234} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A
Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE
Computer Society, 2001.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment
for Storage Area Networks,” in PDP, 2001, pp. 227--234.
mla: Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area
Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society,
2001, pp. 227--234.'
date_created: 2018-04-03T05:49:21Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:39:01Z
date_updated: 2018-04-12T08:39:01Z
file_id: '2298'
file_name: PDP-00.pdf
file_size: 85778
relation: main_file
file_date_updated: 2018-04-12T08:39:01Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 227--234
publication: PDP
publisher: IEEE Computer Society
status: public
title: SIMLAB-A Simulation Environment for Storage Area Networks
type: conference
urn: '21415'
user_id: '14955'
year: '2001'
...
---
_id: '2142'
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. Simple on-line algorithms for the maximum disjoint
paths problem. In: SPAA. ; 2001:38--47.'
apa: Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the
maximum disjoint paths problem. In SPAA (pp. 38--47).
bibtex: '@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms
for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr
and Scheideler, Christian}, year={2001}, pages={38--47} }'
chicago: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.
ieee: P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint
paths problem,” in SPAA, 2001, pp. 38--47.
mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.
short: 'P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.'
date_created: 2018-04-03T05:50:16Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:58:07Z
date_updated: 2018-04-12T08:58:07Z
file_id: '2301'
file_name: SPAA-01.pdf
file_size: 335171
relation: main_file
file_date_updated: 2018-04-12T08:58:07Z
has_accepted_license: '1'
oa: '1'
page: 38--47
publication: SPAA
status: public
title: Simple on-line algorithms for the maximum disjoint paths problem
type: conference
urn: '21421'
user_id: '15504'
year: '2001'
...
---
_id: '18749'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th
International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505.
doi:10.1007/3-540-48224-5_41
apa: Czumaj, A., & Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
493–505. https://doi.org/10.1007/3-540-48224-5_41
bibtex: '@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={10.1007/3-540-48224-5_41},
journal={Proceedings of the 28th International Colloquium on Automata, Languages
and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001},
pages={493–505} }'
chicago: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, 493–505. https://doi.org/10.1007/3-540-48224-5_41.
ieee: A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” Proceedings of
the 28th International Colloquium on Automata, Languages and Programming (ICALP),
pp. 493–505, 2001.
mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
short: A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on
Automata, Languages and Programming (ICALP) (2001) 493–505.
date_created: 2020-09-01T10:48:38Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
doi: 10.1007/3-540-48224-5_41
language:
- iso: eng
page: 493-505
publication: Proceedings of the 28th International Colloquium on Automata, Languages
and Programming (ICALP)
publication_identifier:
isbn:
- '9783540422877'
- '9783540482246'
issn:
- 0302-9743
publication_status: published
status: public
title: Testing Hypergraph Coloring
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18750'
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. Soft Kinetic Data Structures. In: Proceedings of the
12th ACM-SIAM Symposium on Discrete Algorithms. ; 2001:865-872.'
apa: Sohler, C., & Czumaj, A. (2001). Soft Kinetic Data Structures. In Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms (pp. 865–872).
bibtex: '@inproceedings{Sohler_Czumaj_2001, title={Soft Kinetic Data Structures},
booktitle={Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms},
author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={865–872} }'
chicago: Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In
Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 865–72,
2001.
ieee: C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.
mla: Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–72.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on
Discrete Algorithms, 2001, pp. 865–872.'
date_created: 2020-09-01T10:56:39Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
page: 865-872
publication: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms
status: public
title: Soft Kinetic Data Structures
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '18857'
abstract:
- lang: eng
text: "This paper investigates geometric problems in the context of property testing
algorithms. Property testing is an emerging area in computer science in which
one is aiming at verifying whether a given object has a predetermined property
or is “far” from any object having the property. Although there has been some
research previously done in testing geometric properties, prior works have been
mostly dealing with the study of combinatorial notion of the distance defining
whether an object is “far” or it is “close”; very little research has been done
for geometric notion of distance measures, that is, distance measures that are
based on the geometry underlying input objects.\r\n\r\nThe main objective of this
work is to develop sound models to study geometric problems in the context of
property testing. Comparing to the previous work in property testing, there are
two novel aspects developed in this paper: geometric measures of being close to
an object having the predetermined property, and the use of geometric data structures
as basic primitives to design the testers. We believe that the second aspect is
of special importance in the context of property testing and that the use of specialized
data structures as basic primitives in the testers can be applied to other important
problems in this area.\r\n\r\nWe shall discuss a number of models that in our
opinion fit best geometric problems and apply them to study geometric properties
for three very fundamental and representative problems in the area: testing convex
position, testing map labeling, and testing clusterability."
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. Property Testing with Geometric Queries. Proceedings
of the 9th Annual European Symposium on Algorithms (ESA`01). 2001:266-277.
doi:10.1007/3-540-44676-1_22
apa: Sohler, C., & Czumaj, A. (2001). Property Testing with Geometric Queries.
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
266–277. https://doi.org/10.1007/3-540-44676-1_22
bibtex: '@article{Sohler_Czumaj_2001, title={Property Testing with Geometric Queries},
DOI={10.1007/3-540-44676-1_22},
journal={Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)},
author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={266–277} }'
chicago: Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
2001, 266–77. https://doi.org/10.1007/3-540-44676-1_22.
ieee: C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” Proceedings
of the 9th Annual European Symposium on Algorithms (ESA`01), pp. 266–277,
2001.
mla: Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
2001, pp. 266–77, doi:10.1007/3-540-44676-1_22.
short: C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on
Algorithms (ESA`01) (2001) 266–277.
date_created: 2020-09-02T12:24:25Z
date_updated: 2022-01-06T06:53:53Z
department:
- _id: '63'
doi: 10.1007/3-540-44676-1_22
language:
- iso: eng
page: 266-277
publication: Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)
status: public
title: Property Testing with Geometric Queries
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18964'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Anil
full_name: Maheshwari, Anil
last_name: Maheshwari
- first_name: Norbert
full_name: Zeh, Norbert
last_name: Zeh
citation:
ama: 'Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and
Its Applications to Proximity Problems. In: Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21'
apa: Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems. In Proceedings of
the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS. https://doi.org/10.1007/3-540-45294-x_21
bibtex: '@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems}, DOI={10.1007/3-540-45294-x_21},
booktitle={Proceedings of the 21st Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki,
Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }'
chicago: Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems.” In Proceedings
of the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS, 2001. https://doi.org/10.1007/3-540-45294-x_21.
ieee: T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting
and Its Applications to Proximity Problems,” in Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS, 2001.
mla: Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications
to Proximity Problems.” Proceedings of the 21st Annual Conference on Foundations
of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS,
2001, doi:10.1007/3-540-45294-x_21.
short: 'T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS, 2001.'
date_created: 2020-09-03T13:26:01Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/3-540-45294-x_21
language:
- iso: eng
publication: Proceedings of the 21st Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FSTTCS 2001), LNCS
publication_identifier:
isbn:
- '9783540430025'
- '9783540452942'
issn:
- 0302-9743
publication_status: published
status: public
title: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '23731'
abstract:
- lang: eng
text: "\r\n On 22 May 2000, the factorization of a pseudorandom
polynomial of degree 1 048 543 over the binary field Z\r\n 2\r\n
\ was completed on a 4-processor Linux PC, using roughly 100 CPU-hours.
The basic approach is a combination of the factorization software BIPOLAR and
a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn
University BSP library) is used for the implementation of the parallel communication.\r\n
\ "
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Joachim
full_name: von zur Gathen, Joachim
last_name: von zur Gathen
- first_name: Jürgen
full_name: Gerhard, Jürgen
last_name: Gerhard
- first_name: Olaf
full_name: Müller, Olaf
last_name: Müller
citation:
ama: Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial
of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333
apa: Bonorden, O., von zur Gathen, J., Gerhard, J., & Müller, O. (2001). Factoring
a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18.
https://doi.org/10.1145/504331.504333
bibtex: '@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring
a binary polynomial of degree over one million}, DOI={10.1145/504331.504333},
journal={ACM SIGSAM Bulletin}, author={Bonorden, Olaf and von zur Gathen, Joachim
and Gerhard, Jürgen and Müller, Olaf}, year={2001}, pages={16–18} }'
chicago: Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller.
“Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin,
2001, 16–18. https://doi.org/10.1145/504331.504333.
ieee: O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary
polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18,
2001.
mla: Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.”
ACM SIGSAM Bulletin, 2001, pp. 16–18, doi:10.1145/504331.504333.
short: O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin
(2001) 16–18.
date_created: 2021-09-03T09:08:27Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '63'
doi: 10.1145/504331.504333
language:
- iso: eng
page: 16-18
publication: ACM SIGSAM Bulletin
publication_identifier:
issn:
- 0163-5824
publication_status: published
status: public
title: Factoring a binary polynomial of degree over one million
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18152'
abstract:
- lang: eng
text: Computing the spectral decomposition of a normal matrix is among the most
frequent tasks to numerical mathematics. A vast range of methods are employed
to do so, but all of them suffer from instabilities when applied to degenerate
matrices, i.e., those having multiple eigenvalues. We investigate the spectral
representation's effectivity properties on the sound formal basis of computable
analysis. It turns out that in general the eigenvectors cannot be computed from
a given matrix. If however the size of the matrix' spectrum (=number of different
eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in
principle the spectral decomposition can be computed under remarkably weak non-degeneracy
conditions.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Vasco
full_name: Brattka, Vasco
last_name: Brattka
citation:
ama: 'Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of
the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol
2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23'
apa: Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)
(Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23
bibtex: '@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A
Computable Spectral Theorem}, volume={2064}, DOI={10.1007/3-540-45335-0_23},
booktitle={Proceedings of the 4th Workshop on Computability and Complexity in
Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001},
pages={378–388} }'
chicago: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In
Proceedings of the 4th Workshop on Computability and Complexity in Analysis
(CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23.
ieee: M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
2001, vol. 2064, pp. 378–388.
mla: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.
short: 'M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability
and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.'
date_created: 2020-08-24T10:14:06Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1007/3-540-45335-0_23
intvolume: ' 2064'
language:
- iso: eng
page: 378-388
place: Berlin, Heidelberg
publication: Proceedings of the 4th Workshop on Computability and Complexity in Analysis
(CCA'2000)
publication_identifier:
isbn:
- '9783540421979'
- '9783540453352'
issn:
- 0302-9743
publication_status: published
status: public
title: A Computable Spectral Theorem
type: conference
user_id: '15415'
volume: 2064
year: '2001'
...
---
_id: '18166'
abstract:
- lang: eng
text: What is the maximum number of edges of the d-dimensional hypercube, denoted
by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial
properties of Euclidean geometry arising from linear separability considerations
in the theory of Perceptrons has become an issue on its own. We use computational
and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen
earlier results on hypercube cut numbers.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: M. Reza
full_name: Emamy-Khansari, M. Reza
last_name: Emamy-Khansari
citation:
ama: 'Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In:
Proceedings of the First International Conference on Discrete Models - Combinatorics,
Computation and Geometry (DM-CCG’2001). Vol AA. ; 2001:155-164.'
apa: Ziegler, M., & Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing
Numbers. In Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG’2001) (Vol. AA, pp. 155–164).
bibtex: '@inproceedings{Ziegler_Emamy-Khansari_2001, title={New Bounds for Hypercube
Slicing Numbers}, volume={AA}, booktitle={Proceedings of the First International
Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)},
author={Ziegler, Martin and Emamy-Khansari, M. Reza}, year={2001}, pages={155–164}
}'
chicago: Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube
Slicing Numbers.” In Proceedings of the First International Conference on Discrete
Models - Combinatorics, Computation and Geometry (DM-CCG’2001), AA:155–64,
2001.
ieee: M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,”
in Proceedings of the First International Conference on Discrete Models - Combinatorics,
Computation and Geometry (DM-CCG’2001), 2001, vol. AA, pp. 155–164.
mla: Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing
Numbers.” Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG’2001), vol. AA, 2001, pp.
155–64.
short: 'M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International
Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001),
2001, pp. 155–164.'
date_created: 2020-08-24T11:29:08Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 155-164
publication: Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG'2001)
status: public
title: New Bounds for Hypercube Slicing Numbers
type: conference
user_id: '15415'
volume: AA
year: '2001'
...
---
_id: '18168'
abstract:
- lang: eng
text: 'We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing
rather than the RealRAM model. Asking for mere computability of a function''s
maximum over some closed domain, we show that the common presumptions ''full-dimensional''
and `bounded'' in fact cannot be omitted: The sound framework of Recursive Analysis
enables us to rigorously prove this folkloristic observation! On the other hand,
convexity of this domain may be weakened to connectedness, and even NON-linear
functions turn out to be effectively optimizable.'
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. Turing Computability of (Non-)Linear Optimization. In:
Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01).
; 2001:181-184.'
apa: Brattka, V., & Ziegler, M. (2001). Turing Computability of (Non-)Linear
Optimization. In Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01) (pp. 181–184).
bibtex: '@inproceedings{Brattka_Ziegler_2001, title={Turing Computability of (Non-)Linear
Optimization}, booktitle={Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01)}, author={Brattka, Vasco and Ziegler, Martin}, year={2001},
pages={181–184} }'
chicago: Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear
Optimization.” In Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01), 181–84, 2001.
ieee: V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,”
in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01),
2001, pp. 181–184.
mla: Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.”
Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01),
2001, pp. 181–84.
short: 'V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference
on Computational Geometry (CCCG’01), 2001, pp. 181–184.'
date_created: 2020-08-24T11:33:12Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 181-184
publication: Proceedings of the 13th Canadian Conference on Computational Geometry
(CCCG'01)
status: public
title: Turing Computability of (Non-)Linear Optimization
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '18370'
abstract:
- lang: eng
text: We present a new approximate occlusion-culling algorithm that in contrast
to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For
generating a frame, as far as possible only the visible objects are rendered that
can be found quickly by an edge of the graph. The algorithm allows a real-time
navigation with over 20 frames per second in complex scenes consisting of over
10 millions of polygons. Moreover, approximation errors are very low.
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the
3D-Sectorgraph. In: Proc. of 3. GI-Informatiktage 2001. Bad Schussenried;
2001:275-278.'
apa: Klein, J., & Fischer, M. (2001). Occlusion Culling for Virtual Environments
based on the 3D-Sectorgraph. In Proc. of 3. GI-Informatiktage 2001 (pp.
275–278). Bad Schussenried.
bibtex: '@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion
Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc.
of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001},
pages={275–278} }'
chicago: Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments
Based on the 3D-Sectorgraph.” In Proc. of 3. GI-Informatiktage 2001, 275–78.
Bad Schussenried, 2001.
ieee: J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based
on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp.
275–278.
mla: Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments
Based on the 3D-Sectorgraph.” Proc. of 3. GI-Informatiktage 2001, 2001,
pp. 275–78.
short: 'J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried,
2001, pp. 275–278.'
date_created: 2020-08-26T13:08:24Z
date_updated: 2022-01-06T06:53:30Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T13:08:08Z
date_updated: 2020-08-26T13:08:08Z
file_id: '18371'
file_name: hni-id-1450.pdf
file_size: 146136
relation: main_file
success: 1
file_date_updated: 2020-08-26T13:08:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 275 - 278
place: Bad Schussenried
publication: Proc. of 3. GI-Informatiktage 2001
status: public
title: Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '7787'
citation:
ama: Mehner K, Mezini M, Pulvermüller E, Speck A, eds. Proceedings of the Workshop
on Aspect-Orientation, German Society for Informatics, Special Interest Group
for Object-Oriented Software Developement, Paderborn (Germany). Vol tr-ri-01-223.
University of Paderborn; 2001.
apa: Mehner, K., Mezini, M., Pulvermüller, E., & Speck, A. (Eds.). (2001). Proceedings
of the workshop on Aspect-Orientation, German Society for Informatics, Special
Interest Group for Object-Oriented Software Developement, Paderborn (Germany)
(Vol. tr-ri-01-223). University of Paderborn.
bibtex: '@book{Mehner_Mezini_Pulvermüller_Speck_2001, series={Forschungsbericht},
title={Proceedings of the workshop on Aspect-Orientation, German Society for Informatics,
Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)},
volume={tr-ri-01-223}, publisher={University of Paderborn}, year={2001}, collection={Forschungsbericht}
}'
chicago: Mehner, Katharina, M. Mezini, Elke Pulvermüller, and Andreas Speck, eds.
Proceedings of the Workshop on Aspect-Orientation, German Society for Informatics,
Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany).
Vol. tr-ri-01-223. Forschungsbericht. University of Paderborn, 2001.
ieee: K. Mehner, M. Mezini, E. Pulvermüller, and A. Speck, Eds., Proceedings
of the workshop on Aspect-Orientation, German Society for Informatics, Special
Interest Group for Object-Oriented Software Developement, Paderborn (Germany),
vol. tr-ri-01-223. University of Paderborn, 2001.
mla: Mehner, Katharina, et al., editors. Proceedings of the Workshop on Aspect-Orientation,
German Society for Informatics, Special Interest Group for Object-Oriented Software
Developement, Paderborn (Germany). Vol. tr-ri-01-223, University of Paderborn,
2001.
short: K. Mehner, M. Mezini, E. Pulvermüller, A. Speck, eds., Proceedings of the
Workshop on Aspect-Orientation, German Society for Informatics, Special Interest
Group for Object-Oriented Software Developement, Paderborn (Germany), University
of Paderborn, 2001.
date_created: 2019-02-19T19:08:50Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Katharina
full_name: Mehner, Katharina
last_name: Mehner
- first_name: M.
full_name: Mezini, M.
last_name: Mezini
- first_name: Elke
full_name: Pulvermüller, Elke
last_name: Pulvermüller
- first_name: Andreas
full_name: Speck, Andreas
last_name: Speck
language:
- iso: eng
publisher: University of Paderborn
series_title: Forschungsbericht
status: public
title: Proceedings of the workshop on Aspect-Orientation, German Society for Informatics,
Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)
type: conference_editor
user_id: '52534'
volume: tr-ri-01-223
year: '2001'
...
---
_id: '7788'
citation:
ama: 'Engels G, Oberweis A, Zündorf A, eds. Modellierung 2001. Vol 1. Bonn:
Gesellschaft für Informatik (GI); 2001.'
apa: 'Engels, G., Oberweis, A., & Zündorf, A. (Eds.). (2001). Modellierung
2001 (Vol. 1). Bonn: Gesellschaft für Informatik (GI).'
bibtex: '@book{Engels_Oberweis_Zündorf_2001, place={Bonn}, series={Lecture Notes
in Informatics}, title={Modellierung 2001}, volume={1}, publisher={Gesellschaft
für Informatik (GI)}, year={2001}, collection={Lecture Notes in Informatics} }'
chicago: 'Engels, Gregor, A. Oberweis, and Albert Zündorf, eds. Modellierung
2001. Vol. 1. Lecture Notes in Informatics. Bonn: Gesellschaft für Informatik
(GI), 2001.'
ieee: 'G. Engels, A. Oberweis, and A. Zündorf, Eds., Modellierung 2001, vol.
1. Bonn: Gesellschaft für Informatik (GI), 2001.'
mla: Engels, Gregor, et al., editors. Modellierung 2001. Vol. 1, Gesellschaft
für Informatik (GI), 2001.
short: G. Engels, A. Oberweis, A. Zündorf, eds., Modellierung 2001, Gesellschaft
für Informatik (GI), Bonn, 2001.
date_created: 2019-02-19T19:09:37Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: A.
full_name: Oberweis, A.
last_name: Oberweis
- first_name: Albert
full_name: Zündorf, Albert
last_name: Zündorf
intvolume: ' 1'
language:
- iso: eng
place: Bonn
publisher: Gesellschaft für Informatik (GI)
series_title: Lecture Notes in Informatics
status: public
title: Modellierung 2001
type: conference_editor
user_id: '52534'
volume: 1
year: '2001'
...
---
_id: '7789'
citation:
ama: Böllert K, Streitferdt D, Heuzeroth D, Mehner K, Hanenberg S, eds. Proceedings
of the 3rd Young Researchers Workshop, Satellite of the 3rd International Symposium
on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany).;
2001.
apa: Böllert, K., Streitferdt, D., Heuzeroth, D., Mehner, K., & Hanenberg, S.
(Eds.). (2001). Proceedings of the 3rd Young Researchers Workshop, satellite
of the 3rd International Symposium on Generative and Component-Based Engineering
(GCSE ’01), Erfurt (Germany).
bibtex: '@book{Böllert_Streitferdt_Heuzeroth_Mehner_Hanenberg_2001, title={Proceedings
of the 3rd Young Researchers Workshop, satellite of the 3rd International Symposium
on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany)}, year={2001}
}'
chicago: Böllert, K., D. Streitferdt, D. Heuzeroth, Katharina Mehner, and S. Hanenberg,
eds. Proceedings of the 3rd Young Researchers Workshop, Satellite of the 3rd
International Symposium on Generative and Component-Based Engineering (GCSE ’01),
Erfurt (Germany), 2001.
ieee: K. Böllert, D. Streitferdt, D. Heuzeroth, K. Mehner, and S. Hanenberg, Eds.,
Proceedings of the 3rd Young Researchers Workshop, satellite of the 3rd International
Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany).
2001.
mla: Böllert, K., et al., editors. Proceedings of the 3rd Young Researchers Workshop,
Satellite of the 3rd International Symposium on Generative and Component-Based
Engineering (GCSE ’01), Erfurt (Germany). 2001.
short: K. Böllert, D. Streitferdt, D. Heuzeroth, K. Mehner, S. Hanenberg, eds.,
Proceedings of the 3rd Young Researchers Workshop, Satellite of the 3rd International
Symposium on Generative and Component-Based Engineering (GCSE ’01), Erfurt (Germany),
2001.
date_created: 2019-02-19T19:10:41Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
editor:
- first_name: K.
full_name: Böllert, K.
last_name: Böllert
- first_name: D.
full_name: Streitferdt, D.
last_name: Streitferdt
- first_name: D.
full_name: Heuzeroth, D.
last_name: Heuzeroth
- first_name: Katharina
full_name: Mehner, Katharina
last_name: Mehner
- first_name: S.
full_name: Hanenberg, S.
last_name: Hanenberg
language:
- iso: eng
status: public
title: Proceedings of the 3rd Young Researchers Workshop, satellite of the 3rd International
Symposium on Generative and Component-Based Engineering (GCSE '01), Erfurt (Germany)
type: conference_editor
user_id: '52534'
year: '2001'
...
---
_id: '7879'
author:
- first_name: Björn
full_name: Lütkemeier, Björn
last_name: Lütkemeier
- first_name: Sebastian
full_name: Thöne, Sebastian
last_name: Thöne
citation:
ama: 'Lütkemeier B, Thöne S. Prozessorientierte Integration von Softwarekomponenten
durch XML-basierte Workflow-Modelle. In: Proceedings of the Fachwissenschaftlicher
Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany). Konradin-Verlag;
2001.'
apa: Lütkemeier, B., & Thöne, S. (2001). Prozessorientierte Integration von
Softwarekomponenten durch XML-basierte Workflow-Modelle. In Proceedings of
the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried
(Germany). Konradin-Verlag.
bibtex: '@inproceedings{Lütkemeier_Thöne_2001, title={Prozessorientierte Integration
von Softwarekomponenten durch XML-basierte Workflow-Modelle}, booktitle={Proceedings
of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried
(Germany)}, publisher={Konradin-Verlag}, author={Lütkemeier, Björn and Thöne,
Sebastian}, year={2001} }'
chicago: Lütkemeier, Björn, and Sebastian Thöne. “Prozessorientierte Integration
von Softwarekomponenten Durch XML-Basierte Workflow-Modelle.” In Proceedings
of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried
(Germany). Konradin-Verlag, 2001.
ieee: B. Lütkemeier and S. Thöne, “Prozessorientierte Integration von Softwarekomponenten
durch XML-basierte Workflow-Modelle,” in Proceedings of the Fachwissenschaftlicher
Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany), 2001.
mla: Lütkemeier, Björn, and Sebastian Thöne. “Prozessorientierte Integration von
Softwarekomponenten Durch XML-Basierte Workflow-Modelle.” Proceedings of the
Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried
(Germany), Konradin-Verlag, 2001.
short: 'B. Lütkemeier, S. Thöne, in: Proceedings of the Fachwissenschaftlicher Informatik-Kongress
(Informatiktage 2001), Bad Schussenried (Germany), Konradin-Verlag, 2001.'
date_created: 2019-02-21T10:39:54Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
language:
- iso: eng
publication: Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage
2001), Bad Schussenried (Germany)
publisher: Konradin-Verlag
status: public
title: Prozessorientierte Integration von Softwarekomponenten durch XML-basierte Workflow-Modelle
type: conference
user_id: '52534'
year: '2001'
...
---
_id: '7880'
author:
- first_name: Paolo
full_name: Baldan, Paolo
last_name: Baldan
- first_name: Andrea
full_name: Corradini, Andrea
last_name: Corradini
- first_name: Hartmut
full_name: Ehrig, Hartmut
last_name: Ehrig
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
citation:
ama: 'Baldan P, Corradini A, Ehrig H, Heckel R. Compositional Modeling of Reactive
Systems Using Open Nets. In: Proceedings of the Conference on Concurrency Theory
(CONCUR 2001), Aalborg (Denmark). Vol 2154. LNCS. Berlin/Heidelberg: Springer;
2001:502-518.'
apa: 'Baldan, P., Corradini, A., Ehrig, H., & Heckel, R. (2001). Compositional
Modeling of Reactive Systems Using Open Nets. In Proceedings of the conference
on Concurrency Theory (CONCUR 2001), Aalborg (Denmark) (Vol. 2154, pp. 502–518).
Berlin/Heidelberg: Springer.'
bibtex: '@inproceedings{Baldan_Corradini_Ehrig_Heckel_2001, place={Berlin/Heidelberg},
series={LNCS}, title={Compositional Modeling of Reactive Systems Using Open Nets},
volume={2154}, booktitle={Proceedings of the conference on Concurrency Theory
(CONCUR 2001), Aalborg (Denmark)}, publisher={Springer}, author={Baldan, Paolo
and Corradini, Andrea and Ehrig, Hartmut and Heckel, Reiko}, year={2001}, pages={502–518},
collection={LNCS} }'
chicago: 'Baldan, Paolo, Andrea Corradini, Hartmut Ehrig, and Reiko Heckel. “Compositional
Modeling of Reactive Systems Using Open Nets.” In Proceedings of the Conference
on Concurrency Theory (CONCUR 2001), Aalborg (Denmark), 2154:502–18. LNCS.
Berlin/Heidelberg: Springer, 2001.'
ieee: P. Baldan, A. Corradini, H. Ehrig, and R. Heckel, “Compositional Modeling
of Reactive Systems Using Open Nets,” in Proceedings of the conference on Concurrency
Theory (CONCUR 2001), Aalborg (Denmark), 2001, vol. 2154, pp. 502–518.
mla: Baldan, Paolo, et al. “Compositional Modeling of Reactive Systems Using Open
Nets.” Proceedings of the Conference on Concurrency Theory (CONCUR 2001), Aalborg
(Denmark), vol. 2154, Springer, 2001, pp. 502–18.
short: 'P. Baldan, A. Corradini, H. Ehrig, R. Heckel, in: Proceedings of the Conference
on Concurrency Theory (CONCUR 2001), Aalborg (Denmark), Springer, Berlin/Heidelberg,
2001, pp. 502–518.'
date_created: 2019-02-21T10:40:17Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
intvolume: ' 2154'
language:
- iso: eng
page: 502-518
place: Berlin/Heidelberg
publication: Proceedings of the conference on Concurrency Theory (CONCUR 2001), Aalborg
(Denmark)
publisher: Springer
series_title: LNCS
status: public
title: Compositional Modeling of Reactive Systems Using Open Nets
type: conference
user_id: '52534'
volume: 2154
year: '2001'
...
---
_id: '7881'
author:
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
- first_name: Joachim
full_name: Stroop, Joachim
last_name: Stroop
citation:
ama: 'Küster J, Stroop J. Consistent Design of Embedded Real-Time Systems with UML-RT.
In: Proceedings of the Conference on Object-Oriented Real-Time Distributed
Computing (ISORC 2001), Magdeburg (Germany). Washington, DC, USA: IEEE Computer
Society; 2001:31-40. doi:https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815'
apa: 'Küster, J., & Stroop, J. (2001). Consistent Design of Embedded Real-Time
Systems with UML-RT. In Proceedings of the conference on Object-Oriented Real-Time
Distributed Computing (ISORC 2001), Magdeburg (Germany) (pp. 31–40). Washington,
DC, USA: IEEE Computer Society. https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815'
bibtex: '@inproceedings{Küster_Stroop_2001, place={Washington, DC, USA}, title={Consistent
Design of Embedded Real-Time Systems with UML-RT}, DOI={https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815},
booktitle={Proceedings of the conference on Object-Oriented Real-Time Distributed
Computing (ISORC 2001), Magdeburg (Germany)}, publisher={IEEE Computer Society},
author={Küster, Jochen and Stroop, Joachim}, year={2001}, pages={31–40} }'
chicago: 'Küster, Jochen, and Joachim Stroop. “Consistent Design of Embedded Real-Time
Systems with UML-RT.” In Proceedings of the Conference on Object-Oriented Real-Time
Distributed Computing (ISORC 2001), Magdeburg (Germany), 31–40. Washington,
DC, USA: IEEE Computer Society, 2001. https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815.'
ieee: J. Küster and J. Stroop, “Consistent Design of Embedded Real-Time Systems
with UML-RT,” in Proceedings of the conference on Object-Oriented Real-Time
Distributed Computing (ISORC 2001), Magdeburg (Germany), 2001, pp. 31–40.
mla: Küster, Jochen, and Joachim Stroop. “Consistent Design of Embedded Real-Time
Systems with UML-RT.” Proceedings of the Conference on Object-Oriented Real-Time
Distributed Computing (ISORC 2001), Magdeburg (Germany), IEEE Computer Society,
2001, pp. 31–40, doi:https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815.
short: 'J. Küster, J. Stroop, in: Proceedings of the Conference on Object-Oriented
Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany), IEEE Computer
Society, Washington, DC, USA, 2001, pp. 31–40.'
date_created: 2019-02-21T10:40:47Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
doi: https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815
language:
- iso: eng
page: 31-40
place: Washington, DC, USA
publication: Proceedings of the conference on Object-Oriented Real-Time Distributed
Computing (ISORC 2001), Magdeburg (Germany)
publisher: IEEE Computer Society
status: public
title: Consistent Design of Embedded Real-Time Systems with UML-RT
type: conference
user_id: '52534'
year: '2001'
...
---
_id: '7882'
author:
- first_name: Ralph
full_name: Depke, Ralph
last_name: Depke
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Jochen
full_name: Küster, Jochen
last_name: Küster
citation:
ama: 'Depke R, Heckel R, Küster J. Improving the Agent-Oriented Modeling Process
with Roles. In: Proceedings of the Fifth International Conference on Autonomous
Agents (AGENTS 2001), Montreal (Canada). New York, NY, USA: ACM Press; 2001:640-647.'
apa: 'Depke, R., Heckel, R., & Küster, J. (2001). Improving the Agent-Oriented
Modeling Process with Roles. In Proceedings of the Fifth International Conference
on Autonomous Agents (AGENTS 2001), Montreal (Canada) (pp. 640–647). New York,
NY, USA: ACM Press.'
bibtex: '@inproceedings{Depke_Heckel_Küster_2001, place={New York, NY, USA}, title={Improving
the Agent-Oriented Modeling Process with Roles}, booktitle={Proceedings of the
Fifth International Conference on Autonomous Agents (AGENTS 2001), Montreal (Canada)},
publisher={ACM Press}, author={Depke, Ralph and Heckel, Reiko and Küster, Jochen},
year={2001}, pages={640–647} }'
chicago: 'Depke, Ralph, Reiko Heckel, and Jochen Küster. “Improving the Agent-Oriented
Modeling Process with Roles.” In Proceedings of the Fifth International Conference
on Autonomous Agents (AGENTS 2001), Montreal (Canada), 640–47. New York, NY,
USA: ACM Press, 2001.'
ieee: R. Depke, R. Heckel, and J. Küster, “Improving the Agent-Oriented Modeling
Process with Roles,” in Proceedings of the Fifth International Conference on
Autonomous Agents (AGENTS 2001), Montreal (Canada), 2001, pp. 640–647.
mla: Depke, Ralph, et al. “Improving the Agent-Oriented Modeling Process with Roles.”
Proceedings of the Fifth International Conference on Autonomous Agents (AGENTS
2001), Montreal (Canada), ACM Press, 2001, pp. 640–47.
short: 'R. Depke, R. Heckel, J. Küster, in: Proceedings of the Fifth International
Conference on Autonomous Agents (AGENTS 2001), Montreal (Canada), ACM Press, New
York, NY, USA, 2001, pp. 640–647.'
date_created: 2019-02-21T10:41:13Z
date_updated: 2022-01-06T07:03:47Z
department:
- _id: '66'
language:
- iso: eng
page: 640-647
place: New York, NY, USA
publication: Proceedings of the Fifth International Conference on Autonomous Agents
(AGENTS 2001), Montreal (Canada)
publisher: ACM Press
status: public
title: Improving the Agent-Oriented Modeling Process with Roles
type: conference
user_id: '52534'
year: '2001'
...