---
_id: '66838'
abstract:
- lang: eng
  text: 'The sliding square model is a widely used abstraction for studying self-reconfigurable
    robotic systems, where modules are square-shaped robots that move by sliding or
    rotating over one another. In this paper, we propose a novel distributed algorithm
    that enables a group of modules to reconfigure into a rhombus shape, starting
    from an arbitrary side-connected configuration. It is connectivity-preserving
    and operates under minimal assumptions: one leader module, common chirality, constant
    memory per module, and visibility and communication restricted to immediate neighbors.
    Unlike prior work, which relaxes the original sliding square move-set, our approach
    uses the unmodified move-set, addressing the additional challenge of handling
    locked configurations. Our algorithm is sequential in nature and operates with
    a worst-case time complexity of O(n^2) rounds, which is optimal for sequential
    algorithms. To improve runtime, we introduce two parallel variants of the algorithm.
    Both rely on a spanning tree data structure, allowing modules to make decisions
    based on local connectivity. Our experimental results show a significant speedup
    for the first variant, and a linear average runtime for the second variant, which
    is worst-case optimal for parallel algorithms.'
article_number: '116196'
article_type: original
author:
- first_name: Irina
  full_name: Kostitsyna, Irina
  last_name: Kostitsyna
- first_name: David
  full_name: Liedtke, David
  id: '55557'
  last_name: Liedtke
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: Kostitsyna I, Liedtke D, Scheideler C. Distributed rhombus formation of sliding
    squares. <i>Theoretical Computer Science</i>. 2026;1085. doi:<a href="https://doi.org/10.1016/j.tcs.2026.116196">10.1016/j.tcs.2026.116196</a>
  apa: Kostitsyna, I., Liedtke, D., &#38; Scheideler, C. (2026). Distributed rhombus
    formation of sliding squares. <i>Theoretical Computer Science</i>, <i>1085</i>,
    Article 116196. <a href="https://doi.org/10.1016/j.tcs.2026.116196">https://doi.org/10.1016/j.tcs.2026.116196</a>
  bibtex: '@article{Kostitsyna_Liedtke_Scheideler_2026, title={Distributed rhombus
    formation of sliding squares}, volume={1085}, DOI={<a href="https://doi.org/10.1016/j.tcs.2026.116196">10.1016/j.tcs.2026.116196</a>},
    number={116196}, journal={Theoretical Computer Science}, publisher={Elsevier BV},
    author={Kostitsyna, Irina and Liedtke, David and Scheideler, Christian}, year={2026}
    }'
  chicago: Kostitsyna, Irina, David Liedtke, and Christian Scheideler. “Distributed
    Rhombus Formation of Sliding Squares.” <i>Theoretical Computer Science</i> 1085
    (2026). <a href="https://doi.org/10.1016/j.tcs.2026.116196">https://doi.org/10.1016/j.tcs.2026.116196</a>.
  ieee: 'I. Kostitsyna, D. Liedtke, and C. Scheideler, “Distributed rhombus formation
    of sliding squares,” <i>Theoretical Computer Science</i>, vol. 1085, Art. no.
    116196, 2026, doi: <a href="https://doi.org/10.1016/j.tcs.2026.116196">10.1016/j.tcs.2026.116196</a>.'
  mla: Kostitsyna, Irina, et al. “Distributed Rhombus Formation of Sliding Squares.”
    <i>Theoretical Computer Science</i>, vol. 1085, 116196, Elsevier BV, 2026, doi:<a
    href="https://doi.org/10.1016/j.tcs.2026.116196">10.1016/j.tcs.2026.116196</a>.
  short: I. Kostitsyna, D. Liedtke, C. Scheideler, Theoretical Computer Science 1085
    (2026).
date_created: 2026-08-25T05:30:39Z
date_updated: 2026-08-25T05:37:47Z
department:
- _id: '34'
- _id: '7'
- _id: '79'
doi: 10.1016/j.tcs.2026.116196
intvolume: '      1085'
keyword:
- modular robots
- distributed algorithms
- sliding squares
language:
- iso: eng
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Distributed rhombus formation of sliding squares
type: journal_article
user_id: '55557'
volume: 1085
year: '2026'
...
---
_id: '62051'
article_number: '115552'
author:
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
- first_name: David Jan
  full_name: Liedtke, David Jan
  id: '55557'
  last_name: Liedtke
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Hinnenthal K, Liedtke DJ, Scheideler C. Efficient shape formation by 3D hybrid
    programmable matter: An algorithm for low diameter intermediate structures. <i>Theoretical
    Computer Science</i>. 2025;1057. doi:<a href="https://doi.org/10.1016/j.tcs.2025.115552">10.1016/j.tcs.2025.115552</a>'
  apa: 'Hinnenthal, K., Liedtke, D. J., &#38; Scheideler, C. (2025). Efficient shape
    formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate
    structures. <i>Theoretical Computer Science</i>, <i>1057</i>, Article 115552.
    <a href="https://doi.org/10.1016/j.tcs.2025.115552">https://doi.org/10.1016/j.tcs.2025.115552</a>'
  bibtex: '@article{Hinnenthal_Liedtke_Scheideler_2025, title={Efficient shape formation
    by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures},
    volume={1057}, DOI={<a href="https://doi.org/10.1016/j.tcs.2025.115552">10.1016/j.tcs.2025.115552</a>},
    number={115552}, journal={Theoretical Computer Science}, publisher={Elsevier BV},
    author={Hinnenthal, Kristian and Liedtke, David Jan and Scheideler, Christian},
    year={2025} }'
  chicago: 'Hinnenthal, Kristian, David Jan Liedtke, and Christian Scheideler. “Efficient
    Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter
    Intermediate Structures.” <i>Theoretical Computer Science</i> 1057 (2025). <a
    href="https://doi.org/10.1016/j.tcs.2025.115552">https://doi.org/10.1016/j.tcs.2025.115552</a>.'
  ieee: 'K. Hinnenthal, D. J. Liedtke, and C. Scheideler, “Efficient shape formation
    by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures,”
    <i>Theoretical Computer Science</i>, vol. 1057, Art. no. 115552, 2025, doi: <a
    href="https://doi.org/10.1016/j.tcs.2025.115552">10.1016/j.tcs.2025.115552</a>.'
  mla: 'Hinnenthal, Kristian, et al. “Efficient Shape Formation by 3D Hybrid Programmable
    Matter: An Algorithm for Low Diameter Intermediate Structures.” <i>Theoretical
    Computer Science</i>, vol. 1057, 115552, Elsevier BV, 2025, doi:<a href="https://doi.org/10.1016/j.tcs.2025.115552">10.1016/j.tcs.2025.115552</a>.'
  short: K. Hinnenthal, D.J. Liedtke, C. Scheideler, Theoretical Computer Science
    1057 (2025).
date_created: 2025-11-03T10:19:53Z
date_updated: 2025-11-03T10:21:52Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2025.115552
intvolume: '      1057'
language:
- iso: eng
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: 'Efficient shape formation by 3D hybrid programmable matter: An algorithm for
  low diameter intermediate structures'
