---
_id: '3018'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
- first_name: Jean-Pierre
  full_name: Seifert, Jean-Pierre
  last_name: Seifert
citation:
  ama: 'Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption
    Standard (AES). In: <i>Financial Cryptography</i>. Berlin, Heidelberg: Springer
    Berlin Heidelberg; 2003:162-181. doi:<a href="https://doi.org/10.1007/978-3-540-45126-6_12">10.1007/978-3-540-45126-6_12</a>'
  apa: 'Blömer, J., &#38; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the
    Advanced Encryption Standard (AES). In <i>Financial Cryptography</i> (pp. 162–181).
    Berlin, Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/978-3-540-45126-6_12">https://doi.org/10.1007/978-3-540-45126-6_12</a>'
  bibtex: '@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based
    Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={<a href="https://doi.org/10.1007/978-3-540-45126-6_12">10.1007/978-3-540-45126-6_12</a>},
    booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer,
    Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }'
  chicago: 'Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis
    of the Advanced Encryption Standard (AES).” In <i>Financial Cryptography</i>,
    162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href="https://doi.org/10.1007/978-3-540-45126-6_12">https://doi.org/10.1007/978-3-540-45126-6_12</a>.'
  ieee: 'J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption
    Standard (AES),” in <i>Financial Cryptography</i>, Berlin, Heidelberg: Springer
    Berlin Heidelberg, 2003, pp. 162–181.'
  mla: Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the
    Advanced Encryption Standard (AES).” <i>Financial Cryptography</i>, Springer Berlin
    Heidelberg, 2003, pp. 162–81, doi:<a href="https://doi.org/10.1007/978-3-540-45126-6_12">10.1007/978-3-540-45126-6_12</a>.
  short: 'J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2003, pp. 162–181.'
date_created: 2018-06-05T08:25:18Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/978-3-540-45126-6_12
page: 162-181
place: Berlin, Heidelberg
publication: Financial Cryptography
publication_identifier:
  isbn:
  - '9783540406631'
  - '9783540451266'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
type: book_chapter
user_id: '25078'
year: '2003'
...
---
_id: '18196'
abstract:
- lang: eng
  text: Fast algorithms for arithmetic on real or complex polynomials are well-known
    and have proven to be not only asymptotically efficient but also very practical.
    Based on FAST FOURIER TRANSFORM, they for instance multiply two polynomials of
    degree up to N or multi-evaluate one at N points simultaneously within quasi-linear
    time O(N polylog N). An extension to (and in fact the mere definition of) polynomials
    over fields R and C to the SKEW-field H of quaternions is promising but still
    missing. The present work proposes three approaches which in the commutative case
    coincide but for H turn out to differ, each one satisfying some desirable properties
    while lacking others. For each notion, we devise algorithms for according arithmetic;
    these are quasi-optimal in that their running times match lower complexity bounds
    up to polylogarithmic factors.
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Ziegler M. Quasi-optimal Arithmetic for Quaternion Polynomials. In: <i>Proc.
    14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>.
    Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg. ; 2003:705-715.
    doi:<a href="https://doi.org/10.1007/978-3-540-24587-2_72">10.1007/978-3-540-24587-2_72</a>'
  apa: Ziegler, M. (2003). Quasi-optimal Arithmetic for Quaternion Polynomials. In
    <i>Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>
    (pp. 705–715). <a href="https://doi.org/10.1007/978-3-540-24587-2_72">https://doi.org/10.1007/978-3-540-24587-2_72</a>
  bibtex: '@inproceedings{Ziegler_2003, series={Lecture Notes in Computer Science,
    vol 2906. Springer, Berlin, Heidelberg}, title={Quasi-optimal Arithmetic for Quaternion
    Polynomials}, DOI={<a href="https://doi.org/10.1007/978-3-540-24587-2_72">10.1007/978-3-540-24587-2_72</a>},
    booktitle={Proc. 14th Annual International Symposium on Algorithms and Computation
    (ISAAC’03)}, author={Ziegler, Martin}, year={2003}, pages={705–715}, collection={Lecture
    Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg} }'
  chicago: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.”
    In <i>Proc. 14th Annual International Symposium on Algorithms and Computation
    (ISAAC’03)</i>, 705–15. Lecture Notes in Computer Science, Vol 2906. Springer,
    Berlin, Heidelberg, 2003. <a href="https://doi.org/10.1007/978-3-540-24587-2_72">https://doi.org/10.1007/978-3-540-24587-2_72</a>.
  ieee: M. Ziegler, “Quasi-optimal Arithmetic for Quaternion Polynomials,” in <i>Proc.
    14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>,
    2003, pp. 705–715.
  mla: Ziegler, Martin. “Quasi-Optimal Arithmetic for Quaternion Polynomials.” <i>Proc.
    14th Annual International Symposium on Algorithms and Computation (ISAAC’03)</i>,
    2003, pp. 705–15, doi:<a href="https://doi.org/10.1007/978-3-540-24587-2_72">10.1007/978-3-540-24587-2_72</a>.
  short: 'M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms
    and Computation (ISAAC’03), 2003, pp. 705–715.'
