--- _id: '64536' author: - first_name: Nils Christopher full_name: Gerhardt, Nils Christopher id: '115298' last_name: Gerhardt orcid: 0009-0002-5538-231X - first_name: Stephan full_name: Hövel, Stephan last_name: Hövel - first_name: Carsten full_name: Brenner, Carsten last_name: Brenner - first_name: Martin full_name: Hofmann, Martin last_name: Hofmann - first_name: Dirk full_name: Reuter, Dirk last_name: Reuter - first_name: Andreas full_name: Wieck, Andreas last_name: Wieck - first_name: Junling full_name: Yang, Junling last_name: Yang citation: ama: 'Gerhardt NC, Hövel S, Brenner C, et al. Spin-controlled LEDs and VCSELs. In: Physics and Simulation of Optoelectronic Devices XIII. ; 2005:221-229. doi:10.1117/12.590346' apa: Gerhardt, N. C., Hövel, S., Brenner, C., Hofmann, M., Reuter, D., Wieck, A., & Yang, J. (2005). Spin-controlled LEDs and VCSELs. Physics and Simulation of Optoelectronic Devices XIII, 221–229. https://doi.org/10.1117/12.590346 bibtex: '@inproceedings{Gerhardt_Hövel_Brenner_Hofmann_Reuter_Wieck_Yang_2005, title={Spin-controlled LEDs and VCSELs}, DOI={10.1117/12.590346}, booktitle={Physics and simulation of optoelectronic devices XIII}, author={Gerhardt, Nils Christopher and Hövel, Stephan and Brenner, Carsten and Hofmann, Martin and Reuter, Dirk and Wieck, Andreas and Yang, Junling}, year={2005}, pages={221–229} }' chicago: Gerhardt, Nils Christopher, Stephan Hövel, Carsten Brenner, Martin Hofmann, Dirk Reuter, Andreas Wieck, and Junling Yang. “Spin-Controlled LEDs and VCSELs.” In Physics and Simulation of Optoelectronic Devices XIII, 221–29, 2005. https://doi.org/10.1117/12.590346. ieee: 'N. C. Gerhardt et al., “Spin-controlled LEDs and VCSELs,” in Physics and simulation of optoelectronic devices XIII, 2005, pp. 221–229, doi: 10.1117/12.590346.' mla: Gerhardt, Nils Christopher, et al. “Spin-Controlled LEDs and VCSELs.” Physics and Simulation of Optoelectronic Devices XIII, 2005, pp. 221–29, doi:10.1117/12.590346. short: 'N.C. Gerhardt, S. Hövel, C. Brenner, M. Hofmann, D. Reuter, A. Wieck, J. Yang, in: Physics and Simulation of Optoelectronic Devices XIII, 2005, pp. 221–229.' date_created: 2026-02-20T10:04:33Z date_updated: 2026-02-23T11:25:40Z department: - _id: '977' doi: 10.1117/12.590346 language: - iso: eng page: 221 - 229 publication: Physics and simulation of optoelectronic devices XIII status: public title: Spin-controlled LEDs and VCSELs type: conference user_id: '15911' year: '2005' ... --- _id: '64535' author: - first_name: Nils Christopher full_name: Gerhardt, Nils Christopher id: '115298' last_name: Gerhardt orcid: 0009-0002-5538-231X - first_name: Stephan full_name: Hövel, Stephan last_name: Hövel - first_name: Carsten full_name: Brenner, Carsten last_name: Brenner - first_name: Martin full_name: Hofmann, Martin last_name: Hofmann - first_name: Fang-Yuh full_name: Lo, Fang-Yuh last_name: Lo - first_name: Dirk full_name: Reuter, Dirk last_name: Reuter - first_name: Andreas full_name: Wieck, Andreas last_name: Wieck - first_name: Kurt full_name: Westerholt, Kurt last_name: Westerholt - first_name: Ellen Ursula full_name: Schuster, Ellen Ursula last_name: Schuster - first_name: Werner full_name: Keune, Werner last_name: Keune citation: ama: Gerhardt NC, Hövel S, Brenner C, et al. Electron spin injection into GaAs from ferromagnetic contacts in remanence. Applied physics letters. 2005;87(3):1-3. doi:10.1063/1.1996843 apa: Gerhardt, N. C., Hövel, S., Brenner, C., Hofmann, M., Lo, F.-Y., Reuter, D., Wieck, A., Westerholt, K., Schuster, E. U., & Keune, W. (2005). Electron spin injection into GaAs from ferromagnetic contacts in remanence. Applied Physics Letters, 87(3), 1–3. https://doi.org/10.1063/1.1996843 bibtex: '@article{Gerhardt_Hövel_Brenner_Hofmann_Lo_Reuter_Wieck_Westerholt_Schuster_Keune_2005, title={Electron spin injection into GaAs from ferromagnetic contacts in remanence}, volume={87}, DOI={10.1063/1.1996843}, number={3}, journal={Applied physics letters}, author={Gerhardt, Nils Christopher and Hövel, Stephan and Brenner, Carsten and Hofmann, Martin and Lo, Fang-Yuh and Reuter, Dirk and Wieck, Andreas and Westerholt, Kurt and Schuster, Ellen Ursula and Keune, Werner}, year={2005}, pages={1–3} }' chicago: 'Gerhardt, Nils Christopher, Stephan Hövel, Carsten Brenner, Martin Hofmann, Fang-Yuh Lo, Dirk Reuter, Andreas Wieck, Kurt Westerholt, Ellen Ursula Schuster, and Werner Keune. “Electron Spin Injection into GaAs from Ferromagnetic Contacts in Remanence.” Applied Physics Letters 87, no. 3 (2005): 1–3. https://doi.org/10.1063/1.1996843.' ieee: 'N. C. Gerhardt et al., “Electron spin injection into GaAs from ferromagnetic contacts in remanence,” Applied physics letters, vol. 87, no. 3, pp. 1–3, 2005, doi: 10.1063/1.1996843.' mla: Gerhardt, Nils Christopher, et al. “Electron Spin Injection into GaAs from Ferromagnetic Contacts in Remanence.” Applied Physics Letters, vol. 87, no. 3, 2005, pp. 1–3, doi:10.1063/1.1996843. short: N.C. Gerhardt, S. Hövel, C. Brenner, M. Hofmann, F.-Y. Lo, D. Reuter, A. Wieck, K. Westerholt, E.U. Schuster, W. Keune, Applied Physics Letters 87 (2005) 1–3. date_created: 2026-02-20T10:04:32Z date_updated: 2026-02-23T13:14:06Z department: - _id: '977' doi: 10.1063/1.1996843 intvolume: ' 87' issue: '3' language: - iso: eng page: 1 - 3 publication: Applied physics letters status: public title: Electron spin injection into GaAs from ferromagnetic contacts in remanence type: journal_article user_id: '15911' volume: 87 year: '2005' ... --- _id: '64741' author: - first_name: Helge full_name: Glöckner, Helge id: '178' last_name: Glöckner citation: ama: Glöckner H. Finite order differentiability properties, fixed points and implicit functions over valued fields. Published online 2005. apa: Glöckner, H. (2005). Finite order differentiability properties, fixed points and implicit functions over valued fields. bibtex: '@article{Glöckner_2005, title={Finite order differentiability properties, fixed points and implicit functions over valued fields}, author={Glöckner, Helge}, year={2005} }' chicago: Glöckner, Helge. “Finite Order Differentiability Properties, Fixed Points and Implicit Functions over Valued Fields,” 2005. ieee: H. Glöckner, “Finite order differentiability properties, fixed points and implicit functions over valued fields.” 2005. mla: Glöckner, Helge. Finite Order Differentiability Properties, Fixed Points and Implicit Functions over Valued Fields. 2005. short: H. Glöckner, (2005). date_created: 2026-02-26T19:49:56Z date_updated: 2026-02-26T19:50:04Z department: - _id: '10' - _id: '87' - _id: '93' extern: '1' external_id: arxiv: - arXiv:math/0511218 language: - iso: eng status: public title: Finite order differentiability properties, fixed points and implicit functions over valued fields type: preprint user_id: '178' year: '2005' ... --- _id: '64700' article_type: original author: - first_name: Helge full_name: Glöckner, Helge id: '178' last_name: Glöckner citation: ama: Glöckner H. Hölder continuous homomorphisms between infinite-dimensional Lie groups are smooth. Journal of Functional Analysis. 2005;228(2):419–444. doi:10.1016/j.jfa.2005.06.023 apa: Glöckner, H. (2005). Hölder continuous homomorphisms between infinite-dimensional Lie groups are smooth. Journal of Functional Analysis, 228(2), 419–444. https://doi.org/10.1016/j.jfa.2005.06.023 bibtex: '@article{Glöckner_2005, title={Hölder continuous homomorphisms between infinite-dimensional Lie groups are smooth}, volume={228}, DOI={10.1016/j.jfa.2005.06.023}, number={2}, journal={Journal of Functional Analysis}, author={Glöckner, Helge}, year={2005}, pages={419–444} }' chicago: 'Glöckner, Helge. “Hölder Continuous Homomorphisms between Infinite-Dimensional Lie Groups Are Smooth.” Journal of Functional Analysis 228, no. 2 (2005): 419–444. https://doi.org/10.1016/j.jfa.2005.06.023.' ieee: 'H. Glöckner, “Hölder continuous homomorphisms between infinite-dimensional Lie groups are smooth,” Journal of Functional Analysis, vol. 228, no. 2, pp. 419–444, 2005, doi: 10.1016/j.jfa.2005.06.023.' mla: Glöckner, Helge. “Hölder Continuous Homomorphisms between Infinite-Dimensional Lie Groups Are Smooth.” Journal of Functional Analysis, vol. 228, no. 2, 2005, pp. 419–444, doi:10.1016/j.jfa.2005.06.023. short: H. Glöckner, Journal of Functional Analysis 228 (2005) 419–444. date_created: 2026-02-26T12:01:38Z date_updated: 2026-02-27T07:56:38Z department: - _id: '10' - _id: '87' - _id: '93' doi: 10.1016/j.jfa.2005.06.023 extern: '1' intvolume: ' 228' issue: '2' keyword: - '22E65' - '22E35' - '26E15' - '26E20' - '26E30' - 46S10 - 46T20 - 58C20 language: - iso: eng page: 419–444 publication: Journal of Functional Analysis publication_identifier: issn: - 0022-1236 quality_controlled: '1' status: public title: Hölder continuous homomorphisms between infinite-dimensional Lie groups are smooth type: journal_article user_id: '178' volume: 228 year: '2005' ... --- _id: '64702' article_type: original author: - first_name: Helge full_name: Glöckner, Helge id: '178' last_name: Glöckner citation: ama: Glöckner H. Conveniently Hölder homomorphisms are smooth in the convenient sense. Annals of Global Analysis and Geometry. 2005;27(3):227–255. doi:10.1007/s10455-005-0040-z apa: Glöckner, H. (2005). Conveniently Hölder homomorphisms are smooth in the convenient sense. Annals of Global Analysis and Geometry, 27(3), 227–255. https://doi.org/10.1007/s10455-005-0040-z bibtex: '@article{Glöckner_2005, title={Conveniently Hölder homomorphisms are smooth in the convenient sense}, volume={27}, DOI={10.1007/s10455-005-0040-z}, number={3}, journal={Annals of Global Analysis and Geometry}, author={Glöckner, Helge}, year={2005}, pages={227–255} }' chicago: 'Glöckner, Helge. “Conveniently Hölder Homomorphisms Are Smooth in the Convenient Sense.” Annals of Global Analysis and Geometry 27, no. 3 (2005): 227–255. https://doi.org/10.1007/s10455-005-0040-z.' ieee: 'H. Glöckner, “Conveniently Hölder homomorphisms are smooth in the convenient sense,” Annals of Global Analysis and Geometry, vol. 27, no. 3, pp. 227–255, 2005, doi: 10.1007/s10455-005-0040-z.' mla: Glöckner, Helge. “Conveniently Hölder Homomorphisms Are Smooth in the Convenient Sense.” Annals of Global Analysis and Geometry, vol. 27, no. 3, 2005, pp. 227–255, doi:10.1007/s10455-005-0040-z. short: H. Glöckner, Annals of Global Analysis and Geometry 27 (2005) 227–255. date_created: 2026-02-26T12:04:07Z date_updated: 2026-02-27T07:55:39Z department: - _id: '10' - _id: '87' - _id: '93' doi: 10.1007/s10455-005-0040-z extern: '1' intvolume: ' 27' issue: '3' keyword: - '22E65' - '26E15' - '26E20' - 46T20 - 58C20 language: - iso: eng page: 227–255 publication: Annals of Global Analysis and Geometry publication_identifier: issn: - 0232-704X quality_controlled: '1' status: public title: Conveniently Hölder homomorphisms are smooth in the convenient sense type: journal_article user_id: '178' volume: 27 year: '2005' ... --- _id: '64704' article_type: original author: - first_name: Helge full_name: Glöckner, Helge id: '178' last_name: Glöckner citation: ama: Glöckner H. Smooth Lie groups over local fields of positive characteristic need not be analytic. Journal of Algebra. 2005;285(1):356–371. doi:10.1016/j.jalgebra.2004.11.018 apa: Glöckner, H. (2005). Smooth Lie groups over local fields of positive characteristic need not be analytic. Journal of Algebra, 285(1), 356–371. https://doi.org/10.1016/j.jalgebra.2004.11.018 bibtex: '@article{Glöckner_2005, title={Smooth Lie groups over local fields of positive characteristic need not be analytic}, volume={285}, DOI={10.1016/j.jalgebra.2004.11.018}, number={1}, journal={Journal of Algebra}, author={Glöckner, Helge}, year={2005}, pages={356–371} }' chicago: 'Glöckner, Helge. “Smooth Lie Groups over Local Fields of Positive Characteristic Need Not Be Analytic.” Journal of Algebra 285, no. 1 (2005): 356–371. https://doi.org/10.1016/j.jalgebra.2004.11.018.' ieee: 'H. Glöckner, “Smooth Lie groups over local fields of positive characteristic need not be analytic,” Journal of Algebra, vol. 285, no. 1, pp. 356–371, 2005, doi: 10.1016/j.jalgebra.2004.11.018.' mla: Glöckner, Helge. “Smooth Lie Groups over Local Fields of Positive Characteristic Need Not Be Analytic.” Journal of Algebra, vol. 285, no. 1, 2005, pp. 356–371, doi:10.1016/j.jalgebra.2004.11.018. short: H. Glöckner, Journal of Algebra 285 (2005) 356–371. date_created: 2026-02-26T12:06:51Z date_updated: 2026-02-27T07:54:32Z department: - _id: '10' - _id: '87' - _id: '93' doi: 10.1016/j.jalgebra.2004.11.018 extern: '1' intvolume: ' 285' issue: '1' keyword: - '22E50' language: - iso: eng page: 356–371 publication: Journal of Algebra publication_identifier: issn: - 0021-8693 quality_controlled: '1' status: public title: Smooth Lie groups over local fields of positive characteristic need not be analytic type: journal_article user_id: '178' volume: 285 year: '2005' ... --- _id: '64701' article_type: original author: - first_name: Helge full_name: Glöckner, Helge id: '178' last_name: Glöckner citation: ama: Glöckner H. Contraction groups for tidy automorphisms of totally disconnected groups. Glasgow Mathematical Journal. 2005;47(2):329–333. doi:10.1017/S0017089505002557 apa: Glöckner, H. (2005). Contraction groups for tidy automorphisms of totally disconnected groups. Glasgow Mathematical Journal, 47(2), 329–333. https://doi.org/10.1017/S0017089505002557 bibtex: '@article{Glöckner_2005, title={Contraction groups for tidy automorphisms of totally disconnected groups}, volume={47}, DOI={10.1017/S0017089505002557}, number={2}, journal={Glasgow Mathematical Journal}, author={Glöckner, Helge}, year={2005}, pages={329–333} }' chicago: 'Glöckner, Helge. “Contraction Groups for Tidy Automorphisms of Totally Disconnected Groups.” Glasgow Mathematical Journal 47, no. 2 (2005): 329–333. https://doi.org/10.1017/S0017089505002557.' ieee: 'H. Glöckner, “Contraction groups for tidy automorphisms of totally disconnected groups,” Glasgow Mathematical Journal, vol. 47, no. 2, pp. 329–333, 2005, doi: 10.1017/S0017089505002557.' mla: Glöckner, Helge. “Contraction Groups for Tidy Automorphisms of Totally Disconnected Groups.” Glasgow Mathematical Journal, vol. 47, no. 2, 2005, pp. 329–333, doi:10.1017/S0017089505002557. short: H. Glöckner, Glasgow Mathematical Journal 47 (2005) 329–333. date_created: 2026-02-26T12:02:52Z date_updated: 2026-02-27T07:56:02Z department: - _id: '10' - _id: '87' - _id: '93' doi: 10.1017/S0017089505002557 extern: '1' intvolume: ' 47' issue: '2' keyword: - 22D05 - 22D40 - 22D45 language: - iso: eng page: 329–333 publication: Glasgow Mathematical Journal publication_identifier: issn: - 0017-0895 quality_controlled: '1' status: public title: Contraction groups for tidy automorphisms of totally disconnected groups type: journal_article user_id: '178' volume: 47 year: '2005' ... --- _id: '64703' article_type: original author: - first_name: Helge full_name: Glöckner, Helge id: '178' last_name: Glöckner citation: ama: Glöckner H. Diff(R^n) as a Milnor-Lie group. Mathematische Nachrichten. 2005;278(9):1025–1032. doi:10.1002/mana.200310288 apa: Glöckner, H. (2005). Diff(R^n) as a Milnor-Lie group. Mathematische Nachrichten, 278(9), 1025–1032. https://doi.org/10.1002/mana.200310288 bibtex: '@article{Glöckner_2005, title={Diff(R^n) as a Milnor-Lie group}, volume={278}, DOI={10.1002/mana.200310288}, number={9}, journal={Mathematische Nachrichten}, author={Glöckner, Helge}, year={2005}, pages={1025–1032} }' chicago: 'Glöckner, Helge. “Diff(R^n) as a Milnor-Lie Group.” Mathematische Nachrichten 278, no. 9 (2005): 1025–1032. https://doi.org/10.1002/mana.200310288.' ieee: 'H. Glöckner, “Diff(R^n) as a Milnor-Lie group,” Mathematische Nachrichten, vol. 278, no. 9, pp. 1025–1032, 2005, doi: 10.1002/mana.200310288.' mla: Glöckner, Helge. “Diff(R^n) as a Milnor-Lie Group.” Mathematische Nachrichten, vol. 278, no. 9, 2005, pp. 1025–1032, doi:10.1002/mana.200310288. short: H. Glöckner, Mathematische Nachrichten 278 (2005) 1025–1032. date_created: 2026-02-26T12:05:15Z date_updated: 2026-02-27T07:55:01Z department: - _id: '10' - _id: '87' - _id: '93' doi: 10.1002/mana.200310288 extern: '1' intvolume: ' 278' issue: '9' keyword: - 58D05 - '22E65' - 46F05 - 46T20 language: - iso: eng page: 1025–1032 publication: Mathematische Nachrichten publication_identifier: issn: - 0025-584X quality_controlled: '1' status: public title: Diff(R^n) as a Milnor-Lie group type: journal_article user_id: '178' volume: 278 year: '2005' ... --- _id: '64699' article_type: original author: - first_name: Helge full_name: Glöckner, Helge id: '178' last_name: Glöckner citation: ama: Glöckner H. Fundamentals of direct limit Lie theory. Compositio Mathematica. 2005;141(6):1551–1577. doi:10.1112/S0010437X05001491 apa: Glöckner, H. (2005). Fundamentals of direct limit Lie theory. Compositio Mathematica, 141(6), 1551–1577. https://doi.org/10.1112/S0010437X05001491 bibtex: '@article{Glöckner_2005, title={Fundamentals of direct limit Lie theory}, volume={141}, DOI={10.1112/S0010437X05001491}, number={6}, journal={Compositio Mathematica}, author={Glöckner, Helge}, year={2005}, pages={1551–1577} }' chicago: 'Glöckner, Helge. “Fundamentals of Direct Limit Lie Theory.” Compositio Mathematica 141, no. 6 (2005): 1551–1577. https://doi.org/10.1112/S0010437X05001491.' ieee: 'H. Glöckner, “Fundamentals of direct limit Lie theory,” Compositio Mathematica, vol. 141, no. 6, pp. 1551–1577, 2005, doi: 10.1112/S0010437X05001491.' mla: Glöckner, Helge. “Fundamentals of Direct Limit Lie Theory.” Compositio Mathematica, vol. 141, no. 6, 2005, pp. 1551–1577, doi:10.1112/S0010437X05001491. short: H. Glöckner, Compositio Mathematica 141 (2005) 1551–1577. date_created: 2026-02-26T12:00:23Z date_updated: 2026-02-27T07:57:23Z department: - _id: '10' - _id: '87' - _id: '93' doi: 10.1112/S0010437X05001491 extern: '1' intvolume: ' 141' issue: '6' keyword: - '22E65' - '26E15' - '26E20' - '26E30' - 46T05 language: - iso: eng page: 1551–1577 publication: Compositio Mathematica publication_identifier: issn: - 0010-437X quality_controlled: '1' status: public title: Fundamentals of direct limit Lie theory type: journal_article user_id: '178' volume: 141 year: '2005' ... --- _id: '51409' author: - first_name: Joachim full_name: Hilgert, Joachim id: '220' last_name: Hilgert - first_name: A. full_name: Deitmar, A. last_name: Deitmar citation: ama: Hilgert J, Deitmar A. Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces. Documenta Math. 2005;10:199-216. apa: Hilgert, J., & Deitmar, A. (2005). Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces. Documenta Math., 10, 199–216. bibtex: '@article{Hilgert_Deitmar_2005, title={Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces}, volume={10}, journal={Documenta Math.}, author={Hilgert, Joachim and Deitmar, A.}, year={2005}, pages={199–216} }' chicago: 'Hilgert, Joachim, and A. Deitmar. “Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces.” Documenta Math. 10 (2005): 199–216.' ieee: J. Hilgert and A. Deitmar, “Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces,” Documenta Math., vol. 10, pp. 199–216, 2005. mla: Hilgert, Joachim, and A. Deitmar. “Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces.” Documenta Math., vol. 10, 2005, pp. 199–216. short: J. Hilgert, A. Deitmar, Documenta Math. 10 (2005) 199–216. date_created: 2024-02-19T07:06:23Z date_updated: 2026-03-31T08:43:19Z department: - _id: '91' extern: '1' intvolume: ' 10' language: - iso: eng page: 199-216 publication: Documenta Math. publication_status: published status: public title: Cohomology of Arithmetic Groups with Infinite Dimensional Coefficient Spaces type: journal_article user_id: '220' volume: 10 year: '2005' ... --- _id: '2529' author: - first_name: A. full_name: Köpke, A. last_name: Köpke - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl - first_name: 'A. ' full_name: 'Wolisz, A. ' last_name: Wolisz citation: ama: 'Köpke A, Karl H, Wolisz A. Consensus in WSN – Identifying critical protocol mechanisms. In: GI / ITG Fachgespräche Drahtlose Sensornetzwerke. ; 2004.' apa: Köpke, A., Karl, H., & Wolisz, A. (2004). Consensus in WSN – Identifying critical protocol mechanisms. In GI / ITG Fachgespräche Drahtlose Sensornetzwerke. bibtex: '@inproceedings{Köpke_Karl_Wolisz_2004, title={Consensus in WSN – Identifying critical protocol mechanisms}, booktitle={GI / ITG Fachgespräche Drahtlose Sensornetzwerke}, author={Köpke, A. and Karl, Holger and Wolisz, A. }, year={2004} }' chicago: Köpke, A., Holger Karl, and A. Wolisz. “Consensus in WSN – Identifying Critical Protocol Mechanisms.” In GI / ITG Fachgespräche Drahtlose Sensornetzwerke, 2004. ieee: A. Köpke, H. Karl, and A. Wolisz, “Consensus in WSN – Identifying critical protocol mechanisms,” in GI / ITG Fachgespräche Drahtlose Sensornetzwerke, 2004. mla: Köpke, A., et al. “Consensus in WSN – Identifying Critical Protocol Mechanisms.” GI / ITG Fachgespräche Drahtlose Sensornetzwerke, 2004. short: 'A. Köpke, H. Karl, A. Wolisz, in: GI / ITG Fachgespräche Drahtlose Sensornetzwerke, 2004.' date_created: 2018-04-26T11:16:38Z date_updated: 2022-01-06T06:56:59Z ddc: - '000' department: - _id: '75' file: - access_level: closed content_type: application/pdf creator: tabu date_created: 2018-04-26T11:16:27Z date_updated: 2018-04-26T11:16:27Z file_id: '2532' file_name: koepke_itg_fg.pdf file_size: 39479 relation: main_file success: 1 file_date_updated: 2018-04-26T11:16:27Z has_accepted_license: '1' publication: GI / ITG Fachgespräche Drahtlose Sensornetzwerke status: public title: Consensus in WSN – Identifying critical protocol mechanisms type: conference user_id: '15572' year: '2004' ... --- _id: '19616' author: - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel citation: ama: Salzwedel K. Data Distribution Algorithms for Storage Networks. Vol 153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2004. apa: Salzwedel, K. (2004). Data Distribution Algorithms for Storage Networks (Vol. 153). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@book{Salzwedel_2004, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Distribution Algorithms for Storage Networks}, volume={153}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Salzwedel, Kay}, year={2004}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }' chicago: Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Vol. 153. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004. ieee: K. Salzwedel, Data Distribution Algorithms for Storage Networks, vol. 153. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004. mla: Salzwedel, Kay. Data Distribution Algorithms for Storage Networks. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004. short: K. Salzwedel, Data Distribution Algorithms for Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2004. date_created: 2020-09-22T08:37:39Z date_updated: 2022-01-06T06:54:08Z department: - _id: '26' - _id: '63' intvolume: ' 153' language: - iso: eng publication_identifier: isbn: - 3-935433-62-X publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20040101385 series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Data Distribution Algorithms for Storage Networks type: dissertation user_id: '5786' volume: 153 year: '2004' ... --- _id: '19692' author: - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Dimo full_name: Brockhoff, Dimo last_name: Brockhoff - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Matthias full_name: Englert, Matthias last_name: Englert - first_name: Christian full_name: Gunia, Christian last_name: Gunia - first_name: Oliver full_name: Heering, Oliver last_name: Heering - first_name: Thomas full_name: Jansen, Thomas last_name: Jansen - first_name: Michael full_name: Leifhelm, Michael last_name: Leifhelm - first_name: Kai full_name: Plociennik, Kai last_name: Plociennik - first_name: Heiko full_name: Röglin, Heiko last_name: Röglin - first_name: Andrea full_name: Schweer, Andrea last_name: Schweer - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt - first_name: Stefan full_name: Tannenbaum, Stefan last_name: Tannenbaum - first_name: Ingo full_name: Wegener, Ingo last_name: Wegener citation: ama: 'Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30217-9_4' apa: 'Briest, P., Brockhoff, D., Degener, B., Englert, M., Gunia, C., Heering, O., … Wegener, I. (2004). The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_4' bibtex: '@inproceedings{Briest_Brockhoff_Degener_Englert_Gunia_Heering_Jansen_Leifhelm_Plociennik_Röglin_et al._2004, place={Berlin, Heidelberg}, title={The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes}, DOI={10.1007/978-3-540-30217-9_4}, booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Briest, Patrick and Brockhoff, Dimo and Degener, Bastian and Englert, Matthias and Gunia, Christian and Heering, Oliver and Jansen, Thomas and Leifhelm, Michael and Plociennik, Kai and Röglin, Heiko and et al.}, year={2004} }' chicago: 'Briest, Patrick, Dimo Brockhoff, Bastian Degener, Matthias Englert, Christian Gunia, Oliver Heering, Thomas Jansen, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” In Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg, 2004. https://doi.org/10.1007/978-3-540-30217-9_4.' ieee: 'P. Briest et al., “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes,” in Parallel Problem Solving from Nature - PPSN VIII, 2004.' mla: 'Briest, Patrick, et al. “The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes.” Parallel Problem Solving from Nature - PPSN VIII, 2004, doi:10.1007/978-3-540-30217-9_4.' short: 'P. Briest, D. Brockhoff, B. Degener, M. Englert, C. Gunia, O. Heering, T. Jansen, M. Leifhelm, K. Plociennik, H. Röglin, A. Schweer, D. Sudholt, S. Tannenbaum, I. Wegener, in: Parallel Problem Solving from Nature - PPSN VIII, Berlin, Heidelberg, 2004.' date_created: 2020-09-25T10:41:37Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' doi: 10.1007/978-3-540-30217-9_4 language: - iso: eng place: Berlin, Heidelberg publication: Parallel Problem Solving from Nature - PPSN VIII publication_identifier: isbn: - '9783540230922' - '9783540302179' issn: - 0302-9743 - 1611-3349 publication_status: published status: public title: 'The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes' type: conference user_id: '15415' year: '2004' ... --- _id: '19693' author: - first_name: Andrea full_name: Schweer, Andrea last_name: Schweer - first_name: Michael full_name: Leifhelm, Michael last_name: Leifhelm - first_name: Bastian full_name: Degener, Bastian last_name: Degener - first_name: Oliver full_name: Heering, Oliver last_name: Heering - first_name: Stefan full_name: Tannenbaum, Stefan last_name: Tannenbaum - first_name: Heiko full_name: Röglin, Heiko last_name: Röglin - first_name: Christian full_name: Gunia, Christian last_name: Gunia - first_name: Matthias full_name: Englert, Matthias last_name: Englert - first_name: Patrick full_name: Briest, Patrick last_name: Briest - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt - first_name: Dimo full_name: Brockhoff, Dimo last_name: Brockhoff - first_name: Ingo full_name: Wegener, Ingo last_name: Wegener - first_name: Thomas full_name: Jansen, Thomas last_name: Jansen - first_name: Kai full_name: Plociennik, Kai last_name: Plociennik citation: ama: 'Schweer A, Leifhelm M, Degener B, et al. Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In: Parallel Problem Solving from Nature - PPSN VIII. ; 2004.' apa: Schweer, A., Leifhelm, M., Degener, B., Heering, O., Tannenbaum, S., Röglin, H., … Plociennik, K. (2004). Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization. In Parallel Problem Solving from Nature - PPSN VIII. bibtex: '@inproceedings{Schweer_Leifhelm_Degener_Heering_Tannenbaum_Röglin_Gunia_Englert_Briest_Sudholt_et al._2004, title={Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization}, booktitle={Parallel Problem Solving from Nature - PPSN VIII}, author={Schweer, Andrea and Leifhelm, Michael and Degener, Bastian and Heering, Oliver and Tannenbaum, Stefan and Röglin, Heiko and Gunia, Christian and Englert, Matthias and Briest, Patrick and Sudholt, Dirk and et al.}, year={2004} }' chicago: Schweer, Andrea, Michael Leifhelm, Bastian Degener, Oliver Heering, Stefan Tannenbaum, Heiko Röglin, Christian Gunia, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” In Parallel Problem Solving from Nature - PPSN VIII, 2004. ieee: A. Schweer et al., “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization,” in Parallel Problem Solving from Nature - PPSN VIII, 2004. mla: Schweer, Andrea, et al. “Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.” Parallel Problem Solving from Nature - PPSN VIII, 2004. short: 'A. Schweer, M. Leifhelm, B. Degener, O. Heering, S. Tannenbaum, H. Röglin, C. Gunia, M. Englert, P. Briest, D. Sudholt, D. Brockhoff, I. Wegener, T. Jansen, K. Plociennik, in: Parallel Problem Solving from Nature - PPSN VIII, 2004.' date_created: 2020-09-25T10:45:22Z date_updated: 2022-01-06T06:54:10Z department: - _id: '63' language: - iso: eng publication: Parallel Problem Solving from Nature - PPSN VIII publication_status: published status: public title: Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization type: conference user_id: '15415' year: '2004' ... --- _id: '19800' abstract: - lang: eng text: Redundant arrays of independent disks, also called RAID arrays, have gained a wide popularity in the last twenty years. Most of the disks used in the server market are currently based on RAID technology. The primary reason for introducing RAID technology in 1988 has been the fact that large disk systems have become much slower and more expensive than the connection of a large number of inexpensive disks and the use of them as an array. The times seem to repeat themselves. Today, large scale RAID arrays have become incredible big and expensive. It seems that it makes sense to replace them by a collection of smaller and inexpensive arrays of JBODs or mid-ranged RAID arrays. In this paper we will show that combining these systems with state-of-the-art virtualization technology can lead to a system that is faster and less expensive than an enterprise storage system, while being as easy to manage and as reliable. Therefore we will outline the most important features of storage management and compare there realization in enterprise class storage systems and in current and future virtualization environments. author: - first_name: André full_name: Brinkmann, André last_name: Brinkmann - first_name: Kay full_name: Salzwedel, Kay last_name: Salzwedel - first_name: Mario full_name: Vodisek, Mario last_name: Vodisek citation: ama: 'Brinkmann A, Salzwedel K, Vodisek M. A case for virtualized arrays of RAID. In: Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04. ; 2004:9-16. doi:10.1145/1162628.1162630' apa: Brinkmann, A., Salzwedel, K., & Vodisek, M. (2004). A case for virtualized arrays of RAID. In Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04 (pp. 9–16). https://doi.org/10.1145/1162628.1162630 bibtex: '@inproceedings{Brinkmann_Salzwedel_Vodisek_2004, title={A case for virtualized arrays of RAID}, DOI={10.1145/1162628.1162630}, booktitle={Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04}, author={Brinkmann, André and Salzwedel, Kay and Vodisek, Mario}, year={2004}, pages={9–16} }' chicago: Brinkmann, André, Kay Salzwedel, and Mario Vodisek. “A Case for Virtualized Arrays of RAID.” In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 9–16, 2004. https://doi.org/10.1145/1162628.1162630. ieee: A. Brinkmann, K. Salzwedel, and M. Vodisek, “A case for virtualized arrays of RAID,” in Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI ’04, 2004, pp. 9–16. mla: Brinkmann, André, et al. “A Case for Virtualized Arrays of RAID.” Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004, pp. 9–16, doi:10.1145/1162628.1162630. short: 'A. Brinkmann, K. Salzwedel, M. Vodisek, in: Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os - SNAPI ’04, 2004, pp. 9–16.' date_created: 2020-09-30T12:39:30Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1162628.1162630 language: - iso: eng page: 9-16 publication: Proceedings of the international workshop on Storage network architecture and parallel I/Os - SNAPI '04 publication_status: published status: public title: A case for virtualized arrays of RAID type: conference user_id: '15415' year: '2004' ... --- _id: '19807' abstract: - lang: eng text: 'Wireless connectivity is state of the art for local area networks. Currently, most W-LAN networks rely on a centralized design with access points routing all inner and outbound traffic. These access points are intrinsic communication bottlenecks. Mobile Ad Hoc Networks (MANET) overcome this problem, because every participant works as well as a simple node and as a router. Current MANETs are restricted in scalability, because they rely on flooding mechanisms or complete routing tables. Other approaches, providing better scalability use clustering, yet network performance deteriorates in case of high node mobility. We describe the design of a PAMANET, the Paderborn Mobile Ad Hoc Network, a MANET overcoming these problems providing scalability and reliability in a mobile scenario. When implemented, PAMANET works with standard W-LAN IEEE 802.11 radio devices, provides IPv6 communication interfaces and works on personal computers under a standard Linux distribution. First, we present current routing protocols and classify them with respect to scalability and stability in dynamically evolving MANETs. Then, we discuss related research in the area of distributed hash tables and consistent hashing, used for relieving hot spots in the Web, storage area networks and peerto-peer networks, which inspires the design of PAMANET. PAMANET consists of three main components: First, the embedding of the routing layer into IEEE 802.11 and IPv6 by using techniques used at the ad hoc support library (aslib) by Gupta et al. Second, the routing layer which combines a landmark routing, hierarchical clustering, consistent hashing for providing location dependent addresses and lookup-service for the location of nodes. Third, a peerto-peer data storage system based on egoistic distributed caches enabling hop and traffic efficient data access on replicated data partitions.
The routing layer incorporates a variety of new approaches. Link distances reflect the failure probability of links, which is estimated by the reciprocal age of the link. Then, we combine a landmarking system on this metric with the hierarchical layer graph yielding small landmark addresses and small routing tables. To balance the load of the distributed lookup-service for landmark addresses, a hierarchical weighted consistent hashing scheme is used. This ensures that each node receives an equal part of all landmark addresses. Using these mechanisms (regularly and on demand) PAMANET adjusts IPv6 routing tables such that short stable routes are preferred. For the distribution of control data like landmark information PAMANET uses a message box system interface to provide fast one-hop communication. On top of this system, PAMANET provides a peer-to-peer data storage and lookup system that realizes time, traffic, and load efficient access using egoistic caches and data segmentation strategies.' author: - first_name: Christian full_name: Schindelhauer, Christian last_name: Schindelhauer - first_name: Stefan full_name: Böttcher, Stefan last_name: Böttcher - first_name: Franz full_name: Rammig, Franz last_name: Rammig citation: ama: 'Schindelhauer C, Böttcher S, Rammig F. The design of PaMaNet the Paderborn mobile ad-hoc network. In: Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols. ; 2004. doi:10.1145/1023783.1023807' apa: Schindelhauer, C., Böttcher, S., & Rammig, F. (2004). The design of PaMaNet the Paderborn mobile ad-hoc network. In Proceedings of the second international workshop on Mobility management & wireless access protocols. https://doi.org/10.1145/1023783.1023807 bibtex: '@inproceedings{Schindelhauer_Böttcher_Rammig_2004, title={The design of PaMaNet the Paderborn mobile ad-hoc network}, DOI={10.1145/1023783.1023807}, booktitle={Proceedings of the second international workshop on Mobility management & wireless access protocols}, author={Schindelhauer, Christian and Böttcher, Stefan and Rammig, Franz}, year={2004} }' chicago: Schindelhauer, Christian, Stefan Böttcher, and Franz Rammig. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.” In Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004. https://doi.org/10.1145/1023783.1023807. ieee: C. Schindelhauer, S. Böttcher, and F. Rammig, “The design of PaMaNet the Paderborn mobile ad-hoc network,” in Proceedings of the second international workshop on Mobility management & wireless access protocols, 2004. mla: Schindelhauer, Christian, et al. “The Design of PaMaNet the Paderborn Mobile Ad-Hoc Network.” Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004, doi:10.1145/1023783.1023807. short: 'C. Schindelhauer, S. Böttcher, F. Rammig, in: Proceedings of the Second International Workshop on Mobility Management & Wireless Access Protocols, 2004.' date_created: 2020-09-30T12:58:55Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1023783.1023807 language: - iso: eng publication: Proceedings of the second international workshop on Mobility management & wireless access protocols publication_identifier: isbn: - '1581139209' publication_status: published status: public title: The design of PaMaNet the Paderborn mobile ad-hoc network type: conference user_id: '15415' year: '2004' ... --- _id: '19851' abstract: - lang: eng text: The Internet-SCSI protocol [iSCSI] allows a client to interact with a remote SCSI-capable target by means of block-oriented commands encapsulated within TCP/IP packets. Thereby, iSCSI greatly simplifies storage virtualization, since clients can access storage in a unified manner, no matter whether the I/O-path is short or long distance. Intermediate devices located on the path between a client and a target can easily intercept iSCSI sessions and rewrite packets for the sake of load balancing, prefetching, or redundancy, to mention just a few beneficial applications. Within this paper we describe the design and implementation of such an iSCSI capable intermediate device that deploys prefetching strategies in combination with redundant disks to reduce average I/O-latency. Depending on its location within the network, this virtualization and prefetching device can hide wide area access latency and reduce network contention targeting remote SCSI-devices to a large extent. author: - first_name: Peter full_name: Bleckmann, Peter last_name: Bleckmann - first_name: Gunnar full_name: Schomaker, Gunnar last_name: Schomaker - first_name: Adrian full_name: Slowik, Adrian last_name: Slowik citation: ama: 'Bleckmann P, Schomaker G, Slowik A. Virtualization with prefetching abilities based on iSCSI. In: Proceeding of International Workshop on Storage Network Architecture and Parallel I/O. ; 2004:40-47. doi:10.1145/1162628.1162634' apa: Bleckmann, P., Schomaker, G., & Slowik, A. (2004). Virtualization with prefetching abilities based on iSCSI. Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2, 40–47. https://doi.org/10.1145/1162628.1162634 bibtex: '@inproceedings{Bleckmann_Schomaker_Slowik_2004, title={Virtualization with prefetching abilities based on iSCSI}, DOI={10.1145/1162628.1162634}, number={2}, booktitle={Proceeding of International Workshop on Storage Network Architecture and Parallel I/O}, author={Bleckmann, Peter and Schomaker, Gunnar and Slowik, Adrian}, year={2004}, pages={40–47} }' chicago: Bleckmann, Peter, Gunnar Schomaker, and Adrian Slowik. “Virtualization with Prefetching Abilities Based on ISCSI.” In Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 40–47, 2004. https://doi.org/10.1145/1162628.1162634. ieee: 'P. Bleckmann, G. Schomaker, and A. Slowik, “Virtualization with prefetching abilities based on iSCSI,” in Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2004, no. 2, pp. 40–47, doi: 10.1145/1162628.1162634.' mla: Bleckmann, Peter, et al. “Virtualization with Prefetching Abilities Based on ISCSI.” Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, no. 2, 2004, pp. 40–47, doi:10.1145/1162628.1162634. short: 'P. Bleckmann, G. Schomaker, A. Slowik, in: Proceeding of International Workshop on Storage Network Architecture and Parallel I/O, 2004, pp. 40–47.' date_created: 2020-10-02T11:40:12Z date_updated: 2022-01-06T06:54:13Z department: - _id: '63' doi: 10.1145/1162628.1162634 issue: '2' language: - iso: eng page: 40-47 publication: Proceeding of International Workshop on Storage Network Architecture and Parallel I/O publication_status: published status: public title: Virtualization with prefetching abilities based on iSCSI type: conference user_id: '15415' year: '2004' ... --- _id: '19879' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: Klein J, Zachmann G. Point Cloud Surfaces using Geometric Proximity Graphs. Computers and Graphics. 2004;28(6):839-850. doi:10.1016/j.cag.2004.08.012 apa: Klein, J., & Zachmann, G. (2004). Point Cloud Surfaces using Geometric Proximity Graphs. Computers and Graphics, 28(6), 839–850. https://doi.org/10.1016/j.cag.2004.08.012 bibtex: '@article{Klein_Zachmann_2004, title={Point Cloud Surfaces using Geometric Proximity Graphs}, volume={28}, DOI={10.1016/j.cag.2004.08.012}, number={6}, journal={Computers and Graphics}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={839–850} }' chicago: 'Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity Graphs.” Computers and Graphics 28, no. 6 (2004): 839–50. https://doi.org/10.1016/j.cag.2004.08.012.' ieee: J. Klein and G. Zachmann, “Point Cloud Surfaces using Geometric Proximity Graphs,” Computers and Graphics, vol. 28, no. 6, pp. 839–850, 2004. mla: Klein, Jan, and Gabriel Zachmann. “Point Cloud Surfaces Using Geometric Proximity Graphs.” Computers and Graphics, vol. 28, no. 6, 2004, pp. 839–50, doi:10.1016/j.cag.2004.08.012. short: J. Klein, G. Zachmann, Computers and Graphics 28 (2004) 839–850. date_created: 2020-10-05T12:57:39Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' doi: 10.1016/j.cag.2004.08.012 intvolume: ' 28' issue: '6' language: - iso: eng page: 839-850 publication: Computers and Graphics status: public title: Point Cloud Surfaces using Geometric Proximity Graphs type: journal_article user_id: '15415' volume: 28 year: '2004' ... --- _id: '19883' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. Proximity Graphs for Defining Surfaces over Point Clouds. In: Eurographics Symposium on Point-Based Grahics (SPBG’04). ; 2004:131-138.' apa: Klein, J., & Zachmann, G. (2004). Proximity Graphs for Defining Surfaces over Point Clouds. In Eurographics Symposium on Point-Based Grahics (SPBG’04) (pp. 131–138). bibtex: '@inproceedings{Klein_Zachmann_2004, title={Proximity Graphs for Defining Surfaces over Point Clouds}, booktitle={Eurographics Symposium on Point-Based Grahics (SPBG’04)}, author={Klein, Jan and Zachmann, Gabriel}, year={2004}, pages={131–138} }' chicago: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over Point Clouds.” In Eurographics Symposium on Point-Based Grahics (SPBG’04), 131–38, 2004. ieee: J. Klein and G. Zachmann, “Proximity Graphs for Defining Surfaces over Point Clouds,” in Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004, pp. 131–138. mla: Klein, Jan, and Gabriel Zachmann. “Proximity Graphs for Defining Surfaces over Point Clouds.” Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004, pp. 131–38. short: 'J. Klein, G. Zachmann, in: Eurographics Symposium on Point-Based Grahics (SPBG’04), 2004, pp. 131–138.' date_created: 2020-10-05T13:03:44Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' language: - iso: eng page: 131-138 publication: Eurographics Symposium on Point-Based Grahics (SPBG'04) status: public title: Proximity Graphs for Defining Surfaces over Point Clouds type: conference user_id: '15415' year: '2004' ... --- _id: '19889' author: - first_name: Jan full_name: Klein, Jan last_name: Klein - first_name: Gabriel full_name: Zachmann, Gabriel last_name: Zachmann citation: ama: 'Klein J, Zachmann G. Nice and Fast Implicit Surfaces over Noisy Point Clouds. In: SIGGRAPH 2004, Sketches. ; 2004.' apa: Klein, J., & Zachmann, G. (2004). Nice and Fast Implicit Surfaces over Noisy Point Clouds. In SIGGRAPH 2004, Sketches. bibtex: '@inproceedings{Klein_Zachmann_2004, title={Nice and Fast Implicit Surfaces over Noisy Point Clouds}, booktitle={SIGGRAPH 2004, Sketches}, author={Klein, Jan and Zachmann, Gabriel}, year={2004} }' chicago: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy Point Clouds.” In SIGGRAPH 2004, Sketches, 2004. ieee: J. Klein and G. Zachmann, “Nice and Fast Implicit Surfaces over Noisy Point Clouds,” in SIGGRAPH 2004, Sketches, 2004. mla: Klein, Jan, and Gabriel Zachmann. “Nice and Fast Implicit Surfaces over Noisy Point Clouds.” SIGGRAPH 2004, Sketches, 2004. short: 'J. Klein, G. Zachmann, in: SIGGRAPH 2004, Sketches, 2004.' date_created: 2020-10-05T13:31:16Z date_updated: 2022-01-06T06:54:14Z department: - _id: '63' language: - iso: eng publication: SIGGRAPH 2004, Sketches status: public title: Nice and Fast Implicit Surfaces over Noisy Point Clouds type: conference user_id: '15415' year: '2004' ...