type: journal_article
user_id: '55557'
volume: 1057
year: '2025'
...
---
_id: '61172'
article_number: '114352'
author:
- first_name: Sam
  full_name: Coy, Sam
  last_name: Coy
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Philipp
  full_name: Schneider, Philipp
  last_name: Schneider
- first_name: Julian
  full_name: Werthmann, Julian
  id: '50024'
  last_name: Werthmann
citation:
  ama: Coy S, Czumaj A, Scheideler C, Schneider P, Werthmann J. Routing Schemes for
    Hybrid Communication Networks. <i>Theoretical Computer Science</i>. 2024;985.
    doi:<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>
  apa: Coy, S., Czumaj, A., Scheideler, C., Schneider, P., &#38; Werthmann, J. (2024).
    Routing Schemes for Hybrid Communication Networks. <i>Theoretical Computer Science</i>,
    <i>985</i>, Article 114352. <a href="https://doi.org/10.1016/j.tcs.2023.114352">https://doi.org/10.1016/j.tcs.2023.114352</a>
  bibtex: '@article{Coy_Czumaj_Scheideler_Schneider_Werthmann_2024, title={Routing
    Schemes for Hybrid Communication Networks}, volume={985}, DOI={<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>},
    number={114352}, journal={Theoretical Computer Science}, publisher={Elsevier BV},
    author={Coy, Sam and Czumaj, Artur and Scheideler, Christian and Schneider, Philipp
    and Werthmann, Julian}, year={2024} }'
  chicago: Coy, Sam, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian
    Werthmann. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical
    Computer Science</i> 985 (2024). <a href="https://doi.org/10.1016/j.tcs.2023.114352">https://doi.org/10.1016/j.tcs.2023.114352</a>.
  ieee: 'S. Coy, A. Czumaj, C. Scheideler, P. Schneider, and J. Werthmann, “Routing
    Schemes for Hybrid Communication Networks,” <i>Theoretical Computer Science</i>,
    vol. 985, Art. no. 114352, 2024, doi: <a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>.'
  mla: Coy, Sam, et al. “Routing Schemes for Hybrid Communication Networks.” <i>Theoretical
    Computer Science</i>, vol. 985, 114352, Elsevier BV, 2024, doi:<a href="https://doi.org/10.1016/j.tcs.2023.114352">10.1016/j.tcs.2023.114352</a>.
  short: S. Coy, A. Czumaj, C. Scheideler, P. Schneider, J. Werthmann, Theoretical
    Computer Science 985 (2024).
date_created: 2025-09-10T14:26:11Z
date_updated: 2025-09-10T14:52:21Z
department:
- _id: '79'
doi: 10.1016/j.tcs.2023.114352
intvolume: '       985'
language:
- iso: eng
project:
- _id: '5'
  name: 'SFB 901; TP A1: Möglichkeiten und Grenzen lokaler Strategien in dynamischen
    Netzen'
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Routing Schemes for Hybrid Communication Networks
type: journal_article
user_id: '50024'
volume: 985
year: '2024'
...
---
_id: '48871'
abstract:
- lang: eng
  text: 'Most runtime analyses of randomised search heuristics focus on the expected
    number of function evaluations to find a unique global optimum. We ask a fundamental
    question: if additional search points are declared optimal, or declared as desirable
    target points, do these additional optima speed up evolutionary algorithms? More
    formally, we analyse the expected hitting time of a target set OPT{$\cup$}S where
    S is a set of non-optimal search points and OPT is the set of optima and compare
    it to the expected hitting time of OPT. We show that the answer to our question
    depends on the number and placement of search points in S. For all black-box algorithms
    and all fitness functions with polynomial expected optimisation times we show
    that, if additional optima are placed randomly, even an exponential number of
    optima has a negligible effect on the expected optimisation time. Considering
    Hamming balls around all global optima gives an easier target for some algorithms
    and functions and can shift the phase transition with respect to offspring population
    sizes in the (1,{$\lambda$}) EA on OneMax. However, for the one-dimensional Ising
    model the time to reach Hamming balls of radius (1/2-{$ϵ$})n around optima does
    not reduce the asymptotic expected optimisation time in the worst case. Finally,
    on functions where search trajectories typically join in a single search point,
    turning one search point into an optimum drastically reduces the expected optimisation
    time.'
author:
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Dirk
  full_name: Sudholt, Dirk
  last_name: Sudholt
citation:
  ama: Bossek J, Sudholt D. Do Additional Target Points Speed Up Evolutionary Algorithms?
    <i>Theoretical Computer Science</i>. Published online 2023:113757. doi:<a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>
  apa: Bossek, J., &#38; Sudholt, D. (2023). Do Additional Target Points Speed Up
    Evolutionary Algorithms? <i>Theoretical Computer Science</i>, 113757. <a href="https://doi.org/10.1016/j.tcs.2023.113757">https://doi.org/10.1016/j.tcs.2023.113757</a>
  bibtex: '@article{Bossek_Sudholt_2023, title={Do Additional Target Points Speed
    Up Evolutionary Algorithms?}, DOI={<a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>},
    journal={Theoretical Computer Science}, author={Bossek, Jakob and Sudholt, Dirk},
    year={2023}, pages={113757} }'
  chicago: Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up
    Evolutionary Algorithms?” <i>Theoretical Computer Science</i>, 2023, 113757. <a
    href="https://doi.org/10.1016/j.tcs.2023.113757">https://doi.org/10.1016/j.tcs.2023.113757</a>.
  ieee: 'J. Bossek and D. Sudholt, “Do Additional Target Points Speed Up Evolutionary
    Algorithms?,” <i>Theoretical Computer Science</i>, p. 113757, 2023, doi: <a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>.'
  mla: Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary
    Algorithms?” <i>Theoretical Computer Science</i>, 2023, p. 113757, doi:<a href="https://doi.org/10.1016/j.tcs.2023.113757">10.1016/j.tcs.2023.113757</a>.
  short: J. Bossek, D. Sudholt, Theoretical Computer Science (2023) 113757.
date_created: 2023-11-14T15:58:56Z
date_updated: 2023-12-13T10:51:07Z
department:
- _id: '819'
doi: 10.1016/j.tcs.2023.113757
keyword:
- Evolutionary algorithms
- pseudo-Boolean functions
- runtime analysis
language:
- iso: eng
page: '113757'
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
status: public
title: Do Additional Target Points Speed Up Evolutionary Algorithms?
type: journal_article
user_id: '102979'
year: '2023'
...
---
_id: '46310'
abstract:
- lang: eng
  text: 'Classic automated algorithm selection (AS) for (combinatorial) optimization
    problems heavily relies on so-called instance features, i.e., numerical characteristics
    of the problem at hand ideally extracted with computationally low-demanding routines.
    For the traveling salesperson problem (TSP) a plethora of features have been suggested.
    Most of these features are, if at all, only normalized imprecisely raising the
    issue of feature values being strongly affected by the instance size. Such artifacts
    may have detrimental effects on algorithm selection models. We propose a normalization
    for two feature groups which stood out in multiple AS studies on the TSP: (a)
    features based on a minimum spanning tree (MST) and (b) nearest neighbor relationships
    of the input instance. To this end we theoretically derive minimum and maximum
    values for properties of MSTs and k-nearest neighbor graphs (NNG) of Euclidean
    graphs. We analyze the differences in feature space between normalized versions
    of these features and their unnormalized counterparts. Our empirical investigations
    on various TSP benchmark sets point out that the feature scaling succeeds in eliminating
    the effect of the instance size. A proof-of-concept AS-study shows promising results:
    models trained with normalized features tend to outperform those trained with
    the respective vanilla features.'
