---
_id: '18285'
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: Ziegler M. <i>Real Computability and Hypercomputation</i>.; 2007.
  apa: Ziegler, M. (2007). <i>Real Computability and Hypercomputation</i>.
  bibtex: '@book{Ziegler_2007, title={Real Computability and Hypercomputation}, author={Ziegler,
    Martin}, year={2007} }'
  chicago: Ziegler, Martin. <i>Real Computability and Hypercomputation</i>, 2007.
  ieee: M. Ziegler, <i>Real Computability and Hypercomputation</i>. 2007.
  mla: Ziegler, Martin. <i>Real Computability and Hypercomputation</i>. 2007.
  short: M. Ziegler, Real Computability and Hypercomputation, 2007.
date_created: 2020-08-25T13:11:38Z
date_updated: 2022-01-06T06:53:28Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-25T13:11:15Z
  date_updated: 2020-08-25T13:11:15Z
  file_id: '18286'
  file_name: real-comp-2007.pdf
  file_size: 2157961
  relation: main_file
  success: 1
file_date_updated: 2020-08-25T13:11:15Z
has_accepted_license: '1'
language:
- iso: eng
report_number: ' tr-ri-07-285'
status: public
title: Real Computability and Hypercomputation
type: report
user_id: '15415'
year: '2007'
...
---
_id: '18347'
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"
author:
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: 'Christoph '
  full_name: 'Laroque, Christoph '
  last_name: Laroque
- first_name: 'Daniel '
  full_name: 'Huber, Daniel '
  last_name: Huber
- first_name: 'Jens '
  full_name: 'Krokowski, Jens '
  last_name: Krokowski
- first_name: 'Bengt '
  full_name: 'Mueck, Bengt '
  last_name: Mueck
- first_name: 'Michael '
  full_name: 'Kortenjan, Michael '
  last_name: Kortenjan
- first_name: Mark
  full_name: Aufenanger, Mark
  last_name: Aufenanger
- first_name: Wilhelm
  full_name: ' Dangelmaier, Wilhelm'
  last_name: ' Dangelmaier'
citation:
  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.'
  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).
  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} }'
  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.
  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.
  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.'
date_created: 2020-08-26T09:23:24Z
date_updated: 2022-01-06T06:53:29Z
ddc:
- '004'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-26T09:22:47Z
  date_updated: 2020-08-26T09:22:47Z
  file_id: '18348'
  file_name: ESM07_final.pdf
  file_size: 389588
  relation: main_file
  success: 1
file_date_updated: 2020-08-26T09:22:47Z
has_accepted_license: '1'
language:
- iso: eng
page: 499--505
publication: European Simulation and Modelling Conference (ESM 2007)
status: public
title: Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple
  Simulation Runs in one 3D Environment
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18349'
author:
- first_name: Wilhelm
  full_name: Dangelmaier, Wilhelm
  last_name: Dangelmaier
- first_name: 'Christoph '
  full_name: ' Laroque, Christoph '
  last_name: ' Laroque'
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
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.'
  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.
  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} }'
  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.
  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.
  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.'
date_created: 2020-08-26T09:30:58Z
date_updated: 2022-01-06T06:53:29Z
department:
- _id: '63'
- _id: '26'
intvolume: '       209'
language:
- iso: eng
page: 95-110
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb
  der Digitalen Fabrik
type: conference
user_id: '5786'
volume: 209
year: '2007'
...
---
_id: '1840'
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
citation:
  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>'
  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>
  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}
    }'
  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>.
  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.
  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>.
  short: 'D.H. Woldegebreal, H. Karl, in: 2007 4th International Symposium on Wireless
    Communication Systems, IEEE, 2007.'
date_created: 2018-03-27T13:00:30Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '75'
doi: 10.1109/iswcs.2007.4392437
publication: 2007 4th International Symposium on Wireless Communication Systems
publication_identifier:
  isbn:
  - '9781424409785'
  - '9781424409792'
publication_status: published
publisher: IEEE
status: public
title: Multiple-Access Relay Channel with Network Coding and Non-Ideal Source-Relay
  Channels
type: conference
user_id: '15572'
year: '2007'
...
---
_id: '1842'
author:
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  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.'
  apa: 'Karl, H. (2007). Optimizing sleeping intervals in preamble sampling MAC for
    WSNs. Bern / Switzerland: Communication in Distributed Systems (KiVS), 2007 ITG-GI
    Conference.'
  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} }'
  chicago: 'Karl, Holger. “Optimizing Sleeping Intervals in Preamble Sampling MAC
    for WSNs.” 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.
  mla: Karl, Holger. <i>Optimizing Sleeping Intervals in Preamble Sampling MAC for
    WSNs</i>. Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference,
    2007.
  short: 'H. Karl, in: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference,
    Bern / Switzerland, 2007.'