date_created: 2020-08-24T14:18:19Z
date_updated: 2022-01-06T06:53:27Z
department:
- _id: '63'
doi: 10.1007/978-3-540-24587-2_72
language:
- iso: eng
page: 705-715
publication: Proc. 14th Annual International Symposium on Algorithms and Computation
  (ISAAC'03)
publication_identifier:
  isbn:
  - '9783540206958'
  - '9783540245872'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science, vol 2906. Springer, Berlin, Heidelberg
status: public
title: Quasi-optimal Arithmetic for Quaternion Polynomials
type: conference
user_id: '15415'
year: '2003'
...
---
_id: '18258'
abstract:
- lang: eng
  text: Multi-evaluation of the Coulomb potential induced by N particles is a central
    part of N-body simulations. In 3D, known subquadratic time algorithms return approximations
    up to given ABSOLUTE precision. By combining data structures from Computational
    Geometry with fast polynomial arithmetic, the present work obtains approximations
    of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
citation:
  ama: 'Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack
    J, Smid M, Algorithms and Data Structures. WADS 2003, eds. <i>Lecture Notes in
    Computer Science</i>. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg:
    Springer; 2003. doi:<a href="https://doi.org/10.1007/978-3-540-45078-8_13">10.1007/978-3-540-45078-8_13</a>'
  apa: 'Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F.
    Dehne, J. Sack, M. Smid, &#38; Algorithms and Data Structures. WADS 2003 (Eds.),
    <i>Lecture Notes in Computer Science</i> (Vol. 2748). Berlin, Heidelberg: Springer.
    <a href="https://doi.org/10.1007/978-3-540-45078-8_13">https://doi.org/10.1007/978-3-540-45078-8_13</a>'
  bibtex: '@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes
    in Computer Science}, title={Fast Relative Approximation of Potential Fields},
    volume={2748}, DOI={<a href="https://doi.org/10.1007/978-3-540-45078-8_13">10.1007/978-3-540-45078-8_13</a>},
    booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler,
    Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data
    Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer
    Science} }'
  chicago: 'Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In
    <i>Lecture Notes in Computer Science</i>, edited by F. Dehne, JR. Sack, M. Smid,
    and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer
    Science. Berlin, Heidelberg: Springer, 2003. <a href="https://doi.org/10.1007/978-3-540-45078-8_13">https://doi.org/10.1007/978-3-540-45078-8_13</a>.'
  ieee: 'M. Ziegler, “Fast Relative Approximation of Potential Fields,” in <i>Lecture
    Notes in Computer Science</i>, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms
    and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.'
  mla: Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” <i>Lecture
    Notes in Computer Science</i>, edited by F. Dehne et al., vol. 2748, Springer,
    2003, doi:<a href="https://doi.org/10.1007/978-3-540-45078-8_13">10.1007/978-3-540-45078-8_13</a>.
  short: 'M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures.
    WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg,
    2003.'
corporate_editor:
- Algorithms and Data Structures. WADS 2003
date_created: 2020-08-25T10:15:14Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1007/978-3-540-45078-8_13
editor:
- first_name: F.
  full_name: Dehne, F.
  last_name: Dehne
- first_name: JR.
  full_name: Sack, JR.
  last_name: Sack
- first_name: M.
  full_name: Smid, M.
  last_name: Smid
intvolume: '      2748'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540405450'
  - '9783540450788'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Fast Relative Approximation of Potential Fields
type: book_chapter
user_id: '15415'
volume: 2748
year: '2003'
...
---
_id: '16543'
author:
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
- first_name: Robert
  full_name: Preis, Robert
  last_name: Preis
citation:
  ama: 'Dellnitz M, Preis R. Congestion and Almost Invariant Sets in Dynamical Systems.
    In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2003. doi:<a
    href="https://doi.org/10.1007/3-540-45084-x_8">10.1007/3-540-45084-x_8</a>'
  apa: Dellnitz, M., &#38; Preis, R. (2003). Congestion and Almost Invariant Sets
    in Dynamical Systems. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-45084-x_8">https://doi.org/10.1007/3-540-45084-x_8</a>
  bibtex: '@inbook{Dellnitz_Preis_2003, place={Berlin, Heidelberg}, title={Congestion
    and Almost Invariant Sets in Dynamical Systems}, DOI={<a href="https://doi.org/10.1007/3-540-45084-x_8">10.1007/3-540-45084-x_8</a>},
    booktitle={Lecture Notes in Computer Science}, author={Dellnitz, Michael and Preis,
    Robert}, year={2003} }'
  chicago: Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets
    in Dynamical Systems.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg,
    2003. <a href="https://doi.org/10.1007/3-540-45084-x_8">https://doi.org/10.1007/3-540-45084-x_8</a>.
  ieee: M. Dellnitz and R. Preis, “Congestion and Almost Invariant Sets in Dynamical
    Systems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2003.
  mla: Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets
    in Dynamical Systems.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a
    href="https://doi.org/10.1007/3-540-45084-x_8">10.1007/3-540-45084-x_8</a>.
  short: 'M. Dellnitz, R. Preis, in: Lecture Notes in Computer Science, Berlin, Heidelberg,
    2003.'
date_created: 2020-04-15T08:50:07Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '101'
doi: 10.1007/3-540-45084-x_8
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540405542'
  - '9783540450849'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Congestion and Almost Invariant Sets in Dynamical Systems
type: book_chapter
user_id: '15701'
year: '2003'
...
---
_id: '16664'
author:
- first_name: Oliver
  full_name: Schütze, Oliver
  last_name: Schütze
citation:
  ama: 'Schütze O. A New Data Structure for the Nondominance Problem in Multi-objective
    Optimization. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg;
    2003. doi:<a href="https://doi.org/10.1007/3-540-36970-8_36">10.1007/3-540-36970-8_36</a>'
  apa: Schütze, O. (2003). A New Data Structure for the Nondominance Problem in Multi-objective
    Optimization. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg.
    <a href="https://doi.org/10.1007/3-540-36970-8_36">https://doi.org/10.1007/3-540-36970-8_36</a>
  bibtex: '@inbook{Schütze_2003, place={Berlin, Heidelberg}, title={A New Data Structure
    for the Nondominance Problem in Multi-objective Optimization}, DOI={<a href="https://doi.org/10.1007/3-540-36970-8_36">10.1007/3-540-36970-8_36</a>},
    booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver}, year={2003}
    }'
  chicago: Schütze, Oliver. “A New Data Structure for the Nondominance Problem in
    Multi-Objective Optimization.” In <i>Lecture Notes in Computer Science</i>. Berlin,
    Heidelberg, 2003. <a href="https://doi.org/10.1007/3-540-36970-8_36">https://doi.org/10.1007/3-540-36970-8_36</a>.
  ieee: O. Schütze, “A New Data Structure for the Nondominance Problem in Multi-objective
    Optimization,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg,
    2003.
  mla: Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective
    Optimization.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href="https://doi.org/10.1007/3-540-36970-8_36">10.1007/3-540-36970-8_36</a>.
  short: 'O. Schütze, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.'
date_created: 2020-04-16T09:57:05Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '101'
doi: 10.1007/3-540-36970-8_36
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540018698'
  - '9783540369707'
  issn:
  - 0302-9743
publication_status: published
status: public
title: A New Data Structure for the Nondominance Problem in Multi-objective Optimization
type: book_chapter
user_id: '15701'
year: '2003'
...
---
_id: '16665'
author:
- first_name: Oliver
  full_name: Schütze, Oliver
  last_name: Schütze
- first_name: Sanaz
  full_name: Mostaghim, Sanaz
  last_name: Mostaghim
- first_name: Michael
  full_name: Dellnitz, Michael
  last_name: Dellnitz
- first_name: Jürgen
  full_name: Teich, Jürgen
  last_name: Teich