author:
- first_name: Jonathan
  full_name: Heins, Jonathan
  last_name: Heins
- first_name: Jakob
  full_name: Bossek, Jakob
  id: '102979'
  last_name: Bossek
  orcid: 0000-0002-4121-4668
- first_name: Janina
  full_name: Pohl, Janina
  last_name: Pohl
- first_name: Moritz
  full_name: Seiler, Moritz
  id: '105520'
  last_name: Seiler
- first_name: Heike
  full_name: Trautmann, Heike
  id: '100740'
  last_name: Trautmann
  orcid: 0000-0002-9788-8282
- first_name: Pascal
  full_name: Kerschke, Pascal
  last_name: Kerschke
citation:
  ama: Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. A study on the
    effects of normalized TSP features for automated algorithm selection. <i>Theoretical
    Computer Science</i>. 2023;940:123-145. doi:<a href="https://doi.org/10.1016/j.tcs.2022.10.019">https://doi.org/10.1016/j.tcs.2022.10.019</a>
  apa: Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., &#38; Kerschke,
    P. (2023). A study on the effects of normalized TSP features for automated algorithm
    selection. <i>Theoretical Computer Science</i>, <i>940</i>, 123–145. <a href="https://doi.org/10.1016/j.tcs.2022.10.019">https://doi.org/10.1016/j.tcs.2022.10.019</a>
  bibtex: '@article{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2023, title={A study
    on the effects of normalized TSP features for automated algorithm selection},
    volume={940}, DOI={<a href="https://doi.org/10.1016/j.tcs.2022.10.019">https://doi.org/10.1016/j.tcs.2022.10.019</a>},
    journal={Theoretical Computer Science}, author={Heins, Jonathan and Bossek, Jakob
    and Pohl, Janina and Seiler, Moritz and Trautmann, Heike and Kerschke, Pascal},
    year={2023}, pages={123–145} }'
  chicago: 'Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann,
    and Pascal Kerschke. “A Study on the Effects of Normalized TSP Features for Automated
    Algorithm Selection.” <i>Theoretical Computer Science</i> 940 (2023): 123–45.
    <a href="https://doi.org/10.1016/j.tcs.2022.10.019">https://doi.org/10.1016/j.tcs.2022.10.019</a>.'
  ieee: 'J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “A
    study on the effects of normalized TSP features for automated algorithm selection,”
    <i>Theoretical Computer Science</i>, vol. 940, pp. 123–145, 2023, doi: <a href="https://doi.org/10.1016/j.tcs.2022.10.019">https://doi.org/10.1016/j.tcs.2022.10.019</a>.'
  mla: Heins, Jonathan, et al. “A Study on the Effects of Normalized TSP Features
    for Automated Algorithm Selection.” <i>Theoretical Computer Science</i>, vol.
    940, 2023, pp. 123–45, doi:<a href="https://doi.org/10.1016/j.tcs.2022.10.019">https://doi.org/10.1016/j.tcs.2022.10.019</a>.
  short: J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, Theoretical
    Computer Science 940 (2023) 123–145.
date_created: 2023-08-04T07:18:38Z
date_updated: 2024-06-10T11:57:21Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1016/j.tcs.2022.10.019
intvolume: '       940'
keyword:
- Feature normalization
- Algorithm selection
- Traveling salesperson problem
language:
- iso: eng
page: 123-145
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
status: public
title: A study on the effects of normalized TSP features for automated algorithm selection
type: journal_article
user_id: '15504'
volume: 940
year: '2023'
...
---
_id: '33947'
article_type: original
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Jonas
  full_name: Harbig, Jonas
  id: '47213'
  last_name: Harbig
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Till
  full_name: Knollmann, Till
  id: '39241'
  last_name: Knollmann
  orcid: 0000-0003-2014-4696
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Castenow J, Harbig J, Jung D, Knollmann T, Meyer auf der Heide F. Gathering
    a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
    Chain-Formation. <i>Theoretical Computer Science</i>. 2023;939:261-291. doi:<a
    href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>
  apa: Castenow, J., Harbig, J., Jung, D., Knollmann, T., &#38; Meyer auf der Heide,
    F. (2023). Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved
    Algorithms for Chain-Formation. <i>Theoretical Computer Science</i>, <i>939</i>,
    261–291. <a href="https://doi.org/10.1016/j.tcs.2022.10.031">https://doi.org/10.1016/j.tcs.2022.10.031</a>
  bibtex: '@article{Castenow_Harbig_Jung_Knollmann_Meyer auf der Heide_2023, title={Gathering
    a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms for
    Chain-Formation}, volume={939}, DOI={<a href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier BV}, author={Castenow,
    Jannik and Harbig, Jonas and Jung, Daniel and Knollmann, Till and Meyer auf der
    Heide, Friedhelm}, year={2023}, pages={261–291} }'
  chicago: 'Castenow, Jannik, Jonas Harbig, Daniel Jung, Till Knollmann, and Friedhelm
    Meyer auf der Heide. “Gathering a Euclidean Closed Chain of Robots in Linear Time
    and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>
    939 (2023): 261–91. <a href="https://doi.org/10.1016/j.tcs.2022.10.031">https://doi.org/10.1016/j.tcs.2022.10.031</a>.'
  ieee: 'J. Castenow, J. Harbig, D. Jung, T. Knollmann, and F. Meyer auf der Heide,
    “Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
    for Chain-Formation,” <i>Theoretical Computer Science</i>, vol. 939, pp. 261–291,
    2023, doi: <a href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>.'
  mla: Castenow, Jannik, et al. “Gathering a Euclidean Closed Chain of Robots in Linear
    Time and Improved Algorithms for Chain-Formation.” <i>Theoretical Computer Science</i>,
    vol. 939, Elsevier BV, 2023, pp. 261–91, doi:<a href="https://doi.org/10.1016/j.tcs.2022.10.031">10.1016/j.tcs.2022.10.031</a>.
  short: J. Castenow, J. Harbig, D. Jung, T. Knollmann, F. Meyer auf der Heide, Theoretical
    Computer Science 939 (2023) 261–291.
date_created: 2022-10-28T05:11:16Z
date_updated: 2023-01-30T09:20:09Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2022.10.031
external_id:
  arxiv:
  - '2010.04424 '
