---
_id: '17980'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Revising Type-2 Computation and Degrees of Discontinuity. Electronic
Notes in Theoretical Computer Science. 2007:255-274. doi:10.1016/j.entcs.2006.08.015
apa: Ziegler, M. (2007). Revising Type-2 Computation and Degrees of Discontinuity.
Electronic Notes in Theoretical Computer Science, 255–274. https://doi.org/10.1016/j.entcs.2006.08.015
bibtex: '@article{Ziegler_2007, title={Revising Type-2 Computation and Degrees of
Discontinuity}, DOI={10.1016/j.entcs.2006.08.015},
journal={Electronic Notes in Theoretical Computer Science}, author={Ziegler, Martin},
year={2007}, pages={255–274} }'
chicago: Ziegler, Martin. “Revising Type-2 Computation and Degrees of Discontinuity.”
Electronic Notes in Theoretical Computer Science, 2007, 255–74. https://doi.org/10.1016/j.entcs.2006.08.015.
ieee: M. Ziegler, “Revising Type-2 Computation and Degrees of Discontinuity,” Electronic
Notes in Theoretical Computer Science, pp. 255–274, 2007.
mla: Ziegler, Martin. “Revising Type-2 Computation and Degrees of Discontinuity.”
Electronic Notes in Theoretical Computer Science, 2007, pp. 255–74, doi:10.1016/j.entcs.2006.08.015.
short: M. Ziegler, Electronic Notes in Theoretical Computer Science (2007) 255–274.
date_created: 2020-08-14T13:30:00Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1016/j.entcs.2006.08.015
language:
- iso: eng
page: 255-274
publication: Electronic Notes in Theoretical Computer Science
publication_identifier:
issn:
- 1571-0661
publication_status: published
status: public
title: Revising Type-2 Computation and Degrees of Discontinuity
type: journal_article
user_id: '15415'
year: '2007'
...
---
_id: '17981'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Real Hypercomputation and Continuity. Theory of Computing Systems.
2007:177-206. doi:10.1007/s00224-006-1343-6
apa: Ziegler, M. (2007). Real Hypercomputation and Continuity. Theory of Computing
Systems, 177–206. https://doi.org/10.1007/s00224-006-1343-6
bibtex: '@article{Ziegler_2007, title={Real Hypercomputation and Continuity}, DOI={10.1007/s00224-006-1343-6},
journal={Theory of Computing Systems}, author={Ziegler, Martin}, year={2007},
pages={177–206} }'
chicago: Ziegler, Martin. “Real Hypercomputation and Continuity.” Theory of Computing
Systems, 2007, 177–206. https://doi.org/10.1007/s00224-006-1343-6.
ieee: M. Ziegler, “Real Hypercomputation and Continuity,” Theory of Computing
Systems, pp. 177–206, 2007.
mla: Ziegler, Martin. “Real Hypercomputation and Continuity.” Theory of Computing
Systems, 2007, pp. 177–206, doi:10.1007/s00224-006-1343-6.
short: M. Ziegler, Theory of Computing Systems (2007) 177–206.
date_created: 2020-08-14T13:32:37Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/s00224-006-1343-6
language:
- iso: eng
page: 177-206
publication: Theory of Computing Systems
publication_identifier:
issn:
- 1432-4350
- 1433-0490
publication_status: published
status: public
title: Real Hypercomputation and Continuity
type: journal_article
user_id: '15415'
year: '2007'
...
---
_id: '17982'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. (Short) Survey of Real Hypercomputation. In: Lecture Notes in
Computer Science. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-73001-9_86'
apa: Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In Lecture
Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_86
bibtex: '@inbook{Ziegler_2007, place={Berlin, Heidelberg}, title={(Short) Survey
of Real Hypercomputation}, DOI={10.1007/978-3-540-73001-9_86},
booktitle={Lecture Notes in Computer Science}, author={Ziegler, Martin}, year={2007}
}'
chicago: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” In Lecture
Notes in Computer Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73001-9_86.
ieee: M. Ziegler, “(Short) Survey of Real Hypercomputation,” in Lecture Notes
in Computer Science, Berlin, Heidelberg, 2007.
mla: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” Lecture Notes
in Computer Science, 2007, doi:10.1007/978-3-540-73001-9_86.
short: 'M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:33:50Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73001-9_86
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540730002'
- '9783540730019'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: (Short) Survey of Real Hypercomputation
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '17983'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Meer K, Ziegler M. Real Computational Universality: The Word Problem for a
Class of Groups with Infinite Presentation. In: Mathematical Foundations of
Computer Science 2007. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-74456-6_64'
apa: 'Meer, K., & Ziegler, M. (2007). Real Computational Universality: The Word
Problem for a Class of Groups with Infinite Presentation. In Mathematical Foundations
of Computer Science 2007. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_64'
bibtex: '@inbook{Meer_Ziegler_2007, place={Berlin, Heidelberg}, title={Real Computational
Universality: The Word Problem for a Class of Groups with Infinite Presentation},
DOI={10.1007/978-3-540-74456-6_64},
booktitle={Mathematical Foundations of Computer Science 2007}, author={Meer, Klaus
and Ziegler, Martin}, year={2007} }'
chicago: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The
Word Problem for a Class of Groups with Infinite Presentation.” In Mathematical
Foundations of Computer Science 2007. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-74456-6_64.'
ieee: 'K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem
for a Class of Groups with Infinite Presentation,” in Mathematical Foundations
of Computer Science 2007, Berlin, Heidelberg, 2007.'
mla: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word
Problem for a Class of Groups with Infinite Presentation.” Mathematical Foundations
of Computer Science 2007, 2007, doi:10.1007/978-3-540-74456-6_64.'
short: 'K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007,
Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:35:56Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-74456-6_64
language:
- iso: eng
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2007
publication_identifier:
isbn:
- '9783540744559'
- '9783540744566'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Real Computational Universality: The Word Problem for a Class of Groups with
Infinite Presentation'
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '17984'
abstract:
- lang: eng
text: "The unit cost model is both convenient and largely realistic for describing\r\ninteger
decision algorithms over (+,*). Additional operations like division\r\nwith remainder
or bitwise conjunction, although equally supported by computing\r\nhardware, may
lead to a considerable drop in complexity. We show a variety of\r\nconcrete problems
to benefit from such NON-arithmetic primitives by presenting\r\nand analyzing
corresponding fast algorithms."
author:
- first_name: Katharina
full_name: Lürwer-Brüggemeier, Katharina
last_name: Lürwer-Brüggemeier
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations using Non-Arithmetic
Primitives. arXiv:07090624. 2007.
apa: Lürwer-Brüggemeier, K., & Ziegler, M. (2007). On Faster Integer Calculations
using Non-Arithmetic Primitives. ArXiv:0709.0624.
bibtex: '@article{Lürwer-Brüggemeier_Ziegler_2007, title={On Faster Integer Calculations
using Non-Arithmetic Primitives}, journal={arXiv:0709.0624}, author={Lürwer-Brüggemeier,
Katharina and Ziegler, Martin}, year={2007} }'
chicago: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” ArXiv:0709.0624, 2007.
ieee: K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations using
Non-Arithmetic Primitives,” arXiv:0709.0624. 2007.
mla: Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations
Using Non-Arithmetic Primitives.” ArXiv:0709.0624, 2007.
short: K. Lürwer-Brüggemeier, M. Ziegler, ArXiv:0709.0624 (2007).
date_created: 2020-08-14T13:36:55Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
language:
- iso: eng
publication: arXiv:0709.0624
status: public
title: On Faster Integer Calculations using Non-Arithmetic Primitives
type: preprint
user_id: '15415'
year: '2007'
...
---
_id: '18285'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: Ziegler M. Real Computability and Hypercomputation.; 2007.
apa: Ziegler, M. (2007). Real Computability and Hypercomputation.
bibtex: '@book{Ziegler_2007, title={Real Computability and Hypercomputation}, author={Ziegler,
Martin}, year={2007} }'
chicago: Ziegler, Martin. Real Computability and Hypercomputation, 2007.
ieee: M. Ziegler, Real Computability and Hypercomputation. 2007.
mla: Ziegler, Martin. Real Computability and Hypercomputation. 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: European Simulation and Modelling Conference (ESM 2007). ; 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 European
Simulation and Modelling Conference (ESM 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} }'
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 European Simulation and Modelling Conference
(ESM 2007), 499--505, 2007.
ieee: M. Fischer et al., “Interactive Refinement of a Material Flow Simulation
Model by Comparing Multiple Simulation Runs in one 3D Environment,” in European
Simulation and Modelling Conference (ESM 2007), 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.” European
Simulation and Modelling Conference (ESM 2007), 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: Augmented &
Virtual Reality in Der Produktentstehung. Vol 209. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2007:95-110.'
apa: Dangelmaier, W., Laroque, C., & Fischer, M. (2007). Ein ganzheitlicher
Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik.
Augmented & Virtual Reality in Der Produktentstehung, 209, 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 & 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 Augmented & Virtual Reality in Der Produktentstehung, 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 Augmented
& Virtual Reality in der Produktentstehung, 2007, vol. 209, pp. 95–110.
mla: Dangelmaier, Wilhelm, et al. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation
Innerhalb Der Digitalen Fabrik.” Augmented & Virtual Reality in Der Produktentstehung,
vol. 209, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007,
pp. 95–110.
short: 'W. Dangelmaier, C. Laroque, M. Fischer, in: Augmented & 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: '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: Proceedings of the 15th European Symposium on Algorithms
(ESA). Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer;
2007:618-632. doi:10.1007/978-3-540-75520-3_55'
apa: 'Buriol, L. S., Frahling, G., Leonardi, S., & Sohler, C. (2007). Estimating
Clustering Indexes in Data Streams. In Proceedings of the 15th European Symposium
on Algorithms (ESA) (Vol. 4698, pp. 618–632). Berlin, Heidelberg: Springer.
https://doi.org/10.1007/978-3-540-75520-3_55'
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={10.1007/978-3-540-75520-3_55},
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 Proceedings of the 15th
European Symposium on Algorithms (ESA), 4698:618–32. Lecture Notes in Computer
Science. Berlin, Heidelberg: Springer, 2007. https://doi.org/10.1007/978-3-540-75520-3_55.'
ieee: L. S. Buriol, G. Frahling, S. Leonardi, and C. Sohler, “Estimating Clustering
Indexes in Data Streams,” in Proceedings of the 15th European Symposium on
Algorithms (ESA), 2007, vol. 4698, pp. 618–632.
mla: Buriol, Luciana S., et al. “Estimating Clustering Indexes in Data Streams.”
Proceedings of the 15th European Symposium on Algorithms (ESA), vol. 4698,
Springer, 2007, pp. 618–32, doi:10.1007/978-3-540-75520-3_55.
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: '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: Proceedings
of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07). ; 2007:494-501.'
apa: Sohler, C., & Czumaj, A. (2007). On Testable Properties in Bounded Degree
Graphs. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07) (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 Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07), 494–501, 2007.
ieee: C. Sohler and A. Czumaj, “On Testable Properties in Bounded Degree Graphs,”
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.” Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms
(SODA’07), 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: Proceedings
of the 23rd European Workshop on Computational Geometry (EWCG). ; 2007:69-72.'
apa: Sohler, C., & Lammersen, C. (2007). StrSort Algorithms for Geometric Problems.
In Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)
(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 Proceedings of the 23rd European Workshop on Computational Geometry
(EWCG), 69–72, 2007.
ieee: C. Sohler and C. Lammersen, “StrSort Algorithms for Geometric Problems,” 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.” Proceedings of the 23rd European Workshop on Computational Geometry
(EWCG), 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: Proceedings
of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS).
; 2007:570-578.'
apa: Sohler, C., & Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs.
In Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer
Science (FOCS) (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 Proceedings of the 48th Annual IEEE Symposium on Foundations of
Computer Science (FOCS), 570–78, 2007.
ieee: C. Sohler and A. Czumaj, “Testing Expansion in Bounded-Degree Graphs,” in
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
(FOCS), 2007, pp. 570–578.
mla: Sohler, Christian, and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.”
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
(FOCS), 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: Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07). ; 2007:536-548.'
apa: Sohler, C., & Czumaj, A. (2007). Small Space Representations for Metric
Min-Sum k-Clustering and their Applications. In Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07) (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 Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07), 536–48, 2007.
ieee: C. Sohler and A. Czumaj, “Small Space Representations for Metric Min-Sum k-Clustering
and their Applications,” in Proceedings of the 24th International Symposium
on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.
mla: Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric
Min-Sum k-Clustering and Their Applications.” Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS’07), 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. Random Structures & Algorithms. 2007;30(1-2):226--
256.
apa: Sohler, C., & Czumaj, A. (2007). Sublinear-time approximation algorithms
for clustering via random sampling. Random Structures & Algorithms,
30(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 & 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.” Random Structures & Algorithms
30, no. 1–2 (2007): 226-- 256.'
ieee: C. Sohler and A. Czumaj, “Sublinear-time approximation algorithms for clustering
via random sampling,” Random Structures & Algorithms, vol. 30, no.
1–2, pp. 226-- 256, 2007.
mla: Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms
for Clustering via Random Sampling.” Random Structures & Algorithms,
vol. 30, no. 1–2, 2007, pp. 226-- 256.
short: C. Sohler, A. Czumaj, Random Structures & 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: Proceedings of the 23rd Annual Symposium on Computational
Geometry (SoCG’07). ; 2007:11-18.'
apa: Sohler, C., Monemizahdeh, M., & Feldman, D. (2007). A PTAS for k-means
clustering based on weak coresets. In Proceedings of the 23rd annual symposium
on computational geometry (SoCG’07) (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 Proceedings of the 23rd Annual Symposium
on Computational Geometry (SoCG’07), 11–18, 2007.
ieee: C. Sohler, M. Monemizahdeh, and D. Feldman, “A PTAS for k-means clustering
based on weak coresets,” in Proceedings of the 23rd annual symposium on computational
geometry (SoCG’07), 2007, pp. 11–18.
mla: Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.”
Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07),
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: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG).
; 2007:157-160.'
apa: Sohler, C., Czumaj, A., & Frahling, G. (2007). Efficient kinetic data structures
for MaxCut. In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG) (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 Proceedings of the 19th Canadian Conference
on Computational Geometry (CCCG), 157–60, 2007.
ieee: C. Sohler, A. Czumaj, and G. Frahling, “Efficient kinetic data structures
for MaxCut,” 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.” Proceedings
of the 19th Canadian Conference on Computational Geometry (CCCG), 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: IEEE International Conference on Distributed Computing
Systems (ICDCS). ; 2007.'
apa: Brinkmann, A., Effert, S., Meyer auf der Heide, F., & Scheideler, C. (2007).
Dynamic and redundant data placement. IEEE International Conference on Distributed
Computing Systems (ICDCS).
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 IEEE International Conference
on Distributed Computing Systems (ICDCS), 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.” IEEE International
Conference on Distributed Computing Systems (ICDCS), 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: '7970'
abstract:
- lang: eng
text: We consider the problem of exploring an unknown environment using a swarm
of autonomous robots with collective behavior emerging from their local rules.
Each robot has only a very restricted view on the environment which makes cooperation
difficult. We introduce a software system which is capable of simulating a large
number of such robots (e.g. 1000) on highly complex terrains with millions of
obstacles. Its main purpose is to easily integrate and evaluate any kind of algorithm
for controlling the robot behavior. The simulation may be observed in real-time
via a visualization that displays both the individual and the collective progress
of the robots. We present the system design, its main features and underlying
concepts.
author:
- first_name: Stephan
full_name: Arens, Stephan
last_name: Arens
- first_name: Alexander
full_name: Buss, Alexander
last_name: Buss
- first_name: Helena
full_name: Deck, Helena
last_name: Deck
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Holger
full_name: Hagedorn, Holger
last_name: Hagedorn
- first_name: Peter
full_name: Isaak, Peter
last_name: Isaak
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Viktor
full_name: Nesterow, Viktor
last_name: Nesterow
- first_name: Adrian
full_name: Ogiermann, Adrian
last_name: Ogiermann
- first_name: Boris
full_name: Stobbe, Boris
last_name: Stobbe
- first_name: Thomas
full_name: Storm, Thomas
last_name: Storm
- first_name: Henning
full_name: Wachsmuth, Henning
id: '3900'
last_name: Wachsmuth
citation:
ama: 'Arens S, Buss A, Deck H, et al. Smart Teams: Simulating Large Robotic Swarms
in Vast Environments. In: Proceedings of the 4th International Symposium on
Autonomous Minirobots for Research and Edutainment. Buenos Aires, Argentina:
Heinz Nixdorf Institut, University of Paderborn; 2007:215-222.'
apa: 'Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H., … Wachsmuth,
H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments.
In Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment (pp. 215–222). Buenos Aires, Argentina: Heinz
Nixdorf Institut, University of Paderborn.'
bibtex: '@inproceedings{Arens_Buss_Deck_Dynia_Fischer_Hagedorn_Isaak_Kutylowski_Meyer
auf der Heide_Nesterow_et al._2007, place={Buenos Aires, Argentina}, title={Smart
Teams: Simulating Large Robotic Swarms in Vast Environments}, booktitle={Proceedings
of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment},
publisher={Heinz Nixdorf Institut, University of Paderborn}, author={Arens, Stephan
and Buss, Alexander and Deck, Helena and Dynia, Miroslaw and Fischer, Matthias
and Hagedorn, Holger and Isaak, Peter and Kutylowski, Jaroslaw and Meyer auf der
Heide, Friedhelm and Nesterow, Viktor and et al.}, year={2007}, pages={215–222}
}'
chicago: 'Arens, Stephan, Alexander Buss, Helena Deck, Miroslaw Dynia, Matthias
Fischer, Holger Hagedorn, Peter Isaak, et al. “Smart Teams: Simulating Large Robotic
Swarms in Vast Environments.” In Proceedings of the 4th International Symposium
on Autonomous Minirobots for Research and Edutainment, 215–22. Buenos Aires,
Argentina: Heinz Nixdorf Institut, University of Paderborn, 2007.'
ieee: 'S. Arens et al., “Smart Teams: Simulating Large Robotic Swarms in
Vast Environments,” in Proceedings of the 4th International Symposium on Autonomous
Minirobots for Research and Edutainment, 2007, pp. 215–222.'
mla: 'Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast
Environments.” Proceedings of the 4th International Symposium on Autonomous
Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University
of Paderborn, 2007, pp. 215–22.'
short: 'S. Arens, A. Buss, H. Deck, M. Dynia, M. Fischer, H. Hagedorn, P. Isaak,
J. Kutylowski, F. Meyer auf der Heide, V. Nesterow, A. Ogiermann, B. Stobbe, T.
Storm, H. Wachsmuth, in: Proceedings of the 4th International Symposium on Autonomous
Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of
Paderborn, Buenos Aires, Argentina, 2007, pp. 215–222.'
date_created: 2019-02-21T11:56:39Z
date_updated: 2022-01-06T07:03:48Z
department:
- _id: '66'
- _id: '600'
- _id: '63'
language:
- iso: eng
main_file_link:
- url: https://webis.de/downloads/publications/papers/arens_2007.pdf
page: 215-222
place: Buenos Aires, Argentina
publication: Proceedings of the 4th International Symposium on Autonomous Minirobots
for Research and Edutainment
publisher: Heinz Nixdorf Institut, University of Paderborn
status: public
title: 'Smart Teams: Simulating Large Robotic Swarms in Vast Environments'
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '16467'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Jaroslaw
full_name: Kutylowski, Jaroslaw
last_name: Kutylowski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Jonas
full_name: Schrieb, Jonas
last_name: Schrieb
citation:
ama: 'Dynia M, Kutylowski J, Meyer auf der Heide F, Schrieb J. Local strategies
for maintaining a chain of relay stations between an explorer and a base station.
In: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms
and Architectures - SPAA ’07. ; 2007. doi:10.1145/1248377.1248420'
apa: Dynia, M., Kutylowski, J., Meyer auf der Heide, F., & Schrieb, J. (2007).
Local strategies for maintaining a chain of relay stations between an explorer
and a base station. In Proceedings of the nineteenth annual ACM symposium on
Parallel algorithms and architectures - SPAA ’07. https://doi.org/10.1145/1248377.1248420
bibtex: '@inproceedings{Dynia_Kutylowski_Meyer auf der Heide_Schrieb_2007, title={Local
strategies for maintaining a chain of relay stations between an explorer and a
base station}, DOI={10.1145/1248377.1248420},
booktitle={Proceedings of the nineteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’07}, author={Dynia, Miroslaw and Kutylowski, Jaroslaw
and Meyer auf der Heide, Friedhelm and Schrieb, Jonas}, year={2007} }'
chicago: Dynia, Miroslaw, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and
Jonas Schrieb. “Local Strategies for Maintaining a Chain of Relay Stations between
an Explorer and a Base Station.” In Proceedings of the Nineteenth Annual ACM
Symposium on Parallel Algorithms and Architectures - SPAA ’07, 2007. https://doi.org/10.1145/1248377.1248420.
ieee: M. Dynia, J. Kutylowski, F. Meyer auf der Heide, and J. Schrieb, “Local strategies
for maintaining a chain of relay stations between an explorer and a base station,”
in Proceedings of the nineteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’07, 2007.
mla: Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay
Stations between an Explorer and a Base Station.” Proceedings of the Nineteenth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’07,
2007, doi:10.1145/1248377.1248420.
short: 'M. Dynia, J. Kutylowski, F. Meyer auf der Heide, J. Schrieb, in: Proceedings
of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’07, 2007.'
date_created: 2020-04-08T08:58:19Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/1248377.1248420
language:
- iso: eng
publication: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms
and architectures - SPAA '07
publication_identifier:
isbn:
- '9781595936677'
publication_status: published
status: public
title: Local strategies for maintaining a chain of relay stations between an explorer
and a base station
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '19612'
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
citation:
ama: Klein J. Efficient Collision Detection for Point and Polygon Based Models.
Vol 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.
apa: Klein, J. (2006). Efficient Collision Detection for Point and Polygon Based
Models (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Klein_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Efficient Collision Detection for Point and Polygon Based Models},
volume={186}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Klein, Jan}, year={2006}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Klein, Jan. Efficient Collision Detection for Point and Polygon Based
Models. Vol. 186. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
ieee: J. Klein, Efficient Collision Detection for Point and Polygon Based Models,
vol. 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
mla: Klein, Jan. Efficient Collision Detection for Point and Polygon Based Models.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
short: J. Klein, Efficient Collision Detection for Point and Polygon Based Models,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.
date_created: 2020-09-22T07:48:45Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 186'
language:
- iso: eng
publication_identifier:
isbn:
- 3-939350-05-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101248
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Efficient Collision Detection for Point and Polygon Based Models
type: dissertation
user_id: '5786'
volume: 186
year: '2006'
...