citation:
  ama: 'Schütze O, Mostaghim S, Dellnitz M, Teich J. Covering Pareto Sets by Multilevel
    Evolutionary Subdivision Techniques. In: <i>Lecture Notes in Computer Science</i>.
    Berlin, Heidelberg; 2003. doi:<a href="https://doi.org/10.1007/3-540-36970-8_9">10.1007/3-540-36970-8_9</a>'
  apa: Schütze, O., Mostaghim, S., Dellnitz, M., &#38; Teich, J. (2003). Covering
    Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In <i>Lecture Notes
    in Computer Science</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-36970-8_9">https://doi.org/10.1007/3-540-36970-8_9</a>
  bibtex: '@inbook{Schütze_Mostaghim_Dellnitz_Teich_2003, place={Berlin, Heidelberg},
    title={Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques},
    DOI={<a href="https://doi.org/10.1007/3-540-36970-8_9">10.1007/3-540-36970-8_9</a>},
    booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver and Mostaghim,
    Sanaz and Dellnitz, Michael and Teich, Jürgen}, year={2003} }'
  chicago: Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering
    Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” In <i>Lecture
    Notes in Computer Science</i>. Berlin, Heidelberg, 2003. <a href="https://doi.org/10.1007/3-540-36970-8_9">https://doi.org/10.1007/3-540-36970-8_9</a>.
  ieee: O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, “Covering Pareto Sets
    by Multilevel Evolutionary Subdivision Techniques,” in <i>Lecture Notes in Computer
    Science</i>, Berlin, Heidelberg, 2003.
  mla: Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision
    Techniques.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href="https://doi.org/10.1007/3-540-36970-8_9">10.1007/3-540-36970-8_9</a>.
  short: 'O. Schütze, S. Mostaghim, M. Dellnitz, J. Teich, in: Lecture Notes in Computer
    Science, Berlin, Heidelberg, 2003.'
date_created: 2020-04-16T09:58:10Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '101'
doi: 10.1007/3-540-36970-8_9
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
  isbn:
  - '9783540018698'
  - '9783540369707'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques
type: book_chapter
user_id: '15701'
year: '2003'
...
---
_id: '15077'
author:
- first_name: Stefan
  full_name: Böttcher, Stefan
  id: '624'
  last_name: Böttcher
- first_name: Rita
  full_name: Steinmetz, Rita
  id: '14961'
  last_name: Steinmetz
citation:
  ama: 'Böttcher S, Steinmetz R. Testing Containment of XPath Expressions in Order
    to Reduce the Data Transfer to Mobile Clients. In: <i>Advances in Databases and
    Information Systems, 7th East European Conference, ADBIS 2003</i>. Springer; 2003:400-410.
    doi:<a href="https://doi.org/10.1007/978-3-540-39403-7_30">10.1007/978-3-540-39403-7_30</a>'
  apa: Böttcher, S., &#38; Steinmetz, R. (2003). Testing Containment of XPath Expressions
    in Order to Reduce the Data Transfer to Mobile Clients. In <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i> (pp. 400–410).
    Springer. <a href="https://doi.org/10.1007/978-3-540-39403-7_30">https://doi.org/10.1007/978-3-540-39403-7_30</a>
  bibtex: '@inproceedings{Böttcher_Steinmetz_2003, title={Testing Containment of XPath
    Expressions in Order to Reduce the Data Transfer to Mobile Clients}, DOI={<a href="https://doi.org/10.1007/978-3-540-39403-7_30">10.1007/978-3-540-39403-7_30</a>},
    booktitle={Advances in Databases and Information Systems, 7th East European Conference,
    ADBIS 2003}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita},
    year={2003}, pages={400–410} }'
  chicago: Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions
    in Order to Reduce the Data Transfer to Mobile Clients.” In <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i>, 400–410.
    Springer, 2003. <a href="https://doi.org/10.1007/978-3-540-39403-7_30">https://doi.org/10.1007/978-3-540-39403-7_30</a>.
  ieee: S. Böttcher and R. Steinmetz, “Testing Containment of XPath Expressions in
    Order to Reduce the Data Transfer to Mobile Clients,” in <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i>, 2003, pp.
    400–410.
  mla: Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions
    in Order to Reduce the Data Transfer to Mobile Clients.” <i>Advances in Databases
    and Information Systems, 7th East European Conference, ADBIS 2003</i>, Springer,
    2003, pp. 400–10, doi:<a href="https://doi.org/10.1007/978-3-540-39403-7_30">10.1007/978-3-540-39403-7_30</a>.
  short: 'S. Böttcher, R. Steinmetz, in: Advances in Databases and Information Systems,
    7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–410.'
date_created: 2019-11-21T14:33:56Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-540-39403-7_30
language:
- iso: eng
page: 400-410
publication: Advances in Databases and Information Systems, 7th East European Conference,
  ADBIS 2003
publication_identifier:
  isbn:
  - '9783540200475'
  - '9783540394037'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Testing Containment of XPath Expressions in Order to Reduce the Data Transfer
  to Mobile Clients
type: conference
user_id: '14961'
year: '2003'
...
---
_id: '15078'
author:
- first_name: Stefan
  full_name: Böttcher, Stefan
  id: '624'
  last_name: Böttcher
- first_name: Rita
  full_name: Steinmetz, Rita
  id: '14961'
  last_name: Steinmetz
citation:
  ama: 'Böttcher S, Steinmetz R. A DTD Graph Based XPath Query Subsumption Test. In:
    <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>. Berlin, Heidelberg; 2003:85-99. doi:<a href="https://doi.org/10.1007/978-3-540-39429-7_6">10.1007/978-3-540-39429-7_6</a>'
  apa: Böttcher, S., &#38; Steinmetz, R. (2003). A DTD Graph Based XPath Query Subsumption
    Test. In <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i> (pp. 85–99). Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-540-39429-7_6">https://doi.org/10.1007/978-3-540-39429-7_6</a>
  bibtex: '@inproceedings{Böttcher_Steinmetz_2003, place={Berlin, Heidelberg}, title={A
    DTD Graph Based XPath Query Subsumption Test}, DOI={<a href="https://doi.org/10.1007/978-3-540-39429-7_6">10.1007/978-3-540-39429-7_6</a>},
    booktitle={Database and XML Technologies, First International XML Database Symposium,
    XSym 2003}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2003}, pages={85–99}
    }'
  chicago: Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption
    Test.” In <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>, 85–99. Berlin, Heidelberg, 2003. <a href="https://doi.org/10.1007/978-3-540-39429-7_6">https://doi.org/10.1007/978-3-540-39429-7_6</a>.
  ieee: S. Böttcher and R. Steinmetz, “A DTD Graph Based XPath Query Subsumption Test,”
    in <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>, 2003, pp. 85–99.
  mla: Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption
    Test.” <i>Database and XML Technologies, First International XML Database Symposium,
    XSym 2003</i>, 2003, pp. 85–99, doi:<a href="https://doi.org/10.1007/978-3-540-39429-7_6">10.1007/978-3-540-39429-7_6</a>.
  short: 'S. Böttcher, R. Steinmetz, in: Database and XML Technologies, First International
    XML Database Symposium, XSym 2003, Berlin, Heidelberg, 2003, pp. 85–99.'