intvolume: '       939'
keyword:
- General Computer Science
- Theoretical Computer Science
language:
- iso: eng
page: 261-291
project:
- _id: '106'
  name: 'Algorithmen für Schwarmrobotik: Verteiltes Rechnen trifft Dynamische Systeme'
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier BV
status: public
title: Gathering a Euclidean Closed Chain of Robots in Linear Time and Improved Algorithms
  for Chain-Formation
type: journal_article
user_id: '38705'
volume: 939
year: '2023'
...
---
_id: '22510'
abstract:
- lang: eng
  text: 'Over the past decades, the Gathering problem, which asks to gather a group
    of robots in finite time given some restrictions, has been intensively studied.
    In this paper, we are given a group of n autonomous, dimensionless, deterministic,
    and anonymous robots, with bounded viewing range. Assuming a continuous time model,
    the goal is to gather these robots into one point in finite time. We introduce
    a simple convergence criterion that defines a new class of algorithms which perform
    gathering in O(nd) time, where d is the diameter of the initial robot configuration.
    We show that some gathering algorithms in the literature belong to this class
    and propose two new algorithms that belong to this class and have quadratic running
    time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center
    algorithm (S-GTRC). We prove that the latter can perform gathering without collision
    by using a slightly more complex robot model: non oblivious, chiral, and luminous
    (i.e. robots have observable external memory, as in [8]). We also consider a variant
    of the Gathering problem, the Near-Gathering problem, in which robots must get
    close to each other without colliding. We show that S-GTRC solves the Near-Gathering
    problem in quadratic time and assumes a weaker robot model than the one assumed
    in the current state-of-the-art.'
author:
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- first_name: Christine
  full_name: Markarian, Christine
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Pavel
  full_name: Podlipyan, Pavel
  last_name: Podlipyan
citation:
  ama: Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy
    for collisionless gathering. <i>Theoretical Computer Science</i>. 2021;852:41-60.
    doi:<a href="https://doi.org/10.1016/j.tcs.2020.10.037">10.1016/j.tcs.2020.10.037</a>
  apa: Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021).
    A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>,
    <i>852</i>, 41–60. <a href="https://doi.org/10.1016/j.tcs.2020.10.037">https://doi.org/10.1016/j.tcs.2020.10.037</a>
  bibtex: '@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous
    strategy for collisionless gathering}, volume={852}, DOI={<a href="https://doi.org/10.1016/j.tcs.2020.10.037">10.1016/j.tcs.2020.10.037</a>},
    journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine
    and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60}
    }'
  chicago: 'Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel
    Podlipyan. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical
    Computer Science</i> 852 (2021): 41–60. <a href="https://doi.org/10.1016/j.tcs.2020.10.037">https://doi.org/10.1016/j.tcs.2020.10.037</a>.'
  ieee: S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous
    strategy for collisionless gathering,” <i>Theoretical Computer Science</i>, vol.
    852, pp. 41–60, 2021.
  mla: Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical
    Computer Science</i>, vol. 852, 2021, pp. 41–60, doi:<a href="https://doi.org/10.1016/j.tcs.2020.10.037">10.1016/j.tcs.2020.10.037</a>.
  short: S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer
    Science 852 (2021) 41–60.
date_created: 2021-06-28T09:24:15Z
date_updated: 2022-01-06T06:55:35Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.10.037
intvolume: '       852'
keyword:
- Local algorithms
- Distributed algorithms
- Collisionless gathering
- Mobile robots
- Multiagent system
language:
- iso: eng
page: 41-60
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: A continuous strategy for collisionless gathering
type: journal_article
user_id: '15415'
volume: 852
year: '2021'
...
---
_id: '22511'
abstract:
- lang: eng
  text: "In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center
    algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile
    robots with limited viewing range in the plane. Remarquably, this algorithm exploits
    the fact that during its execution, many collisions of robots occur. Such collisions
    are interpreted as a success because it is assumed that such collided robots behave
    the same from now on. This is acceptable under the assumption that each robot
    is represented by a single point. Otherwise, collisions should be avoided. In
    this paper, we consider a continuous Go-To-The-Center algorithm in which the robots
    continuously observe the positions of their neighbors and adapt their speed (assuming
    a speed limit) and direction. Our first results are time bounds of O(n2) for gathering
    in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution
    is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center
    considering only the neighbors of a robot with respect to the Gabriel subgraph
    of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that
    this modification still correctly executes gathering in one and two dimensions,
    with the same time bounds as above. Simulations exhibit a severe difference of
    the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms:
    Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm,
    typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center
    algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center
    algorithm for one dimension. In two-dimensional Euclidean space, we conjecture
    that the “collisionless property” holds for almost every initial configuration.
    We support our conjecture with measurements obtained from the simulation where
    robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n"
author:
- first_name: Shouwei
  full_name: Li, Shouwei
  last_name: Li
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Pavel
  full_name: Podlipyan, Pavel
  last_name: Podlipyan
citation:
  ama: Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph
    of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical
    Computer Science</i>. 2021;852:29-40. doi:<a href="https://doi.org/10.1016/j.tcs.2020.11.009">10.1016/j.tcs.2020.11.009</a>
  apa: Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). The impact of
    the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
    robots. <i>Theoretical Computer Science</i>, <i>852</i>, 29–40. <a href="https://doi.org/10.1016/j.tcs.2020.11.009">https://doi.org/10.1016/j.tcs.2020.11.009</a>
  bibtex: '@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the
    Gabriel subgraph of the visibility graph on the gathering of mobile autonomous
    robots}, volume={852}, DOI={<a href="https://doi.org/10.1016/j.tcs.2020.11.009">10.1016/j.tcs.2020.11.009</a>},
    journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der
    Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }'
  chicago: 'Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The
    Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile
    Autonomous Robots.” <i>Theoretical Computer Science</i> 852 (2021): 29–40. <a
    href="https://doi.org/10.1016/j.tcs.2020.11.009">https://doi.org/10.1016/j.tcs.2020.11.009</a>.'
  ieee: S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel
    subgraph of the visibility graph on the gathering of mobile autonomous robots,”
    <i>Theoretical Computer Science</i>, vol. 852, pp. 29–40, 2021.
  mla: Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph
    on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i>,
    vol. 852, 2021, pp. 29–40, doi:<a href="https://doi.org/10.1016/j.tcs.2020.11.009">10.1016/j.tcs.2020.11.009</a>.
  short: S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science
    852 (2021) 29–40.
date_created: 2021-06-28T09:34:45Z
date_updated: 2022-01-06T06:55:35Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.11.009
intvolume: '       852'
keyword:
- Local algorithms
- Distributed algorithms
- Collisionless gathering
- Mobile robots
- Multiagent system
language:
- iso: eng
page: 29-40
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: The impact of the Gabriel subgraph of the visibility graph on the gathering
  of mobile autonomous robots
type: journal_article
user_id: '15415'
volume: 852
year: '2021'
...
---
_id: '16299'
author:
- first_name: Jannik
  full_name: Castenow, Jannik
  id: '38705'
  last_name: Castenow
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Jonas
  full_name: Harbig, Jonas
  last_name: Harbig
