---
_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: '16733'
author:
- first_name: Martin
full_name: Dietzfelbinger, Martin
last_name: Dietzfelbinger
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing,
with applications to shared memory simulations. In: Data Structures and Efficient
Algorithms. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55488-2_31'
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). High performance
universal hashing, with applications to shared memory simulations. In Data
structures and efficient algorithms. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55488-2_31
bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg},
title={High performance universal hashing, with applications to shared memory
simulations}, DOI={10.1007/3-540-55488-2_31},
booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger,
Martin and Meyer auf der Heide, Friedhelm}, year={1992} }'
chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance
Universal Hashing, with Applications to Shared Memory Simulations.” In Data
Structures and Efficient Algorithms. Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_31.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal
hashing, with applications to shared memory simulations,” in Data structures
and efficient algorithms, Berlin, Heidelberg, 1992.
mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance
Universal Hashing, with Applications to Shared Memory Simulations.” Data Structures
and Efficient Algorithms, 1992, doi:10.1007/3-540-55488-2_31.
short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient
Algorithms, Berlin, Heidelberg, 1992.'
date_created: 2020-04-20T11:27:50Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-55488-2_31
language:
- iso: eng
place: Berlin, Heidelberg
publication: Data structures and efficient algorithms
publication_identifier:
isbn:
- '9783540554882'
- '9783540471035'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: High performance universal hashing, with applications to shared memory simulations
type: book_chapter
user_id: '15415'
year: '1992'
...