[{"date_created":"2021-09-03T09:08:27Z","publication":"ACM SIGSAM Bulletin","status":"public","language":[{"iso":"eng"}],"year":"2001","type":"journal_article","publication_identifier":{"issn":["0163-5824"]},"page":"16-18","_id":"23731","date_updated":"2022-01-06T06:55:58Z","author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"full_name":"von zur Gathen, Joachim","first_name":"Joachim","last_name":"von zur Gathen"},{"first_name":"Jürgen","full_name":"Gerhard, Jürgen","last_name":"Gerhard"},{"first_name":"Olaf","full_name":"Müller, Olaf","last_name":"Müller"}],"title":"Factoring a binary polynomial of degree over one million","abstract":[{"text":"<jats:p>\r\n            On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z\r\n            <jats:sub>2</jats:sub>\r\n            was completed on a 4-processor Linux PC, using roughly 100 CPU-hours. The basic approach is a combination of the factorization software BIPOLAR and a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn University BSP library) is used for the implementation of the parallel communication.\r\n          </jats:p>","lang":"eng"}],"doi":"10.1145/504331.504333","publication_status":"published","user_id":"15415","citation":{"bibtex":"@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring a binary polynomial of degree over one million}, DOI={<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>}, journal={ACM SIGSAM Bulletin}, author={Bonorden, Olaf and von zur Gathen, Joachim and Gerhard, Jürgen and Müller, Olaf}, year={2001}, pages={16–18} }","mla":"Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, pp. 16–18, doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>.","short":"O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.","ama":"Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>. 2001:16-18. doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>","apa":"Bonorden, O., von zur Gathen, J., Gerhard, J., &#38; Müller, O. (2001). Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>","ieee":"O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” <i>ACM SIGSAM Bulletin</i>, pp. 16–18, 2001.","chicago":"Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>."},"department":[{"_id":"63"}]},{"citation":{"ama":"Ziegler M, Brattka V. A Computable Spectral Theorem. In: <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>. Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>","apa":"Ziegler, M., &#38; Brattka, V. (2001). A Computable Spectral Theorem. In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i> (Vol. 2064, pp. 378–388). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>","ieee":"M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2001, vol. 2064, pp. 378–388.","chicago":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2064:378–88. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>.","bibtex":"@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A Computable Spectral Theorem}, volume={2064}, DOI={<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>}, booktitle={Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001}, pages={378–388} }","mla":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, vol. 2064, 2001, pp. 378–88, doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>.","short":"M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388."},"publication_status":"published","department":[{"_id":"63"}],"author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"},{"last_name":"Brattka","first_name":"Vasco","full_name":"Brattka, Vasco"}],"place":"Berlin, Heidelberg","intvolume":"      2064","_id":"18152","date_updated":"2022-01-06T06:53:26Z","date_created":"2020-08-24T10:14:06Z","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540421979","9783540453352"]},"year":"2001","status":"public","user_id":"15415","title":"A Computable Spectral Theorem","doi":"10.1007/3-540-45335-0_23","abstract":[{"lang":"eng","text":"Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions."}],"page":"378-388","volume":2064,"publication":"Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)","type":"conference"},{"date_updated":"2022-01-06T06:53:26Z","volume":"AA","page":"155-164","_id":"18166","status":"public","year":"2001","type":"conference","language":[{"iso":"eng"}],"publication":"Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)","date_created":"2020-08-24T11:29:08Z","department":[{"_id":"63"}],"user_id":"15415","citation":{"bibtex":"@inproceedings{Ziegler_Emamy-Khansari_2001, title={New Bounds for Hypercube Slicing Numbers}, volume={AA}, booktitle={Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)}, author={Ziegler, Martin and Emamy-Khansari, M. Reza}, year={2001}, pages={155–164} }","mla":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, vol. AA, 2001, pp. 155–64.","short":"M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001), 2001, pp. 155–164.","ama":"Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In: <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>. Vol AA. ; 2001:155-164.","apa":"Ziegler, M., &#38; Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing Numbers. In <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i> (Vol. AA, pp. 155–164).","ieee":"M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,” in <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, 2001, vol. AA, pp. 155–164.","chicago":"Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing Numbers.” In <i>Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)</i>, AA:155–64, 2001."},"abstract":[{"text":"What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen earlier results on hypercube cut numbers.","lang":"eng"}],"author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"},{"last_name":"Emamy-Khansari","full_name":"Emamy-Khansari, M. Reza","first_name":"M. Reza"}],"title":"New Bounds for Hypercube Slicing Numbers"},{"_id":"18168","page":"181-184","date_updated":"2022-01-06T06:53:26Z","publication":"Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)","date_created":"2020-08-24T11:33:12Z","type":"conference","year":"2001","language":[{"iso":"eng"}],"status":"public","citation":{"apa":"Brattka, V., &#38; Ziegler, M. (2001). Turing Computability of (Non-)Linear Optimization. In <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i> (pp. 181–184).","ama":"Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In: <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>. ; 2001:181-184.","chicago":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” In <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 181–84, 2001.","ieee":"V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,” in <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 2001, pp. 181–184.","mla":"Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.” <i>Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)</i>, 2001, pp. 181–84.","bibtex":"@inproceedings{Brattka_Ziegler_2001, title={Turing Computability of (Non-)Linear Optimization}, booktitle={Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01)}, author={Brattka, Vasco and Ziegler, Martin}, year={2001}, pages={181–184} }","short":"V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01), 2001, pp. 181–184."},"user_id":"15415","department":[{"_id":"63"}],"title":"Turing Computability of (Non-)Linear Optimization","author":[{"last_name":"Brattka","full_name":"Brattka, Vasco","first_name":"Vasco"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"abstract":[{"lang":"eng","text":"We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather than the RealRAM model. Asking for mere computability of a function's maximum over some closed domain, we show that the common presumptions 'full-dimensional' and `bounded' in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other hand, convexity of this domain may be weakened to connectedness, and even NON-linear functions turn out to be effectively optimizable."}]},{"page":"275 - 278","type":"conference","publication":"Proc. of 3. GI-Informatiktage 2001","ddc":["000"],"user_id":"15415","abstract":[{"lang":"eng","text":"We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low."}],"has_accepted_license":"1","file":[{"access_level":"closed","content_type":"application/pdf","file_id":"18371","date_created":"2020-08-26T13:08:08Z","creator":"koala","file_name":"hni-id-1450.pdf","file_size":146136,"success":1,"relation":"main_file","date_updated":"2020-08-26T13:08:08Z"}],"title":"Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph","date_updated":"2022-01-06T06:53:30Z","_id":"18370","file_date_updated":"2020-08-26T13:08:08Z","status":"public","year":"2001","language":[{"iso":"eng"}],"date_created":"2020-08-26T13:08:24Z","department":[{"_id":"63"}],"citation":{"ama":"Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: <i>Proc. of 3. GI-Informatiktage 2001</i>. Bad Schussenried; 2001:275-278.","apa":"Klein, J., &#38; Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In <i>Proc. of 3. GI-Informatiktage 2001</i> (pp. 275–278). Bad Schussenried.","chicago":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” In <i>Proc. of 3. GI-Informatiktage 2001</i>, 275–78. Bad Schussenried, 2001.","ieee":"J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–278.","mla":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–78.","bibtex":"@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc. of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001}, pages={275–278} }","short":"J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278."},"place":"Bad Schussenried","author":[{"last_name":"Klein","full_name":"Klein, Jan","first_name":"Jan"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"}]},{"author":[{"full_name":"Wand, Michael","first_name":"Michael","last_name":"Wand"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"last_name":"Peter","first_name":"Ingmar","full_name":"Peter, Ingmar"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Wolfgang","full_name":"Straßer, Wolfgang","last_name":"Straßer"}],"title":"The randomized z-buffer algorithm","abstract":[{"text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of an arbitrary three-dimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized z-buffer cannot drop below that of conventional z-buffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like z-buffer rendering. The precomputed data structures employed by the randomized z-buffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption.","lang":"eng"}],"doi":"10.1145/383259.383299","user_id":"15415","publication_status":"published","citation":{"short":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001.","mla":"Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001, doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>.","bibtex":"@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The randomized z-buffer algorithm}, DOI={<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>}, booktitle={Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001} }","chicago":"Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>.","ieee":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>, 2001.","ama":"Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>. ; 2001. doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>","apa":"Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., &#38; Straßer, W. (2001). The randomized z-buffer algorithm. In <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>"},"department":[{"_id":"63"}],"publication":"Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH '01","date_created":"2020-04-09T10:36:54Z","status":"public","year":"2001","publication_identifier":{"isbn":["158113374X"]},"type":"conference","language":[{"iso":"eng"}],"_id":"16492","date_updated":"2022-01-06T06:52:51Z"},{"volume":2204,"_id":"16493","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:40:48Z","publication":"Graph-Theoretic Concepts in Computer Science","status":"public","language":[{"iso":"eng"}],"year":"2001","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540427070","9783540454779"]},"type":"book_chapter","publication_status":"published","user_id":"15415","citation":{"short":"F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001.","bibtex":"@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204}, DOI={<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science} }","mla":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>.","ieee":"F. Meyer auf der Heide, “Data Management in Networks,” in <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, Berlin, Heidelberg, 2001.","chicago":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In <i>Graph-Theoretic Concepts in Computer Science</i>, Vol. 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>.","ama":"Meyer auf der Heide F. Data Management in Networks. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>","apa":"Meyer auf der Heide, F. (2001). Data Management in Networks. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 2204). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>"},"series_title":" Lecture Notes in Computer Science","department":[{"_id":"63"}],"author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"title":"Data Management in Networks","doi":"10.1007/3-540-45477-2_2","intvolume":"      2204","place":"Berlin, Heidelberg"},{"department":[{"_id":"63"}],"user_id":"15415","publication_status":"published","citation":{"short":"F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.","bibtex":"@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel Bridging Models and Their Impact on Algorithm Design}, DOI={<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>}, booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2001} }","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” <i>Computational Science - ICCS 2001</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>.","ieee":"F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in <i>Computational Science - ICCS 2001</i>, Berlin, Heidelberg, 2001.","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>.","apa":"Meyer auf der Heide, F., &#38; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>","ama":"Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>"},"doi":"10.1007/3-540-45718-6_68","place":"Berlin, Heidelberg","author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"title":"Parallel Bridging Models and Their Impact on Algorithm Design","date_updated":"2022-01-06T06:52:51Z","_id":"16494","status":"public","type":"book_chapter","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540422334","9783540457183"]},"year":"2001","language":[{"iso":"eng"}],"publication":"Computational Science - ICCS 2001","date_created":"2020-04-09T10:51:36Z"},{"department":[{"_id":"63"}],"user_id":"15415","publication_status":"published","citation":{"ieee":"F. Meyer auf der Heide, Ed., <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.","chicago":"Meyer auf der Heide, Friedhelm, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001. <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>.","apa":"Meyer auf der Heide, F. (Ed.). (2001). <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i> (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>","ama":"Meyer auf der Heide F, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>","short":"F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.","bibtex":"@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}, DOI={<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>}, publisher={Springer }, year={2001} }","mla":"Meyer auf der Heide, Friedhelm, editor. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>."},"doi":"10.1007/3-540-44676-1","place":"Berlin, Heidelberg","editor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark","date_updated":"2022-01-06T06:52:55Z","edition":"Lecture Notes in Computer Science (LNCS, volume 2161)","_id":"16722","status":"public","year":"2001","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424932","9783540446767"]},"type":"book_editor","language":[{"iso":"eng"}],"publisher":"Springer ","date_created":"2020-04-17T10:59:08Z"},{"intvolume":"        81","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"author":[{"last_name":"Rieping","first_name":"Ingo","full_name":"Rieping, Ingo"}],"title":"Communication in Parallel Systems-Models, Algorithms and Implementations","department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","citation":{"short":"I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","bibtex":"@book{Rieping_2000, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Communication in Parallel Systems-Models, Algorithms and Implementations}, volume={81}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Rieping, Ingo}, year={2000}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Rieping, Ingo. <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","ieee":"I. Rieping, <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>, vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","chicago":"Rieping, Ingo. <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>. Vol. 81. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","apa":"Rieping, I. (2000). <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i> (Vol. 81). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Rieping I. <i>Communication in Parallel Systems-Models, Algorithms and Implementations</i>. Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000."},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","status":"public","language":[{"iso":"eng"}],"type":"dissertation","publication_identifier":{"isbn":["3-931466-80-9"]},"year":"2000","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_created":"2020-09-22T10:06:31Z","date_updated":"2022-01-06T06:54:08Z","volume":81,"_id":"19620"},{"author":[{"first_name":"Matthias","full_name":"Westermann, Matthias","last_name":"Westermann"}],"title":"Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints","intvolume":"        90","supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"user_id":"5786","citation":{"chicago":"Westermann, Matthias. <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>. Vol. 90. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","ieee":"M. Westermann, <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","apa":"Westermann, M. (2000). <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i> (Vol. 90). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Westermann M. <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>. Vol 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.","short":"M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","mla":"Westermann, Matthias. <i>Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.","bibtex":"@book{Westermann_2000, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints}, volume={90}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Westermann, Matthias}, year={2000}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","related_material":{"link":[{"relation":"confirmation","url":"https://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20000101283"}]},"date_created":"2020-09-22T10:16:35Z","status":"public","language":[{"iso":"eng"}],"type":"dissertation","publication_identifier":{"isbn":["3-931466-89-2"]},"year":"2000","volume":90,"_id":"19621","date_updated":"2022-01-06T06:54:08Z"},{"language":[{"iso":"eng"}],"type":"report","year":"2000","status":"public","date_created":"2020-09-28T12:20:20Z","ddc":["000"],"date_updated":"2022-01-06T06:54:10Z","_id":"19733","file_date_updated":"2020-09-28T12:20:10Z","has_accepted_license":"1","title":"PUB-Library, Release 7.0, User Guide and Function Reference","file":[{"success":1,"date_updated":"2020-09-28T12:20:10Z","relation":"main_file","date_created":"2020-09-28T12:20:10Z","content_type":"application/pdf","access_level":"closed","file_id":"19734","file_name":"pub-hni-1656.pdf","file_size":271118,"creator":"koala"}],"author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"full_name":"Rieping, Ingo","first_name":"Ingo","last_name":"Rieping"},{"first_name":"Ingo","full_name":"von Otte, Ingo","last_name":"von Otte"},{"last_name":"Juurlink","full_name":"Juurlink, Bernhardus","first_name":"Bernhardus"}],"department":[{"_id":"63"}],"citation":{"ama":"Bonorden O, Rieping I, von Otte I, Juurlink B. <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>.; 2000.","apa":"Bonorden, O., Rieping, I., von Otte, I., &#38; Juurlink, B. (2000). <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>.","chicago":"Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>, 2000.","ieee":"O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>. 2000.","mla":"Bonorden, Olaf, et al. <i>PUB-Library, Release 7.0, User Guide and Function Reference</i>. 2000.","bibtex":"@book{Bonorden_Rieping_von Otte_Juurlink_2000, title={PUB-Library, Release 7.0, User Guide and Function Reference}, author={Bonorden, Olaf and Rieping, Ingo and von Otte, Ingo and Juurlink, Bernhardus}, year={2000} }","short":"O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0, User Guide and Function Reference, 2000."},"user_id":"15415"},{"title":"Tradeoff analysis and architecture design of a hybrid hardware/software sorter","author":[{"full_name":"Bednara, M.","first_name":"M.","last_name":"Bednara"},{"last_name":"Beyer","first_name":"O.","full_name":"Beyer, O."},{"last_name":"Teich","first_name":"J.","full_name":"Teich, J."},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"doi":"10.1109/asap.2000.862400","citation":{"ieee":"M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture design of a hybrid hardware/software sorter,” in <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 2000, pp. 299–308, doi: <a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>.","chicago":"Bednara, M., O. Beyer, J. Teich, and Rolf Wanka. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” In <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 299–308, 2000. <a href=\"https://doi.org/10.1109/asap.2000.862400\">https://doi.org/10.1109/asap.2000.862400</a>.","apa":"Bednara, M., Beyer, O., Teich, J., &#38; Wanka, R. (2000). Tradeoff analysis and architecture design of a hybrid hardware/software sorter. <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 299–308. <a href=\"https://doi.org/10.1109/asap.2000.862400\">https://doi.org/10.1109/asap.2000.862400</a>","ama":"Bednara M, Beyer O, Teich J, Wanka R. Tradeoff analysis and architecture design of a hybrid hardware/software sorter. In: <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>. ; 2000:299-308. doi:<a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>","short":"M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.","bibtex":"@inproceedings{Bednara_Beyer_Teich_Wanka_2000, title={Tradeoff analysis and architecture design of a hybrid hardware/software sorter}, DOI={<a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>}, booktitle={Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)}, author={Bednara, M. and Beyer, O. and Teich, J. and Wanka, Rolf}, year={2000}, pages={299–308} }","mla":"Bednara, M., et al. “Tradeoff Analysis and Architecture Design of a Hybrid Hardware/Software Sorter.” <i>Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)</i>, 2000, pp. 299–308, doi:<a href=\"https://doi.org/10.1109/asap.2000.862400\">10.1109/asap.2000.862400</a>."},"publication_status":"published","user_id":"15415","department":[{"_id":"63"}],"date_created":"2020-10-02T10:30:38Z","publication":"Proc. Int. Conf. on Application Specific Systems, Architectures, and Processors (ASAP)","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0769507166"]},"type":"conference","year":"2000","status":"public","_id":"19849","page":"299-308","date_updated":"2022-01-06T06:54:13Z"},{"status":"public","type":"journal_article","year":"2000","language":[{"iso":"eng"}],"publication":"Theory Comput. Syst.","date_created":"2018-04-03T05:51:02Z","date_updated":"2022-01-06T06:54:59Z","issue":"5/6","volume":33,"_id":"2143","page":"337--391","intvolume":"        33","doi":"10.1007/s002240010006","author":[{"last_name":"Adler","first_name":"Micah","full_name":"Adler, Micah"},{"first_name":"Christian","full_name":"Scheideler, Christian","last_name":"Scheideler","id":"20792"}],"title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","citation":{"chicago":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i> 33, no. 5/6 (2000): 337--391. <a href=\"https://doi.org/10.1007/s002240010006\">https://doi.org/10.1007/s002240010006</a>.","ieee":"M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc Wireless Networks,” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6, pp. 337--391, 2000.","ama":"Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless Networks. <i>Theory Comput Syst</i>. 2000;33(5/6):337--391. doi:<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>","apa":"Adler, M., &#38; Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. <i>Theory Comput. Syst.</i>, <i>33</i>(5/6), 337--391. <a href=\"https://doi.org/10.1007/s002240010006\">https://doi.org/10.1007/s002240010006</a>","short":"M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.","mla":"Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.” <i>Theory Comput. Syst.</i>, vol. 33, no. 5/6, 2000, pp. 337--391, doi:<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>.","bibtex":"@article{Adler_Scheideler_2000, title={Efficient Communication Strategies for Ad Hoc Wireless Networks}, volume={33}, DOI={<a href=\"https://doi.org/10.1007/s002240010006\">10.1007/s002240010006</a>}, number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler, Christian}, year={2000}, pages={337--391} }"}},{"intvolume":"        30","doi":"10.1137/S0097539799353431","title":"From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols","author":[{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"department":[{"_id":"79"},{"_id":"63"}],"citation":{"ieee":"C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols,” <i>SIAM J. Comput.</i>, vol. 30, no. 4, pp. 1126--1155, 2000.","chicago":"Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” <i>SIAM J. Comput.</i> 30, no. 4 (2000): 1126--1155. <a href=\"https://doi.org/10.1137/S0097539799353431\">https://doi.org/10.1137/S0097539799353431</a>.","ama":"Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. <i>SIAM J Comput</i>. 2000;30(4):1126--1155. doi:<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>","apa":"Scheideler, C., &#38; Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. <i>SIAM J. Comput.</i>, <i>30</i>(4), 1126--1155. <a href=\"https://doi.org/10.1137/S0097539799353431\">https://doi.org/10.1137/S0097539799353431</a>","short":"C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.","bibtex":"@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>}, 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.” <i>SIAM J. Comput.</i>, vol. 30, no. 4, 2000, pp. 1126--1155, doi:<a href=\"https://doi.org/10.1137/S0097539799353431\">10.1137/S0097539799353431</a>."},"user_id":"14955","year":"2000","type":"journal_article","language":[{"iso":"eng"}],"status":"public","publication":"SIAM J. Comput.","date_created":"2018-04-03T06:12:15Z","date_updated":"2022-01-06T06:55:00Z","issue":"4","page":"1126--1155","_id":"2145","volume":30},{"date_updated":"2022-01-06T06:55:00Z","_id":"2146","file_date_updated":"2018-04-12T08:47:50Z","language":[{"iso":"eng"}],"type":"conference","year":"2000","status":"public","date_created":"2018-04-03T06:13:07Z","publication":"PDPTA","ddc":["040"],"department":[{"_id":"79"},{"_id":"63"}],"citation":{"mla":"Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” <i>PDPTA</i>, 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.","ama":"Berenbrink P, Brinkmann A, Scheideler C. Distributed Path Selection for Storage Networks. In: <i>PDPTA</i>. ; 2000.","apa":"Berenbrink, P., Brinkmann, A., &#38; Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In <i>PDPTA</i>.","chicago":"Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In <i>PDPTA</i>, 2000.","ieee":"P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection for Storage Networks,” in <i>PDPTA</i>, 2000."},"oa":"1","user_id":"14955","has_accepted_license":"1","urn":"21467","title":"Distributed Path Selection for Storage Networks","file":[{"relation":"main_file","date_updated":"2018-04-12T08:47:50Z","creator":"florida","file_name":"PDPTA-00.pdf","file_size":168677,"access_level":"open_access","file_id":"2299","content_type":"application/pdf","date_created":"2018-04-12T08:47:50Z"}],"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","id":"20792","last_name":"Scheideler"}]},{"oa":"1","user_id":"14955","citation":{"ieee":"A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma,” in <i>SODA</i>, 2000, pp. 30--39.","chicago":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In <i>SODA</i>, 30--39, 2000.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In <i>SODA</i> (pp. 30--39).","ama":"Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In: <i>SODA</i>. ; 2000:30--39.","short":"A. Czumaj, C. Scheideler, in: SODA, 2000, 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} }","mla":"Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” <i>SODA</i>, 2000, pp. 30--39."},"department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","file_size":185001,"file_name":"SODA-00.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"2295","date_created":"2018-04-12T08:36:17Z","relation":"main_file","date_updated":"2018-04-12T08:36:17Z"}],"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma","urn":"21476","has_accepted_license":"1","_id":"2147","file_date_updated":"2018-04-12T08:36:17Z","page":"30--39","date_updated":"2022-01-06T06:55:00Z","publication":"SODA","ddc":["040"],"date_created":"2018-04-03T06:16:48Z","status":"public","year":"2000","type":"conference","language":[{"iso":"eng"}]},{"title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"}],"intvolume":"        17","citation":{"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.” <i>Random Struct. Algorithms</i>, vol. 17, no. 3–4, 2000, pp. 213--237.","short":"A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct. Algorithms</i>, <i>17</i>(3–4), 213--237.","ama":"Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. <i>Random Struct Algorithms</i>. 2000;17(3-4):213--237.","ieee":"A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma,” <i>Random Struct. Algorithms</i>, 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.” <i>Random Struct. Algorithms</i> 17, no. 3–4 (2000): 213--237."},"user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"publication":"Random Struct. Algorithms","date_created":"2018-04-03T06:17:52Z","type":"journal_article","year":"2000","language":[{"iso":"eng"}],"status":"public","page":"213--237","_id":"2148","volume":17,"date_updated":"2022-01-06T06:55:00Z","issue":"3-4"},{"has_accepted_license":"1","author":[{"full_name":"Brinkmann, André","first_name":"André","last_name":"Brinkmann"},{"first_name":"Kay","full_name":"Salzwedel, Kay","last_name":"Salzwedel"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"file":[{"creator":"florida","file_size":222176,"file_name":"spaa_00.pdf","access_level":"open_access","content_type":"application/pdf","file_id":"2297","date_created":"2018-04-12T08:38:13Z","relation":"main_file","date_updated":"2018-04-12T08:38:13Z"}],"title":"Efficient, distributed data placement strategies for storage area networks (extended abstract)","urn":"21493","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","user_id":"14955","citation":{"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).” <i>SPAA</i>, 2000, pp. 119--128.","ieee":"A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data placement strategies for storage area networks (extended abstract),” in <i>SPAA</i>, 2000, pp. 119--128.","chicago":"Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In <i>SPAA</i>, 119--128, 2000.","ama":"Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement strategies for storage area networks (extended abstract). In: <i>SPAA</i>. ; 2000:119--128.","apa":"Brinkmann, A., Salzwedel, K., &#38; Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In <i>SPAA</i> (pp. 119--128)."},"status":"public","language":[{"iso":"eng"}],"year":"2000","type":"conference","date_created":"2018-04-03T06:18:45Z","publication":"SPAA","ddc":["040"],"date_updated":"2022-01-06T06:55:02Z","_id":"2149","file_date_updated":"2018-04-12T08:38:13Z","page":"119--128"},{"file":[{"creator":"florida","file_name":"STOC-00.pdf","file_size":190083,"file_id":"2300","access_level":"open_access","content_type":"application/pdf","date_created":"2018-04-12T08:49:23Z","relation":"main_file","date_updated":"2018-04-12T08:49:23Z"}],"title":"A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract)","has_accepted_license":"1","user_id":"14955","oa":"1","ddc":["040"],"publication":"STOC","type":"conference","page":"38--47","author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"last_name":"Scheideler","id":"20792","first_name":"Christian","full_name":"Scheideler, Christian"}],"urn":"21509","citation":{"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 <i>STOC</i>, 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 <i>STOC</i>, 2000, pp. 38--47.","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: <i>STOC</i>. ACM; 2000:38--47.","apa":"Czumaj, A., &#38; Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In <i>STOC</i> (pp. 38--47). ACM.","short":"A. Czumaj, C. Scheideler, in: STOC, ACM, 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).” <i>STOC</i>, 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} }"},"department":[{"_id":"79"},{"_id":"63"}],"publisher":"ACM","date_created":"2018-04-03T06:21:11Z","status":"public","language":[{"iso":"eng"}],"year":"2000","_id":"2150","file_date_updated":"2018-04-12T08:49:23Z","date_updated":"2022-01-06T06:55:02Z"}]