- first_name: Daniel
  full_name: Jung, Daniel
  id: '37827'
  last_name: Jung
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous,
    Oblivious Robots on a Grid. <i>Theoretical Computer Science</i>. 2020;815:289-309.
    doi:<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>
  apa: Castenow, J., Fischer, M., Harbig, J., Jung, D., &#38; Meyer auf der Heide,
    F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. <i>Theoretical Computer
    Science</i>, <i>815</i>, 289–309. <a href="https://doi.org/10.1016/j.tcs.2020.02.018">https://doi.org/10.1016/j.tcs.2020.02.018</a>
  bibtex: '@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering
    Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>},
    journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer,
    Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm},
    year={2020}, pages={289–309} }'
  chicago: 'Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm
    Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>Theoretical
    Computer Science</i> 815 (2020): 289–309. <a href="https://doi.org/10.1016/j.tcs.2020.02.018">https://doi.org/10.1016/j.tcs.2020.02.018</a>.'
  ieee: J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering
    Anonymous, Oblivious Robots on a Grid,” <i>Theoretical Computer Science</i>, vol.
    815, pp. 289–309, 2020.
  mla: Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
    <i>Theoretical Computer Science</i>, vol. 815, 2020, pp. 289–309, doi:<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>.
  short: J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical
    Computer Science 815 (2020) 289–309.
date_created: 2020-03-13T12:55:53Z
date_updated: 2022-01-06T06:52:48Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2020.02.018
intvolume: '       815'
language:
- iso: eng
page: 289-309
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Gathering Anonymous, Oblivious Robots on a Grid
type: journal_article
user_id: '38705'
volume: 815
year: '2020'
...
---
_id: '2916'
author:
- first_name: Sascha
  full_name: Brauer, Sascha
  id: '13291'
  last_name: Brauer
citation:
  ama: Brauer S. Complexity of single-swap heuristics for metric facility location
    and related problems. <i>Theoretical Computer Science</i>. 2019;754:88-106. doi:<a
    href="https://doi.org/10.1016/j.tcs.2018.04.048">10.1016/j.tcs.2018.04.048</a>
  apa: Brauer, S. (2019). Complexity of single-swap heuristics for metric facility
    location and related problems. <i>Theoretical Computer Science</i>, <i>754</i>,
    88–106. <a href="https://doi.org/10.1016/j.tcs.2018.04.048">https://doi.org/10.1016/j.tcs.2018.04.048</a>
  bibtex: '@article{Brauer_2019, title={Complexity of single-swap heuristics for metric
    facility location and related problems}, volume={754}, DOI={<a href="https://doi.org/10.1016/j.tcs.2018.04.048">10.1016/j.tcs.2018.04.048</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Brauer,
    Sascha}, year={2019}, pages={88–106} }'
  chicago: 'Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility
    Location and Related Problems.” <i>Theoretical Computer Science</i> 754 (2019):
    88–106. <a href="https://doi.org/10.1016/j.tcs.2018.04.048">https://doi.org/10.1016/j.tcs.2018.04.048</a>.'
  ieee: S. Brauer, “Complexity of single-swap heuristics for metric facility location
    and related problems,” <i>Theoretical Computer Science</i>, vol. 754, pp. 88–106,
    2019.
  mla: Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location
    and Related Problems.” <i>Theoretical Computer Science</i>, vol. 754, Elsevier,
    2019, pp. 88–106, doi:<a href="https://doi.org/10.1016/j.tcs.2018.04.048">10.1016/j.tcs.2018.04.048</a>.
  short: S. Brauer, Theoretical Computer Science 754 (2019) 88–106.
date_created: 2018-05-25T11:10:36Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
doi: 10.1016/j.tcs.2018.04.048
intvolume: '       754'
language:
- iso: eng
page: 88-106
project:
- _id: '45'
  name: Soft-Clustering - Von Heuristiken zu Approximationsalgorithmen
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
publisher: Elsevier
status: public
title: Complexity of single-swap heuristics for metric facility location and related
  problems
type: journal_article
user_id: '13291'
volume: 754
year: '2019'
...
---
_id: '16429'
author:
- first_name: Jarosław
  full_name: Kutyłowski, Jarosław
  last_name: Kutyłowski
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Kutyłowski J, Meyer auf der Heide F. Optimal strategies for maintaining a chain
    of relays between an explorer and a base camp. <i>Theoretical Computer Science</i>.
    2009:3391-3405. doi:<a href="https://doi.org/10.1016/j.tcs.2008.04.010">10.1016/j.tcs.2008.04.010</a>
  apa: Kutyłowski, J., &#38; Meyer auf der Heide, F. (2009). Optimal strategies for
    maintaining a chain of relays between an explorer and a base camp. <i>Theoretical
    Computer Science</i>, 3391–3405. <a href="https://doi.org/10.1016/j.tcs.2008.04.010">https://doi.org/10.1016/j.tcs.2008.04.010</a>
  bibtex: '@article{Kutyłowski_Meyer auf der Heide_2009, title={Optimal strategies
    for maintaining a chain of relays between an explorer and a base camp}, DOI={<a
    href="https://doi.org/10.1016/j.tcs.2008.04.010">10.1016/j.tcs.2008.04.010</a>},
    journal={Theoretical Computer Science}, author={Kutyłowski, Jarosław and Meyer
    auf der Heide, Friedhelm}, year={2009}, pages={3391–3405} }'
  chicago: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
    for Maintaining a Chain of Relays between an Explorer and a Base Camp.” <i>Theoretical
    Computer Science</i>, 2009, 3391–3405. <a href="https://doi.org/10.1016/j.tcs.2008.04.010">https://doi.org/10.1016/j.tcs.2008.04.010</a>.
  ieee: J. Kutyłowski and F. Meyer auf der Heide, “Optimal strategies for maintaining
    a chain of relays between an explorer and a base camp,” <i>Theoretical Computer
    Science</i>, pp. 3391–3405, 2009.
  mla: Kutyłowski, Jarosław, and Friedhelm Meyer auf der Heide. “Optimal Strategies
    for Maintaining a Chain of Relays between an Explorer and a Base Camp.” <i>Theoretical
    Computer Science</i>, 2009, pp. 3391–405, doi:<a href="https://doi.org/10.1016/j.tcs.2008.04.010">10.1016/j.tcs.2008.04.010</a>.
  short: J. Kutyłowski, F. Meyer auf der Heide, Theoretical Computer Science (2009)
    3391–3405.
date_created: 2020-04-06T13:52:18Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2008.04.010
language:
- iso: eng
page: 3391-3405
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Optimal strategies for maintaining a chain of relays between an explorer and
  a base camp
type: journal_article
user_id: '15415'
year: '2009'
...
---
_id: '2999'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Stefanie
  full_name: ' Naewe, Stefanie'
  id: '1971'
  last_name: ' Naewe'