date_created: 2018-03-27T13:11:08Z
date_updated: 2022-01-06T06:53:32Z
department:
- _id: '75'
place: Bern / Switzerland
publisher: Communication in Distributed Systems (KiVS), 2007 ITG-GI Conference
status: public
title: Optimizing sleeping intervals in preamble sampling MAC for WSNs
type: conference
user_id: '15572'
year: '2007'
...
---
_id: '18572'
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."
author:
- first_name: Luciana S.
  full_name: Buriol, Luciana S.
  last_name: Buriol
- first_name: Gereon
  full_name: Frahling, Gereon
  last_name: Frahling
- first_name: Stefano
  full_name: Leonardi, Stefano
  last_name: Leonardi
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  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>'
  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} }'
  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.
  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.'
date_created: 2020-08-28T12:46:05Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/978-3-540-75520-3_55
intvolume: '      4698'
language:
- iso: eng
page: 618-632
place: Berlin, Heidelberg
publication: Proceedings of the 15th European Symposium on Algorithms (ESA)
publication_identifier:
  isbn:
  - '9783540755197'
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Estimating Clustering Indexes in Data Streams
type: conference
user_id: '15415'
volume: 4698
year: '2007'
...
---
_id: '18588'
author:
- first_name: Arno
  full_name: Schindlmayr, Arno
  id: '458'
  last_name: Schindlmayr
  orcid: 0000-0002-4855-071X
citation:
  ama: 'Schindlmayr A. Interaction of radiation with matter. Part II: Light and electrons.
    In: Urban K, Schneider CM, Brückel T, Blügel S, eds. <i>Probing the Nanoworld
    </i>. Vol 34. Matter and Materials. Jülich: Forschungszentrum Jülich; 2007:A1.21-A1.36.'
  apa: 'Schindlmayr, A. (2007). Interaction of radiation with matter. Part II: Light
    and electrons. In K. Urban, C. M. Schneider, T. Brückel, &#38; S. Blügel (Eds.),
    <i>Probing the Nanoworld </i> (Vol. 34, p. A1.21-A1.36). Jülich: Forschungszentrum
    Jülich.'
  bibtex: '@inbook{Schindlmayr_2007, place={Jülich}, series={Matter and Materials},
    title={Interaction of radiation with matter. Part II: Light and electrons}, volume={34},
    booktitle={Probing the Nanoworld }, publisher={Forschungszentrum Jülich}, author={Schindlmayr,
    Arno}, editor={Urban, Knut and Schneider, Claus Michael and Brückel, Thomas and
    Blügel, StefanEditors}, year={2007}, pages={A1.21-A1.36}, collection={Matter and
    Materials} }'
  chicago: 'Schindlmayr, Arno. “Interaction of Radiation with Matter. Part II: Light
    and Electrons.” In <i>Probing the Nanoworld </i>, edited by Knut Urban, Claus
    Michael Schneider, Thomas Brückel, and Stefan Blügel, 34:A1.21-A1.36. Matter and
    Materials. Jülich: Forschungszentrum Jülich, 2007.'
  ieee: 'A. Schindlmayr, “Interaction of radiation with matter. Part II: Light and
    electrons,” in <i>Probing the Nanoworld </i>, vol. 34, K. Urban, C. M. Schneider,
    T. Brückel, and S. Blügel, Eds. Jülich: Forschungszentrum Jülich, 2007, p. A1.21-A1.36.'
  mla: 'Schindlmayr, Arno. “Interaction of Radiation with Matter. Part II: Light and
    Electrons.” <i>Probing the Nanoworld </i>, edited by Knut Urban et al., vol. 34,
    Forschungszentrum Jülich, 2007, p. A1.21-A1.36.'
  short: 'A. Schindlmayr, in: K. Urban, C.M. Schneider, T. Brückel, S. Blügel (Eds.),
    Probing the Nanoworld , Forschungszentrum Jülich, Jülich, 2007, p. A1.21-A1.36.'
conference:
  end_date: 2007-03-23
  location: Jülich
  name: 38th Spring School of the Institute of Solid State Research
  start_date: 2007-03-12
date_created: 2020-08-28T16:18:39Z
date_updated: 2022-01-06T06:53:40Z
ddc:
- '530'
editor:
- first_name: Knut
  full_name: Urban, Knut
  last_name: Urban
- first_name: Claus Michael
  full_name: Schneider, Claus Michael
  last_name: Schneider
- first_name: Thomas
  full_name: Brückel, Thomas
  last_name: Brückel
- first_name: Stefan
  full_name: Blügel, Stefan
  last_name: Blügel
extern: '1'
file:
- access_level: request
  content_type: application/pdf
  creator: schindlm
  date_created: 2020-10-05T11:43:03Z
  date_updated: 2022-01-06T06:53:40Z
  description: © 2007 Forschungszentrum Jülich
  file_id: '19878'
  file_name: A01-Schindlmayr.pdf
  file_size: 281378
  relation: main_file
  title: 'Interaction of radiation with matter: Part II: Light and electrons'
