---
_id: '18929'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Miroslaw
full_name: Korzeniowski, Miroslaw
last_name: Korzeniowski
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
citation:
ama: 'Dynia M, Korzeniowski M, Kutyłowski J. Competitive Maintenance of Minimum
Spanning Trees in Dynamic Graphs. In: Proc. of the 33rd International Conference
on Current Trends in Theory and Practice of Computer Science (SOFSEM’07).
Vol 4362. ; 2007:260--271. doi:10.1007/978-3-540-69507-3_21'
apa: Dynia, M., Korzeniowski, M., & Kutyłowski, J. (2007). Competitive Maintenance
of Minimum Spanning Trees in Dynamic Graphs. In Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)
(Vol. 4362, pp. 260--271). https://doi.org/10.1007/978-3-540-69507-3_21
bibtex: '@inproceedings{Dynia_Korzeniowski_Kutyłowski_2007, title={Competitive Maintenance
of Minimum Spanning Trees in Dynamic Graphs}, volume={4362}, DOI={10.1007/978-3-540-69507-3_21},
booktitle={Proc. of the 33rd International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM’07)}, author={Dynia, Miroslaw and Korzeniowski,
Miroslaw and Kutyłowski, Jarosław}, year={2007}, pages={260--271} }'
chicago: Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosław Kutyłowski. “Competitive
Maintenance of Minimum Spanning Trees in Dynamic Graphs.” In Proc. of the 33rd
International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM’07), 4362:260--271, 2007. https://doi.org/10.1007/978-3-540-69507-3_21.
ieee: M. Dynia, M. Korzeniowski, and J. Kutyłowski, “Competitive Maintenance of
Minimum Spanning Trees in Dynamic Graphs,” in Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
2007, vol. 4362, pp. 260--271.
mla: Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees
in Dynamic Graphs.” Proc. of the 33rd International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp.
260--271, doi:10.1007/978-3-540-69507-3_21.
short: 'M. Dynia, M. Korzeniowski, J. Kutyłowski, in: Proc. of the 33rd International
Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07),
2007, pp. 260--271.'
date_created: 2020-09-03T10:29:52Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-69507-3_21
intvolume: ' 4362'
language:
- iso: eng
page: 260--271
publication: Proc. of the 33rd International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM'07)
publication_identifier:
isbn:
- '9783540695066'
- '9783540695073'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
type: conference
user_id: '15415'
volume: 4362
year: '2007'
...
---
_id: '17982'
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Ziegler M. (Short) Survey of Real Hypercomputation. In: Lecture Notes in
Computer Science. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-73001-9_86'
apa: Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In Lecture
Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_86
bibtex: '@inbook{Ziegler_2007, place={Berlin, Heidelberg}, title={(Short) Survey
of Real Hypercomputation}, DOI={10.1007/978-3-540-73001-9_86},
booktitle={Lecture Notes in Computer Science}, author={Ziegler, Martin}, year={2007}
}'
chicago: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” In Lecture
Notes in Computer Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73001-9_86.
ieee: M. Ziegler, “(Short) Survey of Real Hypercomputation,” in Lecture Notes
in Computer Science, Berlin, Heidelberg, 2007.
mla: Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” Lecture Notes
in Computer Science, 2007, doi:10.1007/978-3-540-73001-9_86.
short: 'M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:33:50Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73001-9_86
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540730002'
- '9783540730019'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: (Short) Survey of Real Hypercomputation
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '17983'
author:
- first_name: Klaus
full_name: Meer, Klaus
last_name: Meer
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Meer K, Ziegler M. Real Computational Universality: The Word Problem for a
Class of Groups with Infinite Presentation. In: Mathematical Foundations of
Computer Science 2007. Berlin, Heidelberg; 2007. doi:10.1007/978-3-540-74456-6_64'
apa: 'Meer, K., & Ziegler, M. (2007). Real Computational Universality: The Word
Problem for a Class of Groups with Infinite Presentation. In Mathematical Foundations
of Computer Science 2007. Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74456-6_64'
bibtex: '@inbook{Meer_Ziegler_2007, place={Berlin, Heidelberg}, title={Real Computational
Universality: The Word Problem for a Class of Groups with Infinite Presentation},
DOI={10.1007/978-3-540-74456-6_64},
booktitle={Mathematical Foundations of Computer Science 2007}, author={Meer, Klaus
and Ziegler, Martin}, year={2007} }'
chicago: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The
Word Problem for a Class of Groups with Infinite Presentation.” In Mathematical
Foundations of Computer Science 2007. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-74456-6_64.'
ieee: 'K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem
for a Class of Groups with Infinite Presentation,” in Mathematical Foundations
of Computer Science 2007, Berlin, Heidelberg, 2007.'
mla: 'Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word
Problem for a Class of Groups with Infinite Presentation.” Mathematical Foundations
of Computer Science 2007, 2007, doi:10.1007/978-3-540-74456-6_64.'
short: 'K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007,
Berlin, Heidelberg, 2007.'
date_created: 2020-08-14T13:35:56Z
date_updated: 2022-01-06T06:53:24Z
department:
- _id: '63'
doi: 10.1007/978-3-540-74456-6_64
language:
- iso: eng
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2007
publication_identifier:
isbn:
- '9783540744559'
- '9783540744566'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Real Computational Universality: The Word Problem for a Class of Groups with
Infinite Presentation'
type: book_chapter
user_id: '15415'
year: '2007'
...
---
_id: '16640'
author:
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
- first_name: Robert
full_name: Preis, Robert
last_name: Preis
citation:
ama: 'Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular
Graphs. In: Mathematical Foundations of Computer Science 2001. Berlin,
Heidelberg; 2007. doi:10.1007/3-540-44683-4_46'
apa: Monien, B., & Preis, R. (2007). Upper Bounds on the Bisection Width of
3- and 4-Regular Graphs. In Mathematical Foundations of Computer Science 2001.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_46
bibtex: '@inbook{Monien_Preis_2007, place={Berlin, Heidelberg}, title={Upper Bounds
on the Bisection Width of 3- and 4-Regular Graphs}, DOI={10.1007/3-540-44683-4_46},
booktitle={Mathematical Foundations of Computer Science 2001}, author={Monien,
Burkhard and Preis, Robert}, year={2007} }'
chicago: Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width
of 3- and 4-Regular Graphs.” In Mathematical Foundations of Computer Science
2001. Berlin, Heidelberg, 2007. https://doi.org/10.1007/3-540-44683-4_46.
ieee: B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular
Graphs,” in Mathematical Foundations of Computer Science 2001, Berlin,
Heidelberg, 2007.
mla: Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of
3- and 4-Regular Graphs.” Mathematical Foundations of Computer Science 2001,
2007, doi:10.1007/3-540-44683-4_46.
short: 'B. Monien, R. Preis, in: Mathematical Foundations of Computer Science 2001,
Berlin, Heidelberg, 2007.'
date_created: 2020-04-16T08:58:07Z
date_updated: 2022-01-06T06:52:53Z
department:
- _id: '101'
doi: 10.1007/3-540-44683-4_46
place: Berlin, Heidelberg
publication: Mathematical Foundations of Computer Science 2001
publication_identifier:
isbn:
- '9783540424963'
- '9783540446835'
issn:
- 0302-9743
publication_status: published
status: public
title: Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
type: book_chapter
user_id: '15701'
year: '2007'
...
---
_id: '15144'
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. Evaluating XPath Queries on XML Data Streams. In:
Data Management. Data, Data Everywhere, 24th British National Conference on
Databases, BNCOD 24. Springer; 2007:101-113. doi:10.1007/978-3-540-73390-4_10'
apa: Böttcher, S., & Steinmetz, R. (2007). Evaluating XPath Queries on XML Data
Streams. In Data Management. Data, Data Everywhere, 24th British National Conference
on Databases, BNCOD 24 (pp. 101–113). Springer. https://doi.org/10.1007/978-3-540-73390-4_10
bibtex: '@inproceedings{Böttcher_Steinmetz_2007, title={Evaluating XPath Queries
on XML Data Streams}, DOI={10.1007/978-3-540-73390-4_10},
booktitle={Data Management. Data, Data Everywhere, 24th British National Conference
on Databases, BNCOD 24}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz,
Rita}, year={2007}, pages={101–113} }'
chicago: Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML
Data Streams.” In Data Management. Data, Data Everywhere, 24th British National
Conference on Databases, BNCOD 24, 101–13. Springer, 2007. https://doi.org/10.1007/978-3-540-73390-4_10.
ieee: S. Böttcher and R. Steinmetz, “Evaluating XPath Queries on XML Data Streams,”
in Data Management. Data, Data Everywhere, 24th British National Conference
on Databases, BNCOD 24, 2007, pp. 101–113.
mla: Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data
Streams.” Data Management. Data, Data Everywhere, 24th British National Conference
on Databases, BNCOD 24, Springer, 2007, pp. 101–13, doi:10.1007/978-3-540-73390-4_10.
short: 'S. Böttcher, R. Steinmetz, in: Data Management. Data, Data Everywhere, 24th
British National Conference on Databases, BNCOD 24, Springer, 2007, pp. 101–113.'
date_created: 2019-11-22T08:59:56Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '69'
doi: 10.1007/978-3-540-73390-4_10
language:
- iso: eng
page: 101-113
publication: Data Management. Data, Data Everywhere, 24th British National Conference
on Databases, BNCOD 24
publication_identifier:
isbn:
- '9783540733898'
- '9783540733904'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Evaluating XPath Queries on XML Data Streams
type: conference
user_id: '14961'
year: '2007'
...
---
_id: '15146'
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. Data Management for Mobile Ajax Web 2.0 Applications.
In: Database and Expert Systems Applications, 18th International Conference,
DEXA 2007. Springer; 2007:424-433. doi:10.1007/978-3-540-74469-6_42'
apa: Böttcher, S., & Steinmetz, R. (2007). Data Management for Mobile Ajax Web
2.0 Applications. In Database and Expert Systems Applications, 18th International
Conference, DEXA 2007 (pp. 424–433). Springer. https://doi.org/10.1007/978-3-540-74469-6_42
bibtex: '@inproceedings{Böttcher_Steinmetz_2007, title={Data Management for Mobile
Ajax Web 2.0 Applications}, DOI={10.1007/978-3-540-74469-6_42},
booktitle={Database and Expert Systems Applications, 18th International Conference,
DEXA 2007}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita},
year={2007}, pages={424–433} }'
chicago: Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax
Web 2.0 Applications.” In Database and Expert Systems Applications, 18th International
Conference, DEXA 2007, 424–33. Springer, 2007. https://doi.org/10.1007/978-3-540-74469-6_42.
ieee: S. Böttcher and R. Steinmetz, “Data Management for Mobile Ajax Web 2.0 Applications,”
in Database and Expert Systems Applications, 18th International Conference,
DEXA 2007, 2007, pp. 424–433.
mla: Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web
2.0 Applications.” Database and Expert Systems Applications, 18th International
Conference, DEXA 2007, Springer, 2007, pp. 424–33, doi:10.1007/978-3-540-74469-6_42.
short: 'S. Böttcher, R. Steinmetz, in: Database and Expert Systems Applications,
18th International Conference, DEXA 2007, Springer, 2007, pp. 424–433.'
date_created: 2019-11-22T09:06:45Z
date_updated: 2022-01-06T06:52:16Z
department:
- _id: '69'
doi: 10.1007/978-3-540-74469-6_42
language:
- iso: eng
page: 424-433
publication: Database and Expert Systems Applications, 18th International Conference,
DEXA 2007
publication_identifier:
isbn:
- '9783540744672'
- '9783540744696'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Data Management for Mobile Ajax Web 2.0 Applications
type: conference
user_id: '14961'
year: '2007'
...
---
_id: '19838'
author:
- first_name: Stefan
full_name: Rührup, Stefan
last_name: Rührup
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: Proc.
of the 17th International Symposium on Algorithms and Computation (ISAAC 2006).
; 2006. doi:10.1007/11940128_65'
apa: Rührup, S., & Schindelhauer, C. (2006). Online Multi-path Routing in a
Maze. In Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006). https://doi.org/10.1007/11940128_65
bibtex: '@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing
in a Maze}, DOI={10.1007/11940128_65},
booktitle={Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006}
}'
chicago: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing
in a Maze.” In Proc. of the 17th International Symposium on Algorithms and
Computation (ISAAC 2006), 2006. https://doi.org/10.1007/11940128_65.
ieee: S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in
Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC
2006), 2006.
mla: Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in
a Maze.” Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006), 2006, doi:10.1007/11940128_65.
short: 'S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium
on Algorithms and Computation (ISAAC 2006), 2006.'
date_created: 2020-10-01T11:51:15Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1007/11940128_65
language:
- iso: eng
publication: Proc. of the 17th International Symposium on Algorithms and Computation
(ISAAC 2006)
publication_identifier:
isbn:
- '9783540496946'
- '9783540496960'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Online Multi-path Routing in a Maze
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '24277'
abstract:
- lang: eng
text: "We propose a dynamic, ad-hoc communication network consisting of mobile units
that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a
practical, low cost solution. Therefore we consider very simple wireless communication
hardware, without collision detection, with very small bandwidth and a probabilistic
model of link failure.\r\n\r\nWe provide a complete system architecture. For this
purpose we design and analyze solutions for size approximation, leader election
and broadcasting. Our algorithms are fine-tuned for fast operation in a practical
setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur
contribution is much different from the previous work, where either pure theoretical
models with a pure theoretical analysis are provided or algorithms working in
practical models are evaluated only through simulations."
author:
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
- first_name: Filip
full_name: Zagórski, Filip
last_name: Zagórski
citation:
ama: 'Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection.
In: SOFSEM 2006: Theory and Practice of Computer Science. ; 2006. doi:10.1007/11611257_37'
apa: 'Kutyłowski, J., & Zagórski, F. (2006). Reliable Broadcasting Without Collision
Detection. SOFSEM 2006: Theory and Practice of Computer Science. https://doi.org/10.1007/11611257_37'
bibtex: '@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable
Broadcasting Without Collision Detection}, DOI={10.1007/11611257_37},
booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski,
Jarosław and Zagórski, Filip}, year={2006} }'
chicago: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without
Collision Detection.” In SOFSEM 2006: Theory and Practice of Computer Science.
Berlin, Heidelberg, 2006. https://doi.org/10.1007/11611257_37.'
ieee: 'J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,”
2006, doi: 10.1007/11611257_37.'
mla: 'Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision
Detection.” SOFSEM 2006: Theory and Practice of Computer Science, 2006,
doi:10.1007/11611257_37.'
short: 'J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer
Science, Berlin, Heidelberg, 2006.'
date_created: 2021-09-13T13:28:29Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/11611257_37
language:
- iso: eng
place: Berlin, Heidelberg
publication: 'SOFSEM 2006: Theory and Practice of Computer Science'
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Reliable Broadcasting Without Collision Detection
type: conference
user_id: '15415'
year: '2006'
...
---
_id: '3004'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: Lecture
Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg;
2006:106-120. doi:10.1007/11889700_11'
apa: 'Blömer, J., & Krummel, V. (2006). Fault Based Collision Attacks on AES.
In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_11'
bibtex: '@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based
Collision Attacks on AES}, DOI={10.1007/11889700_11},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }'
chicago: 'Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on
AES.” In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_11.'
ieee: 'J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture
Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg,
2006, pp. 106–120.'
mla: Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”
Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp.
106–20, doi:10.1007/11889700_11.
short: 'J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.'
date_created: 2018-06-05T08:14:42Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_11
page: 106-120
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540462507'
- '9783540462514'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Fault Based Collision Attacks on AES
type: book_chapter
user_id: '25078'
year: '2006'
...
---
_id: '3005'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Martin
full_name: Otto, Martin
last_name: Otto
citation:
ama: 'Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.
In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2006:13-23. doi:10.1007/11889700_2'
apa: 'Blömer, J., & Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm
Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/11889700_2'
bibtex: '@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack
on a Secure CRT-RSA Algorithm Reconsidered}, DOI={10.1007/11889700_2},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }'
chicago: 'Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA
Algorithm Reconsidered.” In Lecture Notes in Computer Science, 13–23. Berlin,
Heidelberg: Springer Berlin Heidelberg, 2006. https://doi.org/10.1007/11889700_2.'
ieee: 'J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,”
in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin
Heidelberg, 2006, pp. 13–23.'
mla: Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm
Reconsidered.” Lecture Notes in Computer Science, Springer Berlin Heidelberg,
2006, pp. 13–23, doi:10.1007/11889700_2.
short: 'J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.'
date_created: 2018-06-05T08:15:48Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/11889700_2
page: 13-23
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540462507'
- '9783540462514'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered
type: book_chapter
user_id: '25078'
year: '2006'
...