--- _id: '2147' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.' apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).' bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39} }' chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.' ieee: 'A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.' mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.' short: 'A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.' date_created: 2018-04-03T06:16:48Z date_updated: 2022-01-06T06:55:00Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:36:17Z date_updated: 2018-04-12T08:36:17Z file_id: '2295' file_name: SODA-00.pdf file_size: 185001 relation: main_file file_date_updated: 2018-04-12T08:36:17Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 30--39 publication: SODA status: public title: 'Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma' type: conference urn: '21476' user_id: '14955' year: '2000' ... --- _id: '2148' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.' apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.' bibtex: '@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4}, journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={213--237} }' chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.' ieee: 'A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” Random Struct. Algorithms, vol. 17, no. 3–4, pp. 213--237, 2000.' mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.' short: A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237. date_created: 2018-04-03T06:17:52Z date_updated: 2022-01-06T06:55:00Z department: - _id: '79' - _id: '63' intvolume: ' 17' issue: 3-4 language: - iso: eng page: 213--237 publication: Random Struct. Algorithms status: public title: 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma' type: journal_article user_id: '14955' volume: 17 year: '2000' ... --- _id: '2149' 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. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.' apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128). bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA}, author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000}, pages={119--128} }' chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000. ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in SPAA, 2000, pp. 119--128. mla: Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128. short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.' date_created: 2018-04-03T06:18:45Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:38:13Z date_updated: 2018-04-12T08:38:13Z file_id: '2297' file_name: spaa_00.pdf file_size: 222176 relation: main_file file_date_updated: 2018-04-12T08:38:13Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 119--128 publication: SPAA status: public title: Efficient, distributed data placement strategies for storage area networks (extended abstract) type: conference urn: '21493' user_id: '14955' year: '2000' ... --- _id: '2150' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In: STOC. ACM; 2000:38--47.' apa: Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM. bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38--47} }' chicago: Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000. ieee: A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract),” in STOC, 2000, pp. 38--47. mla: Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47. short: 'A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.' date_created: 2018-04-03T06:21:11Z date_updated: 2022-01-06T06:55:02Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:49:23Z date_updated: 2018-04-12T08:49:23Z file_id: '2300' file_name: STOC-00.pdf file_size: 190083 relation: main_file file_date_updated: 2018-04-12T08:49:23Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 38--47 publication: STOC publisher: ACM status: public title: A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) type: conference urn: '21509' user_id: '14955' year: '2000' ... --- _id: '17865' abstract: - lang: eng text: We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of a three dimensional scene of triangular primitives by reconstruction from a random sample of surface points which are chosen with a probability proportional to the projected area of the objects. The approach is independent of mesh connectivity and topology. It leads to a rendering time that grows only logarithmically with the numbers of triangles in the scene and to linear memory consumption, thus allowing walkthroughs of scenes of extreme complexity. We consider different methods for image reconstruction which aim at correctness, rendering speed and image quality and we develop an efficient data structure for sample extraction in output-sensitive time which allows for efficient dynamic updates of the scene. Experiments confirm that scenes consisting of some hundred billion triangles can be rendered within seconds with an image quality comparable to a conventional z-buffer rendering; in special cases, realtime performance can be achieved. author: - first_name: Michael full_name: Wand, Michael last_name: Wand - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Wand M, Fischer M, Meyer auf der Heide F. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn; 2000. apa: Wand, M., Fischer, M., & Meyer auf der Heide, F. (2000). Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn. bibtex: '@book{Wand_Fischer_Meyer auf der Heide_2000, place={Universität Paderborn}, title={Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes}, author={Wand, Michael and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2000} }' chicago: Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000. ieee: M. Wand, M. Fischer, and F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. Universität Paderborn, 2000. mla: Wand, Michael, et al. Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes. 2000. short: M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000. date_created: 2020-08-12T13:27:52Z date_updated: 2022-01-06T06:53:21Z ddc: - '000' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: koala date_created: 2020-08-12T13:27:33Z date_updated: 2020-08-12T13:27:33Z file_id: '17866' file_name: tr-ri-00-217.pdf file_size: 921817 relation: main_file success: 1 file_date_updated: 2020-08-12T13:27:33Z has_accepted_license: '1' language: - iso: eng place: Universität Paderborn status: public title: Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes type: report user_id: '15415' year: '2000' ... --- _id: '18962' author: - first_name: Sathish full_name: Govindarajan, Sathish last_name: Govindarajan - first_name: Tamas full_name: Lukovszki, Tamas 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: 'Govindarajan S, Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Well-Separated Pair Decomposition and Applications. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS. ; 2000:585-614. doi:10.1007/s00453-005-1197-3' apa: Govindarajan, S., Lukovszki, T., Maheshwari, A., & Zeh, N. (2000). I/O-Efficient Well-Separated Pair Decomposition and Applications. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS (pp. 585–614). https://doi.org/10.1007/s00453-005-1197-3 bibtex: '@inproceedings{Govindarajan_Lukovszki_Maheshwari_Zeh_2000, title={I/O-Efficient Well-Separated Pair Decomposition and Applications}, DOI={10.1007/s00453-005-1197-3}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS}, author={Govindarajan, Sathish and Lukovszki, Tamas and Maheshwari, Anil and Zeh, Norbert}, year={2000}, pages={585–614} }' chicago: Govindarajan, Sathish, Tamas Lukovszki, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 585–614, 2000. https://doi.org/10.1007/s00453-005-1197-3. ieee: S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Well-Separated Pair Decomposition and Applications,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614. mla: Govindarajan, Sathish, et al. “I/O-Efficient Well-Separated Pair Decomposition and Applications.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614, doi:10.1007/s00453-005-1197-3. short: 'S. Govindarajan, T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS, 2000, pp. 585–614.' date_created: 2020-09-03T13:21:02Z date_updated: 2022-01-06T06:53:55Z department: - _id: '63' doi: 10.1007/s00453-005-1197-3 language: - iso: eng page: 585-614 publication: Proceedings of the 8th Annual European Symposium on Algorithms (ESA 2000), LNCS publication_identifier: issn: - 0178-4617 - 1432-0541 publication_status: published status: public title: I/O-Efficient Well-Separated Pair Decomposition and Applications type: conference user_id: '15415' year: '2000' ... --- _id: '1920' author: - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: Andreas full_name: Polze, Andreas last_name: Polze - first_name: Matthias full_name: Werner, Matthias last_name: Werner citation: ama: 'Karl H, Polze A, Werner M. Predictable Network Computing using Message-driven Scheduling. In: Proc. the Workshop on Run-Time Systems for Parallel Programming. ; 2000.' apa: Karl, H., Polze, A., & Werner, M. (2000). Predictable Network Computing using Message-driven Scheduling. In Proc. the Workshop on Run-Time Systems for Parallel Programming. bibtex: '@inproceedings{Karl_Polze_Werner_2000, title={Predictable Network Computing using Message-driven Scheduling}, booktitle={Proc. the Workshop on Run-Time Systems for Parallel Programming}, author={Karl, Holger and Polze, Andreas and Werner, Matthias}, year={2000} }' chicago: Karl, Holger, Andreas Polze, and Matthias Werner. “Predictable Network Computing Using Message-Driven Scheduling.” In Proc. the Workshop on Run-Time Systems for Parallel Programming, 2000. ieee: H. Karl, A. Polze, and M. Werner, “Predictable Network Computing using Message-driven Scheduling,” in Proc. the Workshop on Run-Time Systems for Parallel Programming, 2000. mla: Karl, Holger, et al. “Predictable Network Computing Using Message-Driven Scheduling.” Proc. the Workshop on Run-Time Systems for Parallel Programming, 2000. short: 'H. Karl, A. Polze, M. Werner, in: Proc. the Workshop on Run-Time Systems for Parallel Programming, 2000.' date_created: 2018-03-28T11:33:29Z date_updated: 2022-01-06T06:54:00Z department: - _id: '75' publication: Proc. the Workshop on Run-Time Systems for Parallel Programming status: public title: Predictable Network Computing using Message-driven Scheduling type: conference user_id: '15572' year: '2000' ... --- _id: '17990' abstract: - lang: eng text: We consider the notion of Property Testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is 'far' from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size. author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Sohler, Christian last_name: Sohler - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler citation: ama: 'Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:10.1007/3-540-45253-2_15' apa: 'Czumaj, A., Sohler, C., & Ziegler, M. (2000). Property Testing in Computational Geometry. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00) (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-45253-2_15' bibtex: '@inproceedings{Czumaj_Sohler_Ziegler_2000, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Property Testing in Computational Geometry}, volume={4698}, DOI={10.1007/3-540-45253-2_15}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)}, publisher={Springer}, author={Czumaj, Artur and Sohler, Christian and Ziegler, Martin}, year={2000}, pages={155–166}, collection={Lecture Notes in Computer Science} }' chicago: 'Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-45253-2_15.' ieee: A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), 2000, vol. 4698, pp. 155–166. mla: Czumaj, Artur, et al. “Property Testing in Computational Geometry.” Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), vol. 4698, Springer, 2000, pp. 155–66, doi:10.1007/3-540-45253-2_15. short: 'A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.' date_created: 2020-08-14T13:48:54Z date_updated: 2022-01-06T06:53:24Z department: - _id: '63' doi: 10.1007/3-540-45253-2_15 intvolume: ' 4698' language: - iso: eng page: 155-166 place: Berlin, Heidelberg publication: Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00) publication_identifier: isbn: - '9783540410041' - '9783540452539' issn: - 0302-9743 publication_status: published publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Property Testing in Computational Geometry type: conference user_id: '15415' volume: 4698 year: '2000' ... --- _id: '18146' abstract: - lang: eng text: 'Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauss Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function.' 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. Computing the Dimension of Linear Subspaces. In: SOFSEM 2000: Theory and Practice of Informatics. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:10.1007/3-540-44411-4_34' apa: 'Ziegler, M., & Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In SOFSEM 2000: Theory and Practice of Informatics (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. https://doi.org/10.1007/3-540-44411-4_34' bibtex: '@inproceedings{Ziegler_Brattka_2000, place={Berlin, Heidelberg}, title={Computing the Dimension of Linear Subspaces}, volume={1963}, DOI={10.1007/3-540-44411-4_34}, booktitle={SOFSEM 2000: Theory and Practice of Informatics}, publisher={Springer}, author={Ziegler, Martin and Brattka, Vasco}, year={2000}, pages={450–458} }' chicago: 'Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In SOFSEM 2000: Theory and Practice of Informatics, 1963:450–58. Berlin, Heidelberg: Springer, 2000. https://doi.org/10.1007/3-540-44411-4_34.' ieee: 'M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in SOFSEM 2000: Theory and Practice of Informatics, 2000, vol. 1963, pp. 450–458.' mla: 'Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” SOFSEM 2000: Theory and Practice of Informatics, vol. 1963, Springer, 2000, pp. 450–58, doi:10.1007/3-540-44411-4_34.' short: 'M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.' date_created: 2020-08-24T09:58:56Z date_updated: 2022-01-06T06:53:26Z department: - _id: '63' doi: 10.1007/3-540-44411-4_34 intvolume: ' 1963' language: - iso: eng page: 450-458 place: Berlin, Heidelberg publication: 'SOFSEM 2000: Theory and Practice of Informatics' publication_identifier: isbn: - '9783540413486' - '9783540444114' issn: - 0302-9743 publication_status: published publisher: Springer status: public title: Computing the Dimension of Linear Subspaces type: conference user_id: '15415' volume: 1963 year: '2000' ... --- _id: '18150' abstract: - lang: eng text: What is the minimum number of hyperplanes that slice all edges of the d-dimensional hypercube? The answers have been known for d<=4.
This work settles the problem for d=5 and d=6. More precisely, a computer search implies that 4 hyperplanes do not suffice for this purpose (but 5 do).
We also develop computational approaches for attacking this extremal problem from combinatorial geometry in higher dimensions. They allow us to determine for example all maximal sliceable subsets of hypercube edges up to dimension 7. author: - first_name: Martin full_name: Ziegler, Martin last_name: Ziegler - first_name: Christian full_name: Sohler, Christian last_name: Sohler citation: ama: 'Ziegler M, Sohler C. Computing Cut Numbers. In: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00). ; 2000:73-79.' apa: Ziegler, M., & Sohler, C. (2000). Computing Cut Numbers. In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00) (pp. 73–79). bibtex: '@inproceedings{Ziegler_Sohler_2000, title={Computing Cut Numbers}, booktitle={Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00)}, author={Ziegler, Martin and Sohler, Christian}, year={2000}, pages={73–79} }' chicago: Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” In Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 73–79, 2000. ieee: M. Ziegler and C. Sohler, “Computing Cut Numbers,” in Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79. mla: Ziegler, Martin, and Christian Sohler. “Computing Cut Numbers.” Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79. short: 'M. Ziegler, C. Sohler, in: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG’00), 2000, pp. 73–79.' date_created: 2020-08-24T10:10:40Z date_updated: 2022-01-06T06:53:26Z department: - _id: '63' language: - iso: eng page: 73-79 publication: Proceedings of the 12th Canadian Conference on Computational Geometry (CCCG'00) status: public title: Computing Cut Numbers type: conference user_id: '15415' year: '2000' ... --- _id: '18446' abstract: - lang: eng text: "We consider comparator networks M that are used repeatedly: while the output produced by M is not sorted, it is fed again into M. Sorting algorithms working in this way are called periodic. The number of parallel steps performed during a single run of M is called its period, the sorting time of M is the total number of parallel steps that are necessary to sort in the worst case. Periodic sorting networks have the advantage that they need little hardware (control logic, wiring, area) and that they are adaptive. We are interested in comparator networks of a constant period, due to their potential applications in hardware design.\r\n\r\nPreviously, very little was known on such networks. The fastest solutions required time O(nε) where the depth was roughly 1/ε. We introduce a general method called periodification scheme that converts automatically an arbitrary sorting network that sorts n items in time T(n) and that has layout area A(n) into a sorting network that has period 5, sorts ***(n • T(n) items in time O(T(Journal of the ACM. 2000;45:944-967. doi:10.1145/355483.355490' apa: 'Lorys, K., Wanka, R., Oesterdiekhoff, B., & Kutylowski, M. (2000). Periodification Scheme: Constructing Sorting Networks with Constant Period. Journal of the ACM, 45, 944–967. https://doi.org/10.1145/355483.355490' bibtex: '@article{Lorys_Wanka_Oesterdiekhoff_Kutylowski_2000, title={Periodification Scheme: Constructing Sorting Networks with Constant Period}, volume={45}, DOI={10.1145/355483.355490}, journal={Journal of the ACM}, author={Lorys, Krzysztof and Wanka, Rolf and Oesterdiekhoff, Brigitte and Kutylowski, Miroslaw}, year={2000}, pages={944–967} }' chicago: 'Lorys, Krzysztof, Rolf Wanka, Brigitte Oesterdiekhoff, and Miroslaw Kutylowski. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM 45 (2000): 944–67. https://doi.org/10.1145/355483.355490.' ieee: 'K. Lorys, R. Wanka, B. Oesterdiekhoff, and M. Kutylowski, “Periodification Scheme: Constructing Sorting Networks with Constant Period,” Journal of the ACM, vol. 45, pp. 944–967, 2000, doi: 10.1145/355483.355490.' mla: 'Lorys, Krzysztof, et al. “Periodification Scheme: Constructing Sorting Networks with Constant Period.” Journal of the ACM, vol. 45, 2000, pp. 944–67, doi:10.1145/355483.355490.' short: K. Lorys, R. Wanka, B. Oesterdiekhoff, M. Kutylowski, Journal of the ACM 45 (2000) 944–967. date_created: 2020-08-27T11:49:50Z date_updated: 2022-01-06T06:53:32Z department: - _id: '63' doi: 10.1145/355483.355490 intvolume: ' 45' language: - iso: eng page: 944-967 publication: Journal of the ACM status: public title: 'Periodification Scheme: Constructing Sorting Networks with Constant Period' type: journal_article user_id: '15415' volume: 45 year: '2000' ... --- _id: '2211' author: - first_name: Artur full_name: Czumaj, Artur last_name: Czumaj - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Czumaj A, Scheideler C. A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd ACM Symposium on Theory of Computing. ; 2000:38-47.' apa: Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47). bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={38–47} }' chicago: Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000. ieee: A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47. mla: Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47. short: 'A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.' date_created: 2018-04-05T07:02:46Z date_updated: 2022-01-06T06:55:26Z ddc: - '040' department: - _id: '79' - _id: '63' file: - access_level: open_access content_type: application/pdf creator: florida date_created: 2018-04-12T08:37:23Z date_updated: 2018-04-12T08:37:23Z file_id: '2296' file_name: STOC-00.pdf file_size: 190083 relation: main_file file_date_updated: 2018-04-12T08:37:23Z has_accepted_license: '1' language: - iso: eng oa: '1' page: 38-47 publication: 32nd ACM Symposium on Theory of Computing status: public title: 'A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems ' type: conference urn: '22111' user_id: '14955' year: '2000' ... --- _id: '21782' author: - first_name: Gitta full_name: Domik, Gitta id: '90' last_name: Domik citation: ama: Domik G. Do we need formal education in visualization? IEEE Computer Graphics and Applications. 2000;20(4):16-19. doi:10.1109/38.851744 apa: Domik, G. (2000). Do we need formal education in visualization? IEEE Computer Graphics and Applications, 20(4), 16–19. https://doi.org/10.1109/38.851744 bibtex: '@article{Domik_2000, title={Do we need formal education in visualization?}, volume={20}, DOI={10.1109/38.851744}, number={4}, journal={IEEE Computer Graphics and Applications}, publisher={IEEE}, author={Domik, Gitta}, year={2000}, pages={16–19} }' chicago: 'Domik, Gitta. “Do We Need Formal Education in Visualization?” IEEE Computer Graphics and Applications 20, no. 4 (2000): 16–19. https://doi.org/10.1109/38.851744.' ieee: G. Domik, “Do we need formal education in visualization?,” IEEE Computer Graphics and Applications, vol. 20, no. 4, pp. 16–19, 2000. mla: Domik, Gitta. “Do We Need Formal Education in Visualization?” IEEE Computer Graphics and Applications, vol. 20, no. 4, IEEE, 2000, pp. 16–19, doi:10.1109/38.851744. short: G. Domik, IEEE Computer Graphics and Applications 20 (2000) 16–19. date_created: 2021-04-25T17:29:44Z date_updated: 2022-01-06T06:55:13Z department: - _id: '65' doi: 10.1109/38.851744 intvolume: ' 20' issue: '4' language: - iso: eng page: 16-19 publication: IEEE Computer Graphics and Applications publisher: IEEE status: public title: Do we need formal education in visualization? type: journal_article user_id: '14955' volume: 20 year: '2000' ... --- _id: '21783' author: - first_name: Sabine full_name: Volbracht, Sabine last_name: Volbracht - first_name: Gitta full_name: Domik, Gitta id: '90' last_name: Domik citation: ama: 'Volbracht S, Domik G. Developing Effective Navigation Techniques in Virtual 3D Environments. In: Mulder J, van Liere R, eds. Virtual Environments 2000. Vienna: Springer Vienna; 2000:55-64.' apa: 'Volbracht, S., & Domik, G. (2000). Developing Effective Navigation Techniques in Virtual 3D Environments. In J. Mulder & R. van Liere (Eds.), Virtual Environments 2000 (pp. 55–64). Vienna: Springer Vienna.' bibtex: '@inproceedings{Volbracht_Domik_2000, place={Vienna}, title={Developing Effective Navigation Techniques in Virtual 3D Environments}, booktitle={Virtual Environments 2000}, publisher={Springer Vienna}, author={Volbracht, Sabine and Domik, Gitta}, editor={Mulder, Jurriaan and van Liere, RobertEditors}, year={2000}, pages={55–64} }' chicago: 'Volbracht, Sabine, and Gitta Domik. “Developing Effective Navigation Techniques in Virtual 3D Environments.” In Virtual Environments 2000, edited by Jurriaan Mulder and Robert van Liere, 55–64. Vienna: Springer Vienna, 2000.' ieee: S. Volbracht and G. Domik, “Developing Effective Navigation Techniques in Virtual 3D Environments,” in Virtual Environments 2000, 2000, pp. 55–64. mla: Volbracht, Sabine, and Gitta Domik. “Developing Effective Navigation Techniques in Virtual 3D Environments.” Virtual Environments 2000, edited by Jurriaan Mulder and Robert van Liere, Springer Vienna, 2000, pp. 55–64. short: 'S. Volbracht, G. Domik, in: J. Mulder, R. van Liere (Eds.), Virtual Environments 2000, Springer Vienna, Vienna, 2000, pp. 55–64.' date_created: 2021-04-25T17:29:45Z date_updated: 2022-01-06T06:55:13Z department: - _id: '65' editor: - first_name: Jurriaan full_name: Mulder, Jurriaan last_name: Mulder - first_name: Robert full_name: van Liere, Robert last_name: van Liere language: - iso: eng page: 55-64 place: Vienna publication: Virtual Environments 2000 publication_identifier: isbn: - 978-3-7091-6785-4 publisher: Springer Vienna status: public title: Developing Effective Navigation Techniques in Virtual 3D Environments type: conference user_id: '14955' year: '2000' ... --- _id: '7790' citation: ama: 'Ehrig H, Engels G, Kreowksi H-J, Taentzer G, eds. Special Issue: Selected Papers of GRATRA 2000. Vol 44. Amsterdam, The Netherlands: Elsevier; 2000.' apa: 'Ehrig, H., Engels, G., Kreowksi, H.-J., & Taentzer, G. (Eds.). (2000). Special Issue: Selected Papers of GRATRA 2000 (Vol. 44). Amsterdam, The Netherlands: Elsevier.' bibtex: '@book{Ehrig_Engels_Kreowksi_Taentzer_2000, place={Amsterdam, The Netherlands}, series={Science of Computer Programming}, title={Special Issue: Selected Papers of GRATRA 2000}, volume={44}, number={2}, publisher={Elsevier}, year={2000}, collection={Science of Computer Programming} }' chicago: 'Ehrig, Hartmut, Gregor Engels, H.-J. Kreowksi, and Gabriele Taentzer, eds. Special Issue: Selected Papers of GRATRA 2000. Vol. 44. Science of Computer Programming. Amsterdam, The Netherlands: Elsevier, 2000.' ieee: 'H. Ehrig, G. Engels, H.-J. Kreowksi, and G. Taentzer, Eds., Special Issue: Selected Papers of GRATRA 2000, vol. 44, no. 2. Amsterdam, The Netherlands: Elsevier, 2000.' mla: 'Ehrig, Hartmut, et al., editors. Special Issue: Selected Papers of GRATRA 2000. Vol. 44, no. 2, Elsevier, 2000.' short: 'H. Ehrig, G. Engels, H.-J. Kreowksi, G. Taentzer, eds., Special Issue: Selected Papers of GRATRA 2000, Elsevier, Amsterdam, The Netherlands, 2000.' date_created: 2019-02-19T19:12:26Z date_updated: 2022-01-06T07:03:46Z department: - _id: '66' editor: - first_name: Hartmut full_name: Ehrig, Hartmut last_name: Ehrig - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: H.-J. full_name: Kreowksi, H.-J. last_name: Kreowksi - first_name: Gabriele full_name: Taentzer, Gabriele last_name: Taentzer intvolume: ' 44' issue: '2' language: - iso: eng place: Amsterdam, The Netherlands publisher: Elsevier series_title: Science of Computer Programming status: public title: 'Special Issue: Selected Papers of GRATRA 2000' type: conference_editor user_id: '52534' volume: 44 year: '2000' ... --- _id: '7791' citation: ama: 'Rolim JDP, Broder AZ, Corradini A, et al., eds. Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland). Waterloo, Ontario, Canada: Carleton Scientific; 2000.' apa: 'Rolim, J. D. P., Broder, A. Z., Corradini, A., Gorrieri, R., Heckel, R., Hromkovic, J., … Wells, J. B. (Eds.). (2000). Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland). Waterloo, Ontario, Canada: Carleton Scientific.' bibtex: '@book{Rolim_Broder_Corradini_Gorrieri_Heckel_Hromkovic_Vaccaro_Wells_2000, place={Waterloo, Ontario, Canada}, title={Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland)}, publisher={Carleton Scientific}, year={2000} }' chicago: 'Rolim, J.D.P., A.Z. Broder, A. Corradini, R. Gorrieri, R. Heckel, J. Hromkovic, U. Vaccaro, and J.B. Wells, eds. Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland). Waterloo, Ontario, Canada: Carleton Scientific, 2000.' ieee: 'J. D. P. Rolim et al., Eds., Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland). Waterloo, Ontario, Canada: Carleton Scientific, 2000.' mla: Rolim, J. D. P., et al., editors. Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland). Carleton Scientific, 2000. short: J.D.P. Rolim, A.Z. Broder, A. Corradini, R. Gorrieri, R. Heckel, J. Hromkovic, U. Vaccaro, J.B. Wells, eds., Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland), Carleton Scientific, Waterloo, Ontario, Canada, 2000. date_created: 2019-02-19T19:12:55Z date_updated: 2022-01-06T07:03:46Z department: - _id: '66' editor: - first_name: J.D.P. full_name: Rolim, J.D.P. last_name: Rolim - first_name: A.Z. full_name: Broder, A.Z. last_name: Broder - first_name: A. full_name: Corradini, A. last_name: Corradini - first_name: R. full_name: Gorrieri, R. last_name: Gorrieri - first_name: R. full_name: Heckel, R. last_name: Heckel - first_name: J. full_name: Hromkovic, J. last_name: Hromkovic - first_name: U. full_name: Vaccaro, U. last_name: Vaccaro - first_name: J.B. full_name: Wells, J.B. last_name: Wells language: - iso: eng place: Waterloo, Ontario, Canada publisher: Carleton Scientific status: public title: Workshop on Graph Transformation and Visual Modeling Techniques (ICALP 2000, Geneva, Switzerland) type: conference_editor user_id: '52534' year: '2000' ... --- _id: '7861' author: - first_name: Marc full_name: Lohmann, Marc last_name: Lohmann - first_name: Annika full_name: Wagner, Annika last_name: Wagner citation: ama: 'Lohmann M, Wagner A. Konzeption eines XML-fähigen Mailtools. In: Proceedings of Net.Object Days 2000, Erfurt (Germany). ; 2000.' apa: Lohmann, M., & Wagner, A. (2000). Konzeption eines XML-fähigen Mailtools. In Proceedings of Net.Object Days 2000, Erfurt (Germany). bibtex: '@inproceedings{Lohmann_Wagner_2000, title={Konzeption eines XML-fähigen Mailtools}, booktitle={Proceedings of Net.Object Days 2000, Erfurt (Germany)}, author={Lohmann, Marc and Wagner, Annika}, year={2000} }' chicago: Lohmann, Marc, and Annika Wagner. “Konzeption Eines XML-Fähigen Mailtools.” In Proceedings of Net.Object Days 2000, Erfurt (Germany), 2000. ieee: M. Lohmann and A. Wagner, “Konzeption eines XML-fähigen Mailtools,” in Proceedings of Net.Object Days 2000, Erfurt (Germany), 2000. mla: Lohmann, Marc, and Annika Wagner. “Konzeption Eines XML-Fähigen Mailtools.” Proceedings of Net.Object Days 2000, Erfurt (Germany), 2000. short: 'M. Lohmann, A. Wagner, in: Proceedings of Net.Object Days 2000, Erfurt (Germany), 2000.' date_created: 2019-02-20T14:44:50Z date_updated: 2022-01-06T07:03:47Z department: - _id: '66' language: - iso: eng publication: Proceedings of Net.Object Days 2000, Erfurt (Germany) status: public title: Konzeption eines XML-fähigen Mailtools type: conference user_id: '52534' year: '2000' ... --- _id: '7862' author: - first_name: Sebastian full_name: Thöne, Sebastian last_name: Thöne citation: ama: 'Thöne S. Entwicklung eines Übersetzers von Nachrichtenaustauschformaten für Bankselbstbedienungssysteme in XML-Formate. In: Proceedings of the Informatiktage 2000, Bad Schussenried (Germany). Leinfelden - Echterdingen: Konradin-Verlag; 2000.' apa: 'Thöne, S. (2000). Entwicklung eines Übersetzers von Nachrichtenaustauschformaten für Bankselbstbedienungssysteme in XML-Formate. In Proceedings of the Informatiktage 2000, Bad Schussenried (Germany). Leinfelden - Echterdingen: Konradin-Verlag.' bibtex: '@inproceedings{Thöne_2000, place={Leinfelden - Echterdingen}, title={Entwicklung eines Übersetzers von Nachrichtenaustauschformaten für Bankselbstbedienungssysteme in XML-Formate}, booktitle={Proceedings of the Informatiktage 2000, Bad Schussenried (Germany)}, publisher={Konradin-Verlag}, author={Thöne, Sebastian}, year={2000} }' chicago: 'Thöne, Sebastian. “Entwicklung Eines Übersetzers von Nachrichtenaustauschformaten Für Bankselbstbedienungssysteme in XML-Formate.” In Proceedings of the Informatiktage 2000, Bad Schussenried (Germany). Leinfelden - Echterdingen: Konradin-Verlag, 2000.' ieee: S. Thöne, “Entwicklung eines Übersetzers von Nachrichtenaustauschformaten für Bankselbstbedienungssysteme in XML-Formate,” in Proceedings of the Informatiktage 2000, Bad Schussenried (Germany), 2000. mla: Thöne, Sebastian. “Entwicklung Eines Übersetzers von Nachrichtenaustauschformaten Für Bankselbstbedienungssysteme in XML-Formate.” Proceedings of the Informatiktage 2000, Bad Schussenried (Germany), Konradin-Verlag, 2000. short: 'S. Thöne, in: Proceedings of the Informatiktage 2000, Bad Schussenried (Germany), Konradin-Verlag, Leinfelden - Echterdingen, 2000.' date_created: 2019-02-20T14:45:38Z date_updated: 2022-01-06T07:03:47Z department: - _id: '66' language: - iso: eng place: Leinfelden - Echterdingen publication: Proceedings of the Informatiktage 2000, Bad Schussenried (Germany) publisher: Konradin-Verlag status: public title: Entwicklung eines Übersetzers von Nachrichtenaustauschformaten für Bankselbstbedienungssysteme in XML-Formate type: conference user_id: '52534' year: '2000' ... --- _id: '7863' author: - first_name: Alexey full_name: Cherchago, Alexey last_name: Cherchago - first_name: N. full_name: Alexandrova, N. last_name: Alexandrova citation: ama: 'Cherchago A, Alexandrova N. A Model of a Physician’s Decision-Making Process using Electropunctural Methods of Diagnostics. In: Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia). ; 2000.' apa: Cherchago, A., & Alexandrova, N. (2000). A Model of a Physician’s Decision-Making Process using Electropunctural Methods of Diagnostics. In Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia). bibtex: '@inproceedings{Cherchago_Alexandrova_2000, title={A Model of a Physician’s Decision-Making Process using Electropunctural Methods of Diagnostics}, booktitle={Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia)}, author={Cherchago, Alexey and Alexandrova, N.}, year={2000} }' chicago: Cherchago, Alexey, and N. Alexandrova. “A Model of a Physician’s Decision-Making Process Using Electropunctural Methods of Diagnostics.” In Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia), 2000. ieee: A. Cherchago and N. Alexandrova, “A Model of a Physician’s Decision-Making Process using Electropunctural Methods of Diagnostics,” in Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia), 2000. mla: Cherchago, Alexey, and N. Alexandrova. “A Model of a Physician’s Decision-Making Process Using Electropunctural Methods of Diagnostics.” Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia), 2000. short: 'A. Cherchago, N. Alexandrova, in: Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia), 2000.' date_created: 2019-02-20T14:46:59Z date_updated: 2022-01-06T07:03:47Z department: - _id: '66' language: - iso: eng publication: Proceedings of the All-Russia Students, Young Scientists and Specialists Scientific and Technical Conference on Biotechnical, Medical and Environmental Systems and Complexes (Ryazan, Russia) status: public title: A Model of a Physician’s Decision-Making Process using Electropunctural Methods of Diagnostics type: conference user_id: '52534' year: '2000' ... --- _id: '7864' author: - first_name: Ralph full_name: Depke, Ralph last_name: Depke - first_name: Matthew full_name: Langham, Matthew last_name: Langham - 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: 'Depke R, Langham M, Lütkemeier B, Thöne S. Ein Konzept zur Generierung von XSL-Transformationen und dessen Anwendung bei Bankselbstbedienungssystemen. In: Proceedings of the Net.ObjectDays (2000), Erfurt (Germany). ; 2000.' apa: Depke, R., Langham, M., Lütkemeier, B., & Thöne, S. (2000). Ein Konzept zur Generierung von XSL-Transformationen und dessen Anwendung bei Bankselbstbedienungssystemen. In Proceedings of the Net.ObjectDays (2000), Erfurt (Germany). bibtex: '@inproceedings{Depke_Langham_Lütkemeier_Thöne_2000, title={Ein Konzept zur Generierung von XSL-Transformationen und dessen Anwendung bei Bankselbstbedienungssystemen}, booktitle={Proceedings of the Net.ObjectDays (2000), Erfurt (Germany)}, author={Depke, Ralph and Langham, Matthew and Lütkemeier, Björn and Thöne, Sebastian}, year={2000} }' chicago: Depke, Ralph, Matthew Langham, Björn Lütkemeier, and Sebastian Thöne. “Ein Konzept Zur Generierung von XSL-Transformationen Und Dessen Anwendung Bei Bankselbstbedienungssystemen.” In Proceedings of the Net.ObjectDays (2000), Erfurt (Germany), 2000. ieee: R. Depke, M. Langham, B. Lütkemeier, and S. Thöne, “Ein Konzept zur Generierung von XSL-Transformationen und dessen Anwendung bei Bankselbstbedienungssystemen,” in Proceedings of the Net.ObjectDays (2000), Erfurt (Germany), 2000. mla: Depke, Ralph, et al. “Ein Konzept Zur Generierung von XSL-Transformationen Und Dessen Anwendung Bei Bankselbstbedienungssystemen.” Proceedings of the Net.ObjectDays (2000), Erfurt (Germany), 2000. short: 'R. Depke, M. Langham, B. Lütkemeier, S. Thöne, in: Proceedings of the Net.ObjectDays (2000), Erfurt (Germany), 2000.' date_created: 2019-02-20T14:47:33Z date_updated: 2022-01-06T07:03:47Z department: - _id: '66' language: - iso: eng publication: Proceedings of the Net.ObjectDays (2000), Erfurt (Germany) status: public title: Ein Konzept zur Generierung von XSL-Transformationen und dessen Anwendung bei Bankselbstbedienungssystemen type: conference user_id: '52534' year: '2000' ...