date_created: 2019-11-21T14:39:48Z
date_updated: 2022-01-06T06:52:15Z
department:
- _id: '69'
doi: 10.1007/978-3-540-39429-7_6
language:
- iso: eng
page: 85-99
place: Berlin, Heidelberg
publication: Database and XML Technologies, First International XML Database Symposium,
  XSym 2003
publication_identifier:
  isbn:
  - '9783540200550'
  - '9783540394297'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: A DTD Graph Based XPath Query Subsumption Test
type: conference
user_id: '14961'
year: '2003'
...
---
_id: '13615'
author:
- first_name: Christoph
  full_name: Steiger, Christoph
  last_name: Steiger
- first_name: Herbert
  full_name: Walder, Herbert
  last_name: Walder
- first_name: Marco
  full_name: Platzner, Marco
  id: '398'
  last_name: Platzner
citation:
  ama: 'Steiger C, Walder H, Platzner M. Heuristics for Online Scheduling Real-Time
    Tasks to Partially Reconfigurable Devices. In: <i>Proceedings of the 13th International
    Conference on Field Programmable Logic and Applications (FPL)</i>. Berlin, Heidelberg:
    Springer; 2003:575-584. doi:<a href="https://doi.org/10.1007/978-3-540-45234-8_56">10.1007/978-3-540-45234-8_56</a>'
  apa: 'Steiger, C., Walder, H., &#38; Platzner, M. (2003). Heuristics for Online
    Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In <i>Proceedings
    of the 13th International Conference on Field Programmable Logic and Applications
    (FPL)</i> (pp. 575–584). Berlin, Heidelberg: Springer. <a href="https://doi.org/10.1007/978-3-540-45234-8_56">https://doi.org/10.1007/978-3-540-45234-8_56</a>'
  bibtex: '@inproceedings{Steiger_Walder_Platzner_2003, place={Berlin, Heidelberg},
    title={Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable
    Devices}, DOI={<a href="https://doi.org/10.1007/978-3-540-45234-8_56">10.1007/978-3-540-45234-8_56</a>},
    booktitle={Proceedings of the 13th International Conference on Field Programmable
    Logic and Applications (FPL)}, publisher={Springer}, author={Steiger, Christoph
    and Walder, Herbert and Platzner, Marco}, year={2003}, pages={575–584} }'
  chicago: 'Steiger, Christoph, Herbert Walder, and Marco Platzner. “Heuristics for
    Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.” In <i>Proceedings
    of the 13th International Conference on Field Programmable Logic and Applications
    (FPL)</i>, 575–84. Berlin, Heidelberg: Springer, 2003. <a href="https://doi.org/10.1007/978-3-540-45234-8_56">https://doi.org/10.1007/978-3-540-45234-8_56</a>.'
  ieee: C. Steiger, H. Walder, and M. Platzner, “Heuristics for Online Scheduling
    Real-Time Tasks to Partially Reconfigurable Devices,” in <i>Proceedings of the
    13th International Conference on Field Programmable Logic and Applications (FPL)</i>,
    2003, pp. 575–584.
  mla: Steiger, Christoph, et al. “Heuristics for Online Scheduling Real-Time Tasks
    to Partially Reconfigurable Devices.” <i>Proceedings of the 13th International
    Conference on Field Programmable Logic and Applications (FPL)</i>, Springer, 2003,
    pp. 575–84, doi:<a href="https://doi.org/10.1007/978-3-540-45234-8_56">10.1007/978-3-540-45234-8_56</a>.
  short: 'C. Steiger, H. Walder, M. Platzner, in: Proceedings of the 13th International
    Conference on Field Programmable Logic and Applications (FPL), Springer, Berlin,
    Heidelberg, 2003, pp. 575–584.'
date_created: 2019-10-04T21:20:41Z
date_updated: 2022-01-06T06:51:40Z
department:
- _id: '78'
doi: 10.1007/978-3-540-45234-8_56
extern: '1'
language:
- iso: eng
page: 575-584
place: Berlin, Heidelberg
publication: Proceedings of the 13th International Conference on Field Programmable
  Logic and Applications (FPL)
publication_identifier:
  isbn:
  - '9783540408222'
  - '9783540452348'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
publisher: Springer
status: public
title: Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable
  Devices
type: conference
user_id: '398'
year: '2003'
...
---
_id: '19850'
author:
- first_name: Rolf
  full_name: Wanka, Rolf
  last_name: Wanka
citation:
  ama: 'Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
    Graphs Is Asymptotically Optimal. In: <i>Proc. Workshop on Graph-Theoretic Concepts
    in Computer Science (WG)</i>. Berlin, Heidelberg; 2002:413-420. doi:<a href="https://doi.org/10.1007/3-540-36379-3_36">10.1007/3-540-36379-3_36</a>'
  apa: Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations
    on Circulant Graphs Is Asymptotically Optimal. In <i>Proc. Workshop on Graph-Theoretic
    Concepts in Computer Science (WG)</i> (pp. 413–420). Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-36379-3_36">https://doi.org/10.1007/3-540-36379-3_36</a>
  bibtex: '@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing
    Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal},
    DOI={<a href="https://doi.org/10.1007/3-540-36379-3_36">10.1007/3-540-36379-3_36</a>},
    booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
    author={Wanka, Rolf}, year={2002}, pages={413–420} }'
  chicago: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations
    on Circulant Graphs Is Asymptotically Optimal.” In <i>Proc. Workshop on Graph-Theoretic
    Concepts in Computer Science (WG)</i>, 413–20. Berlin, Heidelberg, 2002. <a href="https://doi.org/10.1007/3-540-36379-3_36">https://doi.org/10.1007/3-540-36379-3_36</a>.
  ieee: R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant
    Graphs Is Asymptotically Optimal,” in <i>Proc. Workshop on Graph-Theoretic Concepts
    in Computer Science (WG)</i>, 2002, pp. 413–420.
  mla: Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on
    Circulant Graphs Is Asymptotically Optimal.” <i>Proc. Workshop on Graph-Theoretic
    Concepts in Computer Science (WG)</i>, 2002, pp. 413–20, doi:<a href="https://doi.org/10.1007/3-540-36379-3_36">10.1007/3-540-36379-3_36</a>.
  short: 'R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science
    (WG), Berlin, Heidelberg, 2002, pp. 413–420.'