file_date_updated: 2022-01-06T06:53:40Z
has_accepted_license: '1'
intvolume: '        34'
language:
- iso: eng
main_file_link:
- url: http://juser.fz-juelich.de/record/811870
page: A1.21-A1.36
place: Jülich
publication: 'Probing the Nanoworld '
publication_identifier:
  isbn:
  - 978-3-89336-462-6
  issn:
  - 1433-5506
publication_status: published
publisher: Forschungszentrum Jülich
series_title: Matter and Materials
status: public
title: 'Interaction of radiation with matter. Part II: Light and electrons'
type: book_chapter
user_id: '458'
volume: 34
year: '2007'
...
---
_id: '18589'
abstract:
- lang: eng
  text: For the calculation of neutral excitations, time-dependent density functional
    theory (TDDFT) is an exact reformulation of the many-body time-dependent Schrödinger
    equation, based on knowledge of the density instead of the many-body wavefunction.
    The density can be determined in an efficient scheme by solving one-particle non-interacting
    Schrödinger equations—the Kohn–Sham equations. The complication of the problem
    is hidden in the—unknown—time-dependent exchange and correlation potential that
    appears in the Kohn–Sham equations and for which it is essential to find good
    approximations. Many approximations have been suggested and tested for finite
    systems, where even the very simple adiabatic local-density approximation (ALDA)
    has often proved to be successful. In the case of solids, ALDA fails to reproduce
    optical absorption spectra, which are instead well described by solving the Bethe–Salpeter
    equation of many-body perturbation theory (MBPT). On the other hand, ALDA can
    lead to excellent results for loss functions (at vanishing and finite momentum
    transfer). In view of this and thanks to recent successful developments of improved
    linear-response kernels derived from MBPT, TDDFT is today considered a promising
    alternative to MBPT for the calculation of electronic spectra, even for solids.
    After reviewing the fundamentals of TDDFT within linear response, we discuss different
    approaches and a variety of applications to extended systems.
article_type: review
author:
- first_name: Silvana
  full_name: Botti, Silvana
  last_name: Botti
- first_name: Arno
  full_name: Schindlmayr, Arno
  id: '458'
  last_name: Schindlmayr
  orcid: 0000-0002-4855-071X
- first_name: Rodolfo
  full_name: Del Sole, Rodolfo
  last_name: Del Sole
- first_name: Lucia
  full_name: Reining, Lucia
  last_name: Reining
citation:
  ama: Botti S, Schindlmayr A, Del Sole R, Reining L. Time-dependent density-functional
    theory for extended systems. <i>Reports on Progress in Physics</i>. 2007;70(3):357-407.
    doi:<a href="https://doi.org/10.1088/0034-4885/70/3/r02">10.1088/0034-4885/70/3/r02</a>
  apa: Botti, S., Schindlmayr, A., Del Sole, R., &#38; Reining, L. (2007). Time-dependent
    density-functional theory for extended systems. <i>Reports on Progress in Physics</i>,
    <i>70</i>(3), 357–407. <a href="https://doi.org/10.1088/0034-4885/70/3/r02">https://doi.org/10.1088/0034-4885/70/3/r02</a>
  bibtex: '@article{Botti_Schindlmayr_Del Sole_Reining_2007, title={Time-dependent
    density-functional theory for extended systems}, volume={70}, DOI={<a href="https://doi.org/10.1088/0034-4885/70/3/r02">10.1088/0034-4885/70/3/r02</a>},
    number={3}, journal={Reports on Progress in Physics}, publisher={IOP Publishing},
    author={Botti, Silvana and Schindlmayr, Arno and Del Sole, Rodolfo and Reining,
    Lucia}, year={2007}, pages={357–407} }'
  chicago: 'Botti, Silvana, Arno Schindlmayr, Rodolfo Del Sole, and Lucia Reining.
    “Time-Dependent Density-Functional Theory for Extended Systems.” <i>Reports on
    Progress in Physics</i> 70, no. 3 (2007): 357–407. <a href="https://doi.org/10.1088/0034-4885/70/3/r02">https://doi.org/10.1088/0034-4885/70/3/r02</a>.'
  ieee: S. Botti, A. Schindlmayr, R. Del Sole, and L. Reining, “Time-dependent density-functional
    theory for extended systems,” <i>Reports on Progress in Physics</i>, vol. 70,
    no. 3, pp. 357–407, 2007.
  mla: Botti, Silvana, et al. “Time-Dependent Density-Functional Theory for Extended
    Systems.” <i>Reports on Progress in Physics</i>, vol. 70, no. 3, IOP Publishing,
    2007, pp. 357–407, doi:<a href="https://doi.org/10.1088/0034-4885/70/3/r02">10.1088/0034-4885/70/3/r02</a>.
  short: S. Botti, A. Schindlmayr, R. Del Sole, L. Reining, Reports on Progress in
    Physics 70 (2007) 357–407.
date_created: 2020-08-28T16:30:06Z
date_updated: 2022-01-06T06:53:40Z
ddc:
- '530'
doi: 10.1088/0034-4885/70/3/r02
extern: '1'
external_id:
  isi:
  - '000244875800003'
