---
_id: '16693'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Thomas
full_name: Decker, Thomas
last_name: Decker
citation:
ama: 'Meyer auf der Heide F, Decker T. Parallel Computing in Paderborn: The SFB
376 “Massive Parallelism — Algorithms, Design Methods, Applications.” In: Informatik
’97 Informatik Als Innovationsmotor. Berlin, Heidelberg; 1997. doi:10.1007/978-3-642-60831-5_22'
apa: 'Meyer auf der Heide, F., & Decker, T. (1997). Parallel Computing in Paderborn:
The SFB 376 “Massive Parallelism — Algorithms, Design Methods, Applications.”
In Informatik ’97 Informatik als Innovationsmotor. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-60831-5_22'
bibtex: '@inbook{Meyer auf der Heide_Decker_1997, place={Berlin, Heidelberg}, title={Parallel
Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms, Design
Methods, Applications”}, DOI={10.1007/978-3-642-60831-5_22},
booktitle={Informatik ’97 Informatik als Innovationsmotor}, author={Meyer auf
der Heide, Friedhelm and Decker, Thomas}, year={1997} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing
in Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
In Informatik ’97 Informatik Als Innovationsmotor. Berlin, Heidelberg,
1997. https://doi.org/10.1007/978-3-642-60831-5_22.'
ieee: 'F. Meyer auf der Heide and T. Decker, “Parallel Computing in Paderborn: The
SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications,’” in
Informatik ’97 Informatik als Innovationsmotor, Berlin, Heidelberg, 1997.'
mla: 'Meyer auf der Heide, Friedhelm, and Thomas Decker. “Parallel Computing in
Paderborn: The SFB 376 ‘Massive Parallelism — Algorithms, Design Methods, Applications.’”
Informatik ’97 Informatik Als Innovationsmotor, 1997, doi:10.1007/978-3-642-60831-5_22.'
short: 'F. Meyer auf der Heide, T. Decker, in: Informatik ’97 Informatik Als Innovationsmotor,
Berlin, Heidelberg, 1997.'
date_created: 2020-04-16T10:48:16Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/978-3-642-60831-5_22
language:
- iso: eng
place: Berlin, Heidelberg
publication: Informatik ’97 Informatik als Innovationsmotor
publication_identifier:
isbn:
- '9783540630661'
- '9783642608315'
issn:
- 1431-472X
publication_status: published
status: public
title: 'Parallel Computing in Paderborn: The SFB 376 “Massive Parallelism — Algorithms,
Design Methods, Applications”'
type: book_chapter
user_id: '15415'
year: '1997'
...
---
_id: '19958'
author:
- first_name: Frank
full_name: Schwarze, Frank
last_name: Schwarze
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Klaus
full_name: Schröder, Klaus
last_name: Schröder
citation:
ama: Schwarze F, Meyer auf der Heide F, Schröder K. Routing on Networks of Optical
Crossbars (Extended Abstract). Euro-Par 1996. 1996;I:299-306.
apa: Schwarze, F., Meyer auf der Heide, F., & Schröder, K. (1996). Routing on
Networks of Optical Crossbars (Extended Abstract). Euro-Par 1996, I,
299–306.
bibtex: '@article{Schwarze_Meyer auf der Heide_Schröder_1996, title={Routing on
Networks of Optical Crossbars (Extended Abstract).}, volume={I}, journal={Euro-Par
1996}, author={Schwarze, Frank and Meyer auf der Heide, Friedhelm and Schröder,
Klaus}, year={1996}, pages={299–306} }'
chicago: 'Schwarze, Frank, Friedhelm Meyer auf der Heide, and Klaus Schröder. “Routing
on Networks of Optical Crossbars (Extended Abstract).” Euro-Par 1996 I
(1996): 299–306.'
ieee: F. Schwarze, F. Meyer auf der Heide, and K. Schröder, “Routing on Networks
of Optical Crossbars (Extended Abstract).,” Euro-Par 1996, vol. I, pp.
299–306, 1996.
mla: Schwarze, Frank, et al. “Routing on Networks of Optical Crossbars (Extended
Abstract).” Euro-Par 1996, vol. I, 1996, pp. 299–306.
short: F. Schwarze, F. Meyer auf der Heide, K. Schröder, Euro-Par 1996 I (1996)
299–306.
date_created: 2020-10-08T12:04:41Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
language:
- iso: eng
page: 299-306
publication: Euro-Par 1996
status: public
title: Routing on Networks of Optical Crossbars (Extended Abstract).
type: journal_article
user_id: '15415'
volume: I
year: '1996'
...
---
_id: '17418'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Czumaj A, Meyer auf der Heide F, Stemann V. Contention Resolution in Hashing
Based Shared Memory Simulations.; 1996.
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1996). Contention
Resolution in Hashing Based Shared Memory Simulations.
bibtex: '@book{Czumaj_Meyer auf der Heide_Stemann_1996, series={Technical Report
SFB, University of Paderborn}, title={Contention Resolution in Hashing Based Shared
Memory Simulations}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm
and Stemann, Volker}, year={1996}, collection={Technical Report SFB, University
of Paderborn} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. Contention
Resolution in Hashing Based Shared Memory Simulations. Technical Report SFB,
University of Paderborn, 1996.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, Contention Resolution
in Hashing Based Shared Memory Simulations. 1996.
mla: Czumaj, Artur, et al. Contention Resolution in Hashing Based Shared Memory
Simulations. 1996.
short: A. Czumaj, F. Meyer auf der Heide, V. Stemann, Contention Resolution in Hashing
Based Shared Memory Simulations, 1996.
date_created: 2020-07-27T13:03:41Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
language:
- iso: eng
report_number: tr-rsfb-96-005
series_title: Technical Report SFB, University of Paderborn
status: public
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: report
user_id: '15415'
year: '1996'
...
---
_id: '17419'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
author:
- first_name: Dima
full_name: Grigoriev, Dima
last_name: Grigoriev
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Roman
full_name: Smolensky, Roman
last_name: Smolensky
citation:
ama: 'Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol
65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics
and Visualization; 1996:612-621.'
apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R.
(1996). A lower bound for randomized algebraic decision trees. In Proc. of
28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel
Graphics and Visualization.
bibtex: '@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996,
series={Lecture Notes in Computer Science}, title={A lower bound for randomized
algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC},
publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev,
Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman},
year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }'
chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc.
of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics
Symposium on Parallel Graphics and Visualization, 1996.
ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC,
1996, vol. 65453, pp. 612–621.
mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel
Graphics and Visualization, 1996, pp. 612–21.
short: 'D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc.
of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization,
1996, pp. 612–621.'
date_created: 2020-07-27T13:09:09Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
intvolume: ' 65453'
language:
- iso: eng
page: 612-621
publication: Proc. of 28th ACM-STOC
publisher: Eurographics Symposium on Parallel Graphics and Visualization
series_title: Lecture Notes in Computer Science
status: public
title: A lower bound for randomized algebraic decision trees
type: conference
user_id: '15415'
volume: 65453
year: '1996'
...
---
_id: '17483'
abstract:
- lang: eng
text: "In this paper we develop a model for communication time on parallel computers
consisting of processors and a service network, i.e., a network performing services
like broadcast, synchronization, and global variables. The implementation of the
service network is done on a free configurable Transputer network.\r\nOur cost
model describes the communication time of accesses to global variables and consists
of a multi-linear function. The cost model includes the parameters packet size,
send hot spot, and the number of processors accessing global variables. These
parameters influence the communication time in a high degree and capture important
parameters like contention.\r\nWe implement a Bitonic Sort and a Connected Components
algorithm (among others) and we show that our model is able to predict the communication
time within a 10% error if indirect service networks are used. The applications
show that it is easy for a programmer to determine the parameter values for our
model and that our new cost model precisely predicts the communication time of
parallel algorithms.\r\nFurthermore, we minimize the communication time of accesses
to global variables by finding a balance between the number of messages in the
network and their size. Our model predicts the optimal values for these parameters
which we validate by experiments. A modified implementation of our routing which
determines on-line the optimal parameter values for an access to a global variable
achieves good speed ups."
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jochen
full_name: Rethmann, Jochen
last_name: Rethmann
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: 'Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication
Time in Parallel Programs. In: 3rd Workshop on Abstract Machine Models for
Parallel and Distributed Computing (AMW ’96). Amsterdam: IOS Press; 1996:13–27.'
apa: 'Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost Model
for the Communication Time in Parallel Programs. In 3rd Workshop on Abstract
Machine Models for Parallel and Distributed Computing (AMW ’96) (pp. 13–27).
Amsterdam: IOS Press.'
bibtex: '@inproceedings{Fischer_Rethmann_Wachsmann_1996, place={Amsterdam}, title={A
Realistic Cost Model for the Communication Time in Parallel Programs}, booktitle={3rd
Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW
’96)}, publisher={IOS Press}, author={Fischer, Matthias and Rethmann, Jochen and
Wachsmann, Alf}, year={1996}, pages={13–27} }'
chicago: 'Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost
Model for the Communication Time in Parallel Programs.” In 3rd Workshop on
Abstract Machine Models for Parallel and Distributed Computing (AMW ’96),
13–27. Amsterdam: IOS Press, 1996.'
ieee: M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the
Communication Time in Parallel Programs,” in 3rd Workshop on Abstract Machine
Models for Parallel and Distributed Computing (AMW ’96), 1996, pp. 13–27.
mla: Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time
in Parallel Programs.” 3rd Workshop on Abstract Machine Models for Parallel
and Distributed Computing (AMW ’96), IOS Press, 1996, pp. 13–27.
short: 'M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine
Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam,
1996, pp. 13–27.'
date_created: 2020-07-30T14:45:12Z
date_updated: 2022-01-06T06:53:13Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T10:15:36Z
date_updated: 2020-08-26T10:15:36Z
file_id: '18354'
file_name: hni-1454.pdf
file_size: 285707
relation: main_file
success: 1
file_date_updated: 2020-08-26T10:15:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 13–27
place: Amsterdam
publication: 3rd Workshop on Abstract Machine Models for Parallel and Distributed
Computing (AMW '96)
publication_identifier:
isbn:
- 905199267X
publisher: IOS Press
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs
type: conference
user_id: '15415'
year: '1996'
...
---
_id: '17564'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel
algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture
Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725'
apa: 'Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996).
Realistic parallel algorithms: Priority queue operations and selection for the
BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin,
Heidelberg. https://doi.org/10.1007/bfb0024725'
bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin,
Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and
selection for the BSP* Model}, DOI={10.1007/bfb0024725},
booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376}
}'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and
Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection
for the BSP* Model.” In Lecture Notes in Computer Science, 369–76. Berlin,
Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.'
ieee: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic
parallel algorithms: Priority queue operations and selection for the BSP* Model,”
in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
mla: 'Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations
and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996,
pp. 369–76, doi:10.1007/bfb0024725.'
short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture
Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.'
date_created: 2020-08-03T13:11:02Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
doi: 10.1007/bfb0024725
language:
- iso: eng
page: 369-376
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540616276'
- '9783540706366'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Realistic parallel algorithms: Priority queue operations and selection for
the BSP* Model'
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '18352'
abstract:
- lang: eng
text: "In this report, we develop a cost model for the communication time on parallel
computers consisting of processors and a service network, i.e., a network performing
services like broadcast, synchronization, and global variables. Because we do
not have a parallel computer at our disposal that is equipped with a service network,
we emulate the service network on a reconfigurable Transputer network.\r\nOur
cost model describes the communication time of accesses to global variables and
consists of a multilinear function. The cost model includes the parameters packet
size, send hot spot (the number of messages sent out by one processor), and number
of processors accessing global variables. We show that these parameters influence
the communication time in a high degree and capture important parameters like
network contention.\r\nWe implement a Bitonic Sort, Sample Sort, Matrix Multiplication,
and Connected Components algorithm, and we show that our model is able to predict
the communication time within a 10% error if indirect service networks are used.
The applications show that it is easy for a programer to determine the parameter
values for our model and that our new cost model precisely predicts the communication
time of parallel algorithms.\r\nWe explore the interaction of hot spots and asynchrony
and show that the influence of hot spots to the communication time is not as high
as one would expect from theoretical considerations in a synchronous model. Therefore,
we do not apprehend the hot spot in our cost model.\r\nFurthermore, we minimize
the communication time of accesses to global variables by finding a balance between
the number of messages in the network and their size. Our model predicts the optimal
values for these parameters which we validate by experiments. A modified implementation
of our routing which determines online the optimal parameter values for an access
to a global variable achieves good speed ups.\r\n"
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Jochen
full_name: Rethmann, Jochen
last_name: Rethmann
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication
Time in Parallel Programs on Parallel Computers Using a Service Hardware.
Universität Paderborn; 1996.
apa: Fischer, M., Rethmann, J., & Wachsmann, A. (1996). A Realistic Cost
Model for the Communication Time in Parallel Programs on Parallel Computers Using
a Service Hardware. Universität Paderborn.
bibtex: '@book{Fischer_Rethmann_Wachsmann_1996, place={Universität Paderborn}, title={A
Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
Computers Using a Service Hardware}, author={Fischer, Matthias and Rethmann, Jochen
and Wachsmann, Alf}, year={1996} }'
chicago: Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. A Realistic Cost
Model for the Communication Time in Parallel Programs on Parallel Computers Using
a Service Hardware. Universität Paderborn, 1996.
ieee: M. Fischer, J. Rethmann, and A. Wachsmann, A Realistic Cost Model for the
Communication Time in Parallel Programs on Parallel Computers Using a Service
Hardware. Universität Paderborn, 1996.
mla: Fischer, Matthias, et al. A Realistic Cost Model for the Communication Time
in Parallel Programs on Parallel Computers Using a Service Hardware. 1996.
short: M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication
Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität
Paderborn, 1996.
date_created: 2020-08-26T10:06:31Z
date_updated: 2022-01-06T06:53:30Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T10:05:35Z
date_updated: 2020-08-26T10:05:35Z
file_id: '18353'
file_name: tr-rsfb-96-007.pdf
file_size: 519632
relation: main_file
success: 1
file_date_updated: 2020-08-26T10:05:35Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
title: A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel
Computers Using a Service Hardware
type: report
user_id: '15415'
year: '1996'
...
---
_id: '2181'
author:
- first_name: Christian
full_name: Scheideler, Christian
last_name: Scheideler
citation:
ama: Scheideler C. Universal Routing Strategies. University of Paderborn,
Germany; 1996.
apa: Scheideler, C. (1996). Universal routing strategies. University of Paderborn,
Germany.
bibtex: '@book{Scheideler_1996, title={Universal routing strategies}, publisher={University
of Paderborn, Germany}, author={Scheideler, Christian}, year={1996} }'
chicago: Scheideler, Christian. Universal Routing Strategies. University
of Paderborn, Germany, 1996.
ieee: C. Scheideler, Universal routing strategies. University of Paderborn,
Germany, 1996.
mla: Scheideler, Christian. Universal Routing Strategies. University of Paderborn,
Germany, 1996.
short: C. Scheideler, Universal Routing Strategies, University of Paderborn, Germany,
1996.
date_created: 2018-04-03T09:29:45Z
date_updated: 2022-01-06T06:55:15Z
department:
- _id: '79'
- _id: '63'
language:
- iso: eng
publisher: University of Paderborn, Germany
status: public
title: Universal routing strategies
type: dissertation
user_id: '14955'
year: '1996'
...
---
_id: '2182'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy
to Speed up Randomized Shared Memory Simulations. Theor Comput Sci. 1996;(2):245--281.
doi:10.1016/0304-3975(96)00032-1
apa: Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1996). Exploiting
Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor.
Comput. Sci., (2), 245--281. https://doi.org/10.1016/0304-3975(96)00032-1
bibtex: '@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting
Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={10.1016/0304-3975(96)00032-1},
number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281}
}'
chicago: 'Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann.
“Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”
Theor. Comput. Sci., no. 2 (1996): 245--281. https://doi.org/10.1016/0304-3975(96)00032-1.'
ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage
Redundancy to Speed up Randomized Shared Memory Simulations,” Theor. Comput.
Sci., no. 2, pp. 245--281, 1996.
mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
up Randomized Shared Memory Simulations.” Theor. Comput. Sci., no. 2, 1996,
pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
short: F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996)
245--281.
date_created: 2018-04-03T09:30:20Z
date_updated: 2022-01-06T06:55:16Z
department:
- _id: '79'
- _id: '63'
doi: 10.1016/0304-3975(96)00032-1
issue: '2'
language:
- iso: eng
page: 245--281
publication: Theor. Comput. Sci.
status: public
title: Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
type: journal_article
user_id: '14955'
year: '1996'
...
---
_id: '2183'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers:
Turning Offline into Online Protocols. In: FOCS. ; 1996:370--379.'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (1996). Deterministic Routing
with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp.
370--379).'
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic
Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS},
author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996},
pages={370--379} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS,
370--379, 1996.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded
Buffers: Turning Offline into Online Protocols,” in FOCS, 1996, pp. 370--379.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996,
pp. 370--379.'
short: 'F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.'
date_created: 2018-04-03T09:31:52Z
date_updated: 2022-01-06T06:55:17Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:01:11Z
date_updated: 2018-04-12T07:10:17Z
file_id: '2281'
file_name: FOCS96.pdf
file_size: 248409
relation: main_file
file_date_updated: 2018-04-12T07:10:17Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 370--379
publication: FOCS
status: public
title: 'Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols'
type: conference
urn: '21832'
user_id: '14955'
year: '1996'
...
---
_id: '2184'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In:
SOFSEM. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.'
apa: Meyer auf der Heide, F., & Scheideler, C. (1996). Communication in Parallel
Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes
in Computer Science}, title={Communication in Parallel Systems}, volume={1175},
booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm
and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes
in Computer Science} }'
chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication
in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer
Science. Springer, 1996.
ieee: F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,”
in SOFSEM, 1996, vol. 1175, pp. 16--33.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in
Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
short: 'F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33.'
date_created: 2018-04-03T09:32:47Z
date_updated: 2022-01-06T06:55:17Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:01:59Z
date_updated: 2018-04-12T07:10:36Z
file_id: '2282'
file_name: SOFSEM96.pdf
file_size: 597639
relation: main_file
file_date_updated: 2018-04-12T07:10:36Z
has_accepted_license: '1'
intvolume: ' 1175'
language:
- iso: eng
oa: '1'
page: 16--33
publication: SOFSEM
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Communication in Parallel Systems
type: conference
urn: '21840'
user_id: '14955'
volume: 1175
year: '1996'
...
---
_id: '2186'
author:
- first_name: Robert
full_name: Cypher, Robert
last_name: Cypher
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms
for Store-and-Forward and Wormhole Routing. In: STOC. ACM; 1996:356--365.'
apa: Cypher, R., Meyer auf der Heide, F., Scheideler, C., & Vöcking, B. (1996).
Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC
(pp. 356--365). ACM.
bibtex: '@inproceedings{Cypher_Meyer auf der Heide_Scheideler_Vöcking_1996, title={Universal
Algorithms for Store-and-Forward and Wormhole Routing}, booktitle={STOC}, publisher={ACM},
author={Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian
and Vöcking, Berthold}, year={1996}, pages={356--365} }'
chicago: Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and
Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.”
In STOC, 356--365. ACM, 1996.
ieee: R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal
Algorithms for Store-and-Forward and Wormhole Routing,” in STOC, 1996,
pp. 356--365.
mla: Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole
Routing.” STOC, ACM, 1996, pp. 356--365.
short: 'R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC,
ACM, 1996, pp. 356--365.'
date_created: 2018-04-03T09:39:17Z
date_updated: 2022-01-06T06:55:18Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:58:59Z
date_updated: 2018-04-12T07:11:03Z
file_id: '2280'
file_name: STOC96.pdf
file_size: 700595
relation: main_file
file_date_updated: 2018-04-12T07:11:03Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 356--365
publication: STOC
publisher: ACM
status: public
title: Universal Algorithms for Store-and-Forward and Wormhole Routing
type: conference
urn: '21868'
user_id: '14955'
year: '1996'
...
---
_id: '16698'
author:
- first_name: Foued
full_name: Ameur, Foued
last_name: Ameur
- first_name: Paul
full_name: Fischer, Paul
last_name: Fischer
- first_name: Klaus -U.
full_name: Höffgen, Klaus -U.
last_name: Höffgen
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A
new approach to space-bounded learning. Acta Informatica. 1996:621-630.
doi:10.1007/bf03036467
apa: Ameur, F., Fischer, P., Höffgen, K.-U., & Meyer auf der Heide, F. (1996).
Trial and error. A new approach to space-bounded learning. Acta Informatica,
621–630. https://doi.org/10.1007/bf03036467
bibtex: '@article{Ameur_Fischer_Höffgen_Meyer auf der Heide_1996, title={Trial and
error. A new approach to space-bounded learning}, DOI={10.1007/bf03036467},
journal={Acta Informatica}, author={Ameur, Foued and Fischer, Paul and Höffgen,
Klaus -U. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={621–630} }'
chicago: Ameur, Foued, Paul Fischer, Klaus -U. Höffgen, and Friedhelm Meyer auf
der Heide. “Trial and Error. A New Approach to Space-Bounded Learning.” Acta
Informatica, 1996, 621–30. https://doi.org/10.1007/bf03036467.
ieee: F. Ameur, P. Fischer, K.-U. Höffgen, and F. Meyer auf der Heide, “Trial and
error. A new approach to space-bounded learning,” Acta Informatica, pp.
621–630, 1996.
mla: Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.”
Acta Informatica, 1996, pp. 621–30, doi:10.1007/bf03036467.
short: F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica
(1996) 621–630.
date_created: 2020-04-16T11:40:05Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bf03036467
language:
- iso: eng
page: 621-630
publication: Acta Informatica
publication_identifier:
issn:
- 0001-5903
- 1432-0525
publication_status: published
status: public
title: Trial and error. A new approach to space-bounded learning
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16699'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Brigitte
full_name: Oesterdiekhoff, Brigitte
last_name: Oesterdiekhoff
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution.
Algorithmica. Published online 1996:413-427. doi:10.1007/bf01955042
apa: Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1996). Strongly
adaptive token distribution. Algorithmica, 413–427. https://doi.org/10.1007/bf01955042
bibtex: '@article{Meyer auf der Heide_Oesterdiekhoff_Wanka_1996, title={Strongly
adaptive token distribution}, DOI={10.1007/bf01955042},
journal={Algorithmica}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff,
Brigitte and Wanka, Rolf}, year={1996}, pages={413–427} }'
chicago: Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka.
“Strongly Adaptive Token Distribution.” Algorithmica, 1996, 413–27. https://doi.org/10.1007/bf01955042.
ieee: 'F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive
token distribution,” Algorithmica, pp. 413–427, 1996, doi: 10.1007/bf01955042.'
mla: Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”
Algorithmica, 1996, pp. 413–27, doi:10.1007/bf01955042.
short: F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996)
413–427.
date_created: 2020-04-16T11:46:56Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bf01955042
language:
- iso: eng
page: 413-427
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
status: public
title: Strongly adaptive token distribution
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16700'
author:
- first_name: R. M.
full_name: Karp, R. M.
last_name: Karp
- first_name: M.
full_name: Luby, M.
last_name: Luby
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed
memory machine. Algorithmica. 1996:517-542. doi:10.1007/bf01940878
apa: Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1996). Efficient PRAM
simulation on a distributed memory machine. Algorithmica, 517–542. https://doi.org/10.1007/bf01940878
bibtex: '@article{Karp_Luby_Meyer auf der Heide_1996, title={Efficient PRAM simulation
on a distributed memory machine}, DOI={10.1007/bf01940878},
journal={Algorithmica}, author={Karp, R. M. and Luby, M. and Meyer auf der Heide,
Friedhelm}, year={1996}, pages={517–542} }'
chicago: Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM
Simulation on a Distributed Memory Machine.” Algorithmica, 1996, 517–42.
https://doi.org/10.1007/bf01940878.
ieee: R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation
on a distributed memory machine,” Algorithmica, pp. 517–542, 1996.
mla: Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.”
Algorithmica, 1996, pp. 517–42, doi:10.1007/bf01940878.
short: R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.
date_created: 2020-04-16T11:50:27Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/bf01940878
language:
- iso: eng
page: 517-542
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
- 1432-0541
publication_status: published
status: public
title: Efficient PRAM simulation on a distributed memory machine
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16701'
author:
- first_name: Joseph
full_name: Gil, Joseph
last_name: Gil
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: 'Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower
and Upper Bounds. SIAM Journal on Computing. 1996:936-955. doi:10.1137/s0097539793255722'
apa: 'Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1996). The Tree Model
for Hashing: Lower and Upper Bounds. SIAM Journal on Computing, 936–955.
https://doi.org/10.1137/s0097539793255722'
bibtex: '@article{Gil_Meyer auf der Heide_Wigderson_1996, title={The Tree Model
for Hashing: Lower and Upper Bounds}, DOI={10.1137/s0097539793255722},
journal={SIAM Journal on Computing}, author={Gil, Joseph and Meyer auf der Heide,
Friedhelm and Wigderson, Avi}, year={1996}, pages={936–955} }'
chicago: 'Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree
Model for Hashing: Lower and Upper Bounds.” SIAM Journal on Computing,
1996, 936–55. https://doi.org/10.1137/s0097539793255722.'
ieee: 'J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing:
Lower and Upper Bounds,” SIAM Journal on Computing, pp. 936–955, 1996.'
mla: 'Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.”
SIAM Journal on Computing, 1996, pp. 936–55, doi:10.1137/s0097539793255722.'
short: J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996)
936–955.
date_created: 2020-04-16T11:53:57Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1137/s0097539793255722
language:
- iso: eng
page: 936-955
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'The Tree Model for Hashing: Lower and Upper Bounds'
type: journal_article
user_id: '15415'
year: '1996'
...
---
_id: '16702'
citation:
ama: Meyer auf der Heide F, Monien B, eds. Automata, Languages and Programming,
23rd International Colloquium, ICALP96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-61440-0
apa: Meyer auf der Heide, F., & Monien, B. (Eds.). (1996). Automata, Languages
and Programming, 23rd International Colloquium, ICALP96. Berlin, Heidelberg.
https://doi.org/10.1007/3-540-61440-0
bibtex: '@book{Meyer auf der Heide_Monien_1996, place={Berlin, Heidelberg}, title={Automata,
Languages and Programming, 23rd International Colloquium, ICALP96}, DOI={10.1007/3-540-61440-0},
year={1996} }'
chicago: Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. Automata,
Languages and Programming, 23rd International Colloquium, ICALP96. Berlin,
Heidelberg, 1996. https://doi.org/10.1007/3-540-61440-0.
ieee: F. Meyer auf der Heide and B. Monien, Eds., Automata, Languages and Programming,
23rd International Colloquium, ICALP96. Berlin, Heidelberg, 1996.
mla: Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. Automata,
Languages and Programming, 23rd International Colloquium, ICALP96. 1996, doi:10.1007/3-540-61440-0.
short: F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming,
23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.
date_created: 2020-04-16T13:25:51Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-61440-0
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Burkhard
full_name: Monien, Burkhard
last_name: Monien
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783540614401'
- '9783540685807'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 23rd International Colloquium, ICALP96
type: book_editor
user_id: '15415'
year: '1996'
...
---
_id: '16703'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory
simulations. In: STACS 96. Berlin, Heidelberg; 1996. doi:10.1007/3-540-60922-9_16'
apa: Berenbrink, P., Meyer auf der Heide, F., & Stemann, V. (1996). Fault-tolerant
shared memory simulations. In STACS 96. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60922-9_16
bibtex: '@inbook{Berenbrink_Meyer auf der Heide_Stemann_1996, place={Berlin, Heidelberg},
title={Fault-tolerant shared memory simulations}, DOI={10.1007/3-540-60922-9_16},
booktitle={STACS 96}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm
and Stemann, Volker}, year={1996} }'
chicago: Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant
Shared Memory Simulations.” In STACS 96. Berlin, Heidelberg, 1996. https://doi.org/10.1007/3-540-60922-9_16.
ieee: P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared
memory simulations,” in STACS 96, Berlin, Heidelberg, 1996.
mla: Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” STACS
96, 1996, doi:10.1007/3-540-60922-9_16.
short: 'P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin,
Heidelberg, 1996.'
date_created: 2020-04-16T13:32:22Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60922-9_16
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 96
publication_identifier:
isbn:
- '9783540609223'
- '9783540497233'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Fault-tolerant shared memory simulations
type: book_chapter
user_id: '15415'
year: '1996'
...
---
_id: '19623'
author:
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: Stemann V. Contention Resolution in Hashing Based Shared Memory Simulations.
Vol 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.
apa: Stemann, V. (1995). Contention Resolution in Hashing Based Shared Memory
Simulations (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Stemann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Contention Resolution in Hashing Based Shared Memory Simulations},
volume={3}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Stemann, Volker}, year={1995}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Stemann, Volker. Contention Resolution in Hashing Based Shared Memory
Simulations. Vol. 3. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
ieee: V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations,
vol. 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
mla: Stemann, Volker. Contention Resolution in Hashing Based Shared Memory Simulations.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
short: V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.
date_created: 2020-09-22T12:28:47Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 3'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-02-7
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Contention Resolution in Hashing Based Shared Memory Simulations
type: dissertation
user_id: '5786'
volume: 3
year: '1995'
...
---
_id: '19627'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Czumaj A. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations.
Vol 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.'
apa: 'Czumaj, A. (1995). Parallel Algorithmic Techniques: PRAM Algorithms and
PRAM Simulations (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.'
bibtex: '@book{Czumaj_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations},
volume={8}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Czumaj, Artur}, year={1995}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: 'Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and
PRAM Simulations. Vol. 8. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.'
ieee: 'A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations,
vol. 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.'
mla: 'Czumaj, Artur. Parallel Algorithmic Techniques: PRAM Algorithms and PRAM
Simulations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
1995.'
short: 'A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.'
date_created: 2020-09-22T12:38:29Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T12:38:15Z
date_updated: 2020-09-22T12:38:15Z
file_id: '19629'
file_name: pub-hni-441.pdf
file_size: 801624
relation: main_file
success: 1
file_date_updated: 2020-09-22T12:38:15Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-07-8
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: 'Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations'
type: dissertation
user_id: '5786'
volume: 8
year: '1995'
...
---
_id: '19630'
author:
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
citation:
ama: 'Wachsmann A. Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing,
Synchronisation, Gemeinsamer Speicher. Vol 6. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn; 1995.'
apa: 'Wachsmann, A. (1995). Eine Bibliothek von Basisdiensten für Parallelrechner:
Routing, Synchronisation, gemeinsamer Speicher (Vol. 6). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.'
bibtex: '@book{Wachsmann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Eine Bibliothek von Basisdiensten für Parallelrechner: Routing,
Synchronisation, gemeinsamer Speicher}, volume={6}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Wachsmann, Alf}, year={1995},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: 'Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner:
Routing, Synchronisation, Gemeinsamer Speicher. Vol. 6. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 1995.'
ieee: 'A. Wachsmann, Eine Bibliothek von Basisdiensten für Parallelrechner: Routing,
Synchronisation, gemeinsamer Speicher, vol. 6. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 1995.'
mla: 'Wachsmann, Alf. Eine Bibliothek von Basisdiensten Für Parallelrechner:
Routing, Synchronisation, Gemeinsamer Speicher. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 1995.'
short: 'A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing,
Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 1995.'
date_created: 2020-09-22T12:40:46Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 6'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-05-1
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: 'Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation,
gemeinsamer Speicher'
type: dissertation
user_id: '5786'
volume: 6
year: '1995'
...
---
_id: '19634'
author:
- first_name: Foued
full_name: Ameur, Foued
last_name: Ameur
citation:
ama: Ameur F. Space-Bounded Learning Algorithms. Vol 10. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 1995.
apa: Ameur, F. (1995). Space-Bounded Learning Algorithms (Vol. 10). Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Ameur_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Space-Bounded Learning Algorithms}, volume={10}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Ameur, Foued}, year={1995}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Ameur, Foued. Space-Bounded Learning Algorithms. Vol. 10. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 1995.
ieee: F. Ameur, Space-Bounded Learning Algorithms, vol. 10. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1995.
mla: Ameur, Foued. Space-Bounded Learning Algorithms. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 1995.
short: F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn, 1995.
date_created: 2020-09-22T12:50:36Z
date_updated: 2022-01-06T06:54:09Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 10'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-09-4
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Space-Bounded Learning Algorithms
type: dissertation
user_id: '5786'
volume: 10
year: '1995'
...
---
_id: '17482'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Simulating shared memory in real
time: On the computation power of reconfigurable meshes. In: Proceedings of
the 2nd IEEE Workshop on Reconfigurable Architectures. ; 1995:46--59.'
apa: 'Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Simulating
shared memory in real time: On the computation power of reconfigurable meshes.
In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures
(pp. 46--59).'
bibtex: '@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Simulating
shared memory in real time: On the computation power of reconfigurable meshes},
booktitle={Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures},
author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker},
year={1995}, pages={46--59} }'
chicago: 'Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating
Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.”
In Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures,
46--59, 1995.'
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating shared memory
in real time: On the computation power of reconfigurable meshes,” in Proceedings
of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.'
mla: 'Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation
Power of Reconfigurable Meshes.” Proceedings of the 2nd IEEE Workshop on Reconfigurable
Architectures, 1995, pp. 46--59.'
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd
IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.'
date_created: 2020-07-30T14:09:45Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
language:
- iso: eng
page: 46--59
publication: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures
status: public
title: 'Simulating shared memory in real time: On the computation power of reconfigurable
meshes'
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '2187'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato
Routing in Vertex-Symmetric Networks. In: ESA. Lecture Notes in Computer
Science. ; 1995:341--354. doi:10.1007/3-540-60313-1_154'
apa: Meyer auf der Heide, F., & Scheideler, C. (1995). Routing with Bounded
Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp.
341--354). https://doi.org/10.1007/3-540-60313-1_154
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1995, series={Lecture Notes
in Computer Science}, title={Routing with Bounded Buffers and Hot-Potato Routing
in Vertex-Symmetric Networks}, DOI={10.1007/3-540-60313-1_154},
booktitle={ESA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian},
year={1995}, pages={341--354}, collection={Lecture Notes in Computer Science}
}'
chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with
Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In ESA,
341--354. Lecture Notes in Computer Science, 1995. https://doi.org/10.1007/3-540-60313-1_154.
ieee: F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and
Hot-Potato Routing in Vertex-Symmetric Networks,” in ESA, 1995, pp. 341--354.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded
Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” ESA, 1995,
pp. 341--354, doi:10.1007/3-540-60313-1_154.
short: 'F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.'
date_created: 2018-04-03T09:40:55Z
date_updated: 2022-01-06T06:55:18Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/3-540-60313-1_154
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:57:17Z
date_updated: 2018-04-12T07:09:35Z
file_id: '2279'
file_name: ESA95.pdf
file_size: 177256
relation: main_file
file_date_updated: 2018-04-12T07:09:35Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 341--354
publication: ESA
series_title: Lecture Notes in Computer Science
status: public
title: Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks
type: conference
urn: '21878'
user_id: '14955'
year: '1995'
...
---
_id: '2207'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric
Networks (Extended Abstract). In: SPAA. ; 1995:137--146.'
apa: Meyer auf der Heide, F., & Scheideler, C. (1995). Space-Efficient Routing
in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_1995, title={Space-Efficient
Routing in Vertex-Symmetric Networks (Extended Abstract)}, booktitle={SPAA}, author={Meyer
auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={137--146}
}'
chicago: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient
Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146,
1995.
ieee: F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric
Networks (Extended Abstract),” in SPAA, 1995, pp. 137--146.
mla: Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient
Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995,
pp. 137--146.
short: 'F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146.'
date_created: 2018-04-04T12:43:41Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:56:32Z
date_updated: 2018-04-12T07:09:52Z
file_id: '2278'
file_name: SPAA95.pdf
file_size: 284222
relation: main_file
file_date_updated: 2018-04-12T07:09:52Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 137--146
publication: SPAA
status: public
title: Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)
type: conference
urn: '22075'
user_id: '14955'
year: '1995'
...
---
_id: '2208'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy
to Speed Up Randomized Shared Memory Simulations. In: STACS. ; 1995:267--278.'
apa: Meyer auf der Heide, F., Scheideler, C., & Stemann, V. (1995). Exploiting
Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS
(pp. 267--278).
bibtex: '@inproceedings{Meyer auf der Heide_Scheideler_Stemann_1995, title={Exploiting
Storage Redundancy to Speed Up Randomized Shared Memory Simulations}, booktitle={STACS},
author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann,
Volker}, year={1995}, pages={267--278} }'
chicago: Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann.
“Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.”
In STACS, 267--278, 1995.
ieee: F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage
Redundancy to Speed Up Randomized Shared Memory Simulations,” in STACS,
1995, pp. 267--278.
mla: Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed
Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
short: 'F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp.
267--278.'
date_created: 2018-04-04T12:44:26Z
date_updated: 2022-01-06T06:55:24Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T06:54:40Z
date_updated: 2018-04-12T07:09:13Z
file_id: '2277'
file_name: STACS95.pdf
file_size: 407467
relation: main_file
file_date_updated: 2018-04-12T07:09:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 267--278
publication: STACS
status: public
title: Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
type: conference
urn: '22085'
user_id: '14955'
year: '1995'
...
---
_id: '16566'
author:
- first_name: Dany
full_name: Breslauer, Dany
last_name: Breslauer
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Devdatt P.
full_name: Dubhashi, Devdatt P.
last_name: Dubhashi
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison
model lower bounds to the parallel-random-access-machine. Information Processing
Letters. 1995:103-110. doi:10.1016/s0020-0190(97)00032-x
apa: Breslauer, D., Czumaj, A., Dubhashi, D. P., & Meyer auf der Heide, F. (1995).
Transforming comparison model lower bounds to the parallel-random-access-machine.
Information Processing Letters, 103–110. https://doi.org/10.1016/s0020-0190(97)00032-x
bibtex: '@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming
comparison model lower bounds to the parallel-random-access-machine}, DOI={10.1016/s0020-0190(97)00032-x},
journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj,
Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995},
pages={103–110} }'
chicago: Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer
auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.”
Information Processing Letters, 1995, 103–10. https://doi.org/10.1016/s0020-0190(97)00032-x.
ieee: D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming
comparison model lower bounds to the parallel-random-access-machine,” Information
Processing Letters, pp. 103–110, 1995.
mla: Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the
Parallel-Random-Access-Machine.” Information Processing Letters, 1995,
pp. 103–10, doi:10.1016/s0020-0190(97)00032-x.
short: D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information
Processing Letters (1995) 103–110.
date_created: 2020-04-15T11:28:35Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1016/s0020-0190(97)00032-x
language:
- iso: eng
page: 103-110
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
status: public
title: Transforming comparison model lower bounds to the parallel-random-access-machine
type: journal_article
user_id: '15415'
year: '1995'
...
---
_id: '16704'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary
networks. In: STACS 95. Berlin, Heidelberg; 1995. doi:10.1007/3-540-59042-0_81'
apa: Meyer auf der Heide, F., & Vöcking, B. (1995). A packet routing protocol
for arbitrary networks. In STACS 95. Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_81
bibtex: '@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A
packet routing protocol for arbitrary networks}, DOI={10.1007/3-540-59042-0_81},
booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold},
year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing
Protocol for Arbitrary Networks.” In STACS 95. Berlin, Heidelberg, 1995.
https://doi.org/10.1007/3-540-59042-0_81.
ieee: F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary
networks,” in STACS 95, Berlin, Heidelberg, 1995.
mla: Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol
for Arbitrary Networks.” STACS 95, 1995, doi:10.1007/3-540-59042-0_81.
short: 'F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:36:32Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-59042-0_81
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 95
publication_identifier:
isbn:
- '9783540590422'
- '9783540491750'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A packet routing protocol for arbitrary networks
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16705'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with
triple-logarithmic delay. In: Lecture Notes in Computer Science. Berlin,
Heidelberg; 1995. doi:10.1007/3-540-60313-1_133'
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Shared memory
simulations with triple-logarithmic delay. In Lecture Notes in Computer Science.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_133
bibtex: '@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg},
title={Shared memory simulations with triple-logarithmic delay}, DOI={10.1007/3-540-60313-1_133},
booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer
auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared
Memory Simulations with Triple-Logarithmic Delay.” In Lecture Notes in Computer
Science. Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60313-1_133.
ieee: A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations
with triple-logarithmic delay,” in Lecture Notes in Computer Science, Berlin,
Heidelberg, 1995.
mla: Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.”
Lecture Notes in Computer Science, 1995, doi:10.1007/3-540-60313-1_133.
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-16T13:40:52Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_133
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540603139'
- '9783540449133'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Shared memory simulations with triple-logarithmic delay
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16706'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Martin
full_name: Storch, Martin
last_name: Storch
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size
and slowdown for universal parallel networks. In: Proceedings of the Seventh
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95.
; 1995. doi:10.1145/215399.215430'
apa: Meyer auf der Heide, F., Storch, M., & Wanka, R. (1995). Optimal trade-offs
between size and slowdown for universal parallel networks. In Proceedings of
the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA
’95. https://doi.org/10.1145/215399.215430
bibtex: '@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs
between size and slowdown for universal parallel networks}, DOI={10.1145/215399.215430},
booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms
and architectures - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch,
Martin and Wanka, Rolf}, year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal
Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In Proceedings
of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’95, 1995. https://doi.org/10.1145/215399.215430.
ieee: F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between
size and slowdown for universal parallel networks,” in Proceedings of the seventh
annual ACM symposium on Parallel algorithms and architectures - SPAA ’95,
1995.
mla: Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and
Slowdown for Universal Parallel Networks.” Proceedings of the Seventh Annual
ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995,
doi:10.1145/215399.215430.
short: 'F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’95, 1995.'
date_created: 2020-04-16T13:47:15Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1145/215399.215430
language:
- iso: eng
publication: Proceedings of the seventh annual ACM symposium on Parallel algorithms
and architectures - SPAA '95
publication_identifier:
isbn:
- '0897917170'
publication_status: published
status: public
title: Optimal trade-offs between size and slowdown for universal parallel networks
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '16707'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Volker
full_name: Stemann, Volker
last_name: Stemann
citation:
ama: 'Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory
simulations, and the power of reconfiguration. In: Proceedings Third Israel
Symposium on the Theory of Computing and Systems. ; 1995. doi:10.1109/istcs.1995.377051'
apa: Czumaj, A., Meyer auf der Heide, F., & Stemann, V. (1995). Improved optimal
shared memory simulations, and the power of reconfiguration. Proceedings Third
Israel Symposium on the Theory of Computing and Systems. https://doi.org/10.1109/istcs.1995.377051
bibtex: '@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved
optimal shared memory simulations, and the power of reconfiguration}, DOI={10.1109/istcs.1995.377051},
booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems},
author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker},
year={1995} }'
chicago: Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved
Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In Proceedings
Third Israel Symposium on the Theory of Computing and Systems, 1995. https://doi.org/10.1109/istcs.1995.377051.
ieee: 'A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared
memory simulations, and the power of reconfiguration,” 1995, doi: 10.1109/istcs.1995.377051.'
mla: Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the
Power of Reconfiguration.” Proceedings Third Israel Symposium on the Theory
of Computing and Systems, 1995, doi:10.1109/istcs.1995.377051.
short: 'A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel
Symposium on the Theory of Computing and Systems, 1995.'
date_created: 2020-04-16T13:49:13Z
date_updated: 2022-01-06T06:52:54Z
department:
- _id: '63'
doi: 10.1109/istcs.1995.377051
language:
- iso: eng
publication: Proceedings Third Israel Symposium on the Theory of Computing and Systems
publication_identifier:
isbn:
- '0818669152'
publication_status: published
status: public
title: Improved optimal shared memory simulations, and the power of reconfiguration
type: conference
user_id: '15415'
year: '1995'
...
---
_id: '16717'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional
tori. In: Graph-Theoretic Concepts in Computer Science. Berlin, Heidelberg;
1995. doi:10.1007/3-540-60618-1_77'
apa: Meyer auf der Heide, F., & Westermann, M. (1995). Hot-potato routing on
multi-dimensional tori. In Graph-Theoretic Concepts in Computer Science.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
bibtex: '@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg},
title={Hot-potato routing on multi-dimensional tori}, DOI={10.1007/3-540-60618-1_77},
booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
Heide, Friedhelm and Westermann, Matthias}, year={1995} }'
chicago: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
on Multi-Dimensional Tori.” In Graph-Theoretic Concepts in Computer Science.
Berlin, Heidelberg, 1995. https://doi.org/10.1007/3-540-60618-1_77.
ieee: F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional
tori,” in Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg,
1995.
mla: Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing
on Multi-Dimensional Tori.” Graph-Theoretic Concepts in Computer Science,
1995, doi:10.1007/3-540-60618-1_77.
short: 'F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-17T07:46:18Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-60618-1_77
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
isbn:
- '9783540606185'
- '9783540484875'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Hot-potato routing on multi-dimensional tori
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '16874'
author:
- first_name: Armin
full_name: Bäumker, Armin
last_name: Bäumker
- first_name: Wolfgang
full_name: Dittrich, Wolfgang
last_name: Dittrich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms:
c-optimal multisearch for an extension of the BSP model. In: Lecture Notes
in Computer Science. Berlin, Heidelberg; 1995. doi:10.1007/3-540-60313-1_131'
apa: 'Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1995). Truly efficient
parallel algorithms: c-optimal multisearch for an extension of the BSP model.
In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_131'
bibtex: '@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg},
title={Truly efficient parallel algorithms: c-optimal multisearch for an extension
of the BSP model}, DOI={10.1007/3-540-60313-1_131},
booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich,
Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }'
chicago: 'Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide.
“Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of
the BSP Model.” In Lecture Notes in Computer Science. Berlin, Heidelberg,
1995. https://doi.org/10.1007/3-540-60313-1_131.'
ieee: 'A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel
algorithms: c-optimal multisearch for an extension of the BSP model,” in Lecture
Notes in Computer Science, Berlin, Heidelberg, 1995.'
mla: 'Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch
for an Extension of the BSP Model.” Lecture Notes in Computer Science,
1995, doi:10.1007/3-540-60313-1_131.'
short: 'A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 1995.'
date_created: 2020-04-27T13:59:05Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/3-540-60313-1_131
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540603139'
- '9783540449133'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: 'Truly efficient parallel algorithms: c-optimal multisearch for an extension
of the BSP model'
type: book_chapter
user_id: '15415'
year: '1995'
...
---
_id: '19624'
author:
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Wanka R. Paralleles Sortieren Auf Mehrdimensionalen Gittern. Universität
Paderborn; 1994.
apa: Wanka, R. (1994). Paralleles Sortieren auf mehrdimensionalen Gittern.
Universität Paderborn.
bibtex: '@book{Wanka_1994, place={Universität Paderborn}, title={Paralleles Sortieren
auf mehrdimensionalen Gittern}, author={Wanka, Rolf}, year={1994} }'
chicago: Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern.
Universität Paderborn, 1994.
ieee: R. Wanka, Paralleles Sortieren auf mehrdimensionalen Gittern. Universität
Paderborn, 1994.
mla: Wanka, Rolf. Paralleles Sortieren Auf Mehrdimensionalen Gittern. 1994.
short: R. Wanka, Paralleles Sortieren Auf Mehrdimensionalen Gittern, Universität
Paderborn, 1994.
date_created: 2020-09-22T12:32:48Z
date_updated: 2022-01-06T06:54:09Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-22T12:32:33Z
date_updated: 2020-09-22T12:32:33Z
file_id: '19625'
file_name: pub-hni-9686.pdf
file_size: 967735
relation: main_file
success: 1
file_date_updated: 2020-09-22T12:32:33Z
has_accepted_license: '1'
language:
- iso: eng
place: Universität Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Paralleles Sortieren auf mehrdimensionalen Gittern
type: dissertation
user_id: '15415'
year: '1994'
...
---
_id: '16728'
author:
- first_name: Martin
full_name: Dietzfelbinger, Martin
last_name: Dietzfelbinger
- first_name: Anna
full_name: Karlin, Anna
last_name: Karlin
- first_name: Kurt
full_name: Mehlhorn, Kurt
last_name: Mehlhorn
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Hans
full_name: Rohnert, Hans
last_name: Rohnert
- first_name: Robert E.
full_name: Tarjan, Robert E.
last_name: Tarjan
citation:
ama: 'Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H,
Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. SIAM Journal on
Computing. 1994:738-761. doi:10.1137/s0097539791194094'
apa: 'Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert,
H., & Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds.
SIAM Journal on Computing, 738–761. https://doi.org/10.1137/s0097539791194094'
bibtex: '@article{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1994,
title={Dynamic Perfect Hashing: Upper and Lower Bounds}, DOI={10.1137/s0097539791194094},
journal={SIAM Journal on Computing}, author={Dietzfelbinger, Martin and Karlin,
Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and
Tarjan, Robert E.}, year={1994}, pages={738–761} }'
chicago: 'Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf
der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper
and Lower Bounds.” SIAM Journal on Computing, 1994, 738–61. https://doi.org/10.1137/s0097539791194094.'
ieee: 'M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert,
and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” SIAM Journal
on Computing, pp. 738–761, 1994.'
mla: 'Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.”
SIAM Journal on Computing, 1994, pp. 738–61, doi:10.1137/s0097539791194094.'
short: M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert,
R.E. Tarjan, SIAM Journal on Computing (1994) 738–761.
date_created: 2020-04-20T10:19:33Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/s0097539791194094
language:
- iso: eng
page: 738-761
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: 'Dynamic Perfect Hashing: Upper and Lower Bounds'
type: journal_article
user_id: '15415'
year: '1994'
...
---
_id: '17477'
citation:
ama: 'Meyer auf der Heide F, Monien B, Rosenberg AL, eds. Parallel Architectures
and Their Efficient Use. Berlin, Heidelberg: Springer; 1993. doi:10.1007/3-540-56731-3'
apa: 'Meyer auf der Heide, F., Monien, B., & Rosenberg, A. L. (Eds.). (1993).
Parallel Architectures and Their Efficient Use. Berlin, Heidelberg: Springer.
https://doi.org/10.1007/3-540-56731-3'
bibtex: '@book{Meyer auf der Heide_Monien_Rosenberg_1993, place={Berlin, Heidelberg},
title={Parallel Architectures and Their Efficient Use}, DOI={10.1007/3-540-56731-3},
publisher={Springer}, year={1993} }'
chicago: 'Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. Parallel
Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.
https://doi.org/10.1007/3-540-56731-3.'
ieee: 'F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., Parallel
Architectures and Their Efficient Use. Berlin, Heidelberg: Springer, 1993.'
mla: Meyer auf der Heide, Friedhelm, et al., editors. Parallel Architectures
and Their Efficient Use. Springer, 1993, doi:10.1007/3-540-56731-3.
short: F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures
and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.
date_created: 2020-07-30T09:49:20Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
doi: 10.1007/3-540-56731-3
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: B.
full_name: Monien, B.
last_name: Monien
- first_name: A. L.
full_name: Rosenberg, A. L.
last_name: Rosenberg
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783540567318'
- '9783540476375'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Parallel Architectures and Their Efficient Use
type: book_editor
user_id: '15415'
year: '1993'
...
---
_id: '17479'
author:
- first_name: Uwe
full_name: Kastens, Uwe
last_name: Kastens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Alf
full_name: Wachsmann, Alf
last_name: Wachsmann
- first_name: Friedrich
full_name: Wichmann, Friedrich
last_name: Wichmann
citation:
ama: 'Kastens U, Meyer auf der Heide F, Wachsmann A, Wichmann F. OCCAM-light: A
Language Combining Shared Memory and Message Passing (A First Report). In: Proc.
3rd PASA Workshop, PARS Mitteilungen. ; 1993:50-55.'
apa: 'Kastens, U., Meyer auf der Heide, F., Wachsmann, A., & Wichmann, F. (1993).
OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report).
In Proc. 3rd PASA Workshop, PARS Mitteilungen (pp. 50–55).'
bibtex: '@inproceedings{Kastens_Meyer auf der Heide_Wachsmann_Wichmann_1993, title={OCCAM-light:
A Language Combining Shared Memory and Message Passing (A First Report)}, booktitle={Proc.
3rd PASA Workshop, PARS Mitteilungen}, author={Kastens, Uwe and Meyer auf der
Heide, Friedhelm and Wachsmann, Alf and Wichmann, Friedrich}, year={1993}, pages={50–55}
}'
chicago: 'Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich
Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing
(A First Report).” In Proc. 3rd PASA Workshop, PARS Mitteilungen, 50–55,
1993.'
ieee: 'U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light:
A Language Combining Shared Memory and Message Passing (A First Report),” in Proc.
3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.'
mla: 'Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and
Message Passing (A First Report).” Proc. 3rd PASA Workshop, PARS Mitteilungen,
1993, pp. 50–55.'
short: 'U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc.
3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.'
date_created: 2020-07-30T10:54:52Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
language:
- iso: eng
page: 50-55
publication: Proc. 3rd PASA Workshop, PARS Mitteilungen
status: public
title: 'OCCAM-light: A Language Combining Shared Memory and Message Passing (A First
Report)'
type: conference
user_id: '15415'
year: '1993'
...
---
_id: '16729'
author:
- first_name: M.
full_name: Dietzfelbinger, M.
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. An Optimal Parallel Dictionary. Information
and Computation. 1993:196-217. doi:10.1006/inco.1993.1007
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). An Optimal Parallel
Dictionary. Information and Computation, 196–217. https://doi.org/10.1006/inco.1993.1007
bibtex: '@article{Dietzfelbinger_Meyer auf der Heide_1993, title={An Optimal Parallel
Dictionary}, DOI={10.1006/inco.1993.1007},
journal={Information and Computation}, author={Dietzfelbinger, M. and Meyer auf
der Heide, Friedhelm}, year={1993}, pages={196–217} }'
chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
Dictionary.” Information and Computation, 1993, 196–217. https://doi.org/10.1006/inco.1993.1007.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,”
Information and Computation, pp. 196–217, 1993.
mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
Dictionary.” Information and Computation, 1993, pp. 196–217, doi:10.1006/inco.1993.1007.
short: M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993)
196–217.
date_created: 2020-04-20T10:31:51Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1006/inco.1993.1007
language:
- iso: eng
page: 196-217
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: An Optimal Parallel Dictionary
type: journal_article
user_id: '15415'
year: '1993'
...
---
_id: '16730'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Brigitte
full_name: Oesterdiekhoff, Brigitte
last_name: Oesterdiekhoff
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token
distribution. In: Automata, Languages and Programming. Berlin, Heidelberg;
1993. doi:10.1007/3-540-56939-1_89'
apa: Meyer auf der Heide, F., Oesterdiekhoff, B., & Wanka, R. (1993). Strongly
adaptive token distribution. In Automata, Languages and Programming. Berlin,
Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
bibtex: '@inbook{Meyer auf der Heide_Oesterdiekhoff_Wanka_1993, place={Berlin, Heidelberg},
title={Strongly adaptive token distribution}, DOI={10.1007/3-540-56939-1_89},
booktitle={Automata, Languages and Programming}, author={Meyer auf der Heide,
Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1993} }'
chicago: Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka.
“Strongly Adaptive Token Distribution.” In Automata, Languages and Programming.
Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56939-1_89.
ieee: F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive
token distribution,” in Automata, Languages and Programming, Berlin, Heidelberg,
1993.
mla: Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.”
Automata, Languages and Programming, 1993, doi:10.1007/3-540-56939-1_89.
short: 'F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages
and Programming, Berlin, Heidelberg, 1993.'
date_created: 2020-04-20T10:33:56Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-56939-1_89
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783540569398'
- '9783540478263'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Strongly adaptive token distribution
type: book_chapter
user_id: '15415'
year: '1993'
...
---
_id: '16731'
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. Simple, efficient shared memory simulations.
In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and
Architectures - SPAA ’93. ; 1993. doi:10.1145/165231.165246'
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1993). Simple, efficient
shared memory simulations. In Proceedings of the fifth annual ACM symposium
on Parallel algorithms and architectures - SPAA ’93. https://doi.org/10.1145/165231.165246
bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1993, title={Simple,
efficient shared memory simulations}, DOI={10.1145/165231.165246},
booktitle={Proceedings of the fifth annual ACM symposium on Parallel algorithms
and architectures - SPAA ’93}, author={Dietzfelbinger, Martin and Meyer auf der
Heide, Friedhelm}, year={1993} }'
chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient
Shared Memory Simulations.” In Proceedings of the Fifth Annual ACM Symposium
on Parallel Algorithms and Architectures - SPAA ’93, 1993. https://doi.org/10.1145/165231.165246.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory
simulations,” in Proceedings of the fifth annual ACM symposium on Parallel
algorithms and architectures - SPAA ’93, 1993.
mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient
Shared Memory Simulations.” Proceedings of the Fifth Annual ACM Symposium on
Parallel Algorithms and Architectures - SPAA ’93, 1993, doi:10.1145/165231.165246.
short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’93, 1993.'
date_created: 2020-04-20T10:35:49Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/165231.165246
language:
- iso: eng
publication: Proceedings of the fifth annual ACM symposium on Parallel algorithms
and architectures - SPAA '93
publication_identifier:
isbn:
- '0897915992'
publication_status: published
status: public
title: Simple, efficient shared memory simulations
type: conference
user_id: '15415'
year: '1993'
...
---
_id: '16732'
author:
- first_name: Katharina
full_name: Lürwer-Brüggemeier, Katharina
last_name: Lürwer-Brüggemeier
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of
computations with integer division. In: Lecture Notes in Computer Science.
Berlin, Heidelberg; 1993. doi:10.1007/3-540-56503-5_46'
apa: Lürwer-Brüggemeier, K., & Meyer auf der Heide, F. (1993). Capabilities
and complexity of computations with integer division. In Lecture Notes in Computer
Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_46
bibtex: '@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg},
title={Capabilities and complexity of computations with integer division}, DOI={10.1007/3-540-56503-5_46},
booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina
and Meyer auf der Heide, Friedhelm}, year={1993} }'
chicago: Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities
and Complexity of Computations with Integer Division.” In Lecture Notes in
Computer Science. Berlin, Heidelberg, 1993. https://doi.org/10.1007/3-540-56503-5_46.
ieee: K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity
of computations with integer division,” in Lecture Notes in Computer Science,
Berlin, Heidelberg, 1993.
mla: Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities
and Complexity of Computations with Integer Division.” Lecture Notes in Computer
Science, 1993, doi:10.1007/3-540-56503-5_46.
short: 'K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 1993.'
date_created: 2020-04-20T11:25:51Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-56503-5_46
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540565031'
- '9783540475743'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Capabilities and complexity of computations with integer division
type: book_chapter
user_id: '15415'
year: '1993'
...
---
_id: '18936'
abstract:
- lang: eng
text: 'We consider the following periodic sorting procedure on two-dimensional meshes
of processors: Initially, each node contains one number. We proceed in rounds
each round consisting of sorting the columns of the grid, and, in the second phase,
of sorting the rows according to the snake-like ordering. We exactly characterize
the number of rounds necessary to sort on an l × m-grid in the worst case, where
l is the number of the rows and m the number of the columns. An upper bound of
⌈ log l⌉ + 1was known before. This bound is tight for the case that m is not a
power of 2. Surprisingly, it turns out that far fewer rounds are necessary if
m is a power of 2 (and m ≪ l) in this case, exactly min { log m + 1, ⌈ log l⌉
+ 1} rounds are needed in the worst case.'
author:
- first_name: Miroslaw
full_name: Kutylowski, Miroslaw
last_name: Kutylowski
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: Kutylowski M, Wanka R. Periodic Sorting on Two-Dimensional Meshes. Parallel
Processing Letters 2. Published online 1992:213-220. doi:10.1142/s0129626492000349
apa: Kutylowski, M., & Wanka, R. (1992). Periodic Sorting on Two-Dimensional
Meshes. Parallel Processing Letters 2, 213–220. https://doi.org/10.1142/s0129626492000349
bibtex: '@article{Kutylowski_Wanka_1992, title={Periodic Sorting on Two-Dimensional
Meshes}, DOI={10.1142/s0129626492000349},
journal={Parallel Processing Letters 2}, author={Kutylowski, Miroslaw and Wanka,
Rolf}, year={1992}, pages={213–220} }'
chicago: Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional
Meshes.” Parallel Processing Letters 2, 1992, 213–20. https://doi.org/10.1142/s0129626492000349.
ieee: 'M. Kutylowski and R. Wanka, “Periodic Sorting on Two-Dimensional Meshes,”
Parallel Processing Letters 2, pp. 213–220, 1992, doi: 10.1142/s0129626492000349.'
mla: Kutylowski, Miroslaw, and Rolf Wanka. “Periodic Sorting on Two-Dimensional
Meshes.” Parallel Processing Letters 2, 1992, pp. 213–20, doi:10.1142/s0129626492000349.
short: M. Kutylowski, R. Wanka, Parallel Processing Letters 2 (1992) 213–220.
date_created: 2020-09-03T11:05:14Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1142/s0129626492000349
language:
- iso: eng
page: 213-220
publication: Parallel Processing Letters 2
publication_identifier:
issn:
- 0129-6264
- 1793-642X
publication_status: published
status: public
title: Periodic Sorting on Two-Dimensional Meshes
type: journal_article
user_id: '15415'
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'
...
---
_id: '16734'
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. Hashing strategies for simulating shared memory on
distributed memory machines. In: Lecture Notes in Computer Science. Berlin,
Heidelberg; 1992. doi:10.1007/3-540-56731-3_3'
apa: Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory
on distributed memory machines. In Lecture Notes in Computer Science. Berlin,
Heidelberg. https://doi.org/10.1007/3-540-56731-3_3
bibtex: '@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing
strategies for simulating shared memory on distributed memory machines}, DOI={10.1007/3-540-56731-3_3}, booktitle={Lecture
Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992}
}'
chicago: Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared
Memory on Distributed Memory Machines.” In Lecture Notes in Computer Science.
Berlin, Heidelberg, 1992. https://doi.org/10.1007/3-540-56731-3_3.
ieee: F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on
distributed memory machines,” in Lecture Notes in Computer Science, Berlin,
Heidelberg, 1992.
mla: Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory
on Distributed Memory Machines.” Lecture Notes in Computer Science, 1992,
doi:10.1007/3-540-56731-3_3.
short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg,
1992.'
date_created: 2020-04-20T11:29:58Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-56731-3_3
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540567318'
- '9783540476375'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Hashing strategies for simulating shared memory on distributed memory machines
type: book_chapter
user_id: '15415'
year: '1992'
...
---
_id: '16735'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Hieu Thien
full_name: Pham, Hieu Thien
last_name: Pham
citation:
ama: 'Meyer auf der Heide F, Pham HT. On the performance of networks with multiple
busses. In: STACS 92. Berlin, Heidelberg; 1992. doi:10.1007/3-540-55210-3_176'
apa: Meyer auf der Heide, F., & Pham, H. T. (1992). On the performance of networks
with multiple busses. In STACS 92. Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_176
bibtex: '@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On
the performance of networks with multiple busses}, DOI={10.1007/3-540-55210-3_176},
booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien},
year={1992} }'
chicago: Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance
of Networks with Multiple Busses.” In STACS 92. Berlin, Heidelberg, 1992.
https://doi.org/10.1007/3-540-55210-3_176.
ieee: F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with
multiple busses,” in STACS 92, Berlin, Heidelberg, 1992.
mla: Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of
Networks with Multiple Busses.” STACS 92, 1992, doi:10.1007/3-540-55210-3_176.
short: 'F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.'
date_created: 2020-04-20T11:31:58Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-55210-3_176
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 92
publication_identifier:
isbn:
- '9783540552109'
- '9783540467755'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: On the performance of networks with multiple busses
type: book_chapter
user_id: '15415'
year: '1992'
...
---
_id: '16736'
author:
- first_name: Richard M.
full_name: Karp, Richard M.
last_name: Karp
- first_name: Michael
full_name: Luby, Michael
last_name: Luby
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed
memory machine. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on
Theory of Computing - STOC ’92. ; 1992. doi:10.1145/129712.129743'
apa: Karp, R. M., Luby, M., & Meyer auf der Heide, F. (1992). Efficient PRAM
simulation on a distributed memory machine. In Proceedings of the twenty-fourth
annual ACM symposium on Theory of computing - STOC ’92. https://doi.org/10.1145/129712.129743
bibtex: '@inproceedings{Karp_Luby_Meyer auf der Heide_1992, title={Efficient PRAM
simulation on a distributed memory machine}, DOI={10.1145/129712.129743},
booktitle={Proceedings of the twenty-fourth annual ACM symposium on Theory of
computing - STOC ’92}, author={Karp, Richard M. and Luby, Michael and Meyer auf
der Heide, Friedhelm}, year={1992} }'
chicago: Karp, Richard M., Michael Luby, and Friedhelm Meyer auf der Heide. “Efficient
PRAM Simulation on a Distributed Memory Machine.” In Proceedings of the Twenty-Fourth
Annual ACM Symposium on Theory of Computing - STOC ’92, 1992. https://doi.org/10.1145/129712.129743.
ieee: R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation
on a distributed memory machine,” in Proceedings of the twenty-fourth annual
ACM symposium on Theory of computing - STOC ’92, 1992.
mla: Karp, Richard M., et al. “Efficient PRAM Simulation on a Distributed Memory
Machine.” Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of
Computing - STOC ’92, 1992, doi:10.1145/129712.129743.
short: 'R.M. Karp, M. Luby, F. Meyer auf der Heide, in: Proceedings of the Twenty-Fourth
Annual ACM Symposium on Theory of Computing - STOC ’92, 1992.'
date_created: 2020-04-20T11:33:22Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/129712.129743
language:
- iso: eng
publication: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing -
STOC '92
publication_identifier:
isbn:
- '0897915119'
publication_status: published
status: public
title: Efficient PRAM simulation on a distributed memory machine
type: conference
user_id: '15415'
year: '1992'
...
---
_id: '16737'
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. Dynamic Hashing in Real Time. In:
TEUBNER-TEXTE Zur Informatik. Wiesbaden; 1992. doi:10.1007/978-3-322-95233-2_7'
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1992). Dynamic Hashing in
Real Time. In TEUBNER-TEXTE zur Informatik. Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_7
bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Wiesbaden}, title={Dynamic
Hashing in Real Time}, DOI={10.1007/978-3-322-95233-2_7},
booktitle={TEUBNER-TEXTE zur Informatik}, author={Dietzfelbinger, Martin and Meyer
auf der Heide, Friedhelm}, year={1992} }'
chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing
in Real Time.” In TEUBNER-TEXTE Zur Informatik. Wiesbaden, 1992. https://doi.org/10.1007/978-3-322-95233-2_7.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “Dynamic Hashing in Real Time,”
in TEUBNER-TEXTE zur Informatik, Wiesbaden, 1992.
mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Dynamic Hashing
in Real Time.” TEUBNER-TEXTE Zur Informatik, 1992, doi:10.1007/978-3-322-95233-2_7.
short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: TEUBNER-TEXTE Zur Informatik,
Wiesbaden, 1992.'
date_created: 2020-04-20T11:35:06Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/978-3-322-95233-2_7
language:
- iso: eng
place: Wiesbaden
publication: TEUBNER-TEXTE zur Informatik
publication_identifier:
isbn:
- '9783815420331'
- '9783322952332'
issn:
- 1615-4584
publication_status: published
status: public
title: Dynamic Hashing in Real Time
type: book_chapter
user_id: '15415'
year: '1992'
...
---
_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'
...
---
_id: '16738'
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. A new universal class of hash functions
and dynamic hashing in real time. In: Automata, Languages and Programming.
Berlin/Heidelberg; 1990. doi:10.1007/bfb0032018'
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class
of hash functions and dynamic hashing in real time. In Automata, Languages
and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018
bibtex: '@inbook{Dietzfelbinger_Meyer auf der Heide_1990, place={Berlin/Heidelberg},
title={A new universal class of hash functions and dynamic hashing in real time},
DOI={10.1007/bfb0032018}, booktitle={Automata,
Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide,
Friedhelm}, year={1990} }'
chicago: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal
Class of Hash Functions and Dynamic Hashing in Real Time.” In Automata, Languages
and Programming. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0032018.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash
functions and dynamic hashing in real time,” in Automata, Languages and Programming,
Berlin/Heidelberg, 1990.
mla: Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal
Class of Hash Functions and Dynamic Hashing in Real Time.” Automata, Languages
and Programming, 1990, doi:10.1007/bfb0032018.
short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming,
Berlin/Heidelberg, 1990.'
date_created: 2020-04-20T11:37:37Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0032018
language:
- iso: eng
place: Berlin/Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '3540528261'
publication_status: published
status: public
title: A new universal class of hash functions and dynamic hashing in real time
type: book_chapter
user_id: '15415'
year: '1990'
...
---
_id: '16739'
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. Dynamic hashing strategies. In: Lecture Notes in
Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029597'
apa: Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes
in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597
bibtex: '@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic
hashing strategies}, DOI={10.1007/bfb0029597},
booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1990} }'
chicago: Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In Lecture
Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029597.
ieee: F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes
in Computer Science, Berlin/Heidelberg, 1990.
mla: Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes
in Computer Science, 1990, doi:10.1007/bfb0029597.
short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg,
1990.'
date_created: 2020-04-20T11:39:31Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0029597
language:
- iso: eng
place: Berlin/Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '3540529535'
publication_status: published
status: public
title: Dynamic hashing strategies
type: book_chapter
user_id: '15415'
year: '1990'
...
---
_id: '16740'
author:
- first_name: Marek
full_name: Karpinski, Marek
last_name: Karpinski
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial
computation. In: Lecture Notes in Computer Science. Berlin/Heidelberg;
1990. doi:10.1007/bfb0029630'
apa: Karpinski, M., & Meyer auf der Heide, F. (1990). On the complexity of genuinely
polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg.
https://doi.org/10.1007/bfb0029630
bibtex: '@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg},
title={On the complexity of genuinely polynomial computation}, DOI={10.1007/bfb0029630},
booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer
auf der Heide, Friedhelm}, year={1990} }'
chicago: Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity
of Genuinely Polynomial Computation.” In Lecture Notes in Computer Science.
Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029630.
ieee: M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial
computation,” in Lecture Notes in Computer Science, Berlin/Heidelberg,
1990.
mla: Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of
Genuinely Polynomial Computation.” Lecture Notes in Computer Science, 1990,
doi:10.1007/bfb0029630.
short: 'M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science,
Berlin/Heidelberg, 1990.'
date_created: 2020-04-20T11:40:17Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0029630
language:
- iso: eng
place: Berlin/Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '3540529535'
publication_status: published
status: public
title: On the complexity of genuinely polynomial computation
type: book_chapter
user_id: '15415'
year: '1990'
...
---
_id: '16741'
author:
- first_name: M.
full_name: Dietzfelbinger, M.
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. How to distribute a dictionary in
a complete network. In: Proceedings of the Twenty-Second Annual ACM Symposium
on Theory of Computing - STOC ’90. ; 1990. doi:10.1145/100216.100229'
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). How to distribute
a dictionary in a complete network. In Proceedings of the twenty-second annual
ACM symposium on Theory of computing - STOC ’90. https://doi.org/10.1145/100216.100229
bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1990, title={How to distribute
a dictionary in a complete network}, DOI={10.1145/100216.100229},
booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of
computing - STOC ’90}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm},
year={1990} }'
chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute
a Dictionary in a Complete Network.” In Proceedings of the Twenty-Second Annual
ACM Symposium on Theory of Computing - STOC ’90, 1990. https://doi.org/10.1145/100216.100229.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary
in a complete network,” in Proceedings of the twenty-second annual ACM symposium
on Theory of computing - STOC ’90, 1990.
mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a
Dictionary in a Complete Network.” Proceedings of the Twenty-Second Annual
ACM Symposium on Theory of Computing - STOC ’90, 1990, doi:10.1145/100216.100229.
short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second
Annual ACM Symposium on Theory of Computing - STOC ’90, 1990.'
date_created: 2020-04-20T11:41:08Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/100216.100229
language:
- iso: eng
publication: Proceedings of the twenty-second annual ACM symposium on Theory of computing -
STOC '90
publication_identifier:
isbn:
- '0897913612'
publication_status: published
status: public
title: How to distribute a dictionary in a complete network
type: conference
user_id: '15415'
year: '1990'
...
---
_id: '16742'
author:
- first_name: J.
full_name: Gil, J.
last_name: Gil
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: A.
full_name: Wigderson, A.
last_name: Wigderson
citation:
ama: 'Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant
time. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of
Computing - STOC ’90. ; 1990. doi:10.1145/100216.100247'
apa: Gil, J., Meyer auf der Heide, F., & Wigderson, A. (1990). Not all keys
can be hashed in constant time. In Proceedings of the twenty-second annual
ACM symposium on Theory of computing - STOC ’90. https://doi.org/10.1145/100216.100247
bibtex: '@inproceedings{Gil_Meyer auf der Heide_Wigderson_1990, title={Not all keys
can be hashed in constant time}, DOI={10.1145/100216.100247},
booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of
computing - STOC ’90}, author={Gil, J. and Meyer auf der Heide, Friedhelm and
Wigderson, A.}, year={1990} }'
chicago: Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys
Can Be Hashed in Constant Time.” In Proceedings of the Twenty-Second Annual
ACM Symposium on Theory of Computing - STOC ’90, 1990. https://doi.org/10.1145/100216.100247.
ieee: J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed
in constant time,” in Proceedings of the twenty-second annual ACM symposium
on Theory of computing - STOC ’90, 1990.
mla: Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” Proceedings
of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90,
1990, doi:10.1145/100216.100247.
short: 'J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second
Annual ACM Symposium on Theory of Computing - STOC ’90, 1990.'
date_created: 2020-04-20T11:41:55Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/100216.100247
language:
- iso: eng
publication: Proceedings of the twenty-second annual ACM symposium on Theory of computing -
STOC '90
publication_identifier:
isbn:
- '0897913612'
publication_status: published
status: public
title: Not all keys can be hashed in constant time
type: conference
user_id: '15415'
year: '1990'
...
---
_id: '16824'
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. Das Heinz Nixdorf-Institut der Universität-GH Paderborn.
Informatik Spektrum. 1990;13(4):231-232.
apa: Meyer auf der Heide, F. (1990). Das Heinz Nixdorf-Institut der Universität-GH
Paderborn. Informatik Spektrum, 13(4), 231–232.
bibtex: '@article{Meyer auf der Heide_1990, title={Das Heinz Nixdorf-Institut der
Universität-GH Paderborn}, volume={13}, number={4}, journal={Informatik Spektrum},
author={Meyer auf der Heide, Friedhelm}, year={1990}, pages={231–232} }'
chicago: 'Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH
Paderborn.” Informatik Spektrum 13, no. 4 (1990): 231–32.'
ieee: F. Meyer auf der Heide, “Das Heinz Nixdorf-Institut der Universität-GH Paderborn,”
Informatik Spektrum, vol. 13, no. 4, pp. 231–232, 1990.
mla: Meyer auf der Heide, Friedhelm. “Das Heinz Nixdorf-Institut Der Universität-GH
Paderborn.” Informatik Spektrum, vol. 13, no. 4, 1990, pp. 231–32.
short: F. Meyer auf der Heide, Informatik Spektrum 13 (1990) 231–232.
date_created: 2020-04-22T10:28:27Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
intvolume: ' 13'
issue: '4'
language:
- iso: eng
page: 231-232
publication: Informatik Spektrum
status: public
title: Das Heinz Nixdorf-Institut der Universität-GH Paderborn
type: journal_article
user_id: '15415'
volume: 13
year: '1990'
...
---
_id: '16743'
author:
- first_name: Bettina
full_name: Just, Bettina
last_name: Just
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: Just B, Meyer auf der Heide F, Wigderson A. On computations with integer division.
RAIRO - Theoretical Informatics and Applications. 1989:101-111. doi:10.1051/ita/1989230101011
apa: Just, B., Meyer auf der Heide, F., & Wigderson, A. (1989). On computations
with integer division. RAIRO - Theoretical Informatics and Applications,
101–111. https://doi.org/10.1051/ita/1989230101011
bibtex: '@article{Just_Meyer auf der Heide_Wigderson_1989, title={On computations
with integer division}, DOI={10.1051/ita/1989230101011},
journal={RAIRO - Theoretical Informatics and Applications}, author={Just, Bettina
and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1989}, pages={101–111}
}'
chicago: Just, Bettina, Friedhelm Meyer auf der Heide, and Avi Wigderson. “On Computations
with Integer Division.” RAIRO - Theoretical Informatics and Applications,
1989, 101–11. https://doi.org/10.1051/ita/1989230101011.
ieee: B. Just, F. Meyer auf der Heide, and A. Wigderson, “On computations with integer
division,” RAIRO - Theoretical Informatics and Applications, pp. 101–111,
1989.
mla: Just, Bettina, et al. “On Computations with Integer Division.” RAIRO - Theoretical
Informatics and Applications, 1989, pp. 101–11, doi:10.1051/ita/1989230101011.
short: B. Just, F. Meyer auf der Heide, A. Wigderson, RAIRO - Theoretical Informatics
and Applications (1989) 101–111.
date_created: 2020-04-20T11:49:38Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1051/ita/1989230101011
language:
- iso: eng
page: 101-111
publication: RAIRO - Theoretical Informatics and Applications
publication_identifier:
issn:
- 0988-3754
- 1290-385X
publication_status: published
status: public
title: On computations with integer division
type: journal_article
user_id: '15415'
year: '1989'
...
---
_id: '16744'
author:
- first_name: M.
full_name: Dietzfelbinger, M.
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. An optimal parallel dictionary. In:
Proceedings of the First Annual ACM Symposium on Parallel Algorithms and Architectures
- SPAA ’89. ; 1989. doi:10.1145/72935.72974'
apa: Dietzfelbinger, M., & Meyer auf der Heide, F. (1989). An optimal parallel
dictionary. In Proceedings of the first annual ACM symposium on Parallel algorithms
and architectures - SPAA ’89. https://doi.org/10.1145/72935.72974
bibtex: '@inproceedings{Dietzfelbinger_Meyer auf der Heide_1989, title={An optimal
parallel dictionary}, DOI={10.1145/72935.72974},
booktitle={Proceedings of the first annual ACM symposium on Parallel algorithms
and architectures - SPAA ’89}, author={Dietzfelbinger, M. and Meyer auf der Heide,
Friedhelm}, year={1989} }'
chicago: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
Dictionary.” In Proceedings of the First Annual ACM Symposium on Parallel Algorithms
and Architectures - SPAA ’89, 1989. https://doi.org/10.1145/72935.72974.
ieee: M. Dietzfelbinger and F. Meyer auf der Heide, “An optimal parallel dictionary,”
in Proceedings of the first annual ACM symposium on Parallel algorithms and
architectures - SPAA ’89, 1989.
mla: Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel
Dictionary.” Proceedings of the First Annual ACM Symposium on Parallel Algorithms
and Architectures - SPAA ’89, 1989, doi:10.1145/72935.72974.
short: 'M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the First
Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA ’89, 1989.'
date_created: 2020-04-20T11:51:01Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/72935.72974
language:
- iso: eng
publication: Proceedings of the first annual ACM symposium on Parallel algorithms
and architectures - SPAA '89
publication_identifier:
isbn:
- 089791323X
publication_status: published
status: public
title: An optimal parallel dictionary
type: conference
user_id: '15415'
year: '1989'
...
---
_id: '16745'
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. On genuinely time bounded computations. In: STACS
89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028969'
apa: Meyer auf der Heide, F. (1989). On genuinely time bounded computations. In
STACS 89. Berlin/Heidelberg. https://doi.org/10.1007/bfb0028969
bibtex: '@inbook{Meyer auf der Heide_1989, place={Berlin/Heidelberg}, title={On
genuinely time bounded computations}, DOI={10.1007/bfb0028969},
booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }'
chicago: Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.”
In STACS 89. Berlin/Heidelberg, 1989. https://doi.org/10.1007/bfb0028969.
ieee: F. Meyer auf der Heide, “On genuinely time bounded computations,” in STACS
89, Berlin/Heidelberg, 1989.
mla: Meyer auf der Heide, Friedhelm. “On Genuinely Time Bounded Computations.” STACS
89, 1989, doi:10.1007/bfb0028969.
short: 'F. Meyer auf der Heide, in: STACS 89, Berlin/Heidelberg, 1989.'
date_created: 2020-04-20T11:51:54Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0028969
language:
- iso: eng
place: Berlin/Heidelberg
publication: STACS 89
publication_identifier:
isbn:
- '3540508406'
publication_status: published
status: public
title: On genuinely time bounded computations
type: book_chapter
user_id: '15415'
year: '1989'
...
---
_id: '16746'
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. Time-optimal simulations of networks by universal
parallel computers. In: STACS 89. Berlin/Heidelberg; 1989. doi:10.1007/bfb0028978'
apa: Meyer auf der Heide, F., & Wanka, R. (1989). Time-optimal simulations of
networks by universal parallel computers. In STACS 89. Berlin/Heidelberg.
https://doi.org/10.1007/bfb0028978
bibtex: '@inbook{Meyer auf der Heide_Wanka_1989, place={Berlin/Heidelberg}, title={Time-optimal
simulations of networks by universal parallel computers}, DOI={10.1007/bfb0028978},
booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf},
year={1989} }'
chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations
of Networks by Universal Parallel Computers.” In STACS 89. Berlin/Heidelberg,
1989. https://doi.org/10.1007/bfb0028978.
ieee: F. Meyer auf der Heide and R. Wanka, “Time-optimal simulations of networks
by universal parallel computers,” in STACS 89, Berlin/Heidelberg, 1989.
mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Time-Optimal Simulations of
Networks by Universal Parallel Computers.” STACS 89, 1989, doi:10.1007/bfb0028978.
short: 'F. Meyer auf der Heide, R. Wanka, in: STACS 89, Berlin/Heidelberg, 1989.'
date_created: 2020-04-20T11:52:46Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0028978
language:
- iso: eng
place: Berlin/Heidelberg
publication: STACS 89
publication_identifier:
isbn:
- '3540508406'
publication_status: published
status: public
title: Time-optimal simulations of networks by universal parallel computers
type: book_chapter
user_id: '15415'
year: '1989'
...
---
_id: '16789'
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. Computing minimum spanning forests on 1- and 2-dimensional
processor arrays. In: STACS 89. Berlin, Heidelberg; 1989. doi:10.1007/bfb0028983'
apa: Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and
2-dimensional processor arrays. In STACS 89. Berlin, Heidelberg. https://doi.org/10.1007/bfb0028983
bibtex: '@inbook{Meyer auf der Heide_1989, place={Berlin, Heidelberg}, title={Computing
minimum spanning forests on 1- and 2-dimensional processor arrays}, DOI={10.1007/bfb0028983},
booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }'
chicago: Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on
1- and 2-Dimensional Processor Arrays.” In STACS 89. Berlin, Heidelberg,
1989. https://doi.org/10.1007/bfb0028983.
ieee: F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional
processor arrays,” in STACS 89, Berlin, Heidelberg, 1989.
mla: Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and
2-Dimensional Processor Arrays.” STACS 89, 1989, doi:10.1007/bfb0028983.
short: 'F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.'
date_created: 2020-04-21T11:37:58Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bfb0028983
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 89
publication_identifier:
isbn:
- '9783540508403'
- '9783540460985'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Computing minimum spanning forests on 1- and 2-dimensional processor arrays
type: book_chapter
user_id: '15415'
year: '1989'
...
---
_id: '16763'
author:
- first_name: László
full_name: Babai, László
last_name: Babai
- first_name: Bettina
full_name: Just, Bettina
last_name: Just
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Babai L, Just B, Meyer auf der Heide F. On the limits of computations with
the floor function. Information and Computation. 1988:99-107. doi:10.1016/0890-5401(88)90031-4
apa: Babai, L., Just, B., & Meyer auf der Heide, F. (1988). On the limits of
computations with the floor function. Information and Computation, 99–107.
https://doi.org/10.1016/0890-5401(88)90031-4
bibtex: '@article{Babai_Just_Meyer auf der Heide_1988, title={On the limits of computations
with the floor function}, DOI={10.1016/0890-5401(88)90031-4},
journal={Information and Computation}, author={Babai, László and Just, Bettina
and Meyer auf der Heide, Friedhelm}, year={1988}, pages={99–107} }'
chicago: Babai, László, Bettina Just, and Friedhelm Meyer auf der Heide. “On the
Limits of Computations with the Floor Function.” Information and Computation,
1988, 99–107. https://doi.org/10.1016/0890-5401(88)90031-4.
ieee: L. Babai, B. Just, and F. Meyer auf der Heide, “On the limits of computations
with the floor function,” Information and Computation, pp. 99–107, 1988.
mla: Babai, László, et al. “On the Limits of Computations with the Floor Function.”
Information and Computation, 1988, pp. 99–107, doi:10.1016/0890-5401(88)90031-4.
short: L. Babai, B. Just, F. Meyer auf der Heide, Information and Computation (1988)
99–107.
date_created: 2020-04-21T08:50:17Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0890-5401(88)90031-4
language:
- iso: eng
page: 99-107
publication: Information and Computation
publication_identifier:
issn:
- 0890-5401
publication_status: published
status: public
title: On the limits of computations with the floor function
type: journal_article
user_id: '15415'
year: '1988'
...
---
_id: '16764'
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. Fast algorithms for N-dimensional restrictions of hard
problems. Journal of the ACM (JACM). 1988:740-747. doi:10.1145/44483.44490
apa: Meyer auf der Heide, F. (1988). Fast algorithms for N-dimensional restrictions
of hard problems. Journal of the ACM (JACM), 740–747. https://doi.org/10.1145/44483.44490
bibtex: '@article{Meyer auf der Heide_1988, title={Fast algorithms for N-dimensional
restrictions of hard problems}, DOI={10.1145/44483.44490},
journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm},
year={1988}, pages={740–747} }'
chicago: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
of Hard Problems.” Journal of the ACM (JACM), 1988, 740–47. https://doi.org/10.1145/44483.44490.
ieee: F. Meyer auf der Heide, “Fast algorithms for N-dimensional restrictions of
hard problems,” Journal of the ACM (JACM), pp. 740–747, 1988.
mla: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
of Hard Problems.” Journal of the ACM (JACM), 1988, pp. 740–47, doi:10.1145/44483.44490.
short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1988) 740–747.
date_created: 2020-04-21T08:51:54Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/44483.44490
language:
- iso: eng
page: 740-747
publication: Journal of the ACM (JACM)
publication_identifier:
issn:
- 0004-5411
- 1557-735X
publication_status: published
status: public
title: Fast algorithms for N-dimensional restrictions of hard problems
type: journal_article
user_id: '15415'
year: '1988'
...
---
_id: '16765'
author:
- first_name: Allan
full_name: Borodin, Allan
last_name: Borodin
- first_name: Faith E.
full_name: Fich, Faith E.
last_name: Fich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Eli
full_name: Upfal, Eli
last_name: Upfal
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff
between search and update time for the implicit dictionary problem. Theoretical
Computer Science. 1988:57-68. doi:10.1016/0304-3975(88)90018-7
apa: Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson,
A. (1988). A tradeoff between search and update time for the implicit dictionary
problem. Theoretical Computer Science, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7
bibtex: '@article{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1988, title={A
tradeoff between search and update time for the implicit dictionary problem},
DOI={10.1016/0304-3975(88)90018-7},
journal={Theoretical Computer Science}, author={Borodin, Allan and Fich, Faith
E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1988},
pages={57–68} }'
chicago: Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal,
and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit
Dictionary Problem.” Theoretical Computer Science, 1988, 57–68. https://doi.org/10.1016/0304-3975(88)90018-7.
ieee: A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson,
“A tradeoff between search and update time for the implicit dictionary problem,”
Theoretical Computer Science, pp. 57–68, 1988.
mla: Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit
Dictionary Problem.” Theoretical Computer Science, 1988, pp. 57–68, doi:10.1016/0304-3975(88)90018-7.
short: A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, Theoretical
Computer Science (1988) 57–68.
date_created: 2020-04-21T08:53:13Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0304-3975(88)90018-7
language:
- iso: eng
page: 57-68
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: A tradeoff between search and update time for the implicit dictionary problem
type: journal_article
user_id: '15415'
year: '1988'
...
---
_id: '16766'
author:
- first_name: M.
full_name: Dietzfelbinger, M.
last_name: Dietzfelbinger
- first_name: A.
full_name: Karlin, A.
last_name: Karlin
- first_name: K.
full_name: Mehlhorn, K.
last_name: Mehlhorn
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: H.
full_name: Rohnert, H.
last_name: Rohnert
- first_name: R.E.
full_name: Tarjan, R.E.
last_name: Tarjan
citation:
ama: 'Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H,
Tarjan RE. Dynamic perfect hashing: upper and lower bounds. In: [Proceedings
1988] 29th Annual Symposium on Foundations of Computer Science. ; 1988. doi:10.1109/sfcs.1988.21968'
apa: 'Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert,
H., & Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds.
In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
https://doi.org/10.1109/sfcs.1988.21968'
bibtex: '@inproceedings{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1988,
title={Dynamic perfect hashing: upper and lower bounds}, DOI={10.1109/sfcs.1988.21968},
booktitle={[Proceedings 1988] 29th Annual Symposium on Foundations of Computer
Science}, author={Dietzfelbinger, M. and Karlin, A. and Mehlhorn, K. and Meyer
auf der Heide, Friedhelm and Rohnert, H. and Tarjan, R.E.}, year={1988} }'
chicago: 'Dietzfelbinger, M., A. Karlin, K. Mehlhorn, Friedhelm Meyer auf der Heide,
H. Rohnert, and R.E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.”
In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science,
1988. https://doi.org/10.1109/sfcs.1988.21968.'
ieee: 'M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert,
and R. E. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” in [Proceedings
1988] 29th Annual Symposium on Foundations of Computer Science, 1988.'
mla: 'Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.”
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science,
1988, doi:10.1109/sfcs.1988.21968.'
short: 'M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert,
R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer
Science, 1988.'
date_created: 2020-04-21T08:59:26Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1109/sfcs.1988.21968
language:
- iso: eng
publication: '[Proceedings 1988] 29th Annual Symposium on Foundations of Computer
Science'
publication_identifier:
isbn:
- '0818608773'
publication_status: published
status: public
title: 'Dynamic perfect hashing: upper and lower bounds'
type: conference
user_id: '15415'
year: '1988'
...
---
_id: '16767'
author:
- first_name: Bettina
full_name: Just, Bettina
last_name: Just
- first_name: Fb
full_name: Mathematik, Fb
last_name: Mathematik
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Fb
full_name: Informatik, Fb
last_name: Informatik
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: 'Just B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On
computations with integer division. In: STACS 88. Berlin, Heidelberg; 1988.
doi:10.1007/bfb0035829'
apa: Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., & Wigderson,
A. (1988). On computations with integer division. In STACS 88. Berlin,
Heidelberg. https://doi.org/10.1007/bfb0035829
bibtex: '@inbook{Just_Mathematik_Meyer auf der Heide_Informatik_Wigderson_1988,
place={Berlin, Heidelberg}, title={On computations with integer division}, DOI={10.1007/bfb0035829}, booktitle={STACS
88}, author={Just, Bettina and Mathematik, Fb and Meyer auf der Heide, Friedhelm
and Informatik, Fb and Wigderson, Avi}, year={1988} }'
chicago: Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik,
and Avi Wigderson. “On Computations with Integer Division.” In STACS 88.
Berlin, Heidelberg, 1988. https://doi.org/10.1007/bfb0035829.
ieee: B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson,
“On computations with integer division,” in STACS 88, Berlin, Heidelberg,
1988.
mla: Just, Bettina, et al. “On Computations with Integer Division.” STACS 88,
1988, doi:10.1007/bfb0035829.
short: 'B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson,
in: STACS 88, Berlin, Heidelberg, 1988.'
date_created: 2020-04-21T09:00:37Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/bfb0035829
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 88
publication_identifier:
isbn:
- '9783540188346'
- '9783540481904'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: On computations with integer division
type: book_chapter
user_id: '15415'
year: '1988'
...
---
_id: '16768'
author:
- first_name: M.
full_name: Dietzfelbinger, M.
last_name: Dietzfelbinger
- first_name: K.
full_name: Mehlhorn, K.
last_name: Mehlhorn
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: H.
full_name: Rohnert, H.
last_name: Rohnert
citation:
ama: 'Dietzfelbinger M, Mehlhorn K, Meyer auf der Heide F, Rohnert H. Upper and
lower bounds for the dictionary problem. In: SWAT 88. Berlin, Heidelberg;
1988. doi:10.1007/3-540-19487-8_24'
apa: Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., & Rohnert, H.
(1988). Upper and lower bounds for the dictionary problem. In SWAT 88.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-19487-8_24
bibtex: '@inbook{Dietzfelbinger_Mehlhorn_Meyer auf der Heide_Rohnert_1988, place={Berlin,
Heidelberg}, title={Upper and lower bounds for the dictionary problem}, DOI={10.1007/3-540-19487-8_24},
booktitle={SWAT 88}, author={Dietzfelbinger, M. and Mehlhorn, K. and Meyer auf
der Heide, Friedhelm and Rohnert, H.}, year={1988} }'
chicago: Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H.
Rohnert. “Upper and Lower Bounds for the Dictionary Problem.” In SWAT 88.
Berlin, Heidelberg, 1988. https://doi.org/10.1007/3-540-19487-8_24.
ieee: M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper
and lower bounds for the dictionary problem,” in SWAT 88, Berlin, Heidelberg,
1988.
mla: Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.”
SWAT 88, 1988, doi:10.1007/3-540-19487-8_24.
short: 'M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in:
SWAT 88, Berlin, Heidelberg, 1988.'
date_created: 2020-04-21T09:01:36Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-19487-8_24
language:
- iso: eng
place: Berlin, Heidelberg
publication: SWAT 88
publication_identifier:
isbn:
- '9783540194873'
- '9783540392880'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Upper and lower bounds for the dictionary problem
type: book_chapter
user_id: '15415'
year: '1988'
...
---
_id: '16772'
author:
- first_name: A.
full_name: Borodin, A.
last_name: Borodin
- first_name: F.
full_name: Fich, F.
last_name: Fich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: E.
full_name: Upfal, E.
last_name: Upfal
- first_name: A.
full_name: Wigderson, A.
last_name: Wigderson
citation:
ama: Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A Time-Space
Tradeoff for Element Distinctness. SIAM Journal on Computing. 1987:97-99.
doi:10.1137/0216007
apa: Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson,
A. (1987). A Time-Space Tradeoff for Element Distinctness. SIAM Journal on
Computing, 97–99. https://doi.org/10.1137/0216007
bibtex: '@article{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1987, title={A
Time-Space Tradeoff for Element Distinctness}, DOI={10.1137/0216007},
journal={SIAM Journal on Computing}, author={Borodin, A. and Fich, F. and Meyer
auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1987}, pages={97–99}
}'
chicago: Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson.
“A Time-Space Tradeoff for Element Distinctness.” SIAM Journal on Computing,
1987, 97–99. https://doi.org/10.1137/0216007.
ieee: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A
Time-Space Tradeoff for Element Distinctness,” SIAM Journal on Computing,
pp. 97–99, 1987.
mla: Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” SIAM
Journal on Computing, 1987, pp. 97–99, doi:10.1137/0216007.
short: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, SIAM
Journal on Computing (1987) 97–99.
date_created: 2020-04-21T10:00:29Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/0216007
language:
- iso: eng
page: 97-99
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: A Time-Space Tradeoff for Element Distinctness
type: journal_article
user_id: '15415'
year: '1987'
...
---
_id: '16773'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: Meyer auf der Heide F, Wigderson A. The Complexity of Parallel Sorting. SIAM
Journal on Computing. 1987:100-107. doi:10.1137/0216008
apa: Meyer auf der Heide, F., & Wigderson, A. (1987). The Complexity of Parallel
Sorting. SIAM Journal on Computing, 100–107. https://doi.org/10.1137/0216008
bibtex: '@article{Meyer auf der Heide_Wigderson_1987, title={The Complexity of Parallel
Sorting}, DOI={10.1137/0216008},
journal={SIAM Journal on Computing}, author={Meyer auf der Heide, Friedhelm and
Wigderson, Avi}, year={1987}, pages={100–107} }'
chicago: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
Sorting.” SIAM Journal on Computing, 1987, 100–107. https://doi.org/10.1137/0216008.
ieee: F. Meyer auf der Heide and A. Wigderson, “The Complexity of Parallel Sorting,”
SIAM Journal on Computing, pp. 100–107, 1987.
mla: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
Sorting.” SIAM Journal on Computing, 1987, pp. 100–07, doi:10.1137/0216008.
short: F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1987) 100–107.
date_created: 2020-04-21T10:01:37Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/0216008
language:
- iso: eng
page: 100-107
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: The Complexity of Parallel Sorting
type: journal_article
user_id: '15415'
year: '1987'
...
---
_id: '16771'
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. Efficient Simulations among Several Models of Parallel
Computers. SIAM Journal on Computing. 1986:106-119. doi:10.1137/0215008
apa: Meyer auf der Heide, F. (1986). Efficient Simulations among Several Models
of Parallel Computers. SIAM Journal on Computing, 106–119. https://doi.org/10.1137/0215008
bibtex: '@article{Meyer auf der Heide_1986, title={Efficient Simulations among Several
Models of Parallel Computers}, DOI={10.1137/0215008},
journal={SIAM Journal on Computing}, author={Meyer auf der Heide, Friedhelm},
year={1986}, pages={106–119} }'
chicago: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
of Parallel Computers.” SIAM Journal on Computing, 1986, 106–19. https://doi.org/10.1137/0215008.
ieee: F. Meyer auf der Heide, “Efficient Simulations among Several Models of Parallel
Computers,” SIAM Journal on Computing, pp. 106–119, 1986.
mla: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
of Parallel Computers.” SIAM Journal on Computing, 1986, pp. 106–19, doi:10.1137/0215008.
short: F. Meyer auf der Heide, SIAM Journal on Computing (1986) 106–119.
date_created: 2020-04-21T09:59:29Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1137/0215008
language:
- iso: eng
page: 106-119
publication: SIAM Journal on Computing
publication_identifier:
issn:
- 0097-5397
- 1095-7111
publication_status: published
status: public
title: Efficient Simulations among Several Models of Parallel Computers
type: journal_article
user_id: '15415'
year: '1986'
...
---
_id: '16774'
author:
- first_name: Allan
full_name: Borodin, Allan
last_name: Borodin
- first_name: Faith E.
full_name: Fich, Faith E.
last_name: Fich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Eli
full_name: Upfal, Eli
last_name: Upfal
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: 'Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff
between search and update time for the implicit dictionary problem. In: Automata,
Languages and Programming. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16761-7_54'
apa: Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., & Wigderson,
A. (1986). A tradeoff between search and update time for the implicit dictionary
problem. In Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16761-7_54
bibtex: '@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin,
Heidelberg}, title={A tradeoff between search and update time for the implicit
dictionary problem}, DOI={10.1007/3-540-16761-7_54},
booktitle={Automata, Languages and Programming}, author={Borodin, Allan and Fich,
Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi},
year={1986} }'
chicago: Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal,
and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit
Dictionary Problem.” In Automata, Languages and Programming. Berlin, Heidelberg,
1986. https://doi.org/10.1007/3-540-16761-7_54.
ieee: A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson,
“A tradeoff between search and update time for the implicit dictionary problem,”
in Automata, Languages and Programming, Berlin, Heidelberg, 1986.
mla: Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit
Dictionary Problem.” Automata, Languages and Programming, 1986, doi:10.1007/3-540-16761-7_54.
short: 'A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in:
Automata, Languages and Programming, Berlin, Heidelberg, 1986.'
date_created: 2020-04-21T10:05:54Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-16761-7_54
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783540167617'
- '9783540398592'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A tradeoff between search and update time for the implicit dictionary problem
type: book_chapter
user_id: '15415'
year: '1986'
...
---
_id: '16775'
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. Speeding up random access machines by few processors.
In: STACS 86. Berlin, Heidelberg; 1986. doi:10.1007/3-540-16078-7_72'
apa: Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors.
In STACS 86. Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_72
bibtex: '@inbook{Meyer auf der Heide_1986, place={Berlin, Heidelberg}, title={Speeding
up random access machines by few processors}, DOI={10.1007/3-540-16078-7_72},
booktitle={STACS 86}, author={Meyer auf der Heide, Friedhelm}, year={1986} }'
chicago: Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by
Few Processors.” In STACS 86. Berlin, Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_72.
ieee: F. Meyer auf der Heide, “Speeding up random access machines by few processors,”
in STACS 86, Berlin, Heidelberg, 1986.
mla: Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few
Processors.” STACS 86, 1986, doi:10.1007/3-540-16078-7_72.
short: 'F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.'
date_created: 2020-04-21T10:07:06Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-16078-7_72
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 86
publication_identifier:
isbn:
- '9783540160786'
- '9783540397588'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Speeding up random access machines by few processors
type: book_chapter
user_id: '15415'
year: '1986'
...
---
_id: '16776'
author:
- first_name: A.
full_name: Borodin, A.
last_name: Borodin
- first_name: F.
full_name: Fich, F.
last_name: Fich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: E.
full_name: Upfal, E.
last_name: Upfal
- first_name: A.
full_name: Wigderson, A.
last_name: Wigderson
citation:
ama: 'Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space
tradeoff for element distinctness. In: STACS 86. Berlin, Heidelberg; 1986.
doi:10.1007/3-540-16078-7_89'
apa: Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., & Wigderson,
A. (1986). A time-space tradeoff for element distinctness. In STACS 86.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-16078-7_89
bibtex: '@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin,
Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={10.1007/3-540-16078-7_89},
booktitle={STACS 86}, author={Borodin, A. and Fich, F. and Meyer auf der Heide,
Friedhelm and Upfal, E. and Wigderson, A.}, year={1986} }'
chicago: Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson.
“A Time-Space Tradeoff for Element Distinctness.” In STACS 86. Berlin,
Heidelberg, 1986. https://doi.org/10.1007/3-540-16078-7_89.
ieee: A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A
time-space tradeoff for element distinctness,” in STACS 86, Berlin, Heidelberg,
1986.
mla: Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” STACS
86, 1986, doi:10.1007/3-540-16078-7_89.
short: 'A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in:
STACS 86, Berlin, Heidelberg, 1986.'
date_created: 2020-04-21T10:08:23Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-16078-7_89
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 86
publication_identifier:
isbn:
- '9783540160786'
- '9783540397588'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A time-space tradeoff for element distinctness
type: book_chapter
user_id: '15415'
year: '1986'
...
---
_id: '16779'
author:
- first_name: Clemens
full_name: Lautemann, Clemens
last_name: Lautemann
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Lautemann C, Meyer auf der Heide F. Lower time bounds for integer programming
with two variables. Information Processing Letters. 1985:101-105. doi:10.1016/0020-0190(85)90042-0
apa: Lautemann, C., & Meyer auf der Heide, F. (1985). Lower time bounds for
integer programming with two variables. Information Processing Letters,
101–105. https://doi.org/10.1016/0020-0190(85)90042-0
bibtex: '@article{Lautemann_Meyer auf der Heide_1985, title={Lower time bounds for
integer programming with two variables}, DOI={10.1016/0020-0190(85)90042-0},
journal={Information Processing Letters}, author={Lautemann, Clemens and Meyer
auf der Heide, Friedhelm}, year={1985}, pages={101–105} }'
chicago: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds
for Integer Programming with Two Variables.” Information Processing Letters,
1985, 101–5. https://doi.org/10.1016/0020-0190(85)90042-0.
ieee: C. Lautemann and F. Meyer auf der Heide, “Lower time bounds for integer programming
with two variables,” Information Processing Letters, pp. 101–105, 1985.
mla: Lautemann, Clemens, and Friedhelm Meyer auf der Heide. “Lower Time Bounds for
Integer Programming with Two Variables.” Information Processing Letters,
1985, pp. 101–05, doi:10.1016/0020-0190(85)90042-0.
short: C. Lautemann, F. Meyer auf der Heide, Information Processing Letters (1985)
101–105.
date_created: 2020-04-21T10:15:46Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0020-0190(85)90042-0
language:
- iso: eng
page: 101-105
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
status: public
title: Lower time bounds for integer programming with two variables
type: journal_article
user_id: '15415'
year: '1985'
...
---
_id: '16780'
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. Lower bounds for solving linear diophantine equations
on random access machines. Journal of the ACM (JACM). 1985:929-937. doi:10.1145/4221.4250
apa: Meyer auf der Heide, F. (1985). Lower bounds for solving linear diophantine
equations on random access machines. Journal of the ACM (JACM), 929–937.
https://doi.org/10.1145/4221.4250
bibtex: '@article{Meyer auf der Heide_1985, title={Lower bounds for solving linear
diophantine equations on random access machines}, DOI={10.1145/4221.4250},
journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm},
year={1985}, pages={929–937} }'
chicago: Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine
Equations on Random Access Machines.” Journal of the ACM (JACM), 1985,
929–37. https://doi.org/10.1145/4221.4250.
ieee: F. Meyer auf der Heide, “Lower bounds for solving linear diophantine equations
on random access machines,” Journal of the ACM (JACM), pp. 929–937, 1985.
mla: Meyer auf der Heide, Friedhelm. “Lower Bounds for Solving Linear Diophantine
Equations on Random Access Machines.” Journal of the ACM (JACM), 1985,
pp. 929–37, doi:10.1145/4221.4250.
short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1985) 929–937.
date_created: 2020-04-21T10:16:50Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/4221.4250
language:
- iso: eng
page: 929-937
publication: Journal of the ACM (JACM)
publication_identifier:
issn:
- 0004-5411
- 1557-735X
publication_status: published
status: public
title: Lower bounds for solving linear diophantine equations on random access machines
type: journal_article
user_id: '15415'
year: '1985'
...
---
_id: '16781'
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. Simulating probabilistic by deterministic algebraic
computation trees. Theoretical Computer Science. 1985:325-330. doi:10.1016/0304-3975(85)90079-9
apa: Meyer auf der Heide, F. (1985). Simulating probabilistic by deterministic algebraic
computation trees. Theoretical Computer Science, 325–330. https://doi.org/10.1016/0304-3975(85)90079-9
bibtex: '@article{Meyer auf der Heide_1985, title={Simulating probabilistic by deterministic
algebraic computation trees}, DOI={10.1016/0304-3975(85)90079-9},
journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1985}, pages={325–330} }'
chicago: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic
Algebraic Computation Trees.” Theoretical Computer Science, 1985, 325–30.
https://doi.org/10.1016/0304-3975(85)90079-9.
ieee: F. Meyer auf der Heide, “Simulating probabilistic by deterministic algebraic
computation trees,” Theoretical Computer Science, pp. 325–330, 1985.
mla: Meyer auf der Heide, Friedhelm. “Simulating Probabilistic by Deterministic
Algebraic Computation Trees.” Theoretical Computer Science, 1985, pp. 325–30,
doi:10.1016/0304-3975(85)90079-9.
short: F. Meyer auf der Heide, Theoretical Computer Science (1985) 325–330.
date_created: 2020-04-21T11:18:44Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1016/0304-3975(85)90079-9
language:
- iso: eng
page: 325-330
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: Simulating probabilistic by deterministic algebraic computation trees
type: journal_article
user_id: '15415'
year: '1985'
...
---
_id: '16782'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Avi
full_name: Wigderson, Avi
last_name: Wigderson
citation:
ama: 'Meyer auf der Heide F, Wigderson A. The complexity of parallel sorting. In:
26th Annual Symposium on Foundations of Computer Science (Sfcs 1985). ;
1985. doi:10.1109/sfcs.1985.58'
apa: Meyer auf der Heide, F., & Wigderson, A. (1985). The complexity of parallel
sorting. In 26th Annual Symposium on Foundations of Computer Science (sfcs
1985). https://doi.org/10.1109/sfcs.1985.58
bibtex: '@inproceedings{Meyer auf der Heide_Wigderson_1985, title={The complexity
of parallel sorting}, DOI={10.1109/sfcs.1985.58},
booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)},
author={Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1985} }'
chicago: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
Sorting.” In 26th Annual Symposium on Foundations of Computer Science (Sfcs
1985), 1985. https://doi.org/10.1109/sfcs.1985.58.
ieee: F. Meyer auf der Heide and A. Wigderson, “The complexity of parallel sorting,”
in 26th Annual Symposium on Foundations of Computer Science (sfcs 1985),
1985.
mla: Meyer auf der Heide, Friedhelm, and Avi Wigderson. “The Complexity of Parallel
Sorting.” 26th Annual Symposium on Foundations of Computer Science (Sfcs 1985),
1985, doi:10.1109/sfcs.1985.58.
short: 'F. Meyer auf der Heide, A. Wigderson, in: 26th Annual Symposium on Foundations
of Computer Science (Sfcs 1985), 1985.'
date_created: 2020-04-21T11:19:34Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1109/sfcs.1985.58
language:
- iso: eng
publication: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
publication_identifier:
isbn:
- '0818606444'
publication_status: published
status: public
title: The complexity of parallel sorting
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16783'
author:
- first_name: F E
full_name: Fich, F E
last_name: Fich
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: P
full_name: Ragde, P
last_name: Ragde
- first_name: A
full_name: Wigderson, A
last_name: Wigderson
citation:
ama: 'Fich FE, Meyer auf der Heide F, Ragde P, Wigderson A. One, two, three . .
. infinity: lower bounds for parallel computation. In: Proceedings of the Seventeenth
Annual ACM Symposium on Theory of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22151'
apa: 'Fich, F. E., Meyer auf der Heide, F., Ragde, P., & Wigderson, A. (1985).
One, two, three . . . infinity: lower bounds for parallel computation. In Proceedings
of the seventeenth annual ACM symposium on Theory of computing - STOC ’85.
https://doi.org/10.1145/22145.22151'
bibtex: '@inproceedings{Fich_Meyer auf der Heide_Ragde_Wigderson_1985, title={One,
two, three . . . infinity: lower bounds for parallel computation}, DOI={10.1145/22145.22151},
booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing
- STOC ’85}, author={Fich, F E and Meyer auf der Heide, Friedhelm and Ragde, P
and Wigderson, A}, year={1985} }'
chicago: 'Fich, F E, Friedhelm Meyer auf der Heide, P Ragde, and A Wigderson. “One,
Two, Three . . . Infinity: Lower Bounds for Parallel Computation.” In Proceedings
of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85,
1985. https://doi.org/10.1145/22145.22151.'
ieee: 'F. E. Fich, F. Meyer auf der Heide, P. Ragde, and A. Wigderson, “One, two,
three . . . infinity: lower bounds for parallel computation,” in Proceedings
of the seventeenth annual ACM symposium on Theory of computing - STOC ’85,
1985.'
mla: 'Fich, F. E., et al. “One, Two, Three . . . Infinity: Lower Bounds for Parallel
Computation.” Proceedings of the Seventeenth Annual ACM Symposium on Theory
of Computing - STOC ’85, 1985, doi:10.1145/22145.22151.'
short: 'F.E. Fich, F. Meyer auf der Heide, P. Ragde, A. Wigderson, in: Proceedings
of the Seventeenth Annual ACM Symposium on Theory of Computing - STOC ’85, 1985.'
date_created: 2020-04-21T11:20:53Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1145/22145.22151
language:
- iso: eng
publication: Proceedings of the seventeenth annual ACM symposium on Theory of computing -
STOC '85
publication_identifier:
isbn:
- '0897911512'
publication_status: published
status: public
title: 'One, two, three . . . infinity: lower bounds for parallel computation'
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16784'
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. Fast algorithms for n-dimensional restrictions of hard
problems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory
of Computing - STOC ’85. ; 1985. doi:10.1145/22145.22191'
apa: Meyer auf der Heide, F. (1985). Fast algorithms for n-dimensional restrictions
of hard problems. In Proceedings of the seventeenth annual ACM symposium on
Theory of computing - STOC ’85. https://doi.org/10.1145/22145.22191
bibtex: '@inproceedings{Meyer auf der Heide_1985, title={Fast algorithms for n-dimensional
restrictions of hard problems}, DOI={10.1145/22145.22191},
booktitle={Proceedings of the seventeenth annual ACM symposium on Theory of computing
- STOC ’85}, author={Meyer auf der Heide, Friedhelm}, year={1985} }'
chicago: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
of Hard Problems.” In Proceedings of the Seventeenth Annual ACM Symposium on
Theory of Computing - STOC ’85, 1985. https://doi.org/10.1145/22145.22191.
ieee: F. Meyer auf der Heide, “Fast algorithms for n-dimensional restrictions of
hard problems,” in Proceedings of the seventeenth annual ACM symposium on Theory
of computing - STOC ’85, 1985.
mla: Meyer auf der Heide, Friedhelm. “Fast Algorithms for N-Dimensional Restrictions
of Hard Problems.” Proceedings of the Seventeenth Annual ACM Symposium on Theory
of Computing - STOC ’85, 1985, doi:10.1145/22145.22191.
short: 'F. Meyer auf der Heide, in: Proceedings of the Seventeenth Annual ACM Symposium
on Theory of Computing - STOC ’85, 1985.'
date_created: 2020-04-21T11:24:17Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1145/22145.22191
language:
- iso: eng
publication: Proceedings of the seventeenth annual ACM symposium on Theory of computing -
STOC '85
publication_identifier:
isbn:
- '0897911512'
publication_status: published
status: public
title: Fast algorithms for n-dimensional restrictions of hard problems
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16788'
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. Nondeterministic versus probabilistic linear search
algorithms. In: 26th Annual Symposium on Foundations of Computer Science (Sfcs
1985). ; 1985. doi:10.1109/sfcs.1985.38'
apa: Meyer auf der Heide, F. (1985). Nondeterministic versus probabilistic linear
search algorithms. In 26th Annual Symposium on Foundations of Computer Science
(sfcs 1985). https://doi.org/10.1109/sfcs.1985.38
bibtex: '@inproceedings{Meyer auf der Heide_1985, title={Nondeterministic versus
probabilistic linear search algorithms}, DOI={10.1109/sfcs.1985.38},
booktitle={26th Annual Symposium on Foundations of Computer Science (sfcs 1985)},
author={Meyer auf der Heide, Friedhelm}, year={1985} }'
chicago: Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic
Linear Search Algorithms.” In 26th Annual Symposium on Foundations of Computer
Science (Sfcs 1985), 1985. https://doi.org/10.1109/sfcs.1985.38.
ieee: F. Meyer auf der Heide, “Nondeterministic versus probabilistic linear search
algorithms,” in 26th Annual Symposium on Foundations of Computer Science (sfcs
1985), 1985.
mla: Meyer auf der Heide, Friedhelm. “Nondeterministic versus Probabilistic Linear
Search Algorithms.” 26th Annual Symposium on Foundations of Computer Science
(Sfcs 1985), 1985, doi:10.1109/sfcs.1985.38.
short: 'F. Meyer auf der Heide, in: 26th Annual Symposium on Foundations of Computer
Science (Sfcs 1985), 1985.'
date_created: 2020-04-21T11:30:30Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1109/sfcs.1985.38
language:
- iso: eng
publication: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
publication_identifier:
isbn:
- '0818606444'
publication_status: published
status: public
title: Nondeterministic versus probabilistic linear search algorithms
type: conference
user_id: '15415'
year: '1985'
...
---
_id: '16823'
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. Lower time bounds for solving linear diophantine equations
on several parallel computational models. Information and Control. 1985;67(1-3):195-211.
doi:10.1016/S0019-9958(85)80035-8
apa: Meyer auf der Heide, F. (1985). Lower time bounds for solving linear diophantine
equations on several parallel computational models. Information and Control,
67(1–3), 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8
bibtex: '@article{Meyer auf der Heide_1985, title={Lower time bounds for solving
linear diophantine equations on several parallel computational models}, volume={67},
DOI={10.1016/S0019-9958(85)80035-8},
number={1–3}, journal={Information and Control}, author={Meyer auf der Heide,
Friedhelm}, year={1985}, pages={195–211} }'
chicago: 'Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear
Diophantine Equations on Several Parallel Computational Models.” Information
and Control 67, no. 1–3 (1985): 195–211. https://doi.org/10.1016/S0019-9958(85)80035-8.'
ieee: F. Meyer auf der Heide, “Lower time bounds for solving linear diophantine
equations on several parallel computational models,” Information and Control,
vol. 67, no. 1–3, pp. 195–211, 1985.
mla: Meyer auf der Heide, Friedhelm. “Lower Time Bounds for Solving Linear Diophantine
Equations on Several Parallel Computational Models.” Information and Control,
vol. 67, no. 1–3, 1985, pp. 195–211, doi:10.1016/S0019-9958(85)80035-8.
short: F. Meyer auf der Heide, Information and Control 67 (1985) 195–211.
date_created: 2020-04-22T09:58:17Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1016/S0019-9958(85)80035-8
intvolume: ' 67'
issue: 1-3
language:
- iso: eng
page: 195-211
publication: Information and Control
status: public
title: Lower time bounds for solving linear diophantine equations on several parallel
computational models
type: journal_article
user_id: '15415'
volume: 67
year: '1985'
...
---
_id: '16785'
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. A Polynomial Linear Search Algorithm forr the n-Dimensional
Knapsack Problem. Journal of the ACM (JACM). 1984:668-676. doi:10.1145/828.322450
apa: Meyer auf der Heide, F. (1984). A Polynomial Linear Search Algorithm forr the
n-Dimensional Knapsack Problem. Journal of the ACM (JACM), 668–676. https://doi.org/10.1145/828.322450
bibtex: '@article{Meyer auf der Heide_1984, title={A Polynomial Linear Search Algorithm
forr the n-Dimensional Knapsack Problem}, DOI={10.1145/828.322450},
journal={Journal of the ACM (JACM)}, author={Meyer auf der Heide, Friedhelm},
year={1984}, pages={668–676} }'
chicago: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr
the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, 668–76.
https://doi.org/10.1145/828.322450.
ieee: F. Meyer auf der Heide, “A Polynomial Linear Search Algorithm forr the n-Dimensional
Knapsack Problem,” Journal of the ACM (JACM), pp. 668–676, 1984.
mla: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm Forr
the N-Dimensional Knapsack Problem.” Journal of the ACM (JACM), 1984, pp.
668–76, doi:10.1145/828.322450.
short: F. Meyer auf der Heide, Journal of the ACM (JACM) (1984) 668–676.
date_created: 2020-04-21T11:25:52Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1145/828.322450
language:
- iso: eng
page: 668-676
publication: Journal of the ACM (JACM)
publication_identifier:
issn:
- 0004-5411
- 1557-735X
publication_status: published
status: public
title: A Polynomial Linear Search Algorithm forr the n-Dimensional Knapsack Problem
type: journal_article
user_id: '15415'
year: '1984'
...
---
_id: '16786'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: R.
full_name: Reischuk, R.
last_name: Reischuk
citation:
ama: 'Meyer auf der Heide F, Reischuk R. On The Limits To Speed Up Parallel Machines
By Large Hardware And Unbounded Communication. In: 25th Annual Symposium OnFoundations
of Computer Science, 1984. ; 1984. doi:10.1109/sfcs.1984.715901'
apa: Meyer auf der Heide, F., & Reischuk, R. (1984). On The Limits To Speed
Up Parallel Machines By Large Hardware And Unbounded Communication. In 25th
Annual Symposium onFoundations of Computer Science, 1984. https://doi.org/10.1109/sfcs.1984.715901
bibtex: '@inproceedings{Meyer auf der Heide_Reischuk_1984, title={On The Limits
To Speed Up Parallel Machines By Large Hardware And Unbounded Communication},
DOI={10.1109/sfcs.1984.715901},
booktitle={25th Annual Symposium onFoundations of Computer Science, 1984.}, author={Meyer
auf der Heide, Friedhelm and Reischuk, R.}, year={1984} }'
chicago: Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed
Up Parallel Machines By Large Hardware And Unbounded Communication.” In 25th
Annual Symposium OnFoundations of Computer Science, 1984., 1984. https://doi.org/10.1109/sfcs.1984.715901.
ieee: F. Meyer auf der Heide and R. Reischuk, “On The Limits To Speed Up Parallel
Machines By Large Hardware And Unbounded Communication,” in 25th Annual Symposium
onFoundations of Computer Science, 1984., 1984.
mla: Meyer auf der Heide, Friedhelm, and R. Reischuk. “On The Limits To Speed Up
Parallel Machines By Large Hardware And Unbounded Communication.” 25th Annual
Symposium OnFoundations of Computer Science, 1984., 1984, doi:10.1109/sfcs.1984.715901.
short: 'F. Meyer auf der Heide, R. Reischuk, in: 25th Annual Symposium OnFoundations
of Computer Science, 1984., 1984.'
date_created: 2020-04-21T11:27:07Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1109/sfcs.1984.715901
language:
- iso: eng
publication: 25th Annual Symposium onFoundations of Computer Science, 1984.
publication_identifier:
isbn:
- 081860591X
publication_status: published
status: public
title: On The Limits To Speed Up Parallel Machines By Large Hardware And Unbounded
Communication
type: conference
user_id: '15415'
year: '1984'
...
---
_id: '16787'
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. Efficient simulations among several models of parallel
computers (extended abstract). In: STACS 84. Berlin, Heidelberg; 1984.
doi:10.1007/3-540-12920-0_20'
apa: Meyer auf der Heide, F. (1984). Efficient simulations among several models
of parallel computers (extended abstract). In STACS 84. Berlin, Heidelberg.
https://doi.org/10.1007/3-540-12920-0_20
bibtex: '@inbook{Meyer auf der Heide_1984, place={Berlin, Heidelberg}, title={Efficient
simulations among several models of parallel computers (extended abstract)}, DOI={10.1007/3-540-12920-0_20},
booktitle={STACS 84}, author={Meyer auf der Heide, Friedhelm}, year={1984} }'
chicago: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
of Parallel Computers (Extended Abstract).” In STACS 84. Berlin, Heidelberg,
1984. https://doi.org/10.1007/3-540-12920-0_20.
ieee: F. Meyer auf der Heide, “Efficient simulations among several models of parallel
computers (extended abstract),” in STACS 84, Berlin, Heidelberg, 1984.
mla: Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models
of Parallel Computers (Extended Abstract).” STACS 84, 1984, doi:10.1007/3-540-12920-0_20.
short: 'F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.'
date_created: 2020-04-21T11:28:40Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-12920-0_20
language:
- iso: eng
place: Berlin, Heidelberg
publication: STACS 84
publication_identifier:
isbn:
- '9783540129202'
- '9783540388050'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Efficient simulations among several models of parallel computers (extended
abstract)
type: book_chapter
user_id: '15415'
year: '1984'
...
---
_id: '16806'
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. Efficiency of universal parallel computers. Acta
Informatica. 1983:269-296. doi:10.1007/bf00265559
apa: Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers.
Acta Informatica, 269–296. https://doi.org/10.1007/bf00265559
bibtex: '@article{Meyer auf der Heide_1983, title={Efficiency of universal parallel
computers}, DOI={10.1007/bf00265559},
journal={Acta Informatica}, author={Meyer auf der Heide, Friedhelm}, year={1983},
pages={269–296} }'
chicago: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
Acta Informatica, 1983, 269–96. https://doi.org/10.1007/bf00265559.
ieee: F. Meyer auf der Heide, “Efficiency of universal parallel computers,” Acta
Informatica, pp. 269–296, 1983.
mla: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
Acta Informatica, 1983, pp. 269–96, doi:10.1007/bf00265559.
short: F. Meyer auf der Heide, Acta Informatica (1983) 269–296.
date_created: 2020-04-22T08:48:20Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bf00265559
language:
- iso: eng
page: 269-296
publication: Acta Informatica
publication_identifier:
issn:
- 0001-5903
- 1432-0525
publication_status: published
status: public
title: Efficiency of universal parallel computers
type: journal_article
user_id: '15415'
year: '1983'
...
---
_id: '16807'
author:
- first_name: Peter
full_name: Klein, Peter
last_name: Klein
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Klein P, Meyer auf der Heide F. A lower time bound for the knapsack problem
on random access machines. Acta Informatica. 1983:385-395. doi:10.1007/bf00290735
apa: Klein, P., & Meyer auf der Heide, F. (1983). A lower time bound for the
knapsack problem on random access machines. Acta Informatica, 385–395.
https://doi.org/10.1007/bf00290735
bibtex: '@article{Klein_Meyer auf der Heide_1983, title={A lower time bound for
the knapsack problem on random access machines}, DOI={10.1007/bf00290735},
journal={Acta Informatica}, author={Klein, Peter and Meyer auf der Heide, Friedhelm},
year={1983}, pages={385–395} }'
chicago: Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for
the Knapsack Problem on Random Access Machines.” Acta Informatica, 1983,
385–95. https://doi.org/10.1007/bf00290735.
ieee: P. Klein and F. Meyer auf der Heide, “A lower time bound for the knapsack
problem on random access machines,” Acta Informatica, pp. 385–395, 1983.
mla: Klein, Peter, and Friedhelm Meyer auf der Heide. “A Lower Time Bound for the
Knapsack Problem on Random Access Machines.” Acta Informatica, 1983, pp.
385–95, doi:10.1007/bf00290735.
short: P. Klein, F. Meyer auf der Heide, Acta Informatica (1983) 385–395.
date_created: 2020-04-22T08:49:58Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bf00290735
language:
- iso: eng
page: 385-395
publication: Acta Informatica
publication_identifier:
issn:
- 0001-5903
- 1432-0525
publication_status: published
status: public
title: A lower time bound for the knapsack problem on random access machines
type: journal_article
user_id: '15415'
year: '1983'
...
---
_id: '16808'
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. Infinite cube-connected cycles. Information Processing
Letters. 1983:1-2. doi:10.1016/0020-0190(83)90001-7
apa: Meyer auf der Heide, F. (1983). Infinite cube-connected cycles. Information
Processing Letters, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7
bibtex: '@article{Meyer auf der Heide_1983, title={Infinite cube-connected cycles},
DOI={10.1016/0020-0190(83)90001-7},
journal={Information Processing Letters}, author={Meyer auf der Heide, Friedhelm},
year={1983}, pages={1–2} }'
chicago: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information
Processing Letters, 1983, 1–2. https://doi.org/10.1016/0020-0190(83)90001-7.
ieee: F. Meyer auf der Heide, “Infinite cube-connected cycles,” Information Processing
Letters, pp. 1–2, 1983.
mla: Meyer auf der Heide, Friedhelm. “Infinite Cube-Connected Cycles.” Information
Processing Letters, 1983, pp. 1–2, doi:10.1016/0020-0190(83)90001-7.
short: F. Meyer auf der Heide, Information Processing Letters (1983) 1–2.
date_created: 2020-04-22T08:51:01Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1016/0020-0190(83)90001-7
language:
- iso: eng
page: 1-2
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
status: public
title: Infinite cube-connected cycles
type: journal_article
user_id: '15415'
year: '1983'
...
---
_id: '16809'
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. A polynomial linear search algorithm for the n-dimensional
knapsack problem. In: Proceedings of the Fifteenth Annual ACM Symposium on
Theory of Computing - STOC ’83. ; 1983. doi:10.1145/800061.808734'
apa: Meyer auf der Heide, F. (1983). A polynomial linear search algorithm for the
n-dimensional knapsack problem. In Proceedings of the fifteenth annual ACM
symposium on Theory of computing - STOC ’83. https://doi.org/10.1145/800061.808734
bibtex: '@inproceedings{Meyer auf der Heide_1983, title={A polynomial linear search
algorithm for the n-dimensional knapsack problem}, DOI={10.1145/800061.808734},
booktitle={Proceedings of the fifteenth annual ACM symposium on Theory of computing
- STOC ’83}, author={Meyer auf der Heide, Friedhelm}, year={1983} }'
chicago: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for
the N-Dimensional Knapsack Problem.” In Proceedings of the Fifteenth Annual
ACM Symposium on Theory of Computing - STOC ’83, 1983. https://doi.org/10.1145/800061.808734.
ieee: F. Meyer auf der Heide, “A polynomial linear search algorithm for the n-dimensional
knapsack problem,” in Proceedings of the fifteenth annual ACM symposium on
Theory of computing - STOC ’83, 1983.
mla: Meyer auf der Heide, Friedhelm. “A Polynomial Linear Search Algorithm for the
N-Dimensional Knapsack Problem.” Proceedings of the Fifteenth Annual ACM Symposium
on Theory of Computing - STOC ’83, 1983, doi:10.1145/800061.808734.
short: 'F. Meyer auf der Heide, in: Proceedings of the Fifteenth Annual ACM Symposium
on Theory of Computing - STOC ’83, 1983.'
date_created: 2020-04-22T08:52:15Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1145/800061.808734
language:
- iso: eng
publication: Proceedings of the fifteenth annual ACM symposium on Theory of computing -
STOC '83
publication_identifier:
isbn:
- '0897910990'
publication_status: published
status: public
title: A polynomial linear search algorithm for the n-dimensional knapsack problem
type: conference
user_id: '15415'
year: '1983'
...
---
_id: '16810'
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. Efficiency of universal parallel computers. In: Lecture
Notes in Computer Science. Berlin/Heidelberg; 1983. doi:10.1007/bfb0036483'
apa: Meyer auf der Heide, F. (1983). Efficiency of universal parallel computers.
In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0036483
bibtex: '@inbook{Meyer auf der Heide_1983, place={Berlin/Heidelberg}, title={Efficiency
of universal parallel computers}, DOI={10.1007/bfb0036483},
booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1983} }'
chicago: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
In Lecture Notes in Computer Science. Berlin/Heidelberg, 1983. https://doi.org/10.1007/bfb0036483.
ieee: F. Meyer auf der Heide, “Efficiency of universal parallel computers,” in Lecture
Notes in Computer Science, Berlin/Heidelberg, 1983.
mla: Meyer auf der Heide, Friedhelm. “Efficiency of Universal Parallel Computers.”
Lecture Notes in Computer Science, 1983, doi:10.1007/bfb0036483.
short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg,
1983.'
date_created: 2020-04-22T08:53:33Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/bfb0036483
language:
- iso: eng
place: Berlin/Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '3540119736'
publication_status: published
status: public
title: Efficiency of universal parallel computers
type: book_chapter
user_id: '15415'
year: '1983'
...
---
_id: '16813'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Anton
full_name: Rollik, Anton
last_name: Rollik
citation:
ama: 'Meyer auf der Heide F, Rollik A. Random access machines and straight-line
programs. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 1981.
doi:10.1007/3-540-10854-8_29'
apa: Meyer auf der Heide, F., & Rollik, A. (1981). Random access machines and
straight-line programs. In Fundamentals of Computation Theory. Berlin,
Heidelberg. https://doi.org/10.1007/3-540-10854-8_29
bibtex: '@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random
access machines and straight-line programs}, DOI={10.1007/3-540-10854-8_29},
booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm
and Rollik, Anton}, year={1981} }'
chicago: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines
and Straight-Line Programs.” In Fundamentals of Computation Theory. Berlin,
Heidelberg, 1981. https://doi.org/10.1007/3-540-10854-8_29.
ieee: F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line
programs,” in Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.
mla: Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and
Straight-Line Programs.” Fundamentals of Computation Theory, 1981, doi:10.1007/3-540-10854-8_29.
short: 'F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory,
Berlin, Heidelberg, 1981.'
date_created: 2020-04-22T09:03:21Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-10854-8_29
language:
- iso: eng
place: Berlin, Heidelberg
publication: Fundamentals of Computation Theory
publication_identifier:
isbn:
- '9783540108542'
- '9783540387657'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Random access machines and straight-line programs
type: book_chapter
user_id: '15415'
year: '1981'
...
---
_id: '16814'
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. Time-processor trade-offs for universal parallel computers.
In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1981. doi:10.1007/3-540-10856-4_111'
apa: Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel
computers. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_111
bibtex: '@inbook{Meyer auf der Heide_1981, place={Berlin, Heidelberg}, title={Time-processor
trade-offs for universal parallel computers}, DOI={10.1007/3-540-10856-4_111},
booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1981} }'
chicago: Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal
Parallel Computers.” In Lecture Notes in Computer Science. Berlin, Heidelberg,
1981. https://doi.org/10.1007/3-540-10856-4_111.
ieee: F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel
computers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.
mla: Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel
Computers.” Lecture Notes in Computer Science, 1981, doi:10.1007/3-540-10856-4_111.
short: 'F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg,
1981.'
date_created: 2020-04-22T09:05:15Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/3-540-10856-4_111
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540108566'
- '9783540387695'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Time-processor trade-offs for universal parallel computers
type: book_chapter
user_id: '15415'
year: '1981'
...
---
_id: '16820'
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. A comparison of two variations of a pebble game on graphs.
Theoretical Computer Science. 1981:315-322. doi:10.1016/s0304-3975(81)80004-7
apa: Meyer auf der Heide, F. (1981). A comparison of two variations of a pebble
game on graphs. Theoretical Computer Science, 315–322. https://doi.org/10.1016/s0304-3975(81)80004-7
bibtex: '@article{Meyer auf der Heide_1981, title={A comparison of two variations
of a pebble game on graphs}, DOI={10.1016/s0304-3975(81)80004-7},
journal={Theoretical Computer Science}, author={Meyer auf der Heide, Friedhelm},
year={1981}, pages={315–322} }'
chicago: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Theoretical Computer Science, 1981, 315–22. https://doi.org/10.1016/s0304-3975(81)80004-7.
ieee: F. Meyer auf der Heide, “A comparison of two variations of a pebble game on
graphs,” Theoretical Computer Science, pp. 315–322, 1981.
mla: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Theoretical Computer Science, 1981, pp. 315–22, doi:10.1016/s0304-3975(81)80004-7.
short: F. Meyer auf der Heide, Theoretical Computer Science (1981) 315–322.
date_created: 2020-04-22T09:33:31Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1016/s0304-3975(81)80004-7
language:
- iso: eng
page: 315-322
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
status: public
title: A comparison of two variations of a pebble game on graphs
type: journal_article
user_id: '15415'
year: '1981'
...
---
_id: '16815'
author:
- first_name: P.
full_name: Klein, P.
last_name: Klein
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Klein P, Meyer auf der Heide F. Untere Zeitschranken für das Rucksack-Problem.
In: GI - 10. Jahrestagung. Berlin, Heidelberg; 1980. doi:10.1007/978-3-642-67838-7_34'
apa: Klein, P., & Meyer auf der Heide, F. (1980). Untere Zeitschranken für das
Rucksack-Problem. In GI - 10. Jahrestagung. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67838-7_34
bibtex: '@inbook{Klein_Meyer auf der Heide_1980, place={Berlin, Heidelberg}, title={Untere
Zeitschranken für das Rucksack-Problem}, DOI={10.1007/978-3-642-67838-7_34},
booktitle={GI - 10. Jahrestagung}, author={Klein, P. and Meyer auf der Heide,
Friedhelm}, year={1980} }'
chicago: Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für
Das Rucksack-Problem.” In GI - 10. Jahrestagung. Berlin, Heidelberg, 1980.
https://doi.org/10.1007/978-3-642-67838-7_34.
ieee: P. Klein and F. Meyer auf der Heide, “Untere Zeitschranken für das Rucksack-Problem,”
in GI - 10. Jahrestagung, Berlin, Heidelberg, 1980.
mla: Klein, P., and Friedhelm Meyer auf der Heide. “Untere Zeitschranken Für Das
Rucksack-Problem.” GI - 10. Jahrestagung, 1980, doi:10.1007/978-3-642-67838-7_34.
short: 'P. Klein, F. Meyer auf der Heide, in: GI - 10. Jahrestagung, Berlin, Heidelberg,
1980.'
date_created: 2020-04-22T09:06:48Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: 10.1007/978-3-642-67838-7_34
language:
- iso: eng
place: Berlin, Heidelberg
publication: GI - 10. Jahrestagung
publication_identifier:
isbn:
- '9783540103882'
- '9783642678387'
issn:
- 0343-3005
publication_status: published
status: public
title: Untere Zeitschranken für das Rucksack-Problem
type: book_chapter
user_id: '15415'
year: '1980'
...
---
_id: '16812'
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. A comparison of two variations of a pebble game on graphs.
Automata, Languages and Programming ICALP 1979. 1979:411-421. doi:10.1007/3-540-09510-1_32
apa: Meyer auf der Heide, F. (1979). A comparison of two variations of a pebble
game on graphs. Automata, Languages and Programming. ICALP 1979, 411–421.
https://doi.org/10.1007/3-540-09510-1_32
bibtex: '@article{Meyer auf der Heide_1979, title={A comparison of two variations
of a pebble game on graphs}, DOI={10.1007/3-540-09510-1_32 }, journal={Automata, Languages and Programming.
ICALP 1979}, author={Meyer auf der Heide, Friedhelm}, year={1979}, pages={411–421}
}'
chicago: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979,
411–21. https://doi.org/10.1007/3-540-09510-1_32
.
ieee: F. Meyer auf der Heide, “A comparison of two variations of a pebble game on
graphs,” Automata, Languages and Programming. ICALP 1979, pp. 411–421,
1979.
mla: Meyer auf der Heide, Friedhelm. “A Comparison of Two Variations of a Pebble
Game on Graphs.” Automata, Languages and Programming. ICALP 1979, 1979,
pp. 411–21, doi:10.1007/3-540-09510-1_32
.
short: F. Meyer auf der Heide, Automata, Languages and Programming. ICALP 1979 (1979)
411–421.
date_created: 2020-04-22T09:02:08Z
date_updated: 2022-01-06T06:52:56Z
department:
- _id: '63'
doi: '10.1007/3-540-09510-1_32 '
language:
- iso: eng
page: 411-421
publication: Automata, Languages and Programming. ICALP 1979
publication_status: published
status: public
title: A comparison of two variations of a pebble game on graphs
type: journal_article
user_id: '15415'
year: '1979'
...