date_created: 2020-10-02T11:16:31Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/3-540-36379-3_36
language:
- iso: eng
page: 413-420
place: Berlin, Heidelberg
publication: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)
publication_identifier:
  isbn:
  - '9783540003311'
  - '9783540363798'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs
  Is Asymptotically Optimal
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '24338'
author:
- first_name: Matthias
  full_name: Grünewald, Matthias
  last_name: Grünewald
- first_name: Tamás
  full_name: Lukovszki, Tamás
  last_name: Lukovszki
- first_name: Christian
  full_name: Schindelhauer, Christian
  last_name: Schindelhauer
- first_name: Klaus
  full_name: Volbert, Klaus
  last_name: Volbert
citation:
  ama: 'Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance
    of Resource Efficient Wireless Network Topologies. In: <i>Proceedings of the 8th
    International Euro-Par Conference</i>. ; 2002. doi:<a href="https://doi.org/10.1007/3-540-45706-2_134">10.1007/3-540-45706-2_134</a>'
  apa: Grünewald, M., Lukovszki, T., Schindelhauer, C., &#38; Volbert, K. (2002).
    Distributed Maintenance of Resource Efficient Wireless Network Topologies. <i>Proceedings
    of the 8th International Euro-Par Conference</i>. <a href="https://doi.org/10.1007/3-540-45706-2_134">https://doi.org/10.1007/3-540-45706-2_134</a>
  bibtex: '@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn,
    Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network
    Topologies}, DOI={<a href="https://doi.org/10.1007/3-540-45706-2_134">10.1007/3-540-45706-2_134</a>},
    booktitle={Proceedings of the 8th International Euro-Par Conference}, author={Grünewald,
    Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus},
    year={2002} }'
  chicago: Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus
    Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.”
    In <i>Proceedings of the 8th International Euro-Par Conference</i>. Paderborn,
    Germany, 2002. <a href="https://doi.org/10.1007/3-540-45706-2_134">https://doi.org/10.1007/3-540-45706-2_134</a>.
  ieee: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed
    Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: <a
    href="https://doi.org/10.1007/3-540-45706-2_134">10.1007/3-540-45706-2_134</a>.'
  mla: Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient
    Wireless Network Topologies.” <i>Proceedings of the 8th International Euro-Par
    Conference</i>, 2002, doi:<a href="https://doi.org/10.1007/3-540-45706-2_134">10.1007/3-540-45706-2_134</a>.
  short: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings
    of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.'
date_created: 2021-09-14T09:15:57Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/3-540-45706-2_134
language:
- iso: eng
place: Paderborn, Germany
publication: Proceedings of the 8th International Euro-Par Conference
publication_identifier:
  issn:
  - 0302-9743
publication_status: published
status: public
title: Distributed Maintenance of Resource Efficient Wireless Network Topologies
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '18566'
abstract:
- lang: eng
  text: "We analyze a randomized pursuit-evasion game on graphs. This game is played
    by two players, a hunter and a rabbit. Let G be any connected, undirected graph
    with n nodes. The game is played in rounds and in each round both the hunter and
    the rabbit are located at a node of the graph. Between rounds both the hunter
    and the rabbit can stay at the current node or move to another node. The hunter
    is assumed to be restricted to the graph G: in every round, the hunter can move
    using at most one edge. For the rabbit we investigate two models: in one model
    the rabbit is restricted to the same graph as the hunter, and in the other model
    the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.\r\n\r\nWe
    say that the rabbit is caught as soon as hunter and rabbit are located at the
    same node in a round. The goal of the hunter is to catch the rabbit in as few
    rounds as possible, whereas the rabbit aims to maximize the number of rounds until
    it is caught. Given a randomized hunter strategy for G, the escape length for
    that strategy is the worst case expected number of rounds it takes the hunter
    to catch the rabbit, where the worst case is with regards to all (possibly randomized)
    rabbit strategies. Our main result is a hunter strategy for general graphs with
    an escape length of only O\r\n(n log (diam(G))) against restricted as well as
    unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower
    bound on the escape length in both models. Furthermore, we prove that our upper
    bound is optimal up to constant factors against unrestricted rabbits."
author:
- first_name: Micah
  full_name: Adler, Micah
  last_name: Adler
- first_name: Harald
  full_name: Räcke, Harald
  last_name: Räcke
- first_name: Naveen
  full_name: Sivadasan, Naveen
  last_name: Sivadasan
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Berthold
  full_name: Vöcking, Berthold
  last_name: Vöcking
citation:
  ama: 'Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion
    in Graphs. In: <i>Proceedings of the 29th International Colloquium on Automata,
    Languages and Programming</i>. Berlin, Heidelberg; 2002. doi:<a href="https://doi.org/10.1007/3-540-45465-9_77">10.1007/3-540-45465-9_77</a>'
  apa: Adler, M., Räcke, H., Sivadasan, N., Sohler, C., &#38; Vöcking, B. (2002).
    Randomized Pursuit-Evasion in Graphs. In <i>Proceedings of the 29th International
    Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg. <a
    href="https://doi.org/10.1007/3-540-45465-9_77">https://doi.org/10.1007/3-540-45465-9_77</a>
  bibtex: '@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin,
    Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={<a href="https://doi.org/10.1007/3-540-45465-9_77">10.1007/3-540-45465-9_77</a>},
    booktitle={Proceedings of the 29th International Colloquium on Automata, Languages
    and Programming}, author={Adler, Micah and Räcke, Harald and Sivadasan, Naveen
    and Sohler, Christian and Vöcking, Berthold}, year={2002} }'
  chicago: Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold
    Vöcking. “Randomized Pursuit-Evasion in Graphs.” In <i>Proceedings of the 29th
    International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg,
    2002. <a href="https://doi.org/10.1007/3-540-45465-9_77">https://doi.org/10.1007/3-540-45465-9_77</a>.
  ieee: M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion
    in Graphs,” in <i>Proceedings of the 29th International Colloquium on Automata,
    Languages and Programming</i>, 2002.
  mla: Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” <i>Proceedings
    of the 29th International Colloquium on Automata, Languages and Programming</i>,
    2002, doi:<a href="https://doi.org/10.1007/3-540-45465-9_77">10.1007/3-540-45465-9_77</a>.
  short: 'M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings
    of the 29th International Colloquium on Automata, Languages and Programming, Berlin,
    Heidelberg, 2002.'