citation:
  ama: Blömer J,  Naewe S. Sampling methods for shortest vectors, closest vectors
    and successive minima. <i>Theoretical Computer Science</i>. 2009;410(18):1648-1665.
    doi:<a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>
  apa: Blömer, J., &#38;  Naewe, S. (2009). Sampling methods for shortest vectors,
    closest vectors and successive minima. <i>Theoretical Computer Science</i>, <i>410</i>(18),
    1648–1665. <a href="https://doi.org/10.1016/j.tcs.2008.12.045">https://doi.org/10.1016/j.tcs.2008.12.045</a>
  bibtex: '@article{Blömer_ Naewe_2009, title={Sampling methods for shortest vectors,
    closest vectors and successive minima}, volume={410}, DOI={<a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>},
    number={18}, journal={Theoretical Computer Science}, author={Blömer, Johannes
    and  Naewe, Stefanie}, year={2009}, pages={1648–1665} }'
  chicago: 'Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest
    Vectors, Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i>
    410, no. 18 (2009): 1648–65. <a href="https://doi.org/10.1016/j.tcs.2008.12.045">https://doi.org/10.1016/j.tcs.2008.12.045</a>.'
  ieee: 'J. Blömer and S.  Naewe, “Sampling methods for shortest vectors, closest
    vectors and successive minima,” <i>Theoretical Computer Science</i>, vol. 410,
    no. 18, pp. 1648–1665, 2009, doi: <a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>.'
  mla: Blömer, Johannes, and Stefanie  Naewe. “Sampling Methods for Shortest Vectors,
    Closest Vectors and Successive Minima.” <i>Theoretical Computer Science</i>, vol.
    410, no. 18, 2009, pp. 1648–65, doi:<a href="https://doi.org/10.1016/j.tcs.2008.12.045">10.1016/j.tcs.2008.12.045</a>.
  short: J. Blömer, S.  Naewe, Theoretical Computer Science 410 (2009) 1648–1665.
date_created: 2018-06-05T08:07:24Z
date_updated: 2024-08-08T12:18:04Z
department:
- _id: '64'
doi: 10.1016/j.tcs.2008.12.045
intvolume: '       410'
issue: '18'
keyword:
- Geometry of numbers
- Lattices
- Shortest vectors
language:
- iso: eng
page: 1648 - 1665
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Sampling methods for shortest vectors, closest vectors and successive minima
type: journal_article
user_id: '49063'
volume: 410
year: '2009'
...
---
_id: '18790'
author:
- first_name: Artur
  full_name: Czumaj, Artur
  last_name: Czumaj
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
citation:
  ama: Czumaj A, Sohler C. Testing hypergraph colorability. <i>Theoretical Computer
    Science</i>. 2005;331(1):37-52. doi:<a href="https://doi.org/10.1016/j.tcs.2004.09.031">10.1016/j.tcs.2004.09.031</a>
  apa: Czumaj, A., &#38; Sohler, C. (2005). Testing hypergraph colorability. <i>Theoretical
    Computer Science</i>, <i>331</i>(1), 37–52. <a href="https://doi.org/10.1016/j.tcs.2004.09.031">https://doi.org/10.1016/j.tcs.2004.09.031</a>
  bibtex: '@article{Czumaj_Sohler_2005, title={Testing hypergraph colorability}, volume={331},
    DOI={<a href="https://doi.org/10.1016/j.tcs.2004.09.031">10.1016/j.tcs.2004.09.031</a>},
    number={1}, journal={Theoretical Computer Science}, author={Czumaj, Artur and
    Sohler, Christian}, year={2005}, pages={37–52} }'
  chicago: 'Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.”
    <i>Theoretical Computer Science</i> 331, no. 1 (2005): 37–52. <a href="https://doi.org/10.1016/j.tcs.2004.09.031">https://doi.org/10.1016/j.tcs.2004.09.031</a>.'
  ieee: A. Czumaj and C. Sohler, “Testing hypergraph colorability,” <i>Theoretical
    Computer Science</i>, vol. 331, no. 1, pp. 37–52, 2005.
  mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Colorability.” <i>Theoretical
    Computer Science</i>, vol. 331, no. 1, 2005, pp. 37–52, doi:<a href="https://doi.org/10.1016/j.tcs.2004.09.031">10.1016/j.tcs.2004.09.031</a>.
  short: A. Czumaj, C. Sohler, Theoretical Computer Science 331 (2005) 37–52.
date_created: 2020-09-01T14:00:37Z
date_updated: 2022-01-06T06:53:52Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2004.09.031
intvolume: '       331'
issue: '1'
language:
- iso: eng
page: 37-52
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Testing hypergraph colorability
type: journal_article
user_id: '15415'
volume: 331
year: '2005'
...
---
_id: '15058'
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: Ziegler M. Stability versus speed in a computable algebraic model. <i>Theoretical
    Computer Science</i>. 2005:14-26. doi:<a href="https://doi.org/10.1016/j.tcs.2005.09.053">10.1016/j.tcs.2005.09.053</a>
  apa: Ziegler, M. (2005). Stability versus speed in a computable algebraic model.
    <i>Theoretical Computer Science</i>, 14–26. <a href="https://doi.org/10.1016/j.tcs.2005.09.053">https://doi.org/10.1016/j.tcs.2005.09.053</a>
  bibtex: '@article{Ziegler_2005, title={Stability versus speed in a computable algebraic
    model}, DOI={<a href="https://doi.org/10.1016/j.tcs.2005.09.053">10.1016/j.tcs.2005.09.053</a>},
    journal={Theoretical Computer Science}, author={Ziegler, Martin}, year={2005},
    pages={14–26} }'
  chicago: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
    <i>Theoretical Computer Science</i>, 2005, 14–26. <a href="https://doi.org/10.1016/j.tcs.2005.09.053">https://doi.org/10.1016/j.tcs.2005.09.053</a>.
  ieee: M. Ziegler, “Stability versus speed in a computable algebraic model,” <i>Theoretical
    Computer Science</i>, pp. 14–26, 2005.
  mla: Ziegler, Martin. “Stability versus Speed in a Computable Algebraic Model.”
    <i>Theoretical Computer Science</i>, 2005, pp. 14–26, doi:<a href="https://doi.org/10.1016/j.tcs.2005.09.053">10.1016/j.tcs.2005.09.053</a>.
  short: M. Ziegler, Theoretical Computer Science (2005) 14–26.
date_created: 2019-11-20T13:22:22Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '63'
doi: 10.1016/j.tcs.2005.09.053
language:
- iso: eng
page: 14-26
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Stability versus speed in a computable algebraic model
type: journal_article
user_id: '15415'
year: '2005'
...
---
_id: '16521'
author:
- first_name: S.
  full_name: Bezrukov, S.
  last_name: Bezrukov
- first_name: R.
  full_name: Elsässer, R.
  last_name: Elsässer
- first_name: B.
  full_name: Monien, B.
  last_name: Monien
- first_name: R.
  full_name: Preis, R.
  last_name: Preis
- first_name: J.-P.
  full_name: Tillich, J.-P.
  last_name: Tillich