file:
- access_level: closed
  content_type: application/pdf
  creator: schindlm
  date_created: 2020-08-28T16:32:12Z
  date_updated: 2020-08-30T15:37:17Z
  description: © 2007 IOP Publishing Ltd
  file_id: '18590'
  file_name: Botti_2007_Rep._Prog._Phys._70_R02.pdf
  file_size: 1166692
  relation: main_file
  title: Time-dependent density-functional theory for extended systems
file_date_updated: 2020-08-30T15:37:17Z
has_accepted_license: '1'
intvolume: '        70'
isi: '1'
issue: '3'
language:
- iso: eng
page: 357-407
publication: Reports on Progress in Physics
publication_identifier:
  eissn:
  - 1361-6633
  issn:
  - 0034-4885
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
status: public
title: Time-dependent density-functional theory for extended systems
type: journal_article
user_id: '458'
volume: 70
year: '2007'
...
---
_id: '18591'
abstract:
- lang: eng
  text: Using density-functional theory, we investigate the stability of the half-metallic
    ground state of magnetite under different strain conditions. The effects of volume
    relaxation and internal degrees of freedom are fully taken into account. For hydrostatic
    compression, planar strain in the (001) plane and uniaxial strain along the [001]
    direction, we derive quantitative limits beyond which magnetite becomes metallic.
    As a major new result, we identify the bond length between the octahedrally coordinated
    iron atoms and their neighbouring oxygen atoms as the main characteristic parameter,
    and we show that the transition occurs if external strain reduces this interatomic
    distance from 2.06 Å in equilibrium to below a critical value of 1.99 Å. Based
    on this criterion, we also argue that planar strain due to epitaxial growth does
    not lead to a metallic state for magnetite films grown on (111)-oriented substrates.
article_number: '5'
article_type: original
author:
- first_name: Martin
  full_name: Friák, Martin
  last_name: Friák
- first_name: Arno
  full_name: Schindlmayr, Arno
  id: '458'
  last_name: Schindlmayr
  orcid: 0000-0002-4855-071X
- first_name: Matthias
  full_name: Scheffler, Matthias
  last_name: Scheffler
citation:
  ama: Friák M, Schindlmayr A, Scheffler M. Ab initio study of the half-metal to metal
    transition in strained magnetite. <i>New Journal of Physics</i>. 2007;9(1). doi:<a
    href="https://doi.org/10.1088/1367-2630/9/1/005">10.1088/1367-2630/9/1/005</a>
  apa: Friák, M., Schindlmayr, A., &#38; Scheffler, M. (2007). Ab initio study of
    the half-metal to metal transition in strained magnetite. <i>New Journal of Physics</i>,
    <i>9</i>(1). <a href="https://doi.org/10.1088/1367-2630/9/1/005">https://doi.org/10.1088/1367-2630/9/1/005</a>
  bibtex: '@article{Friák_Schindlmayr_Scheffler_2007, title={Ab initio study of the
    half-metal to metal transition in strained magnetite}, volume={9}, DOI={<a href="https://doi.org/10.1088/1367-2630/9/1/005">10.1088/1367-2630/9/1/005</a>},
    number={15}, journal={New Journal of Physics}, publisher={IOP Publishing and Deutsche
    Physikalische Gesellschaft}, author={Friák, Martin and Schindlmayr, Arno and Scheffler,
    Matthias}, year={2007} }'
  chicago: Friák, Martin, Arno Schindlmayr, and Matthias Scheffler. “Ab Initio Study
    of the Half-Metal to Metal Transition in Strained Magnetite.” <i>New Journal of
    Physics</i> 9, no. 1 (2007). <a href="https://doi.org/10.1088/1367-2630/9/1/005">https://doi.org/10.1088/1367-2630/9/1/005</a>.
  ieee: M. Friák, A. Schindlmayr, and M. Scheffler, “Ab initio study of the half-metal
    to metal transition in strained magnetite,” <i>New Journal of Physics</i>, vol.
    9, no. 1, 2007.
  mla: Friák, Martin, et al. “Ab Initio Study of the Half-Metal to Metal Transition
    in Strained Magnetite.” <i>New Journal of Physics</i>, vol. 9, no. 1, 5, IOP Publishing
    and Deutsche Physikalische Gesellschaft, 2007, doi:<a href="https://doi.org/10.1088/1367-2630/9/1/005">10.1088/1367-2630/9/1/005</a>.
  short: M. Friák, A. Schindlmayr, M. Scheffler, New Journal of Physics 9 (2007).
date_created: 2020-08-28T16:34:37Z
date_updated: 2022-01-06T06:53:41Z
ddc:
- '530'
doi: 10.1088/1367-2630/9/1/005
extern: '1'
external_id:
  isi:
  - '000243590400002'