date_created: 2020-08-28T12:04:12Z
date_updated: 2022-01-06T06:53:40Z
department:
- _id: '63'
doi: 10.1007/3-540-45465-9_77
language:
- iso: eng
place: Berlin, Heidelberg
publication: Proceedings of the 29th International Colloquium on Automata, Languages
  and Programming
publication_identifier:
  isbn:
  - '9783540438649'
  - '9783540454656'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Randomized Pursuit-Evasion in Graphs
type: conference
user_id: '15415'
year: '2002'
...
---
_id: '16723'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Mohan
  full_name: Kumar, Mohan
  last_name: Kumar
- first_name: Sotiris
  full_name: Nikoletseas, Sotiris
  last_name: Nikoletseas
- first_name: Paul
  full_name: Spirakis, Paul
  last_name: Spirakis
citation:
  ama: 'Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing,
    Mobile Networks. In: <i>Euro-Par 2002 Parallel Processing</i>. Lecture Notes in
    Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:<a href="https://doi.org/10.1007/3-540-45706-2_133">10.1007/3-540-45706-2_133</a>'
  apa: Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., &#38; Spirakis, P. (2002).
    Mobile Computing, Mobile Networks. In <i>Euro-Par 2002 Parallel Processing</i>
    (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-45706-2_133">https://doi.org/10.1007/3-540-45706-2_133</a>
  bibtex: '@inbook{Meyer auf der Heide_Kumar_Nikoletseas_Spirakis_2002, place={Berlin,
    Heidelberg}, edition={Lecture Notes in Computer Science, vol 2400}, title={Mobile
    Computing, Mobile Networks}, DOI={<a href="https://doi.org/10.1007/3-540-45706-2_133">10.1007/3-540-45706-2_133</a>},
    booktitle={Euro-Par 2002 Parallel Processing}, author={Meyer auf der Heide, Friedhelm
    and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, year={2002} }'
  chicago: Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul
    Spirakis. “Mobile Computing, Mobile Networks.” In <i>Euro-Par 2002 Parallel Processing</i>,
    Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. <a href="https://doi.org/10.1007/3-540-45706-2_133">https://doi.org/10.1007/3-540-45706-2_133</a>.
  ieee: F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile
    Computing, Mobile Networks,” in <i>Euro-Par 2002 Parallel Processing</i>, Lecture
    Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.
  mla: Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”
    <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol
    2400, 2002, doi:<a href="https://doi.org/10.1007/3-540-45706-2_133">10.1007/3-540-45706-2_133</a>.
  short: 'F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par
    2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin,
    Heidelberg, 2002.'
date_created: 2020-04-17T11:40:33Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-45706-2_133
edition: Lecture Notes in Computer Science, vol 2400
language:
- iso: eng
place: Berlin, Heidelberg
publication: Euro-Par 2002 Parallel Processing
publication_identifier:
  isbn:
  - '9783540440499'
  - '9783540457060'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Mobile Computing, Mobile Networks
type: book_chapter
user_id: '15415'
year: '2002'
...
---
_id: '18749'
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 Coloring. <i>Proceedings of the 28th
    International Colloquium on Automata, Languages and Programming (ICALP)</i>. 2001:493-505.
    doi:<a href="https://doi.org/10.1007/3-540-48224-5_41">10.1007/3-540-48224-5_41</a>
  apa: Czumaj, A., &#38; Sohler, C. (2001). Testing Hypergraph Coloring. <i>Proceedings
    of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>,
    493–505. <a href="https://doi.org/10.1007/3-540-48224-5_41">https://doi.org/10.1007/3-540-48224-5_41</a>
  bibtex: '@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={<a
    href="https://doi.org/10.1007/3-540-48224-5_41">10.1007/3-540-48224-5_41</a>},
    journal={Proceedings of the 28th International Colloquium on Automata, Languages
    and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001},
    pages={493–505} }'
  chicago: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings
    of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>,
    2001, 493–505. <a href="https://doi.org/10.1007/3-540-48224-5_41">https://doi.org/10.1007/3-540-48224-5_41</a>.
  ieee: A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” <i>Proceedings of
    the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>,
    pp. 493–505, 2001.
  mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings
    of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>,
    2001, pp. 493–505, doi:<a href="https://doi.org/10.1007/3-540-48224-5_41">10.1007/3-540-48224-5_41</a>.
  short: A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on
    Automata, Languages and Programming (ICALP) (2001) 493–505.
date_created: 2020-09-01T10:48:38Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
doi: 10.1007/3-540-48224-5_41
language:
- iso: eng
page: 493-505
publication: Proceedings of the 28th International Colloquium on Automata, Languages
  and Programming (ICALP)
publication_identifier:
  isbn:
  - '9783540422877'
  - '9783540482246'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Testing Hypergraph Coloring
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18964'
author:
- first_name: Tamás
  full_name: Lukovszki, Tamás
  last_name: Lukovszki
- first_name: Anil
  full_name: Maheshwari, Anil
  last_name: Maheshwari
- first_name: Norbert
  full_name: Zeh, Norbert
  last_name: Zeh
