[{"status":"public","publication":"Zeitschrift für  \tAnglistik und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2","type":"book_chapter","extern":"1","language":[{"iso":"eng"}],"department":[{"_id":"384"}],"series_title":"Heft 2","user_id":"21240","_id":"17907","page":"195 - 197","intvolume":"         2","citation":{"chicago":"Mindt, Ilka, Rodney Huddleston, and Geoffrey K. Pullum. “A Student’s Introduction to  \tEnglish Grammar.” In <i>Zeitschrift Für  \tAnglistik Und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2</i>, 2:195–97. Heft 2. Cambridge: Cambridge University Press, 2005, 2005.","ieee":"I. Mindt, R. Huddleston, and G. K. Pullum, “A Student’s Introduction to  \tEnglish Grammar,” in <i>Zeitschrift für  \tAnglistik und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2</i>, vol. 2, Cambridge: Cambridge University Press, 2005, 2005, pp. 195–197.","ama":"Mindt I, Huddleston R, Pullum GK. A Student’s Introduction to  \tEnglish Grammar. In: <i>Zeitschrift Für  \tAnglistik Und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2</i>. Vol 2. Heft 2. Cambridge: Cambridge University Press, 2005; 2005:195-197.","short":"I. Mindt, R. Huddleston, G.K. Pullum, in: Zeitschrift Für  \tAnglistik Und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2, Cambridge University Press, 2005, Cambridge, 2005, pp. 195–197.","bibtex":"@inbook{Mindt_Huddleston_Pullum_2005, place={Cambridge}, series={Heft 2}, title={A Student’s Introduction to  \tEnglish Grammar}, volume={2}, booktitle={Zeitschrift für  \tAnglistik und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2}, publisher={Cambridge University Press, 2005}, author={Mindt, Ilka and Huddleston, Rodney and Pullum, Geoffrey K.}, year={2005}, pages={195–197}, collection={Heft 2} }","mla":"Mindt, Ilka, et al. “A Student’s Introduction to  \tEnglish Grammar.” <i>Zeitschrift Für  \tAnglistik Und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2</i>, vol. 2, Cambridge University Press, 2005, 2005, pp. 195–97.","apa":"Mindt, I., Huddleston, R., &#38; Pullum, G. K. (2005). A Student’s Introduction to  \tEnglish Grammar. In <i>Zeitschrift für  \tAnglistik und Amerikanisitk. A Quarterly of Language, Literature and Culture. Heft 2,  \t2</i> (Vol. 2, pp. 195–197). Cambridge: Cambridge University Press, 2005."},"place":"Cambridge","year":"2005","title":"A Student's Introduction to  \tEnglish Grammar","volume":2,"date_created":"2020-08-13T10:54:37Z","author":[{"first_name":"Ilka","id":"32079","full_name":"Mindt, Ilka","last_name":"Mindt"},{"last_name":"Huddleston","full_name":"Huddleston, Rodney","first_name":"Rodney"},{"full_name":"Pullum, Geoffrey K.","last_name":"Pullum","first_name":"Geoffrey K."}],"date_updated":"2022-01-06T06:53:23Z","publisher":"Cambridge University Press, 2005"},{"extern":"1","language":[{"iso":"ger"}],"user_id":"21240","department":[{"_id":"384"}],"_id":"17908","status":"public","type":"book_chapter","publication":"Anglistik. Mitteilungen des Deutschen Anglistenverbandes","title":" Lexikalische Dynamik: Kognitiv-linguistische  \tUntersuchungen am englischen Computerwortschatz","author":[{"first_name":"Ilka","last_name":"Mindt","id":"32079","full_name":"Mindt, Ilka"},{"last_name":"Bründl","full_name":"Bründl, Monika Elisabeth","first_name":"Monika Elisabeth"}],"date_created":"2020-08-13T11:19:46Z","date_updated":"2022-01-06T06:53:23Z","publisher":"Niemeyer, 2001","citation":{"mla":"Mindt, Ilka, and Monika Elisabeth Bründl. “ Lexikalische Dynamik: Kognitiv-linguistische  \tUntersuchungen am englischen Computerwortschatz.” <i>Anglistik. Mitteilungen des Deutschen Anglistenverbandes</i>, Heft 16/1, März 2005, Niemeyer, 2001, 2005, pp. 194–96.","bibtex":"@inbook{Mindt_Bründl_2005, place={Tübingen}, edition={Heft 16/1, März 2005}, title={ Lexikalische Dynamik: Kognitiv-linguistische  \tUntersuchungen am englischen Computerwortschatz}, booktitle={Anglistik. Mitteilungen des Deutschen Anglistenverbandes}, publisher={Niemeyer, 2001}, author={Mindt, Ilka and Bründl, Monika Elisabeth}, year={2005}, pages={194–196} }","short":"I. Mindt, M.E. Bründl, in: Anglistik. Mitteilungen des Deutschen Anglistenverbandes, Heft 16/1, März 2005, Niemeyer, 2001, Tübingen, 2005, pp. 194–196.","apa":"Mindt, I., &#38; Bründl, M. E. (2005).  Lexikalische Dynamik: Kognitiv-linguistische  \tUntersuchungen am englischen Computerwortschatz. In <i>Anglistik. Mitteilungen des Deutschen Anglistenverbandes</i> (Heft 16/1, März 2005, pp. 194–196). Tübingen: Niemeyer, 2001.","ama":"Mindt I, Bründl ME.  Lexikalische Dynamik: Kognitiv-linguistische  \tUntersuchungen am englischen Computerwortschatz. In: <i>Anglistik. Mitteilungen des Deutschen Anglistenverbandes</i>. Heft 16/1, März 2005. Tübingen: Niemeyer, 2001; 2005:194-196.","ieee":"I. Mindt and M. E. Bründl, “ Lexikalische Dynamik: Kognitiv-linguistische  \tUntersuchungen am englischen Computerwortschatz,” in <i>Anglistik. Mitteilungen des Deutschen Anglistenverbandes</i>, Heft 16/1, März 2005., Tübingen: Niemeyer, 2001, 2005, pp. 194–196.","chicago":"Mindt, Ilka, and Monika Elisabeth Bründl. “ Lexikalische Dynamik: Kognitiv-linguistische  \tUntersuchungen am englischen Computerwortschatz.” In <i>Anglistik. Mitteilungen des Deutschen Anglistenverbandes</i>, Heft 16/1, März 2005., 194–96. Tübingen: Niemeyer, 2001, 2005."},"page":"194 - 196","year":"2005","place":"Tübingen","edition":"Heft 16/1, März 2005"},{"abstract":[{"text":"Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our framework is based on a connection of property testing and a new class of problems which we call abstract combinatorial programs . We show that if the problem of testing a property can be reduced to an abstract combinatorial program of small dimension , then the property has an efficient tester.\r\n\r\nWe apply our framework to a variety of problems. We present efficient property testing algorithms for geometric clustering problems, for the reversal distance problem, and for graph and hypergraph coloring problems. We also prove that, informally, any hereditary graph property can be efficiently tested if and only if it can be reduced to an abstract combinatorial program of small size.\r\n\r\nOur framework allows us to analyze all our testers in a unified way, and the obtained complexity bounds either match or improve the previously known bounds. Furthermore, even if the asymptotic complexity of the testers is not improved, the obtained proofs are significantly simpler than the previous ones. We believe that our framework will help to understand the structure of efficiently testable properties.","lang":"eng"}],"status":"public","type":"journal_article","publication":"SIAM Journal on Computing","language":[{"iso":"eng"}],"_id":"18763","user_id":"15415","department":[{"_id":"63"}],"year":"2005","citation":{"bibtex":"@article{Czumaj_Sohler_2005, title={Abstract Combinatorial Programs and Efficient Property Testers}, volume={34}, DOI={<a href=\"https://doi.org/10.1137/s009753970444199x\">10.1137/s009753970444199x</a>}, number={3}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Sohler, Christian}, year={2005}, pages={580–615} }","short":"A. Czumaj, C. Sohler, SIAM Journal on Computing 34 (2005) 580–615.","mla":"Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.” <i>SIAM Journal on Computing</i>, vol. 34, no. 3, 2005, pp. 580–615, doi:<a href=\"https://doi.org/10.1137/s009753970444199x\">10.1137/s009753970444199x</a>.","apa":"Czumaj, A., &#38; Sohler, C. (2005). Abstract Combinatorial Programs and Efficient Property Testers. <i>SIAM Journal on Computing</i>, <i>34</i>(3), 580–615. <a href=\"https://doi.org/10.1137/s009753970444199x\">https://doi.org/10.1137/s009753970444199x</a>","chicago":"Czumaj, Artur, and Christian Sohler. “Abstract Combinatorial Programs and Efficient Property Testers.” <i>SIAM Journal on Computing</i> 34, no. 3 (2005): 580–615. <a href=\"https://doi.org/10.1137/s009753970444199x\">https://doi.org/10.1137/s009753970444199x</a>.","ieee":"A. Czumaj and C. Sohler, “Abstract Combinatorial Programs and Efficient Property Testers,” <i>SIAM Journal on Computing</i>, vol. 34, no. 3, pp. 580–615, 2005.","ama":"Czumaj A, Sohler C. Abstract Combinatorial Programs and Efficient Property Testers. <i>SIAM Journal on Computing</i>. 2005;34(3):580-615. doi:<a href=\"https://doi.org/10.1137/s009753970444199x\">10.1137/s009753970444199x</a>"},"page":"580-615","intvolume":"        34","publication_status":"published","publication_identifier":{"issn":["0097-5397","1095-7111"]},"issue":"3","title":"Abstract Combinatorial Programs and Efficient Property Testers","doi":"10.1137/s009753970444199x","date_updated":"2022-01-06T06:53:52Z","date_created":"2020-09-01T11:35:41Z","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"volume":34},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18768","status":"public","type":"conference","publication":"Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)","doi":"10.1007/11523468_70","title":"Facility Location in Sublinear Time","date_created":"2020-09-01T11:53:19Z","author":[{"last_name":"Bădoiu","full_name":"Bădoiu, Mihai","first_name":"Mihai"},{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"first_name":"Piotr","full_name":"Indyk, Piotr","last_name":"Indyk"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:52Z","citation":{"apa":"Bădoiu, M., Czumaj, A., Indyk, P., &#38; Sohler, C. (2005). Facility Location in Sublinear Time. In <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i> (pp. 866–877). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11523468_70\">https://doi.org/10.1007/11523468_70</a>","short":"M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, in: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Berlin, Heidelberg, 2005, pp. 866–877.","mla":"Bădoiu, Mihai, et al. “Facility Location in Sublinear Time.” <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2005, pp. 866–77, doi:<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>.","bibtex":"@inproceedings{Bădoiu_Czumaj_Indyk_Sohler_2005, place={Berlin, Heidelberg}, title={Facility Location in Sublinear Time}, DOI={<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>}, booktitle={Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)}, author={Bădoiu, Mihai and Czumaj, Artur and Indyk, Piotr and Sohler, Christian}, year={2005}, pages={866–877} }","chicago":"Bădoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.” In <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 866–77. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11523468_70\">https://doi.org/10.1007/11523468_70</a>.","ieee":"M. Bădoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2005, pp. 866–877.","ama":"Bădoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>. Berlin, Heidelberg; 2005:866-877. doi:<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>"},"page":"866-877","place":"Berlin, Heidelberg","year":"2005","publication_status":"published","publication_identifier":{"isbn":["9783540275800","9783540316916"],"issn":["0302-9743","1611-3349"]}},{"year":"2005","citation":{"apa":"Sohler, C., &#38; Frahling, G. (2005). Coresets in Dynamic Geometric Data Streams. In <i>Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)</i> (pp. 209–217).","bibtex":"@inproceedings{Sohler_Frahling_2005, title={Coresets in Dynamic Geometric Data Streams}, booktitle={Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)}, author={Sohler, Christian and Frahling, Gereon}, year={2005}, pages={209–217} }","short":"C. Sohler, G. Frahling, in: Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 209–217.","mla":"Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” <i>Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)</i>, 2005, pp. 209–17.","ama":"Sohler C, Frahling G. Coresets in Dynamic Geometric Data Streams. In: <i>Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)</i>. ; 2005:209-217.","ieee":"C. Sohler and G. Frahling, “Coresets in Dynamic Geometric Data Streams,” in <i>Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)</i>, 2005, pp. 209–217.","chicago":"Sohler, Christian, and Gereon Frahling. “Coresets in Dynamic Geometric Data Streams.” In <i>Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)</i>, 209–17, 2005."},"page":"209-217","title":"Coresets in Dynamic Geometric Data Streams","date_updated":"2022-01-06T06:53:52Z","author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"full_name":"Frahling, Gereon","last_name":"Frahling","first_name":"Gereon"}],"date_created":"2020-09-01T13:49:23Z","abstract":[{"lang":"eng","text":"A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1,..., ∆} d [26]. We develop streaming (1 + ɛ)-approximation algorithms for k-median, k-means, MaxCut, maximum weighted matching (MaxWM), maximum travelling salesperson (MaxTSP), maximum spanning tree (MaxST), and average distance over dynamic geometric data streams. Our algorithms maintain a small weighted set of points (a coreset) that approximates with probability 2/3 the current point set with respect to the considered problem during the m insert/delete operations of the data stream. They use poly(ɛ −1, log m, log ∆) space and update time per insert/delete operation for constant k and dimension d. Having a coreset one only needs a fast approximation algorithm for the weighted problem to compute a solution quickly. In fact, even an exponential algorithm is sometimes feasible as its running time may still be polynomial in n. For example one can compute in poly(log n, exp(O((1+log(1/ɛ)/ɛ) d−1))) time a solution to k-median and k-means [21] where n is the size of the current point set and k and d are constants. Finding an implicit solution to MaxCut can be done in poly(log n, exp((1/ɛ) O(1))) time. For MaxST and average distance we require poly(log n, ɛ −1) time and for MaxWM we require O(n 3) time to do this."}],"status":"public","type":"conference","publication":"Proceedings of the 37th ACM Symposium on Theory of Computing (STOC)","language":[{"iso":"eng"}],"_id":"18787","user_id":"15415","department":[{"_id":"63"}]},{"_id":"18790","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Theoretical Computer Science","status":"public","date_updated":"2022-01-06T06:53:52Z","author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"date_created":"2020-09-01T14:00:37Z","volume":331,"title":"Testing hypergraph colorability","doi":"10.1016/j.tcs.2004.09.031","publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"issue":"1","year":"2005","citation":{"ieee":"A. Czumaj and C. Sohler, “Testing hypergraph colorability,” <i>Theoretical Computer Science</i>, vol. 331, no. 1, pp. 37–52, 2005.","chicago":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” <i>Theoretical Computer Science</i> 331, no. 1 (2005): 37–52. <a href=\"https://doi.org/10.1016/j.tcs.2004.09.031\">https://doi.org/10.1016/j.tcs.2004.09.031</a>.","ama":"Czumaj A, Sohler C. Testing hypergraph colorability. <i>Theoretical Computer Science</i>. 2005;331(1):37-52. doi:<a href=\"https://doi.org/10.1016/j.tcs.2004.09.031\">10.1016/j.tcs.2004.09.031</a>","mla":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” <i>Theoretical Computer Science</i>, vol. 331, no. 1, 2005, pp. 37–52, doi:<a href=\"https://doi.org/10.1016/j.tcs.2004.09.031\">10.1016/j.tcs.2004.09.031</a>.","short":"A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52.","bibtex":"@article{Czumaj_Sohler_2005, title={Testing hypergraph colorability}, volume={331}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2004.09.031\">10.1016/j.tcs.2004.09.031</a>}, number={1}, journal={Theoretical Computer Science}, author={Czumaj, Artur and Sohler, Christian}, year={2005}, pages={37–52} }","apa":"Czumaj, A., &#38; Sohler, C. (2005). Testing hypergraph colorability. <i>Theoretical Computer Science</i>, <i>331</i>(1), 37–52. <a href=\"https://doi.org/10.1016/j.tcs.2004.09.031\">https://doi.org/10.1016/j.tcs.2004.09.031</a>"},"intvolume":"       331","page":"37-52"},{"_id":"18855","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"SIAM Journal on Computing","type":"journal_article","abstract":[{"text":"We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\\mathbb R^d$. We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within $1 + \\eps$ using only $\\widetilde{\\O}(\\sqrt{n} \\, \\text{poly} (1/\\eps))$ queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbor queries.\r\n\r\n\r\nRead More: https://epubs.siam.org/doi/10.1137/S0097539703435297\r\n","lang":"eng"}],"status":"public","date_updated":"2022-01-06T06:53:53Z","volume":35,"author":[{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"},{"last_name":"Ergün","full_name":"Ergün, Funda","first_name":"Funda"},{"first_name":"Lance","full_name":"Fortnow, Lance","last_name":"Fortnow"},{"first_name":"Avner","last_name":"Magen","full_name":"Magen, Avner"},{"last_name":"Newman","full_name":"Newman, Ilan","first_name":"Ilan"},{"last_name":"Rubinfeld","full_name":"Rubinfeld, Ronitt","first_name":"Ronitt"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"date_created":"2020-09-02T12:13:26Z","title":"Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time","doi":"10.1137/s0097539703435297","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","issue":"1","year":"2005","page":"91-109","intvolume":"        35","citation":{"apa":"Czumaj, A., Ergün, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., &#38; Sohler, C. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. <i>SIAM Journal on Computing</i>, <i>35</i>(1), 91–109. <a href=\"https://doi.org/10.1137/s0097539703435297\">https://doi.org/10.1137/s0097539703435297</a>","mla":"Czumaj, Artur, et al. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” <i>SIAM Journal on Computing</i>, vol. 35, no. 1, 2005, pp. 91–109, doi:<a href=\"https://doi.org/10.1137/s0097539703435297\">10.1137/s0097539703435297</a>.","bibtex":"@article{Czumaj_Ergün_Fortnow_Magen_Newman_Rubinfeld_Sohler_2005, title={Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time}, volume={35}, DOI={<a href=\"https://doi.org/10.1137/s0097539703435297\">10.1137/s0097539703435297</a>}, number={1}, journal={SIAM Journal on Computing}, author={Czumaj, Artur and Ergün, Funda and Fortnow, Lance and Magen, Avner and Newman, Ilan and Rubinfeld, Ronitt and Sohler, Christian}, year={2005}, pages={91–109} }","short":"A. Czumaj, F. Ergün, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, C. Sohler, SIAM Journal on Computing 35 (2005) 91–109.","ama":"Czumaj A, Ergün F, Fortnow L, et al. Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. <i>SIAM Journal on Computing</i>. 2005;35(1):91-109. doi:<a href=\"https://doi.org/10.1137/s0097539703435297\">10.1137/s0097539703435297</a>","chicago":"Czumaj, Artur, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, and Christian Sohler. “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.” <i>SIAM Journal on Computing</i> 35, no. 1 (2005): 91–109. <a href=\"https://doi.org/10.1137/s0097539703435297\">https://doi.org/10.1137/s0097539703435297</a>.","ieee":"A. Czumaj <i>et al.</i>, “Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time,” <i>SIAM Journal on Computing</i>, vol. 35, no. 1, pp. 91–109, 2005."}},{"publication":"Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)","type":"conference","abstract":[{"lang":"eng","text":"Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.<br>We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well."}],"status":"public","_id":"18867","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540291183","9783540319511"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2005","place":"Berlin, Heidelberg","page":"758-769","intvolume":"      3669","citation":{"chicago":"Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 3669:758–69. Berlin, Heidelberg: Springer, 2005. <a href=\"https://doi.org/10.1007/11561071_67\">https://doi.org/10.1007/11561071_67</a>.","ieee":"G. Frahling and J. Krokowski, “Online Occlusion Culling,” in <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 2005, vol. 3669, pp. 758–769.","ama":"Frahling G, Krokowski J. Online Occlusion Culling. In: <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>. Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>","apa":"Frahling, G., &#38; Krokowski, J. (2005). Online Occlusion Culling. In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i> (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/11561071_67\">https://doi.org/10.1007/11561071_67</a>","short":"G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.","bibtex":"@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer}, author={Frahling, Gereon and Krokowski, Jens}, year={2005}, pages={758–769} }","mla":"Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, vol. 3669, Springer, 2005, pp. 758–69, doi:<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>."},"publisher":"Springer","date_updated":"2022-01-06T06:53:53Z","volume":3669,"date_created":"2020-09-02T13:26:52Z","author":[{"first_name":"Gereon","full_name":"Frahling, Gereon","last_name":"Frahling"},{"full_name":"Krokowski, Jens","last_name":"Krokowski","first_name":"Jens"}],"title":"Online Occlusion Culling","doi":"10.1007/11561071_67"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540287001","9783540319252"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2005","citation":{"short":"M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.","mla":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>.","bibtex":"@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }","apa":"Bienkowski, M., &#38; Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>","chicago":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>.","ieee":"M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005.","ama":"Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>"},"date_updated":"2022-01-06T06:53:54Z","author":[{"first_name":"Marcin","full_name":"Bienkowski, Marcin","last_name":"Bienkowski"},{"full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski","first_name":"Miroslaw"}],"date_created":"2020-09-03T07:56:58Z","title":"Dynamic Page Migration Under Brownian Motion","doi":"10.1007/11549468_105","publication":"Proc. of the European Conference in Parallel Processing (Euro-Par)","type":"conference","abstract":[{"text":"We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).","lang":"eng"}],"status":"public","_id":"18912","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["9783540291183","9783540319511"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","page":"815-826","intvolume":"      3669","citation":{"ama":"Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>. Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>","ieee":"M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 2005, vol. 3669, pp. 815–826.","chicago":"Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 3669:815–26. Berlin, Heidelberg: Springer , 2005. <a href=\"https://doi.org/10.1007/11561071_72\">https://doi.org/10.1007/11561071_72</a>.","apa":"Bienkowski, M., &#38; Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i> (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/11561071_72\">https://doi.org/10.1007/11561071_72</a>","bibtex":"@inproceedings{Bienkowski_Byrka_2005, place={Berlin, Heidelberg}, title={Bucket Game with Applications to Set Multicover and Dynamic Page Migration}, volume={3669}, DOI={<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer }, author={Bienkowski, Marcin and Byrka, Jarosław}, year={2005}, pages={815–826} }","short":"M. Bienkowski, J. Byrka, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer , Berlin, Heidelberg, 2005, pp. 815–826.","mla":"Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, vol. 3669, Springer , 2005, pp. 815–26, doi:<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>."},"date_updated":"2022-01-06T06:53:54Z","volume":3669,"author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"full_name":"Byrka, Jarosław","last_name":"Byrka","first_name":"Jarosław"}],"doi":"10.1007/11561071_72","type":"conference","status":"public","_id":"18915","department":[{"_id":"63"}],"user_id":"15415","year":"2005","publisher":"Springer ","date_created":"2020-09-03T08:11:11Z","title":"Bucket Game with Applications to Set Multicover and Dynamic Page Migration","publication":"Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)","abstract":[{"text":"We present a simple two-person Bucket Game, based on throwing balls into buckets, and we<br>discuss possible players' strategies.<br><br>We use these strategies to create an approximation algorithm for a generalization of<br>the well known Set Cover problem, where we need to cover each element by at least $k$ sets.<br>Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration <br>problem achieving the optimal competitive ratio against an oblivious adversary.","lang":"eng"}],"language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18917","status":"public","abstract":[{"text":"The page migration problem is one of subproblems of data management in networks. It occurs<br>in a distributed network of processors sharing one indivisible memory page of size D. During runtime,<br>the processors access a unit of data from the page, and the system is allowed to migrate the page <br>between the processors. The problem is to compute (on-line) a schedule of page movements <br>to minimize the total communication cost. <br><br>The Dynamic Page Migration problem is an extension to the page migration. <br>It attempts to model the network dynamics, occurring, for example, in mobile networks.<br>However, the pace of changes is restricted, i.e. the distances between processors can <br>change only by a constant per round.  <br><br>The movement of the nodes induce changes in the communication cost between each pair of nodes,  <br>which is proportional to the distance between them raised to some power $alpha$.<br>This is typical for mobile wireless networks, where nodes can move with a constant speed,<br>and the cost of communication is measured in terms of energy used for sending the data.<br>Thus, by setting $alpha$ equal to the propagation exponent of the medium, <br>cost minimization becomes minimizing the total energy consumption in the system. <br><br>However, as proven in citedynamic-page-migration, if both network mobility and <br>request sequence are created by an adversary, then the competitive ratio is polynomially large in D and <br>in the number of the nodes. In our search for a reasonable, close-to-reality model, in this paper we <br>consider a scenario in which the network mobility is adversarial, but the requests are <br>generated randomly by a stochastic process. We design an algorithm MTFR for this scenario,<br>and prove that it is O(1)-competitive, on expectation and with high probability.","lang":"eng"}],"publication":"Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)","type":"conference","conference":{"location":"Las Vegas, Nevada, USA"},"title":"Dynamic Page Migration with Stochastic Requests","author":[{"first_name":"Marcin","full_name":"Bienkowski, Marcin","last_name":"Bienkowski"}],"date_created":"2020-09-03T08:19:31Z","publisher":"ACM Press, NY, USA","date_updated":"2022-01-06T06:53:54Z","page":"270-278","citation":{"short":"M. Bienkowski, in: Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), ACM Press, NY, USA, 2005, pp. 270–278.","bibtex":"@inproceedings{Bienkowski_2005, title={Dynamic Page Migration with Stochastic Requests}, booktitle={Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)}, publisher={ACM Press, NY, USA}, author={Bienkowski, Marcin}, year={2005}, pages={270–278} }","mla":"Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, ACM Press, NY, USA, 2005, pp. 270–78.","apa":"Bienkowski, M. (2005). Dynamic Page Migration with Stochastic Requests. In <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i> (pp. 270–278). Las Vegas, Nevada, USA: ACM Press, NY, USA.","ama":"Bienkowski M. Dynamic Page Migration with Stochastic Requests. In: <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>. ACM Press, NY, USA; 2005:270-278.","ieee":"M. Bienkowski, “Dynamic Page Migration with Stochastic Requests,” in <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, Las Vegas, Nevada, USA, 2005, pp. 270–278.","chicago":"Bienkowski, Marcin. “Dynamic Page Migration with Stochastic Requests.” In <i>Proc. of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005)</i>, 270–78. ACM Press, NY, USA, 2005."},"year":"2005"},{"abstract":[{"lang":"eng","text":"Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need."}],"publication":"Proceedings of the 4th International Conference on Networking","language":[{"iso":"eng"}],"year":"2005","title":"Cube Connected Cycles Based Bluetooth Scatternet Formation","date_created":"2020-09-03T09:52:33Z","publisher":"Springer","status":"public","type":"conference","department":[{"_id":"63"}],"series_title":" Lecture Notes in Computer Science","user_id":"15415","_id":"18924","page":"413-420","intvolume":"      3420","citation":{"chicago":"Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” In <i>Proceedings of the 4th International Conference on Networking</i>, 3420:413–20.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>.","ieee":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in <i>Proceedings of the 4th International Conference on Networking</i>, 2005, vol. 3420, pp. 413–420.","ama":"Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: <i>Proceedings of the 4th International Conference on Networking</i>. Vol 3420.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>","apa":"Bienkowski, M., Brinkmann, A., Korzeniowski, M., &#38; Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In <i>Proceedings of the 4th International Conference on Networking</i> (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>","mla":"Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” <i>Proceedings of the 4th International Conference on Networking</i>, vol. 3420, Springer, 2005, pp. 413–20, doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>.","short":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, O. Orhan, in: Proceedings of the 4th International Conference on Networking, Springer, Berlin, Heidelberg, 2005, pp. 413–420.","bibtex":"@inproceedings{Bienkowski_Brinkmann_Korzeniowski_Orhan_2005, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Cube Connected Cycles Based Bluetooth Scatternet Formation}, volume={3420}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>}, booktitle={Proceedings of the 4th International Conference on Networking}, publisher={Springer}, author={Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw and Orhan, Orhan}, year={2005}, pages={413–420}, collection={ Lecture Notes in Computer Science} }"},"place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540253396","9783540319566"]},"publication_status":"published","doi":"10.1007/978-3-540-31956-6_49","volume":3420,"author":[{"full_name":"Bienkowski, Marcin","last_name":"Bienkowski","first_name":"Marcin"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski","first_name":"Miroslaw"},{"full_name":"Orhan, Orhan","last_name":"Orhan","first_name":"Orhan"}],"date_updated":"2022-01-06T06:53:54Z"},{"status":"public","abstract":[{"text":"The dynamic page migration problem citedynamic-page-migration is defined in <br>a distributed network of $n$ mobile nodes sharing one indivisible memory page <br>of size $D$. During runtime, the nodes can both access a unit of data from<br>the page and move with a constant speed, thus changing the costs of communication.<br>The problem is to compute <em> online</em> a schedule of page movements<br>to minimize the total communication cost.<br><br>In this paper we construct and analyze the first deterministic algorithm for this problem. <br>We prove that it achieves an (up to a constant factor) optimal competitive ratio <br>$O(n cdot sqrtD)$. We show that the randomization of this algorithm <br>improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary). <br>This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.<br>We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem.","lang":"eng"}],"publication":"Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","series_title":"Lecture Notes in Computer Science","_id":"18925","page":"365-376","citation":{"chicago":"Bienkowski, Marcin, Miroslaw Dynia, and Miroslaw Korzeniowski. “Improved Algorithms for Dynamic Page Migration.” In <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 365–76. Lecture Notes in Computer Science, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">https://doi.org/10.1007/978-3-540-31856-9_30</a>.","ieee":"M. Bienkowski, M. Dynia, and M. Korzeniowski, “Improved Algorithms for Dynamic Page Migration,” in <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2005, pp. 365–376.","ama":"Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>. Lecture Notes in Computer Science. ; 2005:365-376. doi:<a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">10.1007/978-3-540-31856-9_30</a>","apa":"Bienkowski, M., Dynia, M., &#38; Korzeniowski, M. (2005). Improved Algorithms for Dynamic Page Migration. In <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i> (pp. 365–376). <a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">https://doi.org/10.1007/978-3-540-31856-9_30</a>","mla":"Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.” <i>Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)</i>, 2005, pp. 365–76, doi:<a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">10.1007/978-3-540-31856-9_30</a>.","bibtex":"@inproceedings{Bienkowski_Dynia_Korzeniowski_2005, series={Lecture Notes in Computer Science}, title={Improved Algorithms for Dynamic Page Migration}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-31856-9_30\">10.1007/978-3-540-31856-9_30</a>}, booktitle={Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Dynia, Miroslaw and Korzeniowski, Miroslaw}, year={2005}, pages={365–376}, collection={Lecture Notes in Computer Science} }","short":"M. Bienkowski, M. Dynia, M. Korzeniowski, in: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–376."},"year":"2005","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540249986","9783540318569"]},"publication_status":"published","doi":"10.1007/978-3-540-31856-9_30","title":"Improved Algorithms for Dynamic Page Migration","date_created":"2020-09-03T10:01:03Z","author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"first_name":"Miroslaw","last_name":"Dynia","full_name":"Dynia, Miroslaw"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"}],"date_updated":"2022-01-06T06:53:54Z"},{"_id":"18967","user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_updated":"2022-01-06T06:53:56Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"author":[{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"}],"date_created":"2020-09-03T14:44:08Z","volume":154,"title":"Data Management and Routing in General Networks","publication_identifier":{"isbn":["3-935433-63-8"]},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20030101262","relation":"confirmation"}]},"year":"2005","citation":{"mla":"Räcke, Harald. <i>Data Management and Routing in General Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","bibtex":"@book{Räcke_2005, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Data Management and Routing in General Networks}, volume={154}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Räcke, Harald}, year={2005}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"H. Räcke, Data Management and Routing in General Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","apa":"Räcke, H. (2005). <i>Data Management and Routing in General Networks</i> (Vol. 154). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"H. Räcke, <i>Data Management and Routing in General Networks</i>, vol. 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","chicago":"Räcke, Harald. <i>Data Management and Routing in General Networks</i>. Vol. 154. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2005.","ama":"Räcke H. <i>Data Management and Routing in General Networks</i>. Vol 154. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2005."},"intvolume":"       154"},{"citation":{"apa":"Eke, N. O. (2005). <i>Einführung in die Literatur des Vormärz</i>. Darmstadt: Wissenschaftliche Buchgesellschaft.","mla":"Eke, Norbert Otto. <i>Einführung in die Literatur des Vormärz</i>. Wissenschaftliche Buchgesellschaft, 2005.","bibtex":"@book{Eke_2005, place={Darmstadt}, series={Einführungen Germanistik}, title={Einführung in die Literatur des Vormärz}, publisher={Wissenschaftliche Buchgesellschaft}, author={Eke, Norbert Otto}, year={2005}, collection={Einführungen Germanistik} }","short":"N.O. Eke, Einführung in die Literatur des Vormärz, Wissenschaftliche Buchgesellschaft, Darmstadt, 2005.","ama":"Eke NO. <i>Einführung in die Literatur des Vormärz</i>. Darmstadt: Wissenschaftliche Buchgesellschaft; 2005.","ieee":"N. O. Eke, <i>Einführung in die Literatur des Vormärz</i>. Darmstadt: Wissenschaftliche Buchgesellschaft, 2005.","chicago":"Eke, Norbert Otto. <i>Einführung in die Literatur des Vormärz</i>. Einführungen Germanistik. Darmstadt: Wissenschaftliche Buchgesellschaft, 2005."},"page":"167","place":"Darmstadt","year":"2005","date_created":"2020-09-04T10:27:30Z","author":[{"full_name":"Eke, Norbert Otto","id":"104","last_name":"Eke","first_name":"Norbert Otto"}],"date_updated":"2022-01-06T06:53:57Z","publisher":"Wissenschaftliche Buchgesellschaft","title":"Einführung in die Literatur des Vormärz","type":"book","status":"public","abstract":[{"text":"Sonderausgabe 2017","lang":"eng"}],"user_id":"14932","series_title":"Einführungen Germanistik","department":[{"_id":"465"}],"_id":"19008","language":[{"iso":"ger"}],"extern":"1"},{"author":[{"full_name":"Eke, Norbert Otto","id":"104","last_name":"Eke","first_name":"Norbert Otto"}],"date_created":"2020-09-04T10:30:21Z","date_updated":"2022-01-06T06:53:57Z","publisher":"Vossiuspers UvA (Amsterdam University Press)","title":"Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie","page":"26","citation":{"ama":"Eke NO. <i>Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie</i>. Amsterdam: Vossiuspers UvA (Amsterdam University Press); 2005.","ieee":"N. O. Eke, <i>Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie</i>. Amsterdam: Vossiuspers UvA (Amsterdam University Press), 2005.","chicago":"Eke, Norbert Otto. <i>Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie</i>. Amsterdam: Vossiuspers UvA (Amsterdam University Press), 2005.","apa":"Eke, N. O. (2005). <i>Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie</i>. Amsterdam: Vossiuspers UvA (Amsterdam University Press).","bibtex":"@book{Eke_2005, place={Amsterdam}, title={Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie}, publisher={Vossiuspers UvA (Amsterdam University Press)}, author={Eke, Norbert Otto}, year={2005} }","mla":"Eke, Norbert Otto. <i>Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie</i>. Vossiuspers UvA (Amsterdam University Press), 2005.","short":"N.O. Eke, Angst en vrees in het theater van de herinnering. Heiner Müllers tragedie, Vossiuspers UvA (Amsterdam University Press), Amsterdam, 2005."},"year":"2005","place":"Amsterdam","department":[{"_id":"465"}],"user_id":"14932","_id":"19009","language":[{"iso":"dut"}],"extern":"1","type":"book","status":"public"},{"citation":{"apa":"Eke, N. O., &#38; Wahrenburg, F. (Eds.). (2005). <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>. Bielefeld: Aisthesis.","bibtex":"@book{Eke_Wahrenburg_2005, place={Bielefeld}, title={Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004}, publisher={Aisthesis}, year={2005} }","short":"N.O. Eke, F. Wahrenburg, eds., Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004, Aisthesis, Bielefeld, 2005.","mla":"Eke, Norbert Otto, and Fritz Wahrenburg, editors. <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>. Aisthesis, 2005.","ama":"Eke NO, Wahrenburg F, eds. <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>. Bielefeld: Aisthesis; 2005.","chicago":"Eke, Norbert Otto, and Fritz Wahrenburg, eds. <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>. Bielefeld: Aisthesis, 2005.","ieee":"N. O. Eke and F. Wahrenburg, Eds., <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>. Bielefeld: Aisthesis, 2005."},"page":"547","year":"2005","place":"Bielefeld","title":"Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004","date_created":"2020-09-08T06:06:23Z","date_updated":"2022-01-06T06:53:58Z","publisher":"Aisthesis","status":"public","editor":[{"first_name":"Norbert Otto","last_name":"Eke","id":"104","full_name":"Eke, Norbert Otto"},{"first_name":"Fritz","last_name":"Wahrenburg","full_name":"Wahrenburg, Fritz"}],"type":"book_editor","extern":"1","language":[{"iso":"ger"}],"user_id":"14932","department":[{"_id":"465"}],"_id":"19083"},{"title":"„Kirchenbau zwischen Säkularisierung und Resakralisierung im 18. und 19. Jahrhundert“","date_created":"2020-09-08T12:43:15Z","author":[{"id":"499","full_name":"Seng, Eva- Maria","last_name":"Seng","first_name":"Eva- Maria"}],"volume":"Bd. 9 H3/4","date_updated":"2022-01-06T06:53:58Z","citation":{"short":"E.-M. Seng, in: R. Dürr, G. Schwerhoff (Eds.), Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 , Frankfurt am Main, 2005, pp. 559–602.","mla":"Seng, Eva-Maria. “„Kirchenbau zwischen Säkularisierung und Resakralisierung im 18. und 19. Jahrhundert“.” <i>Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 </i>, edited by Renate Dürr and Gerd Schwerhoff, vol. Bd. 9 H3/4, 2005, pp. 559–602.","bibtex":"@inbook{Seng_2005, place={Frankfurt am Main}, title={„Kirchenbau zwischen Säkularisierung und Resakralisierung im 18. und 19. Jahrhundert“}, volume={Bd. 9 H3/4}, booktitle={Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 }, author={Seng, Eva- Maria}, editor={Dürr, Renate and Schwerhoff, GerdEditors}, year={2005}, pages={559–602} }","apa":"Seng, E.-M. (2005). „Kirchenbau zwischen Säkularisierung und Resakralisierung im 18. und 19. Jahrhundert“. In R. Dürr &#38; G. Schwerhoff (Eds.), <i>Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 </i> (Vol. Bd. 9 H3/4, pp. 559–602). Frankfurt am Main.","ama":"Seng E-M. „Kirchenbau zwischen Säkularisierung und Resakralisierung im 18. und 19. Jahrhundert“. In: Dürr R, Schwerhoff G, eds. <i>Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 </i>. Vol Bd. 9 H3/4. Frankfurt am Main; 2005:559-602.","ieee":"E.-M. Seng, “„Kirchenbau zwischen Säkularisierung und Resakralisierung im 18. und 19. Jahrhundert“,” in <i>Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 </i>, vol. Bd. 9 H3/4, R. Dürr and G. Schwerhoff, Eds. Frankfurt am Main, 2005, pp. 559–602.","chicago":"Seng, Eva- Maria. “„Kirchenbau zwischen Säkularisierung und Resakralisierung im 18. und 19. Jahrhundert“.” In <i>Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 </i>, edited by Renate Dürr and Gerd Schwerhoff, Bd. 9 H3/4:559–602. Frankfurt am Main, 2005."},"page":"559-602","year":"2005","place":"Frankfurt am Main","language":[{"iso":"ger"}],"extern":"1","user_id":"21240","department":[{"_id":"443"}],"_id":"19142","status":"public","editor":[{"last_name":"Dürr","full_name":"Dürr, Renate","first_name":"Renate"},{"last_name":"Schwerhoff","full_name":"Schwerhoff, Gerd","first_name":"Gerd"}],"type":"book_chapter","publication":"Kirchen, Märkte und Tavernen. Erfahrungs- und Handlungsräume in der Frühen Neuzeit. „Zeitsprünge“. Forschungen zur Frühen Neuzeit, Bd. 9, H. 3/4 "},{"user_id":"14932","department":[{"_id":"465"}],"_id":"19346","extern":"1","language":[{"iso":"ger"}],"type":"book_chapter","publication":"Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004","status":"public","editor":[{"first_name":"Norbert Otto","full_name":"Eke, Norbert Otto","last_name":"Eke"},{"first_name":"Fritz","full_name":"Wahrenburg, Fritz","last_name":"Wahrenburg"}],"date_created":"2020-09-14T06:31:11Z","author":[{"first_name":"Norbert Otto","full_name":"Eke, Norbert Otto","id":"104","last_name":"Eke"}],"publisher":"Aisthesis","date_updated":"2022-01-06T06:54:02Z","title":"„Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil","citation":{"apa":"Eke, N. O. (2005). „Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil. In N. O. Eke &#38; F. Wahrenburg (Eds.), <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i> (pp. 13–30). Bielefeld: Aisthesis.","bibtex":"@inbook{Eke_2005, place={Bielefeld}, title={„Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil}, booktitle={Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004}, publisher={Aisthesis}, author={Eke, Norbert Otto}, editor={Eke, Norbert Otto and Wahrenburg, FritzEditors}, year={2005}, pages={13–30} }","mla":"Eke, Norbert Otto. “„Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil.” <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>, edited by Norbert Otto Eke and Fritz Wahrenburg, Aisthesis, 2005, pp. 13–30.","short":"N.O. Eke, in: N.O. Eke, F. Wahrenburg (Eds.), Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004, Aisthesis, Bielefeld, 2005, pp. 13–30.","ama":"Eke NO. „Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil. In: Eke NO, Wahrenburg F, eds. <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>. Bielefeld: Aisthesis; 2005:13-30.","ieee":"N. O. Eke, “„Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil,” in <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>, N. O. Eke and F. Wahrenburg, Eds. Bielefeld: Aisthesis, 2005, pp. 13–30.","chicago":"Eke, Norbert Otto. “„Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil.” In <i>Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004</i>, edited by Norbert Otto Eke and Fritz Wahrenburg, 13–30. Bielefeld: Aisthesis, 2005."},"page":"13-30","place":"Bielefeld","year":"2005"},{"type":"review","publication":"Kunstform und Sehepunkte","status":"public","_id":"19374","user_id":"21240","department":[{"_id":"443"}],"language":[{"iso":"ger"}],"extern":"1","year":"2005","citation":{"apa":"Seng, E.-M. (2005). Barbara Uppenkamp, Das Pentagon in Wolfenbüttel. Ausbau der welfischen Residenz 1568-1626 zwischen Ideal und Wirklichkeit, Hannover 2005. <i>Kunstform und Sehepunkte</i>.","mla":"Seng, Eva-Maria. “Barbara Uppenkamp, Das Pentagon in Wolfenbüttel. Ausbau der welfischen Residenz 1568-1626 zwischen Ideal und Wirklichkeit, Hannover 2005.” <i>Kunstform und Sehepunkte</i>, 2005.","bibtex":"@article{Seng_2005, title={Barbara Uppenkamp, Das Pentagon in Wolfenbüttel. Ausbau der welfischen Residenz 1568-1626 zwischen Ideal und Wirklichkeit, Hannover 2005}, journal={Kunstform und Sehepunkte}, author={Seng, Eva- Maria}, year={2005} }","short":"E.-M. Seng, Kunstform und Sehepunkte (2005).","ama":"Seng E-M. Barbara Uppenkamp, Das Pentagon in Wolfenbüttel. Ausbau der welfischen Residenz 1568-1626 zwischen Ideal und Wirklichkeit, Hannover 2005. <i>Kunstform und Sehepunkte</i>. 2005.","ieee":"E.-M. Seng, “Barbara Uppenkamp, Das Pentagon in Wolfenbüttel. Ausbau der welfischen Residenz 1568-1626 zwischen Ideal und Wirklichkeit, Hannover 2005,” <i>Kunstform und Sehepunkte</i>. 2005.","chicago":"Seng, Eva- Maria. “Barbara Uppenkamp, Das Pentagon in Wolfenbüttel. Ausbau der welfischen Residenz 1568-1626 zwischen Ideal und Wirklichkeit, Hannover 2005.” <i>Kunstform und Sehepunkte</i>, 2005."},"date_updated":"2022-01-06T06:54:03Z","date_created":"2020-09-14T12:08:23Z","author":[{"last_name":"Seng","id":"499","full_name":"Seng, Eva- Maria","first_name":"Eva- Maria"}],"title":"Barbara Uppenkamp, Das Pentagon in Wolfenbüttel. Ausbau der welfischen Residenz 1568-1626 zwischen Ideal und Wirklichkeit, Hannover 2005"}]