citation:
  ama: Bezrukov S, Elsässer R, Monien B, Preis R, Tillich J-P. New spectral lower
    bounds on the bisection width of graphs. <i>Theoretical Computer Science</i>.
    2004:155-174. doi:<a href="https://doi.org/10.1016/j.tcs.2004.03.059">10.1016/j.tcs.2004.03.059</a>
  apa: Bezrukov, S., Elsässer, R., Monien, B., Preis, R., &#38; Tillich, J.-P. (2004).
    New spectral lower bounds on the bisection width of graphs. <i>Theoretical Computer
    Science</i>, 155–174. <a href="https://doi.org/10.1016/j.tcs.2004.03.059">https://doi.org/10.1016/j.tcs.2004.03.059</a>
  bibtex: '@article{Bezrukov_Elsässer_Monien_Preis_Tillich_2004, title={New spectral
    lower bounds on the bisection width of graphs}, DOI={<a href="https://doi.org/10.1016/j.tcs.2004.03.059">10.1016/j.tcs.2004.03.059</a>},
    journal={Theoretical Computer Science}, author={Bezrukov, S. and Elsässer, R.
    and Monien, B. and Preis, R. and Tillich, J.-P.}, year={2004}, pages={155–174}
    }'
  chicago: Bezrukov, S., R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich. “New
    Spectral Lower Bounds on the Bisection Width of Graphs.” <i>Theoretical Computer
    Science</i>, 2004, 155–74. <a href="https://doi.org/10.1016/j.tcs.2004.03.059">https://doi.org/10.1016/j.tcs.2004.03.059</a>.
  ieee: S. Bezrukov, R. Elsässer, B. Monien, R. Preis, and J.-P. Tillich, “New spectral
    lower bounds on the bisection width of graphs,” <i>Theoretical Computer Science</i>,
    pp. 155–174, 2004.
  mla: Bezrukov, S., et al. “New Spectral Lower Bounds on the Bisection Width of Graphs.”
    <i>Theoretical Computer Science</i>, 2004, pp. 155–74, doi:<a href="https://doi.org/10.1016/j.tcs.2004.03.059">10.1016/j.tcs.2004.03.059</a>.
  short: S. Bezrukov, R. Elsässer, B. Monien, R. Preis, J.-P. Tillich, Theoretical
    Computer Science (2004) 155–174.
date_created: 2020-04-15T08:05:40Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1016/j.tcs.2004.03.059
language:
- iso: eng
page: 155-174
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: New spectral lower bounds on the bisection width of graphs
type: journal_article
user_id: '15701'
year: '2004'
...
---
_id: '16503'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Klaus
  full_name: Schröder, Klaus
  last_name: Schröder
- first_name: Frank
  full_name: Schwarze, Frank
  last_name: Schwarze
citation:
  ama: Meyer auf der Heide F, Schröder K, Schwarze F. Routing on networks of optical
    crossbars. <i>Theoretical Computer Science</i>. 1998;196:181-200. doi:<a href="https://doi.org/10.1016/s0304-3975(97)86791-6">10.1016/s0304-3975(97)86791-6</a>
  apa: Meyer auf der Heide, F., Schröder, K., &#38; Schwarze, F. (1998). Routing on
    networks of optical crossbars. <i>Theoretical Computer Science</i>, <i>196</i>,
    181–200. <a href="https://doi.org/10.1016/s0304-3975(97)86791-6">https://doi.org/10.1016/s0304-3975(97)86791-6</a>
  bibtex: '@article{Meyer auf der Heide_Schröder_Schwarze_1998, title={Routing on
    networks of optical crossbars}, volume={196}, DOI={<a href="https://doi.org/10.1016/s0304-3975(97)86791-6">10.1016/s0304-3975(97)86791-6</a>},
    journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm
    and Schröder, Klaus and Schwarze, Frank}, year={1998}, pages={181–200} }'
  chicago: 'Meyer auf der Heide, Friedhelm, Klaus Schröder, and Frank Schwarze. “Routing
    on Networks of Optical Crossbars.” <i>Theoretical Computer Science</i> 196 (1998):
    181–200. <a href="https://doi.org/10.1016/s0304-3975(97)86791-6">https://doi.org/10.1016/s0304-3975(97)86791-6</a>.'
  ieee: F. Meyer auf der Heide, K. Schröder, and F. Schwarze, “Routing on networks
    of optical crossbars,” <i>Theoretical Computer Science</i>, vol. 196, pp. 181–200,
    1998.
  mla: Meyer auf der Heide, Friedhelm, et al. “Routing on Networks of Optical Crossbars.”
    <i>Theoretical Computer Science</i>, vol. 196, 1998, pp. 181–200, doi:<a href="https://doi.org/10.1016/s0304-3975(97)86791-6">10.1016/s0304-3975(97)86791-6</a>.
  short: F. Meyer auf der Heide, K. Schröder, F. Schwarze, Theoretical Computer Science
    196 (1998) 181–200.
date_created: 2020-04-14T12:20:57Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(97)86791-6
intvolume: '       196'
language:
- iso: eng
page: 181-200
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Routing on networks of optical crossbars
type: journal_article
user_id: '15415'
volume: 196
year: '1998'
...
---
_id: '16504'
author:
- first_name: Armin
  full_name: Bäumker, Armin
  last_name: Bäumker
- first_name: Wolfgang
  full_name: Dittrich, Wolfgang
  last_name: Dittrich
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms:
    1-optimal multisearch for an extension of the BSP model. <i>Theoretical Computer
    Science</i>. 1998:175-203. doi:<a href="https://doi.org/10.1016/s0304-3975(98)00020-6">10.1016/s0304-3975(98)00020-6</a>'
  apa: 'Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1998). Truly efficient
    parallel algorithms: 1-optimal multisearch for an extension of the BSP model.
    <i>Theoretical Computer Science</i>, 175–203. <a href="https://doi.org/10.1016/s0304-3975(98)00020-6">https://doi.org/10.1016/s0304-3975(98)00020-6</a>'
  bibtex: '@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient
    parallel algorithms: 1-optimal multisearch for an extension of the BSP model},
    DOI={<a href="https://doi.org/10.1016/s0304-3975(98)00020-6">10.1016/s0304-3975(98)00020-6</a>},
    journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang
    and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }'
  chicago: 'Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide.
    “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of
    the BSP Model.” <i>Theoretical Computer Science</i>, 1998, 175–203. <a href="https://doi.org/10.1016/s0304-3975(98)00020-6">https://doi.org/10.1016/s0304-3975(98)00020-6</a>.'
  ieee: 'A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel
    algorithms: 1-optimal multisearch for an extension of the BSP model,” <i>Theoretical
    Computer Science</i>, pp. 175–203, 1998.'
  mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch
    for an Extension of the BSP Model.” <i>Theoretical Computer Science</i>, 1998,
    pp. 175–203, doi:<a href="https://doi.org/10.1016/s0304-3975(98)00020-6">10.1016/s0304-3975(98)00020-6</a>.'
  short: A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science
    (1998) 175–203.
date_created: 2020-04-14T12:36:47Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(98)00020-6
language:
- iso: eng
page: 175-203
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: 'Truly efficient parallel algorithms: 1-optimal multisearch for an extension
  of the BSP model'
