[{"author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-25T13:11:38Z","date_updated":"2022-01-06T06:53:28Z","title":"Real Computability and Hypercomputation","has_accepted_license":"1","citation":{"bibtex":"@book{Ziegler_2007, title={Real Computability and Hypercomputation}, author={Ziegler, Martin}, year={2007} }","short":"M. Ziegler, Real Computability and Hypercomputation, 2007.","mla":"Ziegler, Martin. <i>Real Computability and Hypercomputation</i>. 2007.","apa":"Ziegler, M. (2007). <i>Real Computability and Hypercomputation</i>.","ama":"Ziegler M. <i>Real Computability and Hypercomputation</i>.; 2007.","chicago":"Ziegler, Martin. <i>Real Computability and Hypercomputation</i>, 2007.","ieee":"M. Ziegler, <i>Real Computability and Hypercomputation</i>. 2007."},"year":"2007","department":[{"_id":"63"}],"user_id":"15415","_id":"18285","file_date_updated":"2020-08-25T13:11:15Z","language":[{"iso":"eng"}],"ddc":["000"],"report_number":" tr-ri-07-285","type":"report","status":"public","file":[{"access_level":"closed","file_id":"18286","file_name":"real-comp-2007.pdf","file_size":2157961,"date_created":"2020-08-25T13:11:15Z","creator":"koala","date_updated":"2020-08-25T13:11:15Z","relation":"main_file","success":1,"content_type":"application/pdf"}]},{"abstract":[{"lang":"eng","text":"The validation of material flow models as well as the selection of promising strategies for the generation of a successful experiment plan is a time-consuming process. A new approach is presented, which supports the simulation expert in his working process by giving him the opportunity to modify the simulated simulation run and afterwards compare the effects of his modification with the original setting, online and in one user interface, implemented by switching the visualizations between the simulation runs or opening up to 5 parallel 3D windows. The method developed therefore clones existing simulation runs online and allows the navigation within these existing simulation runs. The method has been implemented and is validated by a test model, which describes in detail the new working process of a modeler. New research questions are derived from this work, which will define following working steps.\r\n"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-08-26T09:22:47Z","creator":"koala","date_created":"2020-08-26T09:22:47Z","file_size":389588,"file_id":"18348","file_name":"ESM07_final.pdf","access_level":"closed"}],"publication":"European Simulation and Modelling Conference (ESM 2007)","type":"conference","ddc":["004"],"language":[{"iso":"eng"}],"file_date_updated":"2020-08-26T09:22:47Z","_id":"18347","department":[{"_id":"63"}],"user_id":"15415","year":"2007","page":"499--505","citation":{"mla":"Fischer, Matthias, et al. “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in One 3D Environment.” <i>European Simulation and Modelling Conference (ESM 2007)</i>, 2007, pp. 499--505.","bibtex":"@inproceedings{Fischer_Laroque_Huber_Krokowski_Mueck_Kortenjan_Aufenanger_ Dangelmaier_2007, title={Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment}, booktitle={European Simulation and Modelling Conference (ESM 2007)}, author={Fischer, Matthias and Laroque, Christoph  and Huber, Daniel  and Krokowski, Jens  and Mueck, Bengt  and Kortenjan, Michael  and Aufenanger, Mark and  Dangelmaier, Wilhelm}, year={2007}, pages={499--505} }","short":"M. Fischer, C. Laroque, D. Huber, J. Krokowski, B. Mueck, M. Kortenjan, M. Aufenanger, W.  Dangelmaier, in: European Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.","apa":"Fischer, M., Laroque, C., Huber, D., Krokowski, J., Mueck, B., Kortenjan, M., …  Dangelmaier, W. (2007). Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In <i>European Simulation and Modelling Conference (ESM 2007)</i> (pp. 499--505).","ama":"Fischer M, Laroque C, Huber D, et al. Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In: <i>European Simulation and Modelling Conference (ESM 2007)</i>. ; 2007:499--505.","chicago":"Fischer, Matthias, Christoph  Laroque, Daniel  Huber, Jens  Krokowski, Bengt  Mueck, Michael  Kortenjan, Mark Aufenanger, and Wilhelm  Dangelmaier. “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in One 3D Environment.” In <i>European Simulation and Modelling Conference (ESM 2007)</i>, 499--505, 2007.","ieee":"M. Fischer <i>et al.</i>, “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment,” in <i>European Simulation and Modelling Conference (ESM 2007)</i>, 2007, pp. 499--505."},"has_accepted_license":"1","title":"Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment","date_updated":"2022-01-06T06:53:29Z","author":[{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Christoph ","last_name":"Laroque","full_name":"Laroque, Christoph "},{"first_name":"Daniel ","last_name":"Huber","full_name":"Huber, Daniel "},{"full_name":"Krokowski, Jens ","last_name":"Krokowski","first_name":"Jens "},{"full_name":"Mueck, Bengt ","last_name":"Mueck","first_name":"Bengt "},{"last_name":"Kortenjan","full_name":"Kortenjan, Michael ","first_name":"Michael "},{"last_name":"Aufenanger","full_name":"Aufenanger, Mark","first_name":"Mark"},{"first_name":"Wilhelm","full_name":" Dangelmaier, Wilhelm","last_name":" Dangelmaier"}],"date_created":"2020-08-26T09:23:24Z"},{"intvolume":"       209","page":"95-110","citation":{"ama":"Dangelmaier W,  Laroque C, Fischer M. Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 209. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2007:95-110.","chicago":"Dangelmaier, Wilhelm, Christoph   Laroque, and Matthias Fischer. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 209:95–110. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007.","ieee":"W. Dangelmaier, C.  Laroque, and M. Fischer, “Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2007, vol. 209, pp. 95–110.","bibtex":"@inproceedings{Dangelmaier_ Laroque_Fischer_2007, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik}, volume={209}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dangelmaier, Wilhelm and  Laroque, Christoph  and Fischer, Matthias}, year={2007}, pages={95–110}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"W. Dangelmaier, C.  Laroque, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007, pp. 95–110.","mla":"Dangelmaier, Wilhelm, et al. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 209, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007, pp. 95–110.","apa":"Dangelmaier, W.,  Laroque, C., &#38; Fischer, M. (2007). Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>209</i>, 95–110."},"year":"2007","volume":209,"author":[{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"first_name":"Christoph ","last_name":" Laroque","full_name":" Laroque, Christoph "},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"date_created":"2020-08-26T09:30:58Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:29Z","title":"Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik","publication":"Augmented & Virtual Reality in der Produktentstehung","type":"conference","status":"public","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"18349","language":[{"iso":"eng"}]},{"citation":{"ieee":"D. H. Woldegebreal and H. Karl, “Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels,” in <i>2007 4th International Symposium on Wireless Communication Systems</i>, 2007.","chicago":"Woldegebreal, Dereje H., and Holger Karl. “Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels.” In <i>2007 4th International Symposium on Wireless Communication Systems</i>. IEEE, 2007. <a href=\"https://doi.org/10.1109/iswcs.2007.4392437\">https://doi.org/10.1109/iswcs.2007.4392437</a>.","ama":"Woldegebreal DH, Karl H. Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels. In: <i>2007 4th International Symposium on Wireless Communication Systems</i>. IEEE; 2007. doi:<a href=\"https://doi.org/10.1109/iswcs.2007.4392437\">10.1109/iswcs.2007.4392437</a>","short":"D.H. Woldegebreal, H. Karl, in: 2007 4th International Symposium on Wireless Communication Systems, IEEE, 2007.","mla":"Woldegebreal, Dereje H., and Holger Karl. “Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels.” <i>2007 4th International Symposium on Wireless Communication Systems</i>, IEEE, 2007, doi:<a href=\"https://doi.org/10.1109/iswcs.2007.4392437\">10.1109/iswcs.2007.4392437</a>.","bibtex":"@inproceedings{Woldegebreal_Karl_2007, title={Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels}, DOI={<a href=\"https://doi.org/10.1109/iswcs.2007.4392437\">10.1109/iswcs.2007.4392437</a>}, booktitle={2007 4th International Symposium on Wireless Communication Systems}, publisher={IEEE}, author={Woldegebreal, Dereje H. and Karl, Holger}, year={2007} }","apa":"Woldegebreal, D. H., &#38; Karl, H. (2007). Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels. In <i>2007 4th International Symposium on Wireless Communication Systems</i>. IEEE. <a href=\"https://doi.org/10.1109/iswcs.2007.4392437\">https://doi.org/10.1109/iswcs.2007.4392437</a>"},"year":"2007","publication_status":"published","publication_identifier":{"isbn":["9781424409785","9781424409792"]},"doi":"10.1109/iswcs.2007.4392437","title":"Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay Channels","author":[{"first_name":"Dereje H.","full_name":"Woldegebreal, Dereje H.","last_name":"Woldegebreal"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"}],"date_created":"2018-03-27T13:00:30Z","date_updated":"2022-01-06T06:53:32Z","publisher":"IEEE","status":"public","type":"conference","publication":"2007 4th International Symposium on Wireless Communication Systems","user_id":"15572","department":[{"_id":"75"}],"_id":"1840"},{"department":[{"_id":"75"}],"user_id":"15572","_id":"1842","status":"public","type":"conference","title":"Optimizing sleeping intervals in preamble sampling MAC for WSNs","author":[{"full_name":"Karl, Holger","id":"126","last_name":"Karl","first_name":"Holger"}],"date_created":"2018-03-27T13:11:08Z","publisher":"Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference","date_updated":"2022-01-06T06:53:32Z","citation":{"mla":"Karl, Holger. <i>Optimizing Sleeping Intervals in Preamble Sampling MAC for WSNs</i>. Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference, 2007.","bibtex":"@inproceedings{Karl_2007, place={Bern / Switzerland}, title={Optimizing sleeping intervals in preamble sampling MAC for WSNs}, publisher={Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference}, author={Karl, Holger}, year={2007} }","short":"H. Karl, in: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference, Bern / Switzerland, 2007.","apa":"Karl, H. (2007). Optimizing sleeping intervals in preamble sampling MAC for WSNs. Bern / Switzerland: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference.","ama":"Karl H. Optimizing sleeping intervals in preamble sampling MAC for WSNs. In: Bern / Switzerland: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference; 2007.","ieee":"H. Karl, “Optimizing sleeping intervals in preamble sampling MAC for WSNs,” 2007.","chicago":"Karl, Holger. “Optimizing Sleeping Intervals in Preamble Sampling MAC for WSNs.” Bern / Switzerland: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference, 2007."},"place":"Bern / Switzerland","year":"2007"},{"year":"2007","title":"Estimating Clustering Indexes in Data Streams","publisher":"Springer","date_created":"2020-08-28T12:46:05Z","abstract":[{"lang":"eng","text":"We present random sampling algorithms that with probability at least 1 − δ compute a (1 ±ε)-approximation of the clustering coefficient and of the number of bipartite clique subgraphs of a graph given as an incidence stream of edges. The space used by our algorithm to estimate the clustering coefficient is inversely related to the clustering coefficient of the network itself. The space used by our algorithm to compute the number K 3,3 of bipartite cliques is proportional to the ratio between the number of K 1,3 and K 3,3 in the graph.\r\n\r\nSince the space complexity depends only on the structure of the input graph and not on the number of nodes, our algorithms scale very well with increasing graph size. Therefore they provide a basic tool to analyze the structure of dense clusters in large graphs and have many applications in the discovery of web communities, the analysis of the structure of large social networks and the probing of frequent patterns in large graphs.\r\n\r\nWe implemented both algorithms and evaluated their performance on networks from different application domains and of different size; The largest instance is a webgraph consisting of more than 135 million nodes and 1 billion edges. Both algorithms compute accurate results in reasonable time on the tested instances."}],"publication":"Proceedings of the 15th European Symposium on Algorithms (ESA)","language":[{"iso":"eng"}],"place":"Berlin, Heidelberg","page":"618-632","intvolume":"      4698","citation":{"apa":"Buriol, L. S., Frahling, G., Leonardi, S., &#38; Sohler, C. (2007). Estimating Clustering Indexes in Data Streams. In <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i> (Vol. 4698, pp. 618–632). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">https://doi.org/10.1007/978-3-540-75520-3_55</a>","bibtex":"@inproceedings{Buriol_Frahling_Leonardi_Sohler_2007, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Estimating Clustering Indexes in Data Streams}, volume={4698}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">10.1007/978-3-540-75520-3_55</a>}, booktitle={Proceedings of the 15th European Symposium on Algorithms (ESA)}, publisher={Springer}, author={Buriol, Luciana S. and Frahling, Gereon and Leonardi, Stefano and Sohler, Christian}, year={2007}, pages={618–632}, collection={Lecture Notes in Computer Science} }","mla":"Buriol, Luciana S., et al. “Estimating Clustering Indexes in Data Streams.” <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>, vol. 4698, Springer, 2007, pp. 618–32, doi:<a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">10.1007/978-3-540-75520-3_55</a>.","short":"L.S. Buriol, G. Frahling, S. Leonardi, C. Sohler, in: Proceedings of the 15th European Symposium on Algorithms (ESA), Springer, Berlin, Heidelberg, 2007, pp. 618–632.","ama":"Buriol LS, Frahling G, Leonardi S, Sohler C. Estimating Clustering Indexes in Data Streams. In: <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>. Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2007:618-632. doi:<a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">10.1007/978-3-540-75520-3_55</a>","chicago":"Buriol, Luciana S., Gereon Frahling, Stefano Leonardi, and Christian Sohler. “Estimating Clustering Indexes in Data Streams.” In <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>, 4698:618–32. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">https://doi.org/10.1007/978-3-540-75520-3_55</a>.","ieee":"L. S. Buriol, G. Frahling, S. Leonardi, and C. Sohler, “Estimating Clustering Indexes in Data Streams,” in <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>, 2007, vol. 4698, pp. 618–632."},"publication_identifier":{"isbn":["9783540755197"]},"publication_status":"published","doi":"10.1007/978-3-540-75520-3_55","date_updated":"2022-01-06T06:53:40Z","volume":4698,"author":[{"full_name":"Buriol, Luciana S.","last_name":"Buriol","first_name":"Luciana S."},{"full_name":"Frahling, Gereon","last_name":"Frahling","first_name":"Gereon"},{"first_name":"Stefano","full_name":"Leonardi, Stefano","last_name":"Leonardi"},{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"}],"status":"public","type":"conference","_id":"18572","department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15415"},{"publication":"Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)","type":"conference","abstract":[{"lang":"eng","text":"We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs. Therefore in this paper we focus our attention on testing graph properties for special classes of graphs. We call a graph family non-expanding if every graph in this family is not a weak expander (its expansion is O(1/log2 n), where n is the graph size). A graph family is hereditary if it is closed under vertex removal. Similarly, a graph property is hereditary if it is closed under vertex removal. Next, we call a graph property Π to be testable for a graph family F if for every graph G ε F, in time independent of the size of G we can distinguish between the case when G satisfies property Π and when it is far from every graph satisfying property Π. In this paper we prove thatIn the bounded degree graph model, any hereditary property is testable if the input graph belongs to a hereditary and non-expanding family of graphs.As an application, our result implies that, for example, any hereditary property (e.g., k-colorability, H-freeness, etc.) is testable in the bounded degree graph model for planar graphs, graphs with bounded genus, interval graphs, etc. No such results have been known before and prior to our work, in the bounded degree graph model very few graph properties have been known to be testable for any graph classes."}],"status":"public","_id":"18655","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9780898716245"]},"year":"2007","page":"494-501","citation":{"apa":"Sohler, C., &#38; Czumaj, A. (2007). On Testable Properties in Bounded Degree Graphs. In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i> (pp. 494–501).","short":"C. Sohler, A. Czumaj, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07), 2007, pp. 494–501.","mla":"Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree Graphs.” <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 2007, pp. 494–501.","bibtex":"@inproceedings{Sohler_Czumaj_2007, title={On Testable Properties in Bounded Degree Graphs}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={494–501} }","ama":"Sohler C, Czumaj A. On Testable Properties in Bounded Degree Graphs. In: <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>. ; 2007:494-501.","chicago":"Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree Graphs.” In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 494–501, 2007.","ieee":"C. Sohler and A. Czumaj, “On Testable Properties in Bounded Degree Graphs,” in <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 2007, pp. 494–501."},"date_updated":"2022-01-06T06:53:50Z","date_created":"2020-08-31T07:40:36Z","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"}],"title":"On Testable Properties in Bounded Degree Graphs"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"18656","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)","status":"public","abstract":[{"text":"In the StrSort model [2], the input is given as a stream, e.g. a sequence of points, and an algorithm can perform (a) streaming and (b) sorting passes to process the stream. A streaming pass reads the input stream from left to right and writes an output stream, which is the input of the next pass. A sorting pass is a black box operation that sorts a stream according to some partial order. In this paper, we develop algorithms for two basic geometric problems in the StrSort model. At first, we propose a divide-and-conquer algorithm that computes the convex hull of a point set in 2D in O(log2 n) passes using O(1) memory. Then we give a StrSort algorithm to compute a (1+ε)-spanner for a point set in Rd for constant d and constant epsilon that uses O(logd-1 n) passes and O(log n) space. This result implies a (1+ε)-approximation of the Euclidean minimum spanning tree in Rd, for constant d and ε.","lang":"eng"}],"author":[{"last_name":"Sohler","full_name":"Sohler, Christian","first_name":"Christian"},{"first_name":"Christiane","full_name":"Lammersen, Christiane","last_name":"Lammersen"}],"date_created":"2020-08-31T07:49:02Z","date_updated":"2022-01-06T06:53:50Z","title":"StrSort Algorithms for Geometric Problems","citation":{"apa":"Sohler, C., &#38; Lammersen, C. (2007). StrSort Algorithms for Geometric Problems. In <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i> (pp. 69–72).","bibtex":"@inproceedings{Sohler_Lammersen_2007, title={StrSort Algorithms for Geometric Problems}, booktitle={Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)}, author={Sohler, Christian and Lammersen, Christiane}, year={2007}, pages={69–72} }","short":"C. Sohler, C. Lammersen, in: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 2007, pp. 69–72.","mla":"Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric Problems.” <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>, 2007, pp. 69–72.","chicago":"Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric Problems.” In <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>, 69–72, 2007.","ieee":"C. Sohler and C. Lammersen, “StrSort Algorithms for Geometric Problems,” in <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>, 2007, pp. 69–72.","ama":"Sohler C, Lammersen C. StrSort Algorithms for Geometric Problems. In: <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>. ; 2007:69-72."},"page":"69-72","year":"2007"},{"page":"570 - 578","citation":{"apa":"Sohler, C., &#38; Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs. In <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i> (pp. 570–578).","mla":"Sohler, Christian, and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.” <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>, 2007, pp. 570–78.","bibtex":"@inproceedings{Sohler_Czumaj_2007, title={Testing Expansion in Bounded-Degree Graphs}, booktitle={Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)}, author={Sohler, Christian  and Czumaj, Artur}, year={2007}, pages={570–578} }","short":"C. Sohler, A. Czumaj, in: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 570–578.","ama":"Sohler C, Czumaj A. Testing Expansion in Bounded-Degree Graphs. In: <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>. ; 2007:570-578.","chicago":"Sohler, Christian , and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.” In <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>, 570–78, 2007.","ieee":"C. Sohler and A. Czumaj, “Testing Expansion in Bounded-Degree Graphs,” in <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>, 2007, pp. 570–578."},"year":"2007","author":[{"first_name":"Christian ","full_name":"Sohler, Christian ","last_name":"Sohler"},{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"}],"date_created":"2020-08-31T07:55:45Z","date_updated":"2022-01-06T06:53:50Z","title":"Testing Expansion in Bounded-Degree Graphs","publication":"Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"18660","language":[{"iso":"eng"}]},{"type":"conference","publication":"Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)","status":"public","_id":"18662","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"year":"2007","citation":{"ama":"Sohler C, Czumaj A. Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In: <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>. ; 2007:536-548.","ieee":"C. Sohler and A. Czumaj, “Small Space Representations for Metric Min-Sum k-Clustering and their Applications,” in <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>, 2007, pp. 536–548.","chicago":"Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.” In <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>, 536–48, 2007.","apa":"Sohler, C., &#38; Czumaj, A. (2007). Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i> (pp. 536–548).","mla":"Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.” <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>, 2007, pp. 536–48.","short":"C. Sohler, A. Czumaj, in: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.","bibtex":"@inproceedings{Sohler_Czumaj_2007, title={Small Space Representations for Metric Min-Sum k-Clustering and their Applications}, booktitle={Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={536–548} }"},"page":"536-548","date_updated":"2022-01-06T06:53:50Z","date_created":"2020-08-31T07:59:05Z","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"last_name":"Czumaj","full_name":"Czumaj, Artur","first_name":"Artur"}],"title":"Small Space Representations for Metric Min-Sum k-Clustering and their Applications"},{"issue":"1-2","year":"2007","page":"226 -- 256","intvolume":"        30","citation":{"chicago":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” <i>Random Structures &#38; Algorithms</i> 30, no. 1–2 (2007): 226-- 256.","ieee":"C. Sohler and A. Czumaj, “Sublinear-time approximation algorithms for clustering via random sampling,” <i>Random Structures &#38; Algorithms</i>, vol. 30, no. 1–2, pp. 226-- 256, 2007.","ama":"Sohler C, Czumaj A. Sublinear-time approximation algorithms for clustering via random sampling. <i>Random Structures &#38; Algorithms</i>. 2007;30(1-2):226-- 256.","mla":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” <i>Random Structures &#38; Algorithms</i>, vol. 30, no. 1–2, 2007, pp. 226-- 256.","bibtex":"@article{Sohler_Czumaj_2007, title={Sublinear-time approximation algorithms for clustering via random sampling}, volume={30}, number={1–2}, journal={Random Structures &#38; Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={226-- 256} }","short":"C. Sohler, A. Czumaj, Random Structures &#38; Algorithms 30 (2007) 226-- 256.","apa":"Sohler, C., &#38; Czumaj, A. (2007). Sublinear-time approximation algorithms for clustering via random sampling. <i>Random Structures &#38; Algorithms</i>, <i>30</i>(1–2), 226-- 256."},"date_updated":"2022-01-06T06:53:50Z","volume":30,"author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"}],"date_created":"2020-08-31T08:03:52Z","title":"Sublinear-time approximation algorithms for clustering via random sampling","publication":"Random Structures & Algorithms","type":"journal_article","abstract":[{"text":"We present a novel analysis of a random sampling approach for four clustering problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced k-median. For all these problems, we consider the following simple sampling scheme: select a small sample set of input points uniformly at random and then run some approximation algorithm on this sample set to compute an approximation of the best possible clustering of this set. Our main technical contribution is a significantly strengthened analysis of the approximation guarantee by this scheme for the clustering problems.The main motivation behind our analyses was to design sublinear-time algorithms for clustering problems. Our second contribution is the development of new approximation algorithms for the aforementioned clustering problems. Using our random sampling approach, we obtain for these problems the first time approximation algorithms that have running time independent of the input size, and depending on k and the diameter of the metric space only. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007A preliminary extended abstract of this work appeared in Proceedings of the 31st Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 396407, 2004.","lang":"eng"}],"status":"public","_id":"18665","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"citation":{"bibtex":"@inproceedings{Sohler_Monemizahdeh_Feldman_2007, title={A PTAS for k-means clustering based on weak coresets}, booktitle={Proceedings of the 23rd annual symposium on computational geometry (SoCG’07)}, author={Sohler, Christian and Monemizahdeh, Morteza and Feldman, Dan}, year={2007}, pages={11–18} }","mla":"Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.” <i>Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07)</i>, 2007, pp. 11–18.","short":"C. Sohler, M. Monemizahdeh, D. Feldman, in: Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18.","apa":"Sohler, C., Monemizahdeh, M., &#38; Feldman, D. (2007). A PTAS for k-means clustering based on weak coresets. In <i>Proceedings of the 23rd annual symposium on computational geometry (SoCG’07)</i> (pp. 11–18).","ama":"Sohler C, Monemizahdeh M, Feldman D. A PTAS for k-means clustering based on weak coresets. In: <i>Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07)</i>. ; 2007:11-18.","ieee":"C. Sohler, M. Monemizahdeh, and D. Feldman, “A PTAS for k-means clustering based on weak coresets,” in <i>Proceedings of the 23rd annual symposium on computational geometry (SoCG’07)</i>, 2007, pp. 11–18.","chicago":"Sohler, Christian, Morteza Monemizahdeh, and Dan Feldman. “A PTAS for K-Means Clustering Based on Weak Coresets.” In <i>Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07)</i>, 11–18, 2007."},"page":"11-18","year":"2007","title":"A PTAS for k-means clustering based on weak coresets","date_created":"2020-08-31T08:10:11Z","author":[{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"first_name":"Morteza","full_name":"Monemizahdeh, Morteza","last_name":"Monemizahdeh"},{"last_name":"Feldman","full_name":"Feldman, Dan","first_name":"Dan"}],"date_updated":"2022-01-06T06:53:50Z","status":"public","type":"conference","publication":"Proceedings of the 23rd annual symposium on computational geometry (SoCG'07)","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18668"},{"type":"conference","publication":"Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)","status":"public","_id":"18669","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"year":"2007","citation":{"ieee":"C. Sohler, A. Czumaj, and G. Frahling, “Efficient kinetic data structures for MaxCut,” in <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>, 2007, pp. 157–160.","chicago":"Sohler, Christian, Artur Czumaj, and Gereon Frahling. “Efficient Kinetic Data Structures for MaxCut.” In <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>, 157–60, 2007.","ama":"Sohler C, Czumaj A, Frahling G. Efficient kinetic data structures for MaxCut. In: <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>. ; 2007:157-160.","bibtex":"@inproceedings{Sohler_Czumaj_Frahling_2007, title={Efficient kinetic data structures for MaxCut}, booktitle={Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)}, author={Sohler, Christian and Czumaj, Artur and Frahling, Gereon}, year={2007}, pages={157–160} }","short":"C. Sohler, A. Czumaj, G. Frahling, in: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–160.","mla":"Sohler, Christian, et al. “Efficient Kinetic Data Structures for MaxCut.” <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>, 2007, pp. 157–60.","apa":"Sohler, C., Czumaj, A., &#38; Frahling, G. (2007). Efficient kinetic data structures for MaxCut. In <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i> (pp. 157–160)."},"page":"157-160","date_updated":"2022-01-06T06:53:50Z","date_created":"2020-08-31T08:12:53Z","author":[{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"full_name":"Frahling, Gereon","last_name":"Frahling","first_name":"Gereon"}],"title":"Efficient kinetic data structures for MaxCut"},{"file_date_updated":"2018-04-13T10:01:42Z","language":[{"iso":"eng"}],"ddc":["040"],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"15415","_id":"2214","status":"public","file":[{"creator":"florida","date_created":"2018-04-13T10:01:42Z","date_updated":"2018-04-13T10:01:42Z","file_id":"2339","access_level":"open_access","file_name":"ICDCS07.pdf","file_size":164121,"content_type":"application/pdf","relation":"main_file"}],"urn":"22147","abstract":[{"lang":"eng","text":"We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices."}],"publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","type":"conference","title":"Dynamic and redundant data placement","date_created":"2018-04-05T07:08:35Z","author":[{"first_name":"André","full_name":"Brinkmann, André","last_name":"Brinkmann"},{"first_name":"Sascha","full_name":"Effert, Sascha","last_name":"Effert"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:55:27Z","oa":"1","citation":{"short":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007.","bibtex":"@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic and redundant data placement}, booktitle={IEEE International Conference on Distributed Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }","apa":"Brinkmann, A., Effert, S., Meyer auf der Heide, F., &#38; Scheideler, C. (2007). Dynamic and redundant data placement. <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>.","ama":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>. ; 2007.","chicago":"Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007.","ieee":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007."},"year":"2007","has_accepted_license":"1"},{"citation":{"mla":"Krevert, B., et al. “Ein Plattformunabhängiges Softwaretool Für Die Schnelle Qualitätskontrolle von Transmissions- Und Dynamischen Emissionsdaten in Der PET.” <i>45. Jahrestagung Der DGN</i>, 2007.","bibtex":"@inproceedings{Krevert_Dang_Weise_Fricke_Domik_Buchert_2007, title={Ein plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle von Transmissions- und dynamischen Emissionsdaten in der PET}, booktitle={45. Jahrestagung der DGN}, author={Krevert, B. and Dang, T. B. and Weise, R. and Fricke, H. and Domik, Gitta and Buchert, W.}, year={2007} }","short":"B. Krevert, T.B. Dang, R. Weise, H. Fricke, G. Domik, W. Buchert, in: 45. Jahrestagung Der DGN, 2007.","apa":"Krevert, B., Dang, T. B., Weise, R., Fricke, H., Domik, G., &#38; Buchert, W. (2007). Ein plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle von Transmissions- und dynamischen Emissionsdaten in der PET. In <i>45. Jahrestagung der DGN</i>.","ama":"Krevert B, Dang TB, Weise R, Fricke H, Domik G, Buchert W. Ein plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle von Transmissions- und dynamischen Emissionsdaten in der PET. In: <i>45. Jahrestagung Der DGN</i>. ; 2007.","ieee":"B. Krevert, T. B. Dang, R. Weise, H. Fricke, G. Domik, and W. Buchert, “Ein plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle von Transmissions- und dynamischen Emissionsdaten in der PET,” in <i>45. Jahrestagung der DGN</i>, 2007.","chicago":"Krevert, B., T. B. Dang, R. Weise, H. Fricke, Gitta Domik, and W. Buchert. “Ein Plattformunabhängiges Softwaretool Für Die Schnelle Qualitätskontrolle von Transmissions- Und Dynamischen Emissionsdaten in Der PET.” In <i>45. Jahrestagung Der DGN</i>, 2007."},"year":"2007","title":"Ein plattformunabhängiges Softwaretool für die schnelle Qualitätskontrolle von Transmissions- und dynamischen Emissionsdaten in der PET","author":[{"last_name":"Krevert","full_name":"Krevert, B.","first_name":"B."},{"last_name":"Dang","full_name":"Dang, T. B.","first_name":"T. B."},{"first_name":"R.","full_name":"Weise, R.","last_name":"Weise"},{"last_name":"Fricke","full_name":"Fricke, H.","first_name":"H."},{"full_name":"Domik, Gitta","id":"90","last_name":"Domik","first_name":"Gitta"},{"first_name":"W.","last_name":"Buchert","full_name":"Buchert, W."}],"date_created":"2021-04-25T17:17:25Z","date_updated":"2022-01-06T06:55:13Z","status":"public","type":"conference","publication":"45. Jahrestagung der DGN","language":[{"iso":"eng"}],"user_id":"14955","department":[{"_id":"65"}],"_id":"21776"},{"doi":"10.1145/1273445.1273449","title":"Can ISPs and P2P users cooperate for improved performance?","date_created":"2018-04-05T06:08:43Z","user_id":"15504","author":[{"first_name":"Vinay","full_name":"Aggarwal, Vinay","last_name":"Aggarwal"},{"first_name":"Anja","last_name":"Feldmann","full_name":"Feldmann, Anja"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"department":[{"_id":"79"}],"date_updated":"2022-01-06T06:55:25Z","_id":"2209","citation":{"ieee":"V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P2P users cooperate for improved performance?,” <i>ACM Computer Commucation Review</i>, 2007.","chicago":"Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and P2P Users Cooperate for Improved Performance?” <i>ACM Computer Commucation Review</i>, 2007. <a href=\"https://doi.org/10.1145/1273445.1273449\">https://doi.org/10.1145/1273445.1273449</a>.","ama":"Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P2P users cooperate for improved performance? <i>ACM Computer Commucation Review</i>. 2007. doi:<a href=\"https://doi.org/10.1145/1273445.1273449\">10.1145/1273445.1273449</a>","apa":"Aggarwal, V., Feldmann, A., &#38; Scheideler, C. (2007). Can ISPs and P2P users cooperate for improved performance? <i>ACM Computer Commucation Review</i>. <a href=\"https://doi.org/10.1145/1273445.1273449\">https://doi.org/10.1145/1273445.1273449</a>","bibtex":"@article{Aggarwal_Feldmann_Scheideler_2007, title={Can ISPs and P2P users cooperate for improved performance?}, DOI={<a href=\"https://doi.org/10.1145/1273445.1273449\">10.1145/1273445.1273449</a>}, journal={ACM Computer Commucation Review}, author={Aggarwal, Vinay and Feldmann, Anja and Scheideler, Christian}, year={2007} }","mla":"Aggarwal, Vinay, et al. “Can ISPs and P2P Users Cooperate for Improved Performance?” <i>ACM Computer Commucation Review</i>, 2007, doi:<a href=\"https://doi.org/10.1145/1273445.1273449\">10.1145/1273445.1273449</a>.","short":"V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007)."},"status":"public","year":"2007","type":"journal_article","publication":"ACM Computer Commucation Review"},{"volume":4735,"date_created":"2019-02-19T18:39:05Z","publisher":"Springer","date_updated":"2022-01-06T07:03:46Z","doi":"http://dx.doi.org/10.1007/978-3-540-75209-7","title":"Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA)","intvolume":"      4735","citation":{"ama":"Engels G, Opdyke B, C. Schmidt D, Weil F, eds. <i>Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA)</i>. Vol 4735. Berlin/Heidelberg: Springer; 2007. doi:<a href=\"http://dx.doi.org/10.1007/978-3-540-75209-7\">http://dx.doi.org/10.1007/978-3-540-75209-7</a>","ieee":"G. Engels, B. Opdyke, D. C. Schmidt, and F. Weil, Eds., <i>Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA)</i>, vol. 4735. Berlin/Heidelberg: Springer, 2007.","chicago":"Engels, Gregor, B. Opdyke, D. C. Schmidt, and F. Weil, eds. <i>Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA)</i>. Vol. 4735. LNCS. Berlin/Heidelberg: Springer, 2007. <a href=\"http://dx.doi.org/10.1007/978-3-540-75209-7\">http://dx.doi.org/10.1007/978-3-540-75209-7</a>.","apa":"Engels, G., Opdyke, B., C. Schmidt, D., &#38; Weil, F. (Eds.). (2007). <i>Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA)</i> (Vol. 4735). Berlin/Heidelberg: Springer. <a href=\"http://dx.doi.org/10.1007/978-3-540-75209-7\">http://dx.doi.org/10.1007/978-3-540-75209-7</a>","bibtex":"@book{Engels_Opdyke_C. Schmidt_Weil_2007, place={Berlin/Heidelberg}, series={LNCS}, title={Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA)}, volume={4735}, DOI={<a href=\"http://dx.doi.org/10.1007/978-3-540-75209-7\">http://dx.doi.org/10.1007/978-3-540-75209-7</a>}, publisher={Springer}, year={2007}, collection={LNCS} }","mla":"Engels, Gregor, et al., editors. <i>Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA)</i>. Vol. 4735, Springer, 2007, doi:<a href=\"http://dx.doi.org/10.1007/978-3-540-75209-7\">http://dx.doi.org/10.1007/978-3-540-75209-7</a>.","short":"G. Engels, B. Opdyke, D. C. Schmidt, F. Weil, eds., Proceedings of the 10th International Conference on Model Driven Engineering Languages and Systems (MoDELS 2007), Nashville, TN (USA), Springer, Berlin/Heidelberg, 2007."},"year":"2007","place":"Berlin/Heidelberg","department":[{"_id":"66"}],"user_id":"52534","series_title":"LNCS","_id":"7778","language":[{"iso":"eng"}],"type":"conference_editor","status":"public","editor":[{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"},{"last_name":"Opdyke","full_name":"Opdyke, B.","first_name":"B."},{"full_name":"C. Schmidt, D.","last_name":"C. Schmidt","first_name":"D."},{"last_name":"Weil","full_name":"Weil, F.","first_name":"F."}]},{"year":"2007","citation":{"bibtex":"@book{Pleuß_Van den Bergh_Hußmann_Sauer_Görlich_2007, series={CEUR Workshop Proceedings}, title={Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA)}, volume={297}, publisher={University of Aachen}, year={2007}, collection={CEUR Workshop Proceedings} }","mla":"Pleuß, Andreas, et al., editors. <i>Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA)</i>. Vol. 297, University of Aachen, 2007.","short":"A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, D. Görlich, eds., Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA), University of Aachen, 2007.","apa":"Pleuß, A., Van den Bergh, J., Hußmann, H., Sauer, S., &#38; Görlich, D. (Eds.). (2007). <i>Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA)</i> (Vol. 297). University of Aachen.","ieee":"A. Pleuß, J. Van den Bergh, H. Hußmann, S. Sauer, and D. Görlich, Eds., <i>Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA)</i>, vol. 297. University of Aachen, 2007.","chicago":"Pleuß, Andreas, Jan Van den Bergh, Heinrich Hußmann, Stefan Sauer, and Daniel Görlich, eds. <i>Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA)</i>. Vol. 297. CEUR Workshop Proceedings. University of Aachen, 2007.","ama":"Pleuß A, Van den Bergh J, Hußmann H, Sauer S, Görlich D, eds. <i>Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI ’07), Nashville, Tennessee (USA)</i>. Vol 297. University of Aachen; 2007."},"intvolume":"       297","title":"Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces (MDDAUI '07), Nashville, Tennessee (USA)","date_updated":"2022-01-06T07:03:46Z","publisher":"University of Aachen","date_created":"2019-02-19T18:40:19Z","volume":297,"editor":[{"full_name":"Pleuß, Andreas","last_name":"Pleuß","first_name":"Andreas"},{"first_name":"Jan","last_name":"Van den Bergh","full_name":"Van den Bergh, Jan"},{"full_name":"Hußmann, Heinrich","last_name":"Hußmann","first_name":"Heinrich"},{"id":"447","full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan"},{"first_name":"Daniel","last_name":"Görlich","full_name":"Görlich, Daniel"}],"status":"public","type":"conference_editor","language":[{"iso":"eng"}],"_id":"7779","series_title":"CEUR Workshop Proceedings","user_id":"52534","department":[{"_id":"66"}]},{"page":"286ff.","citation":{"chicago":"Schattkowsky, Tim, Gregor Engels, and Alexander Förster. “A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency.” In <i>Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007)</i>, 286ff. Washington, DC, USA: IEEE Computer Society, 2007. <a href=\"http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22\">http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22</a>.","ieee":"T. Schattkowsky, G. Engels, and A. Förster, “A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency,” in <i>Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007)</i>, 2007, p. 286ff.","ama":"Schattkowsky T, Engels G, Förster A. A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency. In: <i>Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007)</i>. Washington, DC, USA: IEEE Computer Society; 2007:286ff. doi:<a href=\"http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22\">http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22</a>","bibtex":"@inproceedings{Schattkowsky_Engels_Förster_2007, place={Washington, DC, USA}, title={A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency}, DOI={<a href=\"http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22\">http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22</a>}, booktitle={Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007)}, publisher={IEEE Computer Society}, author={Schattkowsky, Tim and Engels, Gregor and Förster, Alexander}, year={2007}, pages={286ff.} }","mla":"Schattkowsky, Tim, et al. “A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency.” <i>Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007)</i>, IEEE Computer Society, 2007, p. 286ff., doi:<a href=\"http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22\">http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22</a>.","short":"T. Schattkowsky, G. Engels, A. Förster, in: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007), IEEE Computer Society, Washington, DC, USA, 2007, p. 286ff.","apa":"Schattkowsky, T., Engels, G., &#38; Förster, A. (2007). A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency. In <i>Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007)</i> (p. 286ff.). Washington, DC, USA: IEEE Computer Society. <a href=\"http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22\">http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22</a>"},"year":"2007","place":"Washington, DC, USA","doi":"http://doi.ieeecomputersociety.org/10.1109/HICSS.2007.22","title":"A Model-Based Approach for Platform-Independent Binary Components with Precise Timing and Fine-Grained Concurrency","date_created":"2019-02-21T11:56:25Z","author":[{"first_name":"Tim","full_name":"Schattkowsky, Tim","last_name":"Schattkowsky"},{"full_name":"Engels, Gregor","id":"107","last_name":"Engels","first_name":"Gregor"},{"first_name":"Alexander","full_name":"Förster, Alexander","last_name":"Förster"}],"publisher":"IEEE Computer Society","date_updated":"2022-01-06T07:03:48Z","status":"public","publication":"Proceedings of the 40th Annual Hawaii International Conference on System Sciences (HICSS 2007)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"7958"},{"publication":"Proceedings of the conference on Business Process Management (BPM 2007), Brisbane (Australia)","type":"conference","status":"public","department":[{"_id":"66"}],"series_title":"LNCS","user_id":"52534","_id":"7960","language":[{"iso":"eng"}],"page":"165-181","intvolume":"      4714","citation":{"chicago":"Küster, Jochen, Ksenia Ryndina, and Harald Gall. “Generation of Business Process Models for Object Life Cycle Compliance.” In <i>Proceedings of the Conference on Business Process Management (BPM 2007), Brisbane (Australia)</i>, 4714:165–81. LNCS. Berlin/Heidelberg: Springer, 2007. <a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13\">https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13</a>.","ieee":"J. Küster, K. Ryndina, and H. Gall, “Generation of Business Process Models for Object Life Cycle Compliance,” in <i>Proceedings of the conference on Business Process Management (BPM 2007), Brisbane (Australia)</i>, 2007, vol. 4714, pp. 165–181.","ama":"Küster J, Ryndina K, Gall H. Generation of Business Process Models for Object Life Cycle Compliance. In: <i>Proceedings of the Conference on Business Process Management (BPM 2007), Brisbane (Australia)</i>. Vol 4714. LNCS. Berlin/Heidelberg: Springer; 2007:165-181. doi:<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13\">https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13</a>","bibtex":"@inproceedings{Küster_Ryndina_Gall_2007, place={Berlin/Heidelberg}, series={LNCS}, title={Generation of Business Process Models for Object Life Cycle Compliance}, volume={4714}, DOI={<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13\">https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13</a>}, booktitle={Proceedings of the conference on Business Process Management (BPM 2007), Brisbane (Australia)}, publisher={Springer}, author={Küster, Jochen and Ryndina, Ksenia and Gall, Harald}, year={2007}, pages={165–181}, collection={LNCS} }","mla":"Küster, Jochen, et al. “Generation of Business Process Models for Object Life Cycle Compliance.” <i>Proceedings of the Conference on Business Process Management (BPM 2007), Brisbane (Australia)</i>, vol. 4714, Springer, 2007, pp. 165–81, doi:<a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13\">https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13</a>.","short":"J. Küster, K. Ryndina, H. Gall, in: Proceedings of the Conference on Business Process Management (BPM 2007), Brisbane (Australia), Springer, Berlin/Heidelberg, 2007, pp. 165–181.","apa":"Küster, J., Ryndina, K., &#38; Gall, H. (2007). Generation of Business Process Models for Object Life Cycle Compliance. In <i>Proceedings of the conference on Business Process Management (BPM 2007), Brisbane (Australia)</i> (Vol. 4714, pp. 165–181). Berlin/Heidelberg: Springer. <a href=\"https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13\">https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13</a>"},"place":"Berlin/Heidelberg","year":"2007","volume":4714,"date_created":"2019-02-21T11:56:27Z","author":[{"full_name":"Küster, Jochen","last_name":"Küster","first_name":"Jochen"},{"first_name":"Ksenia","last_name":"Ryndina","full_name":"Ryndina, Ksenia"},{"full_name":"Gall, Harald","last_name":"Gall","first_name":"Harald"}],"date_updated":"2022-01-06T07:03:48Z","publisher":"Springer","doi":"https://groups.uni-paderborn.de/fg-engels/Publications/dx.doi.org/10.1007/978-3-540-75183-0_13","title":"Generation of Business Process Models for Object Life Cycle Compliance"}]