[{"author":[{"first_name":"Gerson","orcid":"0000-0002-2763-1246","full_name":"Meschut, Gerson","last_name":"Meschut","id":"32056"}],"publication":"Adhäsion","department":[{"_id":"157"}],"status":"public","date_created":"2021-01-18T09:33:21Z","volume":44,"user_id":"68518","title":"Eigenschaftsoptimierte Verbindungen durch wärmearmes Hybridfügen","language":[{"iso":"eng"}],"citation":{"apa":"Meschut, G. (2000). Eigenschaftsoptimierte Verbindungen durch wärmearmes Hybridfügen. Adhäsion, 44(11), 14–21.","ama":"Meschut G. Eigenschaftsoptimierte Verbindungen durch wärmearmes Hybridfügen. Adhäsion. 2000;44(11):14-21.","chicago":"Meschut, Gerson. “Eigenschaftsoptimierte Verbindungen Durch Wärmearmes Hybridfügen.” Adhäsion 44, no. 11 (2000): 14–21.","mla":"Meschut, Gerson. “Eigenschaftsoptimierte Verbindungen Durch Wärmearmes Hybridfügen.” Adhäsion, vol. 44, no. 11, 2000, pp. 14–21.","bibtex":"@article{Meschut_2000, title={Eigenschaftsoptimierte Verbindungen durch wärmearmes Hybridfügen}, volume={44}, number={11}, journal={Adhäsion}, author={Meschut, Gerson}, year={2000}, pages={14–21} }","short":"G. Meschut, Adhäsion 44 (2000) 14–21.","ieee":"G. Meschut, “Eigenschaftsoptimierte Verbindungen durch wärmearmes Hybridfügen,” Adhäsion, vol. 44, no. 11, pp. 14–21, 2000."},"year":"2000","type":"journal_article","page":"14-21","_id":"21006","date_updated":"2022-01-06T06:54:42Z","intvolume":" 44","issue":"11"},{"place":"Bad Nauheim","title":"Status und Weiterentwicklungsmöglichkeiten beim strukturellen Kleben bei Spaceframe-Konstruktionen","user_id":"68518","publication":"Tagungsband zur 4. Jahres- und 1. Europäischen Fachkonferenz “Kleben im Automobilbau”","department":[{"_id":"157"}],"author":[{"first_name":"M.","full_name":"Koyro, M.","last_name":"Koyro"},{"first_name":"Gerson","orcid":"0000-0002-2763-1246","full_name":"Meschut, Gerson","last_name":"Meschut","id":"32056"}],"date_created":"2021-01-18T09:35:37Z","status":"public","conference":{"name":"4. Jahres- und 1. Europäischen Fachkonferenz “Kleben im Automobilbau”","start_date":"2000-11-16","location":"Bad Nauheim","end_date":"2000-11-17"},"_id":"21007","date_updated":"2022-01-06T06:54:42Z","page":"114-126","citation":{"bibtex":"@inproceedings{Koyro_Meschut_2000, place={Bad Nauheim}, title={Status und Weiterentwicklungsmöglichkeiten beim strukturellen Kleben bei Spaceframe-Konstruktionen}, booktitle={Tagungsband zur 4. Jahres- und 1. Europäischen Fachkonferenz “Kleben im Automobilbau”}, author={Koyro, M. and Meschut, Gerson}, year={2000}, pages={114–126} }","mla":"Koyro, M., and Gerson Meschut. “Status Und Weiterentwicklungsmöglichkeiten Beim Strukturellen Kleben Bei Spaceframe-Konstruktionen.” Tagungsband Zur 4. Jahres- Und 1. Europäischen Fachkonferenz “Kleben Im Automobilbau,” 2000, pp. 114–26.","chicago":"Koyro, M., and Gerson Meschut. “Status Und Weiterentwicklungsmöglichkeiten Beim Strukturellen Kleben Bei Spaceframe-Konstruktionen.” In Tagungsband Zur 4. Jahres- Und 1. Europäischen Fachkonferenz “Kleben Im Automobilbau,” 114–26. Bad Nauheim, 2000.","apa":"Koyro, M., & Meschut, G. (2000). Status und Weiterentwicklungsmöglichkeiten beim strukturellen Kleben bei Spaceframe-Konstruktionen. In Tagungsband zur 4. Jahres- und 1. Europäischen Fachkonferenz “Kleben im Automobilbau” (pp. 114–126). Bad Nauheim.","ama":"Koyro M, Meschut G. Status und Weiterentwicklungsmöglichkeiten beim strukturellen Kleben bei Spaceframe-Konstruktionen. In: Tagungsband Zur 4. Jahres- Und 1. Europäischen Fachkonferenz “Kleben Im Automobilbau.” Bad Nauheim; 2000:114-126.","ieee":"M. Koyro and G. Meschut, “Status und Weiterentwicklungsmöglichkeiten beim strukturellen Kleben bei Spaceframe-Konstruktionen,” in Tagungsband zur 4. Jahres- und 1. Europäischen Fachkonferenz “Kleben im Automobilbau,” Bad Nauheim, 2000, pp. 114–126.","short":"M. Koyro, G. Meschut, in: Tagungsband Zur 4. Jahres- Und 1. Europäischen Fachkonferenz “Kleben Im Automobilbau,” Bad Nauheim, 2000, pp. 114–126."},"year":"2000","type":"conference","language":[{"iso":"eng"}]},{"user_id":"14955","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","author":[{"last_name":"Adler","full_name":"Adler, Micah","first_name":"Micah"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"publication":"Theory Comput. Syst.","department":[{"_id":"79"},{"_id":"63"}],"status":"public","date_created":"2018-04-03T05:51:02Z","volume":33,"intvolume":" 33","_id":"2143","date_updated":"2022-01-06T06:54:59Z","issue":"5/6","doi":"10.1007/s002240010006","language":[{"iso":"eng"}],"year":"2000","type":"journal_article","citation":{"short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391, 2000.","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006","apa":"Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391. https://doi.org/10.1007/s002240010006","chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000): 337--391. https://doi.org/10.1007/s002240010006.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }"},"page":"337--391"},{"volume":30,"date_created":"2018-04-03T06:12:15Z","status":"public","publication":"SIAM J. Comput.","department":[{"_id":"79"},{"_id":"63"}],"author":[{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","user_id":"14955","page":"1126--1155","citation":{"ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431","apa":"Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput. 30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431}, number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking, Berthold}, year={2000}, pages={1126--1155} }","mla":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.","ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol. 30, no. 4, pp. 1126--1155, 2000."},"type":"journal_article","year":"2000","language":[{"iso":"eng"}],"doi":"10.1137/S0097539799353431","issue":"4","_id":"2145","intvolume":" 30","date_updated":"2022-01-06T06:55:00Z"},{"year":"2000","citation":{"apa":"Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: PDPTA. ; 2000.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.","mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.","bibtex":"@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian}, year={2000} }","short":"P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in PDPTA, 2000."},"type":"conference","language":[{"iso":"eng"}],"oa":"1","_id":"2146","date_updated":"2022-01-06T06:55:00Z","urn":"21467","has_accepted_license":"1","status":"public","date_created":"2018-04-03T06:13:07Z","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"publication":"PDPTA","file_date_updated":"2018-04-12T08:47:50Z","department":[{"_id":"79"},{"_id":"63"}],"file":[{"date_created":"2018-04-12T08:47:50Z","file_name":"PDPTA-00.pdf","access_level":"open_access","file_id":"2299","creator":"florida","file_size":168677,"relation":"main_file","date_updated":"2018-04-12T08:47:50Z","content_type":"application/pdf"}],"ddc":["040"],"title":"Distributed Path Selection for Storage Networks","user_id":"14955"},{"file_date_updated":"2018-04-12T08:36:17Z","publication":"SODA","department":[{"_id":"79"},{"_id":"63"}],"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"full_name":"Scheideler, Christian","first_name":"Christian","id":"20792","last_name":"Scheideler"}],"file":[{"file_id":"2295","creator":"florida","file_size":185001,"relation":"main_file","date_updated":"2018-04-12T08:36:17Z","content_type":"application/pdf","file_name":"SODA-00.pdf","date_created":"2018-04-12T08:36:17Z","access_level":"open_access"}],"date_created":"2018-04-03T06:16:48Z","has_accepted_license":"1","status":"public","title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","ddc":["040"],"user_id":"14955","page":"30--39","type":"conference","year":"2000","citation":{"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).","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.","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.","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} }","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.","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."},"language":[{"iso":"eng"}],"urn":"21476","date_updated":"2022-01-06T06:55:00Z","_id":"2147","oa":"1"},{"title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"publication":"Random Struct. Algorithms","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"volume":17,"date_created":"2018-04-03T06:17:52Z","status":"public","date_updated":"2022-01-06T06:55:00Z","_id":"2148","intvolume":" 17","issue":"3-4","page":"213--237","citation":{"short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (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.","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.","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} }","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."},"type":"journal_article","year":"2000","language":[{"iso":"eng"}]},{"user_id":"14955","title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","ddc":["040"],"file":[{"relation":"main_file","date_updated":"2018-04-12T08:38:13Z","content_type":"application/pdf","file_id":"2297","creator":"florida","file_size":222176,"access_level":"open_access","file_name":"spaa_00.pdf","date_created":"2018-04-12T08:38:13Z"}],"department":[{"_id":"79"},{"_id":"63"}],"file_date_updated":"2018-04-12T08:38:13Z","publication":"SPAA","author":[{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"last_name":"Salzwedel","full_name":"Salzwedel, Kay","first_name":"Kay"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T06:18:45Z","status":"public","has_accepted_license":"1","urn":"21493","date_updated":"2022-01-06T06:55:02Z","_id":"2149","oa":"1","language":[{"iso":"eng"}],"page":"119--128","year":"2000","type":"conference","citation":{"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.","short":"A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, 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} }","mla":"Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 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.","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)."}},{"department":[{"_id":"79"},{"_id":"63"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:02Z","oa":"1","publisher":"ACM","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"id":"20792","last_name":"Scheideler","full_name":"Scheideler, Christian","first_name":"Christian"}],"publication":"STOC","file_date_updated":"2018-04-12T08:49:23Z","file":[{"date_updated":"2018-04-12T08:49:23Z","content_type":"application/pdf","relation":"main_file","file_size":190083,"creator":"florida","file_id":"2300","access_level":"open_access","date_created":"2018-04-12T08:49:23Z","file_name":"STOC-00.pdf"}],"status":"public","has_accepted_license":"1","date_created":"2018-04-03T06:21:11Z","ddc":["040"],"user_id":"14955","citation":{"short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.","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.","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.","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.","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.","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.","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} }"},"type":"conference","year":"2000","page":"38--47","_id":"2150","urn":"21509"},{"date_updated":"2022-01-06T06:53:12Z","_id":"17458","year":"2000","type":"book_editor","citation":{"ieee":"V. Peckhaus, Ed., “Contributing Editor” für die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, edited by Joseph W. Dauben, revised edition on CD-ROM by Albert C. Lewis, in cooperation with the International Commission on the History Mathematics, American Mathematical Society. 2000.","short":"V. Peckhaus, ed., “Contributing Editor” Für Die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, Edited by Joseph W. Dauben, Revised Edition on CD-ROM by Albert C. Lewis, in Cooperation with the International Commission on the History Mathematics, American Mathematical Society, 2000.","bibtex":"@book{Peckhaus_2000, title={“Contributing Editor” für die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, edited by Joseph W. Dauben, revised edition on CD-ROM by Albert C. Lewis, in cooperation with the International Commission on the History Mathematics, American Mathematical Society}, year={2000} }","mla":"Peckhaus, Volker, editor. “Contributing Editor” Für Die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, Edited by Joseph W. Dauben, Revised Edition on CD-ROM by Albert C. Lewis, in Cooperation with the International Commission on the History Mathematics, American Mathematical Society. 2000.","chicago":"Peckhaus, Volker, ed. “Contributing Editor” Für Die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, Edited by Joseph W. Dauben, Revised Edition on CD-ROM by Albert C. Lewis, in Cooperation with the International Commission on the History Mathematics, American Mathematical Society, 2000.","ama":"Peckhaus V, ed. “Contributing Editor” Für Die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, Edited by Joseph W. Dauben, Revised Edition on CD-ROM by Albert C. Lewis, in Cooperation with the International Commission on the History Mathematics, American Mathematical Society.; 2000.","apa":"Peckhaus, V. (Ed.). (2000). “Contributing Editor” für die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, edited by Joseph W. Dauben, revised edition on CD-ROM by Albert C. Lewis, in cooperation with the International Commission on the History Mathematics, American Mathematical Society."},"page":"693–730","language":[{"iso":"eng"}],"title":"“Contributing Editor” für die Sektion “Philosophy of Mathematics” in: The History of Mathematics from Antiquity to the Present: A Selective Annotated Bibliography, edited by Joseph W. Dauben, revised edition on CD-ROM by Albert C. Lewis, in cooperation with the International Commission on the History Mathematics, American Mathematical Society","user_id":"14932","extern":"1","editor":[{"id":"391","last_name":"Peckhaus","full_name":"Peckhaus, Volker","first_name":"Volker"}],"publication_identifier":{"isbn":["0-8218-0844-3"]},"status":"public","date_created":"2020-07-30T06:36:36Z","department":[{"_id":"520"}]}]