file:
- access_level: open_access
  content_type: application/pdf
  creator: schindlm
  date_created: 2020-08-28T16:40:11Z
  date_updated: 2020-08-30T15:40:54Z
  description: © 2007 IOP Publishing Ltd and Deutsche Physikalische Gesellschaft
  file_id: '18592'
  file_name: Friák_2007_New_J._Phys._9_005.pdf
  file_size: 573804
  relation: main_file
  title: Ab initio study of the half-metal to metal transition in strained magnetite
file_date_updated: 2020-08-30T15:40:54Z
has_accepted_license: '1'
intvolume: '         9'
isi: '1'
issue: '1'
language:
- iso: eng
oa: '1'
publication: New Journal of Physics
publication_identifier:
  eissn:
  - 1361-6633
  issn:
  - 0034-4885
publication_status: published
publisher: IOP Publishing and Deutsche Physikalische Gesellschaft
quality_controlled: '1'
status: public
title: Ab initio study of the half-metal to metal transition in strained magnetite
type: journal_article
user_id: '458'
volume: 9
year: '2007'
...
---
_id: '18593'
abstract:
- lang: eng
  text: We present a quantitative parameter-free method for calculating defect states
    and charge-transition levels of point defects in semiconductors. It combines the
    strength of density-functional theory for ground-state total energies with quasiparticle
    corrections to the excitation spectrum obtained from many-body perturbation theory.
    The latter is implemented within the G0W0 approximation, in which the electronic
    self-energy is constructed non-self-consistently from the Green’s function of
    the underlying Kohn–Sham system. The method is general and applicable to arbitrary
    bulk or surface defects. As an example we consider anion vacancies at the (110)
    surfaces of III–V semiconductors. Relative to the Kohn–Sham eigenvalues in the
    local-density approximation, the quasiparticle corrections open the fundamental
    band gap and raise the position of defect states inside the gap. As a consequence,
    the charge-transition levels are also pushed to higher energies, leading to close
    agreement with the available experimental data.
author:
- first_name: Arno
  full_name: Schindlmayr, Arno
  id: '458'
  last_name: Schindlmayr
  orcid: 0000-0002-4855-071X
- first_name: Matthias
  full_name: Scheffler, Matthias
  last_name: Scheffler
citation:
  ama: 'Schindlmayr A, Scheffler M. Quasiparticle calculations for point defects at
    semiconductor surfaces. In: Drabold DA, Estreicher SK, eds. <i>Theory of Defects
    in Semiconductors</i>. Vol 104. Topics in Applied Physics. Berlin, Heidelberg:
    Springer; 2007:165-192. doi:<a href="https://doi.org/10.1007/11690320_8">10.1007/11690320_8</a>'
  apa: 'Schindlmayr, A., &#38; Scheffler, M. (2007). Quasiparticle calculations for
    point defects at semiconductor surfaces. In D. A. Drabold &#38; S. K. Estreicher
    (Eds.), <i>Theory of Defects in Semiconductors</i> (Vol. 104, pp. 165–192). Berlin,
    Heidelberg: Springer. <a href="https://doi.org/10.1007/11690320_8">https://doi.org/10.1007/11690320_8</a>'
  bibtex: '@inbook{Schindlmayr_Scheffler_2007, place={Berlin, Heidelberg}, series={Topics
    in Applied Physics}, title={Quasiparticle calculations for point defects at semiconductor
    surfaces}, volume={104}, DOI={<a href="https://doi.org/10.1007/11690320_8">10.1007/11690320_8</a>},
    booktitle={Theory of Defects in Semiconductors}, publisher={Springer}, author={Schindlmayr,
    Arno and Scheffler, Matthias}, editor={Drabold, David A. and Estreicher, Stefan
    K.Editors}, year={2007}, pages={165–192}, collection={Topics in Applied Physics}
    }'
  chicago: 'Schindlmayr, Arno, and Matthias Scheffler. “Quasiparticle Calculations
    for Point Defects at Semiconductor Surfaces.” In <i>Theory of Defects in Semiconductors</i>,
    edited by David A. Drabold and Stefan K. Estreicher, 104:165–92. Topics in Applied
    Physics. Berlin, Heidelberg: Springer, 2007. <a href="https://doi.org/10.1007/11690320_8">https://doi.org/10.1007/11690320_8</a>.'
  ieee: 'A. Schindlmayr and M. Scheffler, “Quasiparticle calculations for point defects
    at semiconductor surfaces,” in <i>Theory of Defects in Semiconductors</i>, vol.
    104, D. A. Drabold and S. K. Estreicher, Eds. Berlin, Heidelberg: Springer, 2007,
    pp. 165–192.'
  mla: Schindlmayr, Arno, and Matthias Scheffler. “Quasiparticle Calculations for
    Point Defects at Semiconductor Surfaces.” <i>Theory of Defects in Semiconductors</i>,
    edited by David A. Drabold and Stefan K. Estreicher, vol. 104, Springer, 2007,
    pp. 165–92, doi:<a href="https://doi.org/10.1007/11690320_8">10.1007/11690320_8</a>.
  short: 'A. Schindlmayr, M. Scheffler, in: D.A. Drabold, S.K. Estreicher (Eds.),
    Theory of Defects in Semiconductors, Springer, Berlin, Heidelberg, 2007, pp. 165–192.'
