---
_id: '47701'
author:
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: Krummel V. Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES)
Rijndael.; 2001.
apa: Krummel, V. (2001). Sicherheit und Anwendungen des Advanced Encryption Standard
(AES) Rijndael.
bibtex: '@book{Krummel_2001, title={Sicherheit und Anwendungen des Advanced Encryption
Standard (AES) Rijndael}, author={Krummel, Volker}, year={2001} }'
chicago: Krummel, Volker. Sicherheit Und Anwendungen Des Advanced Encryption
Standard (AES) Rijndael, 2001.
ieee: V. Krummel, Sicherheit und Anwendungen des Advanced Encryption Standard
(AES) Rijndael. 2001.
mla: Krummel, Volker. Sicherheit Und Anwendungen Des Advanced Encryption Standard
(AES) Rijndael. 2001.
short: V. Krummel, Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES)
Rijndael, 2001.
date_created: 2023-10-05T16:41:47Z
date_updated: 2023-10-05T16:54:52Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
content_type: application/postscript
creator: bhenrik
date_created: 2023-10-05T16:41:41Z
date_updated: 2023-10-05T16:54:52Z
file_id: '47729'
file_name: 2001_Krummel_AES.ps
file_size: 1580787
relation: main_file
file_date_updated: 2023-10-05T16:54:52Z
has_accepted_license: '1'
keyword:
- Diplomarbeit
language:
- iso: eng
oa: '1'
status: public
title: Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael
type: misc
user_id: '41047'
year: '2001'
...
---
_id: '47702'
author:
- first_name: Martin
full_name: Otto, Martin
last_name: Otto
citation:
ama: Otto M. Brauer Addition-Subtraction Chains.; 2001.
apa: Otto, M. (2001). Brauer Addition-Subtraction Chains.
bibtex: '@book{Otto_2001, title={Brauer Addition-Subtraction Chains}, author={Otto,
Martin}, year={2001} }'
chicago: Otto, Martin. Brauer Addition-Subtraction Chains, 2001.
ieee: M. Otto, Brauer Addition-Subtraction Chains. 2001.
mla: Otto, Martin. Brauer Addition-Subtraction Chains. 2001.
short: M. Otto, Brauer Addition-Subtraction Chains, 2001.
date_created: 2023-10-05T16:42:24Z
date_updated: 2023-10-05T16:54:58Z
ddc:
- '000'
department:
- _id: '34'
- _id: '64'
file:
- access_level: open_access
content_type: application/postscript
creator: bhenrik
date_created: 2023-10-05T16:42:18Z
date_updated: 2023-10-05T16:54:58Z
file_id: '47730'
file_name: 2001_Otto_BrauerAddition-SubtractionChains_Diplom.ps
file_size: 2275300
relation: main_file
file_date_updated: 2023-10-05T16:54:58Z
has_accepted_license: '1'
keyword:
- Diplomarbeit
language:
- iso: eng
oa: '1'
status: public
title: Brauer Addition-Subtraction Chains
type: misc
user_id: '41047'
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'
...
---
_id: '3024'
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. On the complexity of computing short linearly independent
vectors and short bases in a lattice. In: Proceedings of the Thirty-First Annual
ACM Symposium on Theory of Computing - STOC ’99. ACM Press; 1999. doi:10.1145/301250.301441'
apa: Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short
linearly independent vectors and short bases in a lattice. Proceedings of the
Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. https://doi.org/10.1145/301250.301441
bibtex: '@inproceedings{Blömer_Seifert_1999, title={On the complexity of computing
short linearly independent vectors and short bases in a lattice}, DOI={10.1145/301250.301441},
booktitle={Proceedings of the thirty-first annual ACM symposium on Theory of computing
- STOC ’99}, publisher={ACM Press}, author={Blömer, Johannes and Seifert, Jean-Pierre},
year={1999} }'
chicago: Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing
Short Linearly Independent Vectors and Short Bases in a Lattice.” In Proceedings
of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99.
ACM Press, 1999. https://doi.org/10.1145/301250.301441.
ieee: 'J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly
independent vectors and short bases in a lattice,” 1999, doi: 10.1145/301250.301441.'
mla: Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing
Short Linearly Independent Vectors and Short Bases in a Lattice.” Proceedings
of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99,
ACM Press, 1999, doi:10.1145/301250.301441.
short: 'J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM
Symposium on Theory of Computing - STOC ’99, ACM Press, 1999.'
date_created: 2018-06-05T08:27:53Z
date_updated: 2023-01-10T13:49:15Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1145/301250.301441
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:28:14Z
date_updated: 2018-06-05T08:28:14Z
file_id: '3025'
file_name: short.pdf
file_size: 313561
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:28:14Z
has_accepted_license: '1'
publication: Proceedings of the thirty-first annual ACM symposium on Theory of computing -
STOC '99
publication_identifier:
isbn:
- '1581130678'
publication_status: published
publisher: ACM Press
status: public
title: On the complexity of computing short linearly independent vectors and short
bases in a lattice
type: conference
user_id: '23'
year: '1999'
...
---
_id: '3028'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Beat
full_name: Trachsler, Beat
last_name: Trachsler
citation:
ama: Blömer J, Trachsler B. A lower bound for a class of graph based loss resilient
codes. Technical report/Departement of Computer Science, ETH Zürich. 1998.
apa: Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph
based loss resilient codes. Technical Report/Departement of Computer Science,
ETH Zürich.
bibtex: '@article{Blömer_Trachsler_1998, title={A lower bound for a class of graph
based loss resilient codes}, journal={Technical report/Departement of Computer
Science, ETH Zürich}, author={Blömer, Johannes and Trachsler, Beat}, year={1998}
}'
chicago: Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph
Based Loss Resilient Codes.” Technical Report/Departement of Computer Science,
ETH Zürich, 1998.
ieee: J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss
resilient codes,” Technical report/Departement of Computer Science, ETH Zürich,
1998.
mla: Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based
Loss Resilient Codes.” Technical Report/Departement of Computer Science, ETH
Zürich, 1998.
short: J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science,
ETH Zürich (1998).
date_created: 2018-06-05T08:29:47Z
date_updated: 2022-01-06T06:58:52Z
ddc:
- '000'
department:
- _id: '64'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:32:27Z
date_updated: 2018-06-05T08:32:27Z
file_id: '3031'
file_name: code_lower.pdf
file_size: 173369
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:32:27Z
has_accepted_license: '1'
publication: Technical report/Departement of Computer Science, ETH Zürich
publication_status: published
status: public
title: A lower bound for a class of graph based loss resilient codes
type: journal_article
user_id: '25078'
year: '1998'
...
---
_id: '3029'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Blömer J. Denesting by bounded degree radicals. In: Algorithms — ESA ’97.
Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:10.1007/3-540-63397-9_5'
apa: 'Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms
— ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5'
bibtex: '@inbook{Blömer_1997, place={Berlin, Heidelberg}, title={Denesting by bounded
degree radicals}, DOI={10.1007/3-540-63397-9_5},
booktitle={Algorithms — ESA ’97}, publisher={Springer Berlin Heidelberg}, author={Blömer,
Johannes}, year={1997}, pages={53–63} }'
chicago: 'Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In Algorithms
— ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. https://doi.org/10.1007/3-540-63397-9_5.'
ieee: 'J. Blömer, “Denesting by bounded degree radicals,” in Algorithms — ESA
’97, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.'
mla: Blömer, Johannes. “Denesting by Bounded Degree Radicals.” Algorithms — ESA
’97, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:10.1007/3-540-63397-9_5.
short: 'J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin,
Heidelberg, 1997, pp. 53–63.'
date_created: 2018-06-05T08:30:40Z
date_updated: 2022-01-06T06:58:52Z
ddc:
- '000'
department:
- _id: '64'
doi: 10.1007/3-540-63397-9_5
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:31:35Z
date_updated: 2018-06-05T08:31:35Z
file_id: '3030'
file_name: DenestingByBoundedDegreeRevised.pdf
file_size: 1656133
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:31:35Z
has_accepted_license: '1'
page: 53-63
place: Berlin, Heidelberg
publication: Algorithms — ESA '97
publication_identifier:
isbn:
- '9783540633976'
- '9783540695363'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Denesting by bounded degree radicals
type: book_chapter
user_id: '25078'
year: '1997'
...
---
_id: '3033'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Richard
full_name: Karp, Richard
last_name: Karp
- first_name: Emo
full_name: Welzl, Emo
last_name: Welzl
citation:
ama: Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields.
Random Structures \& Algorithms. 1997;(4):407-419. doi:10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
apa: Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices
over finite fields. Random Structures \& Algorithms, (4), 407–419.
https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
bibtex: '@article{Blömer_Karp_Welzl_1997, title={The rank of sparse random matrices
over finite fields}, DOI={10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y},
number={4}, journal={Random Structures \& Algorithms}, author={Blömer, Johannes
and Karp, Richard and Welzl, Emo}, year={1997}, pages={407–419} }'
chicago: 'Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random
Matrices over Finite Fields.” Random Structures \& Algorithms, no.
4 (1997): 407–19. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y.'
ieee: J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over
finite fields,” Random Structures \& Algorithms, no. 4, pp. 407–419,
1997.
mla: Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.”
Random Structures \& Algorithms, no. 4, 1997, pp. 407–19, doi:10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y.
short: J. Blömer, R. Karp, E. Welzl, Random Structures \& Algorithms (1997)
407–419.
date_created: 2018-06-05T08:34:49Z
date_updated: 2022-01-06T06:58:52Z
department:
- _id: '64'
doi: 10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
extern: '1'
issue: '4'
keyword:
- random matrices
- rank
- finite fields
page: 407-419
publication: Random Structures \& Algorithms
publication_status: published
status: public
title: The rank of sparse random matrices over finite fields
type: journal_article
user_id: '25078'
year: '1997'
...
---
_id: '3037'
abstract:
- lang: eng
text: For two given simple polygonsP, Q, the problem is to determine a rigid motionI
ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff
distance betweenP andI(Q). Faster algorithms as the one for the general problem
are obtained for special cases, namely thatI is restricted to translations or
even to translations only in one specified direction. It turns out that determining
pseudo-optimal solutions, i.e. ones that differ from the optimum by just a constant
factor, can be done much more efficiently than determining optimal solutions.
In the most general case, the algorithm for the pseudo-optimal solution is based
on the surprising fact that for the optimal possible match betweenP and an imageI(Q)
ofQ, the distance between the centroids of the edges of the convex hulls ofP andI(Q)
is a constant multiple of the Hausdorff distance betweenP andI(Q). It is also
shown that the Hausdorff distance between two polygons can be determined in timeO(n
logn), wheren is the total number of vertices.
author:
- first_name: Helmut
full_name: Alt, Helmut
last_name: Alt
- first_name: Bernd
full_name: Behrends, Bernd
last_name: Behrends
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes. Annals
of Mathematics and Artificial Intelligence. 1995;13(3).
apa: Alt, H., Behrends, B., & Blömer, J. (1995). Approximate matching of polygonal
shapes. Annals of Mathematics and Artificial Intelligence, 13(3).
bibtex: '@article{Alt_Behrends_Blömer_1995, title={Approximate matching of polygonal
shapes}, volume={13}, number={3}, journal={Annals of Mathematics and Artificial
Intelligence}, author={Alt, Helmut and Behrends, Bernd and Blömer, Johannes},
year={1995} }'
chicago: Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching
of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence
13, no. 3 (1995).
ieee: H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,”
Annals of Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
mla: Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes.” Annals of
Mathematics and Artificial Intelligence, vol. 13, no. 3, 1995.
short: H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence
13 (1995).
date_created: 2018-06-05T08:38:41Z
date_updated: 2022-01-06T06:58:53Z
department:
- _id: '64'
extern: '1'
intvolume: ' 13'
issue: '3'
language:
- iso: eng
publication: Annals of Mathematics and Artificial Intelligence
publication_identifier:
issn:
- 1573-7470
publication_status: published
quality_controlled: '1'
status: public
title: Approximate matching of polygonal shapes
type: journal_article
user_id: '25078'
volume: 13
year: '1995'
...
---
_id: '3038'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Malik
full_name: Kalfane, Malik
last_name: Kalfane
- first_name: Richard
full_name: Karp, Richard
last_name: Karp
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Michael
full_name: Luby, Michael
last_name: Luby
- first_name: David
full_name: Zuckerman, David
last_name: Zuckerman
citation:
ama: Blömer J, Kalfane M, Karp R, Karpinski M, Luby M, Zuckerman D. An XOR-Based
Erasure-Resilient Coding Scheme. Berkeley, USA; 1995.
apa: Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., & Zuckerman,
D. (1995). An XOR-based erasure-resilient coding scheme. Berkeley, USA.
bibtex: '@book{Blömer_Kalfane_Karp_Karpinski_Luby_Zuckerman_1995, place={Berkeley,
USA}, series={Technical Report, International Computer Science Institute}, title={An
XOR-based erasure-resilient coding scheme}, author={Blömer, Johannes and Kalfane,
Malik and Karp, Richard and Karpinski, Marek and Luby, Michael and Zuckerman,
David}, year={1995}, collection={Technical Report, International Computer Science
Institute} }'
chicago: Blömer, Johannes, Malik Kalfane, Richard Karp, Marek Karpinski, Michael
Luby, and David Zuckerman. An XOR-Based Erasure-Resilient Coding Scheme.
Technical Report, International Computer Science Institute. Berkeley, USA, 1995.
ieee: J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, An
XOR-based erasure-resilient coding scheme. Berkeley, USA, 1995.
mla: Blömer, Johannes, et al. An XOR-Based Erasure-Resilient Coding Scheme.
1995.
short: J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based
Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.
date_created: 2018-06-05T08:40:26Z
date_updated: 2022-01-06T06:58:53Z
ddc:
- '000'
department:
- _id: '64'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:42:49Z
date_updated: 2018-06-05T08:42:49Z
file_id: '3039'
file_name: erasure.pdf
file_size: 261338
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:42:49Z
has_accepted_license: '1'
place: Berkeley, USA
series_title: Technical Report, International Computer Science Institute
status: public
title: An XOR-based erasure-resilient coding scheme
type: report
user_id: '25078'
year: '1995'
...
---
_id: '3045'
author:
- first_name: Johannes
full_name: Blömer, Johannes
last_name: Blömer
citation:
ama: Blömer J. On Kummer Theory and the Number of Roots of Unity in Radical Extensions
of Q. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und
Informatik; 1993.
apa: Blömer, J. (1993). On Kummer theory and the number of roots of unity in
radical extensions of Q. Technical Report, Freie Universität Berlin, Fachbereich
Mathematik und Informatik.
bibtex: '@book{Blömer_1993, title={On Kummer theory and the number of roots of unity
in radical extensions of Q}, publisher={Technical Report, Freie Universität Berlin,
Fachbereich Mathematik und Informatik}, author={Blömer, Johannes}, year={1993}
}'
chicago: Blömer, Johannes. On Kummer Theory and the Number of Roots of Unity
in Radical Extensions of Q. Technical Report, Freie Universität Berlin, Fachbereich
Mathematik und Informatik, 1993.
ieee: J. Blömer, On Kummer theory and the number of roots of unity in radical
extensions of Q. Technical Report, Freie Universität Berlin, Fachbereich Mathematik
und Informatik, 1993.
mla: Blömer, Johannes. On Kummer Theory and the Number of Roots of Unity in Radical
Extensions of Q. Technical Report, Freie Universität Berlin, Fachbereich Mathematik
und Informatik, 1993.
short: J. Blömer, On Kummer Theory and the Number of Roots of Unity in Radical Extensions
of Q, Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik,
1993.
date_created: 2018-06-05T08:48:42Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
extern: '1'
publisher: Technical Report, Freie Universität Berlin, Fachbereich Mathematik und
Informatik
status: public
title: On Kummer theory and the number of roots of unity in radical extensions of
Q
type: report
user_id: '25078'
year: '1993'
...
---
_id: '3043'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: Blömer J. Simplifying Expressions Involving Radicals. PhD thesis, Freie
Universität Berlin, Fachbereich Mathematik und Informatik; 1992.
apa: Blömer, J. (1992). Simplifying Expressions Involving Radicals. PhD thesis,
Freie Universität Berlin, Fachbereich Mathematik und Informatik.
bibtex: '@book{Blömer_1992, title={Simplifying Expressions Involving Radicals},
publisher={PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik},
author={Blömer, Johannes}, year={1992} }'
chicago: Blömer, Johannes. Simplifying Expressions Involving Radicals. PhD
thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
ieee: J. Blömer, Simplifying Expressions Involving Radicals. PhD thesis,
Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
mla: Blömer, Johannes. Simplifying Expressions Involving Radicals. PhD thesis,
Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
short: J. Blömer, Simplifying Expressions Involving Radicals, PhD thesis, Freie
Universität Berlin, Fachbereich Mathematik und Informatik, 1992.
date_created: 2018-06-05T08:46:51Z
date_updated: 2022-01-06T06:58:54Z
ddc:
- '000'
department:
- _id: '64'
extern: '1'
file:
- access_level: closed
content_type: application/pdf
creator: feidens
date_created: 2018-06-05T08:47:26Z
date_updated: 2018-06-05T08:47:26Z
file_id: '3044'
file_name: JohannesThesisAbstract.pdf
file_size: 40741
relation: main_file
success: 1
file_date_updated: 2018-06-05T08:47:26Z
has_accepted_license: '1'
publication_status: published
publisher: PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik
status: public
title: Simplifying Expressions Involving Radicals
type: dissertation
user_id: '25078'
year: '1992'
...
---
_id: '3046'
author:
- first_name: Helmut
full_name: Alt, Helmut
last_name: Alt
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: Data
Structures and Efficient Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg;
1992:1-24. doi:10.1007/3-540-55488-2_19'
apa: 'Alt, H., & Blömer, J. (1992). Resemblance and symmetries of geometric
patterns. In Data structures and efficient algorithms (pp. 1–24). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55488-2_19'
bibtex: '@inbook{Alt_Blömer_1992, place={Berlin, Heidelberg}, title={Resemblance
and symmetries of geometric patterns}, DOI={10.1007/3-540-55488-2_19},
booktitle={Data structures and efficient algorithms}, publisher={Springer Berlin
Heidelberg}, author={Alt, Helmut and Blömer, Johannes}, year={1992}, pages={1–24}
}'
chicago: 'Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric
Patterns.” In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg:
Springer Berlin Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_19.'
ieee: 'H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,”
in Data structures and efficient algorithms, Berlin, Heidelberg: Springer
Berlin Heidelberg, 1992, pp. 1–24.'
mla: Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric
Patterns.” Data Structures and Efficient Algorithms, Springer Berlin Heidelberg,
1992, pp. 1–24, doi:10.1007/3-540-55488-2_19.
short: 'H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer
Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.'
date_created: 2018-06-05T08:51:15Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
doi: 10.1007/3-540-55488-2_19
page: 1-24
place: Berlin, Heidelberg
publication: Data structures and efficient algorithms
publication_identifier:
isbn:
- '9783540554882'
- '9783540471035'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Resemblance and symmetries of geometric patterns
type: book_chapter
user_id: '25078'
year: '1992'
...
---
_id: '3047'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Blömer J. How to denest Ramanujan’s nested radicals. In: Proceedings.,
33rd Annual Symposium on Foundations of Computer Science. IEEE; 1992. doi:10.1109/sfcs.1992.267807'
apa: Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In Proceedings.,
33rd Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/sfcs.1992.267807
bibtex: '@inproceedings{Blömer_1992, title={How to denest Ramanujan’s nested radicals},
DOI={10.1109/sfcs.1992.267807},
booktitle={Proceedings., 33rd Annual Symposium on Foundations of Computer Science},
publisher={IEEE}, author={Blömer, Johannes}, year={1992} }'
chicago: Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” In Proceedings.,
33rd Annual Symposium on Foundations of Computer Science. IEEE, 1992. https://doi.org/10.1109/sfcs.1992.267807.
ieee: J. Blömer, “How to denest Ramanujan’s nested radicals,” in Proceedings.,
33rd Annual Symposium on Foundations of Computer Science, 1992.
mla: Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” Proceedings.,
33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992, doi:10.1109/sfcs.1992.267807.
short: 'J. Blömer, in: Proceedings., 33rd Annual Symposium on Foundations of Computer
Science, IEEE, 1992.'
date_created: 2018-06-05T08:52:51Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
doi: 10.1109/sfcs.1992.267807
extern: '1'
publication: Proceedings., 33rd Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '0818629002'
publication_status: published
publisher: IEEE
status: public
title: How to denest Ramanujan's nested radicals
type: conference
user_id: '25078'
year: '1992'
...
---
_id: '3048'
author:
- first_name: Helmut
full_name: Alt, Helmut
last_name: Alt
- first_name: Bernd
full_name: Behrends, Bernd
last_name: Behrends
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes (extended
abstract). In: Proceedings of the Seventh Annual Symposium on Computational
Geometry - SCG ’91. ACM Press; 1991. doi:10.1145/109648.109669'
apa: Alt, H., Behrends, B., & Blömer, J. (1991). Approximate matching of polygonal
shapes (extended abstract). In Proceedings of the seventh annual symposium
on Computational geometry - SCG ’91. ACM Press. https://doi.org/10.1145/109648.109669
bibtex: '@inproceedings{Alt_Behrends_Blömer_1991, title={Approximate matching of
polygonal shapes (extended abstract)}, DOI={10.1145/109648.109669},
booktitle={Proceedings of the seventh annual symposium on Computational geometry
- SCG ’91}, publisher={ACM Press}, author={Alt, Helmut and Behrends, Bernd and
Blömer, Johannes}, year={1991} }'
chicago: Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching
of Polygonal Shapes (Extended Abstract).” In Proceedings of the Seventh Annual
Symposium on Computational Geometry - SCG ’91. ACM Press, 1991. https://doi.org/10.1145/109648.109669.
ieee: H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes
(extended abstract),” in Proceedings of the seventh annual symposium on Computational
geometry - SCG ’91, 1991.
mla: Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes (Extended Abstract).”
Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG
’91, ACM Press, 1991, doi:10.1145/109648.109669.
short: 'H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium
on Computational Geometry - SCG ’91, ACM Press, 1991.'
date_created: 2018-06-05T08:54:37Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
doi: 10.1145/109648.109669
extern: '1'
publication: Proceedings of the seventh annual symposium on Computational geometry -
SCG '91
publication_identifier:
isbn:
- '0897914260'
publication_status: published
publisher: ACM Press
status: public
title: Approximate matching of polygonal shapes (extended abstract)
type: conference
user_id: '25078'
year: '1991'
...
---
_id: '3049'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Blömer J. Computing sums of radicals in polynomial time. In: Proceedings
32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc.
Press; 1991. doi:10.1109/sfcs.1991.185434'
apa: Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings
32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc.
Press. https://doi.org/10.1109/sfcs.1991.185434
bibtex: '@inproceedings{Blömer_1991, title={Computing sums of radicals in polynomial
time}, DOI={10.1109/sfcs.1991.185434},
booktitle={Proceedings 32nd Annual Symposium of Foundations of Computer Science},
publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={1991} }'
chicago: Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In Proceedings
32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc.
Press, 1991. https://doi.org/10.1109/sfcs.1991.185434.
ieee: J. Blömer, “Computing sums of radicals in polynomial time,” in Proceedings
32nd Annual Symposium of Foundations of Computer Science, 1991.
mla: Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” Proceedings
32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc.
Press, 1991, doi:10.1109/sfcs.1991.185434.
short: 'J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer
Science, IEEE Comput. Soc. Press, 1991.'
date_created: 2018-06-05T08:56:01Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
doi: 10.1109/sfcs.1991.185434
extern: '1'
publication: Proceedings 32nd Annual Symposium of Foundations of Computer Science
publication_identifier:
isbn:
- '0818624450'
publication_status: published
publisher: IEEE Comput. Soc. Press
status: public
title: Computing sums of radicals in polynomial time
type: conference
user_id: '25078'
year: '1991'
...
---
_id: '3050'
author:
- first_name: Helmut
full_name: Alt, Helmut
last_name: Alt
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Hubert
full_name: Wagener, Hubert
last_name: Wagener
citation:
ama: 'Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: Automata,
Languages and Programming. Berlin/Heidelberg: Springer-Verlag; 1990:703-716.
doi:10.1007/bfb0032068'
apa: 'Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons.
In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg:
Springer-Verlag. https://doi.org/10.1007/bfb0032068'
bibtex: '@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation
of convex polygons}, DOI={10.1007/bfb0032068},
booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag},
author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716}
}'
chicago: 'Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex
Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg:
Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.'
ieee: 'H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in
Automata, Languages and Programming, Berlin/Heidelberg: Springer-Verlag,
1990, pp. 703–716.'
mla: Alt, Helmut, et al. “Approximation of Convex Polygons.” Automata, Languages
and Programming, Springer-Verlag, 1990, pp. 703–16, doi:10.1007/bfb0032068.
short: 'H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming,
Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.'
date_created: 2018-06-05T08:56:43Z
date_updated: 2022-01-06T06:58:54Z
department:
- _id: '64'
- _id: '63'
doi: 10.1007/bfb0032068
extern: '1'
language:
- iso: eng
page: 703-716
place: Berlin/Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '3540528261'
publication_status: published
publisher: Springer-Verlag
status: public
title: Approximation of convex polygons
type: book_chapter
user_id: '14955'
year: '1990'
...