---
_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: Proceedings of the 8th
International Euro-Par Conference. ; 2002. doi:10.1007/3-540-45706-2_134'
apa: Grünewald, M., Lukovszki, T., Schindelhauer, C., & Volbert, K. (2002).
Distributed Maintenance of Resource Efficient Wireless Network Topologies. Proceedings
of the 8th International Euro-Par Conference. https://doi.org/10.1007/3-540-45706-2_134
bibtex: '@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn,
Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network
Topologies}, DOI={10.1007/3-540-45706-2_134},
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 Proceedings of the 8th International Euro-Par Conference. Paderborn,
Germany, 2002. https://doi.org/10.1007/3-540-45706-2_134.
ieee: 'M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed
Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: 10.1007/3-540-45706-2_134.'
mla: Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient
Wireless Network Topologies.” Proceedings of the 8th International Euro-Par
Conference, 2002, doi:10.1007/3-540-45706-2_134.
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: Proceedings of the 29th International Colloquium on Automata,
Languages and Programming. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45465-9_77'
apa: Adler, M., Räcke, H., Sivadasan, N., Sohler, C., & Vöcking, B. (2002).
Randomized Pursuit-Evasion in Graphs. In Proceedings of the 29th International
Colloquium on Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_77
bibtex: '@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin,
Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={10.1007/3-540-45465-9_77},
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 Proceedings of the 29th
International Colloquium on Automata, Languages and Programming. Berlin, Heidelberg,
2002. https://doi.org/10.1007/3-540-45465-9_77.
ieee: M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion
in Graphs,” in Proceedings of the 29th International Colloquium on Automata,
Languages and Programming, 2002.
mla: Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” Proceedings
of the 29th International Colloquium on Automata, Languages and Programming,
2002, doi:10.1007/3-540-45465-9_77.
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: Euro-Par 2002 Parallel Processing. Lecture Notes in
Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:10.1007/3-540-45706-2_133'
apa: Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., & Spirakis, P. (2002).
Mobile Computing, Mobile Networks. In Euro-Par 2002 Parallel Processing
(Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45706-2_133
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={10.1007/3-540-45706-2_133},
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 Euro-Par 2002 Parallel Processing,
Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. https://doi.org/10.1007/3-540-45706-2_133.
ieee: F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile
Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture
Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.
mla: Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.”
Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol
2400, 2002, doi:10.1007/3-540-45706-2_133.
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. Proceedings of the 28th
International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505.
doi:10.1007/3-540-48224-5_41
apa: Czumaj, A., & Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
493–505. https://doi.org/10.1007/3-540-48224-5_41
bibtex: '@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={10.1007/3-540-48224-5_41},
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.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, 493–505. https://doi.org/10.1007/3-540-48224-5_41.
ieee: A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” Proceedings of
the 28th International Colloquium on Automata, Languages and Programming (ICALP),
pp. 493–505, 2001.
mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
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: Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21'
apa: Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems. In Proceedings of
the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS. https://doi.org/10.1007/3-540-45294-x_21
bibtex: '@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems}, DOI={10.1007/3-540-45294-x_21},
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 Proceedings
of the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS, 2001. https://doi.org/10.1007/3-540-45294-x_21.
ieee: T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting
and Its Applications to Proximity Problems,” in Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS, 2001.
mla: Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications
to Proximity Problems.” Proceedings of the 21st Annual Conference on Foundations
of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS,
2001, doi:10.1007/3-540-45294-x_21.
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: Proceedings of
the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol
2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23'
apa: Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)
(Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23
bibtex: '@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A
Computable Spectral Theorem}, volume={2064}, DOI={10.1007/3-540-45335-0_23},
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
Proceedings of the 4th Workshop on Computability and Complexity in Analysis
(CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23.
ieee: M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
2001, vol. 2064, pp. 378–388.
mla: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.
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: Graph-Theoretic
Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2'
apa: Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic
Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
bibtex: '@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={
Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204},
DOI={10.1007/3-540-45477-2_2},
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 Graph-Theoretic
Concepts in Computer Science, Vol. 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45477-2_2.
ieee: F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic
Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
mla: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic
Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.
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: Computational Science - ICCS 2001. Berlin, Heidelberg;
2001. doi:10.1007/3-540-45718-6_68'
apa: Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and
Their Impact on Algorithm Design. In Computational Science - ICCS 2001.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
bibtex: '@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel
Bridging Models and Their Impact on Algorithm Design}, DOI={10.1007/3-540-45718-6_68},
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 Computational Science - ICCS 2001.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45718-6_68.
ieee: F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact
on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg,
2001.
mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and
Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001,
doi:10.1007/3-540-45718-6_68.
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. Algorithms — ESA 2001, 9th Annual European Symposium
Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin,
Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1'
apa: 'Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS,
volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1'
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={10.1007/3-540-44676-1},
publisher={Springer }, year={2001} }'
chicago: 'Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161). Berlin, Heidelberg: Springer , 2001. https://doi.org/10.1007/3-540-44676-1.'
ieee: 'F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European
Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume
2161). Berlin, Heidelberg: Springer , 2001.'
mla: Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.
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: Automata, Languages and Programming. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2000:248-259. doi:10.1007/3-540-45022-x_22'
apa: 'Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases
of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22'
bibtex: '@inbook{Blömer_2000, place={Berlin, Heidelberg}, title={Closest Vectors,
Successive Minima, and Dual HKZ-Bases of Lattices}, DOI={10.1007/3-540-45022-x_22},
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 Automata, Languages and Programming, 248–59. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2000. https://doi.org/10.1007/3-540-45022-x_22.'
ieee: 'J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,”
in Automata, Languages and Programming, Berlin, Heidelberg: Springer Berlin
Heidelberg, 2000, pp. 248–259.'
mla: Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of
Lattices.” Automata, Languages and Programming, Springer Berlin Heidelberg,
2000, pp. 248–59, doi:10.1007/3-540-45022-x_22.
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'
...