type: journal_article
user_id: '15415'
year: '1998'
...
---
_id: '19818'
author:
- first_name: Hans
  full_name: Kleine Büning, Hans
  last_name: Kleine Büning
- first_name: Theodor
  full_name: Lettmann, Theodor
  id: '315'
  last_name: Lettmann
  orcid: 0000-0001-5859-2457
- first_name: Ernst W.
  full_name: Mayr, Ernst W.
  last_name: Mayr
citation:
  ama: Kleine Büning H, Lettmann T, Mayr EW. Projections of vector addition system
    reachability sets are semilinear. <i>Theoretical Computer Science</i>. 1989:343-350.
    doi:<a href="https://doi.org/10.1016/0304-3975(89)90055-8">10.1016/0304-3975(89)90055-8</a>
  apa: Kleine Büning, H., Lettmann, T., &#38; Mayr, E. W. (1989). Projections of vector
    addition system reachability sets are semilinear. <i>Theoretical Computer Science</i>,
    343–350. <a href="https://doi.org/10.1016/0304-3975(89)90055-8">https://doi.org/10.1016/0304-3975(89)90055-8</a>
  bibtex: '@article{Kleine Büning_Lettmann_Mayr_1989, title={Projections of vector
    addition system reachability sets are semilinear}, DOI={<a href="https://doi.org/10.1016/0304-3975(89)90055-8">10.1016/0304-3975(89)90055-8</a>},
    journal={Theoretical Computer Science}, author={Kleine Büning, Hans and Lettmann,
    Theodor and Mayr, Ernst W.}, year={1989}, pages={343–350} }'
  chicago: Kleine Büning, Hans, Theodor Lettmann, and Ernst W. Mayr. “Projections
    of Vector Addition System Reachability Sets Are Semilinear.” <i>Theoretical Computer
    Science</i>, 1989, 343–50. <a href="https://doi.org/10.1016/0304-3975(89)90055-8">https://doi.org/10.1016/0304-3975(89)90055-8</a>.
  ieee: H. Kleine Büning, T. Lettmann, and E. W. Mayr, “Projections of vector addition
    system reachability sets are semilinear,” <i>Theoretical Computer Science</i>,
    pp. 343–350, 1989.
  mla: Kleine Büning, Hans, et al. “Projections of Vector Addition System Reachability
    Sets Are Semilinear.” <i>Theoretical Computer Science</i>, 1989, pp. 343–50, doi:<a
    href="https://doi.org/10.1016/0304-3975(89)90055-8">10.1016/0304-3975(89)90055-8</a>.
  short: H. Kleine Büning, T. Lettmann, E.W. Mayr, Theoretical Computer Science (1989)
    343–350.
date_created: 2020-10-01T08:20:05Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '34'
- _id: '355'
- _id: '7'
doi: 10.1016/0304-3975(89)90055-8
language:
- iso: eng
page: 343-350
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Projections of vector addition system reachability sets are semilinear
type: journal_article
user_id: '315'
year: '1989'
...
---
_id: '16765'
author:
- first_name: Allan
  full_name: Borodin, Allan
  last_name: Borodin
- first_name: Faith E.
  full_name: Fich, Faith E.
  last_name: Fich
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Eli
  full_name: Upfal, Eli
  last_name: Upfal
- first_name: Avi
  full_name: Wigderson, Avi
  last_name: Wigderson
citation:
  ama: Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff
    between search and update time for the implicit dictionary problem. <i>Theoretical
    Computer Science</i>. 1988:57-68. doi:<a href="https://doi.org/10.1016/0304-3975(88)90018-7">10.1016/0304-3975(88)90018-7</a>
  apa: Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson,
    A. (1988). A tradeoff between search and update time for the implicit dictionary
    problem. <i>Theoretical Computer Science</i>, 57–68. <a href="https://doi.org/10.1016/0304-3975(88)90018-7">https://doi.org/10.1016/0304-3975(88)90018-7</a>
  bibtex: '@article{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1988, title={A
    tradeoff between search and update time for the implicit dictionary problem},
    DOI={<a href="https://doi.org/10.1016/0304-3975(88)90018-7">10.1016/0304-3975(88)90018-7</a>},
    journal={Theoretical Computer Science}, author={Borodin, Allan and Fich, Faith
    E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1988},
    pages={57–68} }'
  chicago: Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal,
    and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit
    Dictionary Problem.” <i>Theoretical Computer Science</i>, 1988, 57–68. <a href="https://doi.org/10.1016/0304-3975(88)90018-7">https://doi.org/10.1016/0304-3975(88)90018-7</a>.
  ieee: A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson,
    “A tradeoff between search and update time for the implicit dictionary problem,”
    <i>Theoretical Computer Science</i>, pp. 57–68, 1988.
  mla: Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit
    Dictionary Problem.” <i>Theoretical Computer Science</i>, 1988, pp. 57–68, doi:<a
    href="https://doi.org/10.1016/0304-3975(88)90018-7">10.1016/0304-3975(88)90018-7</a>.
  short: A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical
    Computer Science (1988) 57–68.
date_created: 2020-04-21T08:53:13Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0304-3975(88)90018-7
language:
- iso: eng
page: 57-68
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: A tradeoff between search and update time for the implicit dictionary problem
type: journal_article
user_id: '15415'
year: '1988'
...
---
_id: '16781'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: Meyer auf der Heide F. Simulating probabilistic by deterministic algebraic
    computation trees. <i>Theoretical Computer Science</i>. 1985:325-330. doi:<a href="https://doi.org/10.1016/0304-3975(85)90079-9">10.1016/0304-3975(85)90079-9</a>
  apa: Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic
    computation trees. <i>Theoretical Computer Science</i>, 325–330. <a href="https://doi.org/10.1016/0304-3975(85)90079-9">https://doi.org/10.1016/0304-3975(85)90079-9</a>
  bibtex: '@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic
    algebraic computation trees}, DOI={<a href="https://doi.org/10.1016/0304-3975(85)90079-9">10.1016/0304-3975(85)90079-9</a>},
    journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm},
    year={1985}, pages={325–330} }'
  chicago: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic
    Algebraic Computation Trees.” <i>Theoretical Computer Science</i>, 1985, 325–30.
    <a href="https://doi.org/10.1016/0304-3975(85)90079-9">https://doi.org/10.1016/0304-3975(85)90079-9</a>.
  ieee: F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic
    computation trees,” <i>Theoretical Computer Science</i>, pp. 325–330, 1985.
  mla: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic
    Algebraic Computation Trees.” <i>Theoretical Computer Science</i>, 1985, pp. 325–30,
    doi:<a href="https://doi.org/10.1016/0304-3975(85)90079-9">10.1016/0304-3975(85)90079-9</a>.
  short: F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
date_created: 2020-04-21T11:18:44Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0304-3975(85)90079-9
language:
- iso: eng
page: 325-330
publication: Theoretical Computer Science
publication_identifier:
  issn:
  - 0304-3975
publication_status: published
status: public
title: Simulating probabilistic by deterministic algebraic computation trees
type: journal_article
user_id: '15415'
year: '1985'
...