citation:
  ama: 'Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and
    Its Applications to Proximity Problems. In: <i>Proceedings of the 21st Annual
    Conference on Foundations of Software Technology and Theoretical Computer Science
    (FSTTCS 2001), LNCS</i>. ; 2001. doi:<a href="https://doi.org/10.1007/3-540-45294-x_21">10.1007/3-540-45294-x_21</a>'
  apa: Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2001). I/O-Efficient Batched
    Range Counting and Its Applications to Proximity Problems. In <i>Proceedings of
    the 21st Annual Conference on Foundations of Software Technology and Theoretical
    Computer Science (FSTTCS 2001), LNCS</i>. <a href="https://doi.org/10.1007/3-540-45294-x_21">https://doi.org/10.1007/3-540-45294-x_21</a>
  bibtex: '@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched
    Range Counting and Its Applications to Proximity Problems}, DOI={<a href="https://doi.org/10.1007/3-540-45294-x_21">10.1007/3-540-45294-x_21</a>},
    booktitle={Proceedings of the 21st Annual Conference on Foundations of Software
    Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki,
    Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }'
  chicago: Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched
    Range Counting and Its Applications to Proximity Problems.” In <i>Proceedings
    of the 21st Annual Conference on Foundations of Software Technology and Theoretical
    Computer Science (FSTTCS 2001), LNCS</i>, 2001. <a href="https://doi.org/10.1007/3-540-45294-x_21">https://doi.org/10.1007/3-540-45294-x_21</a>.
  ieee: T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting
    and Its Applications to Proximity Problems,” in <i>Proceedings of the 21st Annual
    Conference on Foundations of Software Technology and Theoretical Computer Science
    (FSTTCS 2001), LNCS</i>, 2001.
  mla: Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications
    to Proximity Problems.” <i>Proceedings of the 21st Annual Conference on Foundations
    of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>,
    2001, doi:<a href="https://doi.org/10.1007/3-540-45294-x_21">10.1007/3-540-45294-x_21</a>.
  short: 'T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual
    Conference on Foundations of Software Technology and Theoretical Computer Science
    (FSTTCS 2001), LNCS, 2001.'
date_created: 2020-09-03T13:26:01Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/3-540-45294-x_21
language:
- iso: eng
publication: Proceedings of the 21st Annual Conference on Foundations of Software
  Technology and Theoretical Computer Science (FSTTCS 2001), LNCS
publication_identifier:
  isbn:
  - '9783540430025'
  - '9783540452942'
  issn:
  - 0302-9743
publication_status: published
status: public
title: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '18152'
abstract:
- lang: eng
  text: Computing the spectral decomposition of a normal matrix is among the most
    frequent tasks to numerical mathematics. A vast range of methods are employed
    to do so, but all of them suffer from instabilities when applied to degenerate
    matrices, i.e., those having multiple eigenvalues. We investigate the spectral
    representation's effectivity properties on the sound formal basis of computable
    analysis. It turns out that in general the eigenvectors cannot be computed from
    a given matrix. If however the size of the matrix' spectrum (=number of different
    eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in
    principle the spectral decomposition can be computed under remarkably weak non-degeneracy
    conditions.
author:
- first_name: Martin
  full_name: Ziegler, Martin
  last_name: Ziegler
- first_name: Vasco
  full_name: Brattka, Vasco
  last_name: Brattka
citation:
  ama: 'Ziegler M, Brattka V. A Computable Spectral Theorem. In: <i>Proceedings of
    the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>. Vol
    2064. Berlin, Heidelberg; 2001:378-388. doi:<a href="https://doi.org/10.1007/3-540-45335-0_23">10.1007/3-540-45335-0_23</a>'
  apa: Ziegler, M., &#38; Brattka, V. (2001). A Computable Spectral Theorem. In <i>Proceedings
    of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>
    (Vol. 2064, pp. 378–388). Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-45335-0_23">https://doi.org/10.1007/3-540-45335-0_23</a>
  bibtex: '@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A
    Computable Spectral Theorem}, volume={2064}, DOI={<a href="https://doi.org/10.1007/3-540-45335-0_23">10.1007/3-540-45335-0_23</a>},
    booktitle={Proceedings of the 4th Workshop on Computability and Complexity in
    Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001},
    pages={378–388} }'
  chicago: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In
    <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis
    (CCA’2000)</i>, 2064:378–88. Berlin, Heidelberg, 2001. <a href="https://doi.org/10.1007/3-540-45335-0_23">https://doi.org/10.1007/3-540-45335-0_23</a>.
  ieee: M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in <i>Proceedings
    of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>,
    2001, vol. 2064, pp. 378–388.
  mla: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” <i>Proceedings
    of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>,
    vol. 2064, 2001, pp. 378–88, doi:<a href="https://doi.org/10.1007/3-540-45335-0_23">10.1007/3-540-45335-0_23</a>.
  short: 'M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability
    and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.'
date_created: 2020-08-24T10:14:06Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1007/3-540-45335-0_23
intvolume: '      2064'
language:
- iso: eng
page: 378-388
place: Berlin, Heidelberg
publication: Proceedings of the 4th Workshop on Computability and Complexity in Analysis
  (CCA'2000)
publication_identifier:
  isbn:
  - '9783540421979'
  - '9783540453352'
  issn:
  - 0302-9743
publication_status: published
status: public
title: A Computable Spectral Theorem
type: conference
user_id: '15415'
volume: 2064
year: '2001'
...
---
_id: '16493'
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. Data Management in Networks. In: <i>Graph-Theoretic
    Concepts in Computer Science</i>. Vol 2204.  Lecture Notes in Computer Science.
    Berlin, Heidelberg; 2001. doi:<a href="https://doi.org/10.1007/3-540-45477-2_2">10.1007/3-540-45477-2_2</a>'
  apa: Meyer auf der Heide, F. (2001). Data Management in Networks. In <i>Graph-Theoretic
    Concepts in Computer Science</i> (Vol. 2204). Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-45477-2_2">https://doi.org/10.1007/3-540-45477-2_2</a>
  bibtex: '@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={
    Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204},
    DOI={<a href="https://doi.org/10.1007/3-540-45477-2_2">10.1007/3-540-45477-2_2</a>},
    booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
    Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science}
    }'
  chicago: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In <i>Graph-Theoretic
    Concepts in Computer Science</i>, Vol. 2204.  Lecture Notes in Computer Science.
    Berlin, Heidelberg, 2001. <a href="https://doi.org/10.1007/3-540-45477-2_2">https://doi.org/10.1007/3-540-45477-2_2</a>.
  ieee: F. Meyer auf der Heide, “Data Management in Networks,” in <i>Graph-Theoretic
    Concepts in Computer Science</i>, vol. 2204, Berlin, Heidelberg, 2001.
  mla: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” <i>Graph-Theoretic
    Concepts in Computer Science</i>, vol. 2204, 2001, doi:<a href="https://doi.org/10.1007/3-540-45477-2_2">10.1007/3-540-45477-2_2</a>.
  short: 'F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science,
    Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:40:48Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45477-2_2
intvolume: '      2204'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
  isbn:
  - '9783540427070'
  - '9783540454779'
  issn:
  - 0302-9743
publication_status: published
series_title: ' Lecture Notes in Computer Science'
status: public
title: Data Management in Networks
type: book_chapter
user_id: '15415'
volume: 2204
year: '2001'
...
---
_id: '16494'
author:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Rolf
  full_name: Wanka, Rolf
  last_name: Wanka
