---
_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: '19110'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Eke NO. Thomas Valentin: Der Hausfreund. Dramen (Edition). Vol 8. Oldenburg:
Igel; 2001.'
apa: 'Eke, N. O. (2001). Thomas Valentin: Der Hausfreund. Dramen (Edition)
(Vol. 8). Oldenburg: Igel.'
bibtex: '@book{Eke_2001, place={Oldenburg}, series={Thomas Valentin. Werke in Einzelbänden},
title={Thomas Valentin: Der Hausfreund. Dramen (Edition)}, volume={8}, publisher={Igel},
author={Eke, Norbert Otto}, year={2001}, collection={Thomas Valentin. Werke in
Einzelbänden} }'
chicago: 'Eke, Norbert Otto. Thomas Valentin: Der Hausfreund. Dramen (Edition).
Vol. 8. Thomas Valentin. Werke in Einzelbänden. Oldenburg: Igel, 2001.'
ieee: 'N. O. Eke, Thomas Valentin: Der Hausfreund. Dramen (Edition), vol.
8. Oldenburg: Igel, 2001.'
mla: 'Eke, Norbert Otto. Thomas Valentin: Der Hausfreund. Dramen (Edition).
Vol. 8, Igel, 2001.'
short: 'N.O. Eke, Thomas Valentin: Der Hausfreund. Dramen (Edition), Igel, Oldenburg,
2001.'
date_created: 2020-09-08T10:15:14Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '465'
extern: '1'
intvolume: ' 8'
language:
- iso: ger
page: '403'
place: Oldenburg
publisher: Igel
series_title: Thomas Valentin. Werke in Einzelbänden
status: public
title: 'Thomas Valentin: Der Hausfreund. Dramen (Edition)'
type: book
user_id: '14932'
volume: 8
year: '2001'
...
---
_id: '19145'
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: 'Seng E-M. Architektonischer Wunschtraum, literarische Utopie, bauliche Realität.
Samjatins “Wir” und die Architektur des 20. Jahrhunderts. In: Reese-Schäfer W,
Kühnel M, Rüdiger A, eds. Modell und Wirklichkeit, Festschrift zum 60. Geburtstag
von Richard Saage. Halle; 2001:236-263.'
apa: Seng, E.-M. (2001). Architektonischer Wunschtraum, literarische Utopie, bauliche
Realität. Samjatins “Wir” und die Architektur des 20. Jahrhunderts. In W. Reese-Schäfer,
M. Kühnel, & A. Rüdiger (Eds.), Modell und Wirklichkeit, Festschrift zum
60. Geburtstag von Richard Saage (pp. 236–263). Halle.
bibtex: '@inbook{Seng_2001, place={Halle}, title={Architektonischer Wunschtraum,
literarische Utopie, bauliche Realität. Samjatins “Wir” und die Architektur des
20. Jahrhunderts}, booktitle={Modell und Wirklichkeit, Festschrift zum 60. Geburtstag
von Richard Saage}, author={Seng, Eva- Maria}, editor={Reese-Schäfer, Walter and
Kühnel, Martin and Rüdiger, AxelEditors}, year={2001}, pages={236–263} }'
chicago: Seng, Eva- Maria. “Architektonischer Wunschtraum, literarische Utopie,
bauliche Realität. Samjatins ‘Wir’ und die Architektur des 20. Jahrhunderts.”
In Modell und Wirklichkeit, Festschrift zum 60. Geburtstag von Richard Saage,
edited by Walter Reese-Schäfer, Martin Kühnel, and Axel Rüdiger, 236–63. Halle,
2001.
ieee: E.-M. Seng, “Architektonischer Wunschtraum, literarische Utopie, bauliche
Realität. Samjatins ‘Wir’ und die Architektur des 20. Jahrhunderts,” in Modell
und Wirklichkeit, Festschrift zum 60. Geburtstag von Richard Saage, W. Reese-Schäfer,
M. Kühnel, and A. Rüdiger, Eds. Halle, 2001, pp. 236–263.
mla: Seng, Eva-Maria. “Architektonischer Wunschtraum, literarische Utopie, bauliche
Realität. Samjatins ‘Wir’ und die Architektur des 20. Jahrhunderts.” Modell
und Wirklichkeit, Festschrift zum 60. Geburtstag von Richard Saage, edited
by Walter Reese-Schäfer et al., 2001, pp. 236–63.
short: 'E.-M. Seng, in: W. Reese-Schäfer, M. Kühnel, A. Rüdiger (Eds.), Modell und
Wirklichkeit, Festschrift zum 60. Geburtstag von Richard Saage, Halle, 2001, pp.
236–263.'
date_created: 2020-09-08T12:52:58Z
date_updated: 2022-01-06T06:53:58Z
department:
- _id: '443'
editor:
- first_name: Walter
full_name: Reese-Schäfer, Walter
last_name: Reese-Schäfer
- first_name: Martin
full_name: Kühnel, Martin
last_name: Kühnel
- first_name: Axel
full_name: Rüdiger, Axel
last_name: Rüdiger
extern: '1'
language:
- iso: ger
page: 236-263
place: Halle
publication: Modell und Wirklichkeit, Festschrift zum 60. Geburtstag von Richard Saage
status: public
title: Architektonischer Wunschtraum, literarische Utopie, bauliche Realität. Samjatins
“Wir” und die Architektur des 20. Jahrhunderts
type: book_chapter
user_id: '21240'
year: '2001'
...
---
_id: '19184'
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: 'Seng E-M. Christianopolis. Der utopische Architekturentwurf des Johann Valentin
Andreae. In: Lächele R, ed. Das Echo Halles. Tübingen; 2001:59-92.'
apa: Seng, E.-M. (2001). Christianopolis. Der utopische Architekturentwurf des Johann
Valentin Andreae. In R. Lächele (Ed.), Das Echo Halles (pp. 59–92). Tübingen.
bibtex: '@inbook{Seng_2001, place={Tübingen}, title={Christianopolis. Der utopische
Architekturentwurf des Johann Valentin Andreae}, booktitle={Das Echo Halles},
author={Seng, Eva- Maria}, editor={Lächele, RainerEditor}, year={2001}, pages={59–92}
}'
chicago: Seng, Eva- Maria. “Christianopolis. Der utopische Architekturentwurf des
Johann Valentin Andreae.” In Das Echo Halles, edited by Rainer Lächele,
59–92. Tübingen, 2001.
ieee: E.-M. Seng, “Christianopolis. Der utopische Architekturentwurf des Johann
Valentin Andreae,” in Das Echo Halles, R. Lächele, Ed. Tübingen, 2001,
pp. 59–92.
mla: Seng, Eva-Maria. “Christianopolis. Der utopische Architekturentwurf des Johann
Valentin Andreae.” Das Echo Halles, edited by Rainer Lächele, 2001, pp.
59–92.
short: 'E.-M. Seng, in: R. Lächele (Ed.), Das Echo Halles, Tübingen, 2001, pp. 59–92.'
date_created: 2020-09-09T08:55:12Z
date_updated: 2022-01-06T06:53:59Z
department:
- _id: '443'
editor:
- first_name: Rainer
full_name: Lächele, Rainer
last_name: Lächele
extern: '1'
language:
- iso: ger
page: 59-92
place: Tübingen
publication: Das Echo Halles
status: public
title: Christianopolis. Der utopische Architekturentwurf des Johann Valentin Andreae
type: book_chapter
user_id: '21240'
year: '2001'
...
---
_id: '19195'
author:
- first_name: Eva- Maria
full_name: Seng, Eva- Maria
id: '499'
last_name: Seng
citation:
ama: Seng E-M. Vom Kristallpalast zum gläsernen Menschen. MUT Forum für Kultur,
Politik und Geschichte, Nr407, Juli 2001. 2001;(Nr. 407):18-27.
apa: Seng, E.-M. (2001). Vom Kristallpalast zum gläsernen Menschen. MUT. Forum
für Kultur, Politik und Geschichte, Nr.407, Juli 2001, (Nr. 407), 18–27.
bibtex: '@article{Seng_2001, title={Vom Kristallpalast zum gläsernen Menschen},
number={Nr. 407}, journal={MUT. Forum für Kultur, Politik und Geschichte, Nr.407,
Juli 2001}, author={Seng, Eva- Maria}, year={2001}, pages={18–27} }'
chicago: 'Seng, Eva- Maria. “Vom Kristallpalast zum gläsernen Menschen.” MUT.
Forum für Kultur, Politik und Geschichte, Nr.407, Juli 2001, no. Nr. 407 (2001):
18–27.'
ieee: E.-M. Seng, “Vom Kristallpalast zum gläsernen Menschen,” MUT. Forum für
Kultur, Politik und Geschichte, Nr.407, Juli 2001, no. Nr. 407, pp. 18–27,
2001.
mla: Seng, Eva-Maria. “Vom Kristallpalast zum gläsernen Menschen.” MUT. Forum
für Kultur, Politik und Geschichte, Nr.407, Juli 2001, no. Nr. 407, 2001,
pp. 18–27.
short: E.-M. Seng, MUT. Forum für Kultur, Politik und Geschichte, Nr.407, Juli 2001
(2001) 18–27.
date_created: 2020-09-09T09:53:02Z
date_updated: 2022-01-06T06:54:00Z
department:
- _id: '443'
extern: '1'
issue: Nr. 407
language:
- iso: ger
page: 18-27
publication: MUT. Forum für Kultur, Politik und Geschichte, Nr.407, Juli 2001
status: public
title: Vom Kristallpalast zum gläsernen Menschen
type: journal_article
user_id: '21240'
year: '2001'
...
---
_id: '19367'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Eke NO. „Alle Ehre deiner Narbe.“ Die Spur des Körpers im Werk Grabbes. In:
Kopp D, Vogt M, eds. Grabbes Welttheater. Christian Dietrich Grabbe zum 200.
Geburtstag. Bielefeld: Aisthesis; 2001:71-101.'
apa: 'Eke, N. O. (2001). „Alle Ehre deiner Narbe.“ Die Spur des Körpers im Werk
Grabbes. In D. Kopp & M. Vogt (Eds.), Grabbes Welttheater. Christian Dietrich
Grabbe zum 200. Geburtstag (pp. 71–101). Bielefeld: Aisthesis.'
bibtex: '@inbook{Eke_2001, place={Bielefeld}, title={„Alle Ehre deiner Narbe.“ Die
Spur des Körpers im Werk Grabbes}, booktitle={Grabbes Welttheater. Christian Dietrich
Grabbe zum 200. Geburtstag}, publisher={Aisthesis}, author={Eke, Norbert Otto},
editor={Kopp, Detlev and Vogt, MichaelEditors}, year={2001}, pages={71–101} }'
chicago: 'Eke, Norbert Otto. “„Alle Ehre deiner Narbe.“ Die Spur des Körpers im
Werk Grabbes.” In Grabbes Welttheater. Christian Dietrich Grabbe zum 200. Geburtstag,
edited by Detlev Kopp and Michael Vogt, 71–101. Bielefeld: Aisthesis, 2001.'
ieee: 'N. O. Eke, “„Alle Ehre deiner Narbe.“ Die Spur des Körpers im Werk Grabbes,”
in Grabbes Welttheater. Christian Dietrich Grabbe zum 200. Geburtstag,
D. Kopp and M. Vogt, Eds. Bielefeld: Aisthesis, 2001, pp. 71–101.'
mla: Eke, Norbert Otto. “„Alle Ehre deiner Narbe.“ Die Spur des Körpers im Werk
Grabbes.” Grabbes Welttheater. Christian Dietrich Grabbe zum 200. Geburtstag,
edited by Detlev Kopp and Michael Vogt, Aisthesis, 2001, pp. 71–101.
short: 'N.O. Eke, in: D. Kopp, M. Vogt (Eds.), Grabbes Welttheater. Christian Dietrich
Grabbe zum 200. Geburtstag, Aisthesis, Bielefeld, 2001, pp. 71–101.'
date_created: 2020-09-14T11:19:32Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '465'
editor:
- first_name: Detlev
full_name: Kopp, Detlev
last_name: Kopp
- first_name: Michael
full_name: Vogt, Michael
last_name: Vogt
extern: '1'
language:
- iso: ger
page: 71-101
place: Bielefeld
publication: Grabbes Welttheater. Christian Dietrich Grabbe zum 200. Geburtstag
publisher: Aisthesis
status: public
title: „Alle Ehre deiner Narbe.“ Die Spur des Körpers im Werk Grabbes
type: book_chapter
user_id: '14932'
year: '2001'
...
---
_id: '19369'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Eke NO. Faustisches im Schatten Goethes. Nikolaus Lenaus vormärzlicher Faust
– eine Erinnerung. In: Vogt M, Kopp D, eds. Literaturkonzepte im Vormärz. Forum
Vormärz Forschung. Jahrbuch 2000. Bielefeld: Aisthesis; 2001:243-260.'
apa: 'Eke, N. O. (2001). Faustisches im Schatten Goethes. Nikolaus Lenaus vormärzlicher
Faust – eine Erinnerung. In M. Vogt & D. Kopp (Eds.), Literaturkonzepte
im Vormärz. Forum Vormärz Forschung. Jahrbuch 2000 (pp. 243–260). Bielefeld:
Aisthesis.'
bibtex: '@inbook{Eke_2001, place={Bielefeld}, title={Faustisches im Schatten Goethes.
Nikolaus Lenaus vormärzlicher Faust – eine Erinnerung}, booktitle={Literaturkonzepte
im Vormärz. Forum Vormärz Forschung. Jahrbuch 2000}, publisher={Aisthesis}, author={Eke,
Norbert Otto}, editor={Vogt, Michael and Kopp, DetlevEditors}, year={2001}, pages={243–260}
}'
chicago: 'Eke, Norbert Otto. “Faustisches im Schatten Goethes. Nikolaus Lenaus vormärzlicher
Faust – eine Erinnerung.” In Literaturkonzepte im Vormärz. Forum Vormärz Forschung.
Jahrbuch 2000, edited by Michael Vogt and Detlev Kopp, 243–60. Bielefeld:
Aisthesis, 2001.'
ieee: 'N. O. Eke, “Faustisches im Schatten Goethes. Nikolaus Lenaus vormärzlicher
Faust – eine Erinnerung,” in Literaturkonzepte im Vormärz. Forum Vormärz Forschung.
Jahrbuch 2000, M. Vogt and D. Kopp, Eds. Bielefeld: Aisthesis, 2001, pp. 243–260.'
mla: Eke, Norbert Otto. “Faustisches im Schatten Goethes. Nikolaus Lenaus vormärzlicher
Faust – eine Erinnerung.” Literaturkonzepte im Vormärz. Forum Vormärz Forschung.
Jahrbuch 2000, edited by Michael Vogt and Detlev Kopp, Aisthesis, 2001, pp.
243–60.
short: 'N.O. Eke, in: M. Vogt, D. Kopp (Eds.), Literaturkonzepte im Vormärz. Forum
Vormärz Forschung. Jahrbuch 2000, Aisthesis, Bielefeld, 2001, pp. 243–260.'
date_created: 2020-09-14T11:34:44Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '465'
editor:
- first_name: Michael
full_name: Vogt, Michael
last_name: Vogt
- first_name: Detlev
full_name: Kopp, Detlev
last_name: Kopp
extern: '1'
language:
- iso: ger
page: 243-260
place: Bielefeld
publication: Literaturkonzepte im Vormärz. Forum Vormärz Forschung. Jahrbuch 2000
publisher: Aisthesis
status: public
title: Faustisches im Schatten Goethes. Nikolaus Lenaus vormärzlicher Faust – eine
Erinnerung
type: book_chapter
user_id: '14932'
year: '2001'
...
---
_id: '19371'
author:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
id: '104'
last_name: Eke
citation:
ama: 'Eke NO. Der Dramatiker Thomas Valentin. In: Eke NO, ed. Thomas Valentin:
Der Hausfreund. Dramen. Oldenburg: Igel; 2001:387-403.'
apa: 'Eke, N. O. (2001). Der Dramatiker Thomas Valentin. In N. O. Eke (Ed.), Thomas
Valentin: Der Hausfreund. Dramen (pp. 387–403). Oldenburg: Igel.'
bibtex: '@inbook{Eke_2001, place={Oldenburg}, title={Der Dramatiker Thomas Valentin},
booktitle={Thomas Valentin: Der Hausfreund. Dramen}, publisher={Igel}, author={Eke,
Norbert Otto}, editor={Eke, Norbert OttoEditor}, year={2001}, pages={387–403}
}'
chicago: 'Eke, Norbert Otto. “Der Dramatiker Thomas Valentin.” In Thomas Valentin:
Der Hausfreund. Dramen, edited by Norbert Otto Eke, 387–403. Oldenburg: Igel,
2001.'
ieee: 'N. O. Eke, “Der Dramatiker Thomas Valentin,” in Thomas Valentin: Der Hausfreund.
Dramen, N. O. Eke, Ed. Oldenburg: Igel, 2001, pp. 387–403.'
mla: 'Eke, Norbert Otto. “Der Dramatiker Thomas Valentin.” Thomas Valentin: Der
Hausfreund. Dramen, edited by Norbert Otto Eke, Igel, 2001, pp. 387–403.'
short: 'N.O. Eke, in: N.O. Eke (Ed.), Thomas Valentin: Der Hausfreund. Dramen, Igel,
Oldenburg, 2001, pp. 387–403.'
date_created: 2020-09-14T11:47:00Z
date_updated: 2022-01-06T06:54:03Z
department:
- _id: '465'
editor:
- first_name: Norbert Otto
full_name: Eke, Norbert Otto
last_name: Eke
extern: '1'
language:
- iso: ger
page: 387-403
place: Oldenburg
publication: 'Thomas Valentin: Der Hausfreund. Dramen'
publisher: Igel
status: public
title: Der Dramatiker Thomas Valentin
type: book_chapter
user_id: '14932'
year: '2001'
...
---
_id: '23421'
applicant:
- Lenze Drive Systems GmbH
application_date: 2001-01-31
application_number: '01102224.1'
author:
- first_name: Detmar
full_name: Zimmer, Detmar
id: '604'
last_name: Zimmer
citation:
ama: Zimmer D. Dichtsysteme zwischen einer Welle und einem feststehenden Gehäuseteil.
2001.
apa: Zimmer, D. (2001). Dichtsysteme zwischen einer Welle und einem feststehenden
Gehäuseteil.
bibtex: '@article{Zimmer_2001, title={Dichtsysteme zwischen einer Welle und einem
feststehenden Gehäuseteil}, author={Zimmer, Detmar}, year={2001} }'
chicago: Zimmer, Detmar. “Dichtsysteme Zwischen Einer Welle Und Einem Feststehenden
Gehäuseteil,” 2001.
ieee: D. Zimmer, “Dichtsysteme zwischen einer Welle und einem feststehenden Gehäuseteil.”
2001.
mla: Zimmer, Detmar. Dichtsysteme Zwischen Einer Welle Und Einem Feststehenden
Gehäuseteil. 2001.
short: D. Zimmer, (2001).
date_created: 2021-08-17T07:39:34Z
date_updated: 2022-01-06T06:55:53Z
department:
- _id: '146'
ipc: F16J 15/32
ipn: EP 1 122 472 B1
publication_date: 2001.01.3
status: public
title: Dichtsysteme zwischen einer Welle und einem feststehenden Gehäuseteil
type: patent
user_id: '38077'
year: '2001'
...
---
_id: '23423'
applicant:
- Lenze GmbH & Co KG
application_date: 2000-04-27
application_number: 09/463,473
author:
- first_name: Detmar
full_name: Zimmer, Detmar
id: '604'
last_name: Zimmer
citation:
ama: Zimmer D. Modular Gear System with Contrate Gear. 2001.
apa: Zimmer, D. (2001). Modular Gear System with Contrate Gear.
bibtex: '@article{Zimmer_2001, title={Modular Gear System with Contrate Gear}, author={Zimmer,
Detmar}, year={2001} }'
chicago: Zimmer, Detmar. “Modular Gear System with Contrate Gear,” 2001.
ieee: D. Zimmer, “Modular Gear System with Contrate Gear.” 2001.
mla: Zimmer, Detmar. Modular Gear System with Contrate Gear. 2001.
short: D. Zimmer, (2001).
date_created: 2021-08-17T07:41:07Z
date_updated: 2022-01-06T06:55:53Z
department:
- _id: '146'
ipc: F16H 57/02
ipn: US 6,234,037 B1
publication_date: 2001-05-22
status: public
title: Modular Gear System with Contrate Gear
type: patent
user_id: '38077'
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: '22321'
author:
- first_name: Detmar
full_name: Zimmer, Detmar
id: '604'
last_name: Zimmer
citation:
ama: 'Zimmer D. Entwicklung eines Getriebemotoren-Baukastens. In: Variantenvielfalt
in Produkten Und Prozessen. Erfahrungen, Methoden Und Instrumente. VDI-Gesellschaft
Entwicklung Konstruktion Vertrieb (VDI-EKV); 2001:77-87.'
apa: Zimmer, D. (2001). Entwicklung eines Getriebemotoren-Baukastens. In Variantenvielfalt
in Produkten und Prozessen. Erfahrungen, Methoden und Instrumente (pp. 77–87).
VDI-Gesellschaft Entwicklung Konstruktion Vertrieb (VDI-EKV).
bibtex: '@inproceedings{Zimmer_2001, title={Entwicklung eines Getriebemotoren-Baukastens},
booktitle={Variantenvielfalt in Produkten und Prozessen. Erfahrungen, Methoden
und Instrumente}, publisher={VDI-Gesellschaft Entwicklung Konstruktion Vertrieb
(VDI-EKV)}, author={Zimmer, Detmar}, year={2001}, pages={77–87} }'
chicago: Zimmer, Detmar. “Entwicklung Eines Getriebemotoren-Baukastens.” In Variantenvielfalt
in Produkten Und Prozessen. Erfahrungen, Methoden Und Instrumente, 77–87.
VDI-Gesellschaft Entwicklung Konstruktion Vertrieb (VDI-EKV), 2001.
ieee: D. Zimmer, “Entwicklung eines Getriebemotoren-Baukastens,” in Variantenvielfalt
in Produkten und Prozessen. Erfahrungen, Methoden und Instrumente, 2001, pp.
77–87.
mla: Zimmer, Detmar. “Entwicklung Eines Getriebemotoren-Baukastens.” Variantenvielfalt
in Produkten Und Prozessen. Erfahrungen, Methoden Und Instrumente, VDI-Gesellschaft
Entwicklung Konstruktion Vertrieb (VDI-EKV), 2001, pp. 77–87.
short: 'D. Zimmer, in: Variantenvielfalt in Produkten Und Prozessen. Erfahrungen,
Methoden Und Instrumente, VDI-Gesellschaft Entwicklung Konstruktion Vertrieb (VDI-EKV),
2001, pp. 77–87.'
date_created: 2021-06-15T11:07:55Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '9'
- _id: '146'
language:
- iso: eng
page: 77-87
publication: Variantenvielfalt in Produkten und Prozessen. Erfahrungen, Methoden und
Instrumente
publication_identifier:
isbn:
- 3-18-091645-1
publisher: VDI-Gesellschaft Entwicklung Konstruktion Vertrieb (VDI-EKV)
status: public
title: Entwicklung eines Getriebemotoren-Baukastens
type: conference
user_id: '38077'
year: '2001'
...
---
_id: '22322'
author:
- first_name: Detmar
full_name: Zimmer, Detmar
id: '604'
last_name: Zimmer
citation:
ama: Zimmer D. Kraft- oder Formschluss? SMM - Schweizer Maschinenmarkt .
2001;102(17).
apa: Zimmer, D. (2001). Kraft- oder Formschluss? SMM - Schweizer Maschinenmarkt
, 102(17).
bibtex: '@article{Zimmer_2001, title={Kraft- oder Formschluss?}, volume={102}, number={17},
journal={SMM - Schweizer Maschinenmarkt }, author={Zimmer, Detmar}, year={2001}
}'
chicago: Zimmer, Detmar. “Kraft- Oder Formschluss?” SMM - Schweizer Maschinenmarkt
102, no. 17 (2001).
ieee: D. Zimmer, “Kraft- oder Formschluss?,” SMM - Schweizer Maschinenmarkt ,
vol. 102, no. 17, 2001.
mla: Zimmer, Detmar. “Kraft- Oder Formschluss?” SMM - Schweizer Maschinenmarkt
, vol. 102, no. 17, 2001.
short: D. Zimmer, SMM - Schweizer Maschinenmarkt 102 (2001).
date_created: 2021-06-15T11:07:56Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '9'
- _id: '146'
intvolume: ' 102'
issue: '17'
language:
- iso: eng
publication: 'SMM - Schweizer Maschinenmarkt '
status: public
title: Kraft- oder Formschluss?
type: journal_article
user_id: '38077'
volume: 102
year: '2001'
...