date_created: 2020-08-28T16:43:51Z
date_updated: 2022-01-06T06:53:41Z
ddc:
- '530'
doi: 10.1007/11690320_8
editor:
- first_name: David A.
  full_name: Drabold, David A.
  last_name: Drabold
- first_name: Stefan K.
  full_name: Estreicher, Stefan K.
  last_name: Estreicher
extern: '1'
external_id:
  isi:
  - '000241944900008'
file:
- access_level: closed
  content_type: application/pdf
  creator: schindlm
  date_created: 2020-08-28T16:49:56Z
  date_updated: 2020-08-30T15:42:34Z
  description: © 2007 Springer-Verlag, Berlin, Heidelberg
  file_id: '18594'
  file_name: Schindlmayr-Scheffler2007_Chapter_QuasiparticleCalculationsForPo.pdf
  file_size: 649066
  relation: main_file
  title: Quasiparticle calculations for point defects at semiconductor surfaces
file_date_updated: 2020-08-30T15:42:34Z
has_accepted_license: '1'
intvolume: '       104'
isi: '1'
language:
- iso: eng
page: 165-192
place: Berlin, Heidelberg
publication: Theory of Defects in Semiconductors
publication_identifier:
  eisbn:
  - 978-3-540-33401-9
  eissn:
  - 1437-0859
  isbn:
  - 978-3-540-33400-2
  issn:
  - 0303-4216
publication_status: published
publisher: Springer
quality_controlled: '1'
series_title: Topics in Applied Physics
status: public
title: Quasiparticle calculations for point defects at semiconductor surfaces
type: book_chapter
user_id: '458'
volume: 104
year: '2007'
...
---
_id: '18655'
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.
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
citation:
  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.'
  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).
  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} }'
  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.
  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.
  short: 'C. Sohler, A. Czumaj, in: Proceedings of the 17th ACM-SIAM Symposium on
    Discrete Algorithms (SODA’07), 2007, pp. 494–501.'
date_created: 2020-08-31T07:40:36Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 494-501
publication: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)
publication_identifier:
  isbn:
  - '9780898716245'
status: public
title: On Testable Properties in Bounded Degree Graphs
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18656'
abstract:
- lang: eng
  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 ε.
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Christiane
  full_name: Lammersen, Christiane
  last_name: Lammersen
citation:
  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.'
  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} }'
  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.
  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.
  short: 'C. Sohler, C. Lammersen, in: Proceedings of the 23rd European Workshop on
    Computational Geometry (EWCG), 2007, pp. 69–72.'
date_created: 2020-08-31T07:49:02Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 69-72
publication: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)
status: public
title: StrSort Algorithms for Geometric Problems
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18660'
author:
- first_name: 'Christian '
  full_name: 'Sohler, Christian '
  last_name: Sohler
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
citation:
  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.'
  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).
  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} }'
  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.
  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.
  short: 'C. Sohler, A. Czumaj, in: Proceedings of the 48th Annual IEEE Symposium
    on Foundations of Computer Science (FOCS), 2007, pp. 570–578.'
date_created: 2020-08-31T07:55:45Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 570 - 578
publication: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer
  Science (FOCS)
status: public
title: Testing Expansion in Bounded-Degree Graphs
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18662'
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
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.'
  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).
  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} }'
  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.
  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.
  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.'
date_created: 2020-08-31T07:59:05Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 536-548
publication: Proceedings of the 24th International Symposium on Theoretical Aspects
  of Computer Science (STACS'07)
status: public
title: Small Space Representations for Metric Min-Sum k-Clustering and their Applications
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18665'
abstract:
- lang: eng
  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.'
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
citation:
  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.
  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.
  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} }'
  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.
  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.
  short: C. Sohler, A. Czumaj, Random Structures &#38; Algorithms 30 (2007) 226--
    256.
date_created: 2020-08-31T08:03:52Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
intvolume: '        30'
issue: 1-2
language:
- iso: eng
page: 226 -- 256
publication: Random Structures & Algorithms
status: public
title: Sublinear-time approximation algorithms for clustering via random sampling
type: journal_article
user_id: '15415'
volume: 30
year: '2007'
...
---
_id: '18668'
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Morteza
  full_name: Monemizahdeh, Morteza
  last_name: Monemizahdeh
- first_name: Dan
  full_name: Feldman, Dan
  last_name: Feldman
citation:
  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.'
  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).
  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} }'
  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.
  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.
  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.'