citation:
  ama: 'Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact
    on Algorithm Design. In: <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg;
    2001. doi:<a href="https://doi.org/10.1007/3-540-45718-6_68">10.1007/3-540-45718-6_68</a>'
  apa: Meyer auf der Heide, F., &#38; Wanka, R. (2001). Parallel Bridging Models and
    Their Impact on Algorithm Design. In <i>Computational Science - ICCS 2001</i>.
    Berlin, Heidelberg. <a href="https://doi.org/10.1007/3-540-45718-6_68">https://doi.org/10.1007/3-540-45718-6_68</a>
  bibtex: '@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel
    Bridging Models and Their Impact on Algorithm Design}, DOI={<a href="https://doi.org/10.1007/3-540-45718-6_68">10.1007/3-540-45718-6_68</a>},
    booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm
    and Wanka, Rolf}, year={2001} }'
  chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models
    and Their Impact on Algorithm Design.” In <i>Computational Science - ICCS 2001</i>.
    Berlin, Heidelberg, 2001. <a href="https://doi.org/10.1007/3-540-45718-6_68">https://doi.org/10.1007/3-540-45718-6_68</a>.
  ieee: F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact
    on Algorithm Design,” in <i>Computational Science - ICCS 2001</i>, Berlin, Heidelberg,
    2001.
  mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and
    Their Impact on Algorithm Design.” <i>Computational Science - ICCS 2001</i>, 2001,
    doi:<a href="https://doi.org/10.1007/3-540-45718-6_68">10.1007/3-540-45718-6_68</a>.
  short: 'F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001,
    Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:51:36Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45718-6_68
language:
- iso: eng
place: Berlin, Heidelberg
publication: Computational Science - ICCS 2001
publication_identifier:
  isbn:
  - '9783540422334'
  - '9783540457183'
  issn:
  - 0302-9743
publication_status: published
status: public
title: Parallel Bridging Models and Their Impact on Algorithm Design
type: book_chapter
user_id: '15415'
year: '2001'
...
---
_id: '16722'
citation:
  ama: 'Meyer auf der Heide F, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium
    Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin,
    Heidelberg: Springer ; 2001. doi:<a href="https://doi.org/10.1007/3-540-44676-1">10.1007/3-540-44676-1</a>'
  apa: 'Meyer auf der Heide, F. (Ed.). (2001). <i>Algorithms — ESA 2001, 9th Annual
    European Symposium Århus, Denmark</i> (Lecture Notes in Computer Science (LNCS,
    volume 2161)). Berlin, Heidelberg: Springer . <a href="https://doi.org/10.1007/3-540-44676-1">https://doi.org/10.1007/3-540-44676-1</a>'
  bibtex: '@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture
    Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001,
    9th Annual European Symposium Århus, Denmark}, DOI={<a href="https://doi.org/10.1007/3-540-44676-1">10.1007/3-540-44676-1</a>},
    publisher={Springer }, year={2001} }'
  chicago: 'Meyer auf der Heide, Friedhelm, ed. <i>Algorithms — ESA 2001, 9th Annual
    European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS,
    Volume 2161). Berlin, Heidelberg: Springer , 2001. <a href="https://doi.org/10.1007/3-540-44676-1">https://doi.org/10.1007/3-540-44676-1</a>.'
  ieee: 'F. Meyer auf der Heide, Ed., <i>Algorithms — ESA 2001, 9th Annual European
    Symposium Århus, Denmark</i>, Lecture Notes in Computer Science (LNCS, Volume
    2161). Berlin, Heidelberg: Springer , 2001.'
  mla: Meyer auf der Heide, Friedhelm, editor. <i>Algorithms — ESA 2001, 9th Annual
    European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS,
    Volume 2161), Springer , 2001, doi:<a href="https://doi.org/10.1007/3-540-44676-1">10.1007/3-540-44676-1</a>.
  short: F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium
    Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer
    , Berlin, Heidelberg, 2001.
date_created: 2020-04-17T10:59:08Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-44676-1
edition: Lecture Notes in Computer Science (LNCS, volume 2161)
editor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
  isbn:
  - '9783540424932'
  - '9783540446767'
  issn:
  - 0302-9743
publication_status: published
publisher: 'Springer '
status: public
title: Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark
type: book_editor
user_id: '15415'
year: '2001'
...
---
_id: '3023'
author:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
citation:
  ama: 'Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.
    In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg: Springer Berlin
    Heidelberg; 2000:248-259. doi:<a href="https://doi.org/10.1007/3-540-45022-x_22">10.1007/3-540-45022-x_22</a>'
  apa: 'Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases
    of Lattices. In <i>Automata, Languages and Programming</i> (pp. 248–259). Berlin,
    Heidelberg: Springer Berlin Heidelberg. <a href="https://doi.org/10.1007/3-540-45022-x_22">https://doi.org/10.1007/3-540-45022-x_22</a>'
  bibtex: '@inbook{Blömer_2000, place={Berlin, Heidelberg}, title={Closest Vectors,
    Successive Minima, and Dual HKZ-Bases of Lattices}, DOI={<a href="https://doi.org/10.1007/3-540-45022-x_22">10.1007/3-540-45022-x_22</a>},
    booktitle={Automata, Languages and Programming}, publisher={Springer Berlin Heidelberg},
    author={Blömer, Johannes}, year={2000}, pages={248–259} }'
  chicago: 'Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases
    of Lattices.” In <i>Automata, Languages and Programming</i>, 248–59. Berlin, Heidelberg:
    Springer Berlin Heidelberg, 2000. <a href="https://doi.org/10.1007/3-540-45022-x_22">https://doi.org/10.1007/3-540-45022-x_22</a>.'
  ieee: 'J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,”
    in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg: Springer Berlin
    Heidelberg, 2000, pp. 248–259.'
  mla: Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of
    Lattices.” <i>Automata, Languages and Programming</i>, Springer Berlin Heidelberg,
    2000, pp. 248–59, doi:<a href="https://doi.org/10.1007/3-540-45022-x_22">10.1007/3-540-45022-x_22</a>.
  short: 'J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg,
    Berlin, Heidelberg, 2000, pp. 248–259.'
date_created: 2018-06-05T08:27:28Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-45022-x_22
page: 248-259
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
  isbn:
  - '9783540677154'
  - '9783540450221'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
type: book_chapter
user_id: '25078'
year: '2000'
...