date_created: 2020-08-31T08:10:11Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 11-18
publication: Proceedings of the 23rd annual symposium on computational geometry (SoCG'07)
status: public
title: A PTAS for k-means clustering based on weak coresets
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '18669'
author:
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Gereon
  full_name: Frahling, Gereon
  last_name: Frahling
citation:
  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.'
  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).
  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} }'
  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.
  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.
  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.
  short: 'C. Sohler, A. Czumaj, G. Frahling, in: Proceedings of the 19th Canadian
    Conference on Computational Geometry (CCCG), 2007, pp. 157–160.'
date_created: 2020-08-31T08:12:53Z
date_updated: 2022-01-06T06:53:50Z
department:
- _id: '63'
language:
- iso: eng
page: 157-160
publication: Proceedings of the 19th Canadian Conference on Computational Geometry
  (CCCG)
status: public
title: Efficient kinetic data structures for MaxCut
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '2214'
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.
author:
- first_name: André
  full_name: Brinkmann, André
  last_name: Brinkmann
- first_name: Sascha
  full_name: Effert, Sascha
  last_name: Effert
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  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.'
  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>.
  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} }'
  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.
  mla: Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” <i>IEEE International
    Conference on Distributed Computing Systems (ICDCS)</i>, 2007.
  short: 'A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE
    International Conference on Distributed Computing Systems (ICDCS), 2007.'
date_created: 2018-04-05T07:08:35Z
date_updated: 2022-01-06T06:55:27Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
  content_type: application/pdf
  creator: florida
  date_created: 2018-04-13T10:01:42Z
  date_updated: 2018-04-13T10:01:42Z
  file_id: '2339'
  file_name: ICDCS07.pdf
  file_size: 164121
  relation: main_file
file_date_updated: 2018-04-13T10:01:42Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: IEEE International Conference on Distributed Computing Systems (ICDCS)
status: public
title: Dynamic and redundant data placement
type: conference
urn: '22147'
user_id: '15415'
year: '2007'
...
---
_id: '22330'
author:
- first_name: Ursula
  full_name: Frank, Ursula
  last_name: Frank
- first_name: Jürgen
  full_name: Gausemeier, Jürgen
  last_name: Gausemeier
- first_name: Alexander
  full_name: Schmidt, Alexander
  last_name: Schmidt
- first_name: Detmar
  full_name: Zimmer, Detmar
  id: '604'
  last_name: Zimmer
citation:
  ama: 'Frank U, Gausemeier J, Schmidt A, Zimmer D. Von der Mechatronik zur Selbstoptimierung.
    In: <i>Internationales Forum Mechatronik. Intelligente Systeme Und Module</i>.
    Züricher Hochschule für Angewandte Wissenschaften Institut für Mechatronische
    Systeme; 2007.'
  apa: Frank, U., Gausemeier, J., Schmidt, A., &#38; Zimmer, D. (2007). Von der Mechatronik
    zur Selbstoptimierung. In <i>Internationales Forum Mechatronik. Intelligente Systeme
    und Module</i>. Züricher Hochschule für Angewandte Wissenschaften Institut für
    Mechatronische Systeme.
  bibtex: '@inproceedings{Frank_Gausemeier_Schmidt_Zimmer_2007, title={Von der Mechatronik
    zur Selbstoptimierung}, booktitle={Internationales Forum Mechatronik. Intelligente
    Systeme und Module}, publisher={Züricher Hochschule für Angewandte Wissenschaften
    Institut für Mechatronische Systeme}, author={Frank, Ursula and Gausemeier, Jürgen
    and Schmidt, Alexander and Zimmer, Detmar}, year={2007} }'
  chicago: Frank, Ursula, Jürgen Gausemeier, Alexander Schmidt, and Detmar Zimmer.
    “Von Der Mechatronik Zur Selbstoptimierung.” In <i>Internationales Forum Mechatronik.
    Intelligente Systeme Und Module</i>. Züricher Hochschule für Angewandte Wissenschaften
    Institut für Mechatronische Systeme, 2007.
  ieee: U. Frank, J. Gausemeier, A. Schmidt, and D. Zimmer, “Von der Mechatronik zur
    Selbstoptimierung,” in <i>Internationales Forum Mechatronik. Intelligente Systeme
    und Module</i>, 2007.
  mla: Frank, Ursula, et al. “Von Der Mechatronik Zur Selbstoptimierung.” <i>Internationales
    Forum Mechatronik. Intelligente Systeme Und Module</i>, Züricher Hochschule für
    Angewandte Wissenschaften Institut für Mechatronische Systeme, 2007.
  short: 'U. Frank, J. Gausemeier, A. Schmidt, D. Zimmer, in: Internationales Forum
    Mechatronik. Intelligente Systeme Und Module, Züricher Hochschule für Angewandte
    Wissenschaften Institut für Mechatronische Systeme, 2007.'
date_created: 2021-06-15T11:08:05Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '9'
- _id: '146'
language:
- iso: eng
publication: Internationales Forum Mechatronik. Intelligente Systeme und Module
publication_identifier:
  isbn:
  - 978-3-033-01192-2
publisher: Züricher Hochschule für Angewandte Wissenschaften Institut für Mechatronische
  Systeme
status: public
title: Von der Mechatronik zur Selbstoptimierung
type: conference
user_id: '38077'
year: '2007'
...
---
_id: '22331'
author:
- first_name: Jürgen
  full_name: Gausemeier, Jürgen
  last_name: Gausemeier
- first_name: Wilhelm
  full_name: Dangelmaier, Wilhelm
  last_name: Dangelmaier
- first_name: Detmar
  full_name: Zimmer, Detmar
  id: '604'
  last_name: Zimmer
- first_name: Alexander
  full_name: Schmidt, Alexander
  last_name: Schmidt
- first_name: Ursula
  full_name: Frank, Ursula
  last_name: Frank
- first_name: Benjamin
  full_name: Klöpper, Benjamin
  last_name: Klöpper
citation:
  ama: 'Gausemeier J, Dangelmaier W, Zimmer D, Schmidt A, Frank U, Klöpper B. Using
    Active Patterns for the Conceptual Design of Self-Optimizing Systems Exemplified
    by an Air Gap Adjustment System. In: <i>Computers and Information in Engineering
    Conference, Parts A and B</i>. Vol 27. American Society of Mechanical Engineers;
    2007:935-944. doi:<a href="https://doi.org/10.1115/DETC2007-34642">10.1115/DETC2007-34642</a>'
  apa: Gausemeier, J., Dangelmaier, W., Zimmer, D., Schmidt, A., Frank, U., &#38;
    Klöpper, B. (2007). Using Active Patterns for the Conceptual Design of Self-Optimizing
    Systems Exemplified by an Air Gap Adjustment System. In <i>Computers and Information
    in Engineering Conference, Parts A and B</i> (Vol. 27, pp. 935–944). American
    Society of Mechanical Engineers. <a href="https://doi.org/10.1115/DETC2007-34642">https://doi.org/10.1115/DETC2007-34642</a>
  bibtex: '@inproceedings{Gausemeier_Dangelmaier_Zimmer_Schmidt_Frank_Klöpper_2007,
    title={Using Active Patterns for the Conceptual Design of Self-Optimizing Systems
    Exemplified by an Air Gap Adjustment System}, volume={27}, DOI={<a href="https://doi.org/10.1115/DETC2007-34642">10.1115/DETC2007-34642</a>},
    booktitle={Computers and Information in Engineering Conference, Parts A and B},
    publisher={American Society of Mechanical Engineers}, author={Gausemeier, Jürgen
    and Dangelmaier, Wilhelm and Zimmer, Detmar and Schmidt, Alexander and Frank,
    Ursula and Klöpper, Benjamin}, year={2007}, pages={935–944} }'
  chicago: Gausemeier, Jürgen, Wilhelm Dangelmaier, Detmar Zimmer, Alexander Schmidt,
    Ursula Frank, and Benjamin Klöpper. “Using Active Patterns for the Conceptual
    Design of Self-Optimizing Systems Exemplified by an Air Gap Adjustment System.”
    In <i>Computers and Information in Engineering Conference, Parts A and B</i>,
    27:935–44. American Society of Mechanical Engineers, 2007. <a href="https://doi.org/10.1115/DETC2007-34642">https://doi.org/10.1115/DETC2007-34642</a>.
  ieee: J. Gausemeier, W. Dangelmaier, D. Zimmer, A. Schmidt, U. Frank, and B. Klöpper,
    “Using Active Patterns for the Conceptual Design of Self-Optimizing Systems Exemplified
    by an Air Gap Adjustment System,” in <i>Computers and Information in Engineering
    Conference, Parts A and B</i>, 2007, vol. 27, pp. 935–944.
  mla: Gausemeier, Jürgen, et al. “Using Active Patterns for the Conceptual Design
    of Self-Optimizing Systems Exemplified by an Air Gap Adjustment System.” <i>Computers
    and Information in Engineering Conference, Parts A and B</i>, vol. 27, American
    Society of Mechanical Engineers, 2007, pp. 935–44, doi:<a href="https://doi.org/10.1115/DETC2007-34642">10.1115/DETC2007-34642</a>.
  short: 'J. Gausemeier, W. Dangelmaier, D. Zimmer, A. Schmidt, U. Frank, B. Klöpper,
    in: Computers and Information in Engineering Conference, Parts A and B, American
    Society of Mechanical Engineers, 2007, pp. 935–944.'
date_created: 2021-06-15T11:08:06Z
date_updated: 2022-01-06T06:55:31Z
department:
- _id: '9'
- _id: '146'
doi: 10.1115/DETC2007-34642
intvolume: '        27'
language:
- iso: eng
page: 935-944
publication: Computers and Information in Engineering Conference, Parts A and B
publication_identifier:
  isbn:
  - 0-7918-3806-4
publisher: American Society of Mechanical Engineers
status: public
title: Using Active Patterns for the Conceptual Design of Self-Optimizing Systems
  Exemplified by an Air Gap Adjustment System
type: conference
user_id: '38077'
volume: 27
year: '2007'
...
