---
_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: '7831'
abstract:
- lang: eng
text: We present a combination of recent extensions to single-pushout graph transformations,
as there are attribution, application conditions and amalgamated graph transformations
and add a simple transaction concept on top of this formalism. Thereby, we provide
the formal basis for several examples, where these concepts are used in combination.
author:
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Jürgen
full_name: Müller, Jürgen
last_name: Müller
- first_name: Gabriele
full_name: Taentzer, Gabriele
last_name: Taentzer
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: 'Heckel R, Müller J, Taentzer G, Wagner A. Attributed Graph Transformations
with Controlled Application of Rules. In: Proceedings of the Colloquium on
Graph Transformation and Its Application in Computer Science. Technical Report.
Universitat de les Illes Balears; 1995.'
apa: Heckel, R., Müller, J., Taentzer, G., & Wagner, A. (1995). Attributed Graph
Transformations with Controlled Application of Rules. In Proceedings of the
Colloquium on Graph Transformation and its Application in Computer Science.
Universitat de les Illes Balears.
bibtex: '@inproceedings{Heckel_Müller_Taentzer_Wagner_1995, series={Technical Report},
title={Attributed Graph Transformations with Controlled Application of Rules},
number={B-19}, booktitle={Proceedings of the Colloquium on Graph Transformation
and its Application in Computer Science}, publisher={Universitat de les Illes
Balears}, author={Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and
Wagner, Annika}, year={1995}, collection={Technical Report} }'
chicago: Heckel, Reiko, Jürgen Müller, Gabriele Taentzer, and Annika Wagner. “Attributed
Graph Transformations with Controlled Application of Rules.” In Proceedings
of the Colloquium on Graph Transformation and Its Application in Computer Science.
Technical Report. Universitat de les Illes Balears, 1995.
ieee: R. Heckel, J. Müller, G. Taentzer, and A. Wagner, “Attributed Graph Transformations
with Controlled Application of Rules,” in Proceedings of the Colloquium on
Graph Transformation and its Application in Computer Science, 1995, no. B-19.
mla: Heckel, Reiko, et al. “Attributed Graph Transformations with Controlled Application
of Rules.” Proceedings of the Colloquium on Graph Transformation and Its Application
in Computer Science, no. B-19, Universitat de les Illes Balears, 1995.
short: 'R. Heckel, J. Müller, G. Taentzer, A. Wagner, in: Proceedings of the Colloquium
on Graph Transformation and Its Application in Computer Science, Universitat de
les Illes Balears, 1995.'
date_created: 2019-02-20T13:59:38Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
issue: B-19
language:
- iso: eng
publication: Proceedings of the Colloquium on Graph Transformation and its Application
in Computer Science
publisher: Universitat de les Illes Balears
series_title: Technical Report
status: public
title: Attributed Graph Transformations with Controlled Application of Rules
type: conference
user_id: '52534'
year: '1995'
...
---
_id: '7832'
author:
- first_name: Wilfried
full_name: Thoben, Wilfried
last_name: Thoben
- first_name: Hans-Jürgen
full_name: Appelrath, Hans-Jürgen
last_name: Appelrath
- first_name: Stefan
full_name: Sauer, Stefan
id: '447'
last_name: Sauer
citation:
ama: 'Thoben W, Appelrath H-J, Sauer S. Record Linkage of Anonymous Data by Control
Numbers. In: Proceedings of the 18th Annual Conference of the Gesellschaft
Für Klassifikation, Oldenburg (Germany). Studies in Classification, Data Analysis,
and Knowledge Organization. Berlin/Heidelberg: Springer; 1995:412-419.'
apa: 'Thoben, W., Appelrath, H.-J., & Sauer, S. (1995). Record Linkage of Anonymous
Data by Control Numbers. In Proceedings of the 18th Annual Conference of the
Gesellschaft für Klassifikation, Oldenburg (Germany) (pp. 412–419). Berlin/Heidelberg:
Springer.'
bibtex: '@inproceedings{Thoben_Appelrath_Sauer_1995, place={Berlin/Heidelberg},
series={Studies in Classification, Data Analysis, and Knowledge Organization},
title={Record Linkage of Anonymous Data by Control Numbers}, booktitle={Proceedings
of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg
(Germany)}, publisher={Springer}, author={Thoben, Wilfried and Appelrath, Hans-Jürgen
and Sauer, Stefan}, year={1995}, pages={412–419}, collection={Studies in Classification,
Data Analysis, and Knowledge Organization} }'
chicago: 'Thoben, Wilfried, Hans-Jürgen Appelrath, and Stefan Sauer. “Record Linkage
of Anonymous Data by Control Numbers.” In Proceedings of the 18th Annual Conference
of the Gesellschaft Für Klassifikation, Oldenburg (Germany), 412–19. Studies
in Classification, Data Analysis, and Knowledge Organization. Berlin/Heidelberg:
Springer, 1995.'
ieee: W. Thoben, H.-J. Appelrath, and S. Sauer, “Record Linkage of Anonymous Data
by Control Numbers,” in Proceedings of the 18th Annual Conference of the Gesellschaft
für Klassifikation, Oldenburg (Germany), 1995, pp. 412–419.
mla: Thoben, Wilfried, et al. “Record Linkage of Anonymous Data by Control Numbers.”
Proceedings of the 18th Annual Conference of the Gesellschaft Für Klassifikation,
Oldenburg (Germany), Springer, 1995, pp. 412–19.
short: 'W. Thoben, H.-J. Appelrath, S. Sauer, in: Proceedings of the 18th Annual
Conference of the Gesellschaft Für Klassifikation, Oldenburg (Germany), Springer,
Berlin/Heidelberg, 1995, pp. 412–419.'
date_created: 2019-02-20T14:00:22Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
language:
- iso: eng
page: 412-419
place: Berlin/Heidelberg
publication: Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation,
Oldenburg (Germany)
publisher: Springer
series_title: Studies in Classification, Data Analysis, and Knowledge Organization
status: public
title: Record Linkage of Anonymous Data by Control Numbers
type: conference
user_id: '52534'
year: '1995'
...
---
_id: '7833'
abstract:
- lang: eng
text: Single pushout graph transformations at injective matches are extended by
negative application conditions. It is shown, how right-sided application conditions
can be transformed into equivalent left-sided ones. Based on this result, conditional
derived rules are introduced and a theorem, similiar to the double pushout embedding
theorem is shown. Finally, three variants of contextual application conditions
are discussed with respect to their expressive power and expected results.
author:
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
citation:
ama: 'Heckel R. Embedding of Conditional Graph Transformations. In: Proceedings
of the Colloquium on Graph Transformation and Its Application in Computer Science.
Technical Report. Universitat de les Illes Balears; 1995.'
apa: Heckel, R. (1995). Embedding of Conditional Graph Transformations. In Proceedings
of the Colloquium on Graph Transformation and its Application in Computer Science.
Universitat de les Illes Balears.
bibtex: '@inproceedings{Heckel_1995, series={Technical Report}, title={Embedding
of Conditional Graph Transformations}, number={B-19}, booktitle={Proceedings of
the Colloquium on Graph Transformation and its Application in Computer Science},
publisher={Universitat de les Illes Balears}, author={Heckel, Reiko}, year={1995},
collection={Technical Report} }'
chicago: Heckel, Reiko. “Embedding of Conditional Graph Transformations.” In Proceedings
of the Colloquium on Graph Transformation and Its Application in Computer Science.
Technical Report. Universitat de les Illes Balears, 1995.
ieee: R. Heckel, “Embedding of Conditional Graph Transformations,” in Proceedings
of the Colloquium on Graph Transformation and its Application in Computer Science,
1995, no. B-19.
mla: Heckel, Reiko. “Embedding of Conditional Graph Transformations.” Proceedings
of the Colloquium on Graph Transformation and Its Application in Computer Science,
no. B-19, Universitat de les Illes Balears, 1995.
short: 'R. Heckel, in: Proceedings of the Colloquium on Graph Transformation and
Its Application in Computer Science, Universitat de les Illes Balears, 1995.'
date_created: 2019-02-20T14:01:39Z
date_updated: 2022-01-06T07:03:46Z
department:
- _id: '66'
issue: B-19
language:
- iso: eng
publication: Proceedings of the Colloquium on Graph Transformation and its Application
in Computer Science
publisher: Universitat de les Illes Balears
series_title: Technical Report
status: public
title: Embedding of Conditional Graph Transformations
type: conference
user_id: '52534'
year: '1995'
...
---
_id: '8194'
author:
- first_name: Mirko
full_name: Conrad, Mirko
last_name: Conrad
- first_name: Magdalena
full_name: Gajewsky, Magdalena
last_name: Gajewsky
- first_name: Rainer
full_name: Holl-Biniasz, Rainer
last_name: Holl-Biniasz
- first_name: Michael
full_name: Rudolf, Michael
last_name: Rudolf
- first_name: Jochen
full_name: Demuth, Jochen
last_name: Demuth
- first_name: Stephan
full_name: Weber, Stephan
last_name: Weber
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Jürgen
full_name: Müller, Jürgen
last_name: Müller
- first_name: Gabriele
full_name: Taentzer, Gabriele
last_name: Taentzer
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: Conrad M, Gajewsky M, Holl-Biniasz R, et al. Graphische Spezifikation Ausgewählter
Teile von AGG - Einem Algebraischen Graphgrammatiksystem.; 1995.
apa: Conrad, M., Gajewsky, M., Holl-Biniasz, R., Rudolf, M., Demuth, J., Weber,
S., … Wagner, A. (1995). Graphische Spezifikation ausgewählter Teile von AGG
- einem algebraischen Graphgrammatiksystem.
bibtex: '@book{Conrad_Gajewsky_Holl-Biniasz_Rudolf_Demuth_Weber_Heckel_Müller_Taentzer_Wagner_1995,
title={Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen
Graphgrammatiksystem}, author={Conrad, Mirko and Gajewsky, Magdalena and Holl-Biniasz,
Rainer and Rudolf, Michael and Demuth, Jochen and Weber, Stephan and Heckel, Reiko
and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}, year={1995} }'
chicago: Conrad, Mirko, Magdalena Gajewsky, Rainer Holl-Biniasz, Michael Rudolf,
Jochen Demuth, Stephan Weber, Reiko Heckel, Jürgen Müller, Gabriele Taentzer,
and Annika Wagner. Graphische Spezifikation Ausgewählter Teile von AGG - Einem
Algebraischen Graphgrammatiksystem, 1995.
ieee: M. Conrad et al., Graphische Spezifikation ausgewählter Teile von
AGG - einem algebraischen Graphgrammatiksystem. 1995.
mla: Conrad, Mirko, et al. Graphische Spezifikation Ausgewählter Teile von AGG
- Einem Algebraischen Graphgrammatiksystem. 1995.
short: M. Conrad, M. Gajewsky, R. Holl-Biniasz, M. Rudolf, J. Demuth, S. Weber,
R. Heckel, J. Müller, G. Taentzer, A. Wagner, Graphische Spezifikation Ausgewählter
Teile von AGG - Einem Algebraischen Graphgrammatiksystem, 1995.
date_created: 2019-03-03T16:12:49Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
language:
- iso: eng
status: public
title: Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem
type: report
user_id: '52534'
year: '1995'
...
---
_id: '8195'
abstract:
- lang: eng
text: Several object-oriented modeling approaches propose to describe the dynamic
behaviour of objects by state transition diagrams. None of them provides precise
rules or conditions for the interrelation between the behaviour description of
classes and those of their subclasses. In this paper, we discuss this interrelation
in detail. It turns out that one has to distinguish between the observable and
the invocable behaviour of objects and that different compatibility requirements
between the diagrams exist depending on the type of behaviour.
author:
- first_name: Jürgen
full_name: Ebert, Jürgen
last_name: Ebert
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Ebert J, Engels G. Specialization of Object Life Cycle Definitions.
Koblenz: University of Koblenz-Landau; 1995.'
apa: 'Ebert, J., & Engels, G. (1995). Specialization of Object Life Cycle
Definitions. Koblenz: University of Koblenz-Landau.'
bibtex: '@book{Ebert_Engels_1995, place={Koblenz}, title={Specialization of Object
Life Cycle Definitions}, publisher={University of Koblenz-Landau}, author={Ebert,
Jürgen and Engels, Gregor}, year={1995} }'
chicago: 'Ebert, Jürgen, and Gregor Engels. Specialization of Object Life Cycle
Definitions. Koblenz: University of Koblenz-Landau, 1995.'
ieee: 'J. Ebert and G. Engels, Specialization of Object Life Cycle Definitions.
Koblenz: University of Koblenz-Landau, 1995.'
mla: Ebert, Jürgen, and Gregor Engels. Specialization of Object Life Cycle Definitions.
University of Koblenz-Landau, 1995.
short: J. Ebert, G. Engels, Specialization of Object Life Cycle Definitions, University
of Koblenz-Landau, Koblenz, 1995.
date_created: 2019-03-03T16:12:50Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
language:
- iso: eng
place: Koblenz
publisher: University of Koblenz-Landau
report_number: 19/95
status: public
title: Specialization of Object Life Cycle Definitions
type: report
user_id: '52534'
year: '1995'
...
---
_id: '8196'
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Andy
full_name: Schürr, Andy
last_name: Schürr
citation:
ama: Engels G, Schürr A. Encapsulated Hierarchical Graphs, Graph Types, and Meta
Types. Vakgroep Informatica, Rijksuniversiteit Leiden; 1995.
apa: Engels, G., & Schürr, A. (1995). Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types. Vakgroep Informatica, Rijksuniversiteit Leiden.
bibtex: '@book{Engels_Schürr_1995, title={Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types}, publisher={Vakgroep Informatica, Rijksuniversiteit Leiden},
author={Engels, Gregor and Schürr, Andy}, year={1995} }'
chicago: Engels, Gregor, and Andy Schürr. Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types. Vakgroep Informatica, Rijksuniversiteit Leiden, 1995.
ieee: G. Engels and A. Schürr, Encapsulated Hierarchical Graphs, Graph Types,
and Meta Types. Vakgroep Informatica, Rijksuniversiteit Leiden, 1995.
mla: Engels, Gregor, and Andy Schürr. Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types. Vakgroep Informatica, Rijksuniversiteit Leiden, 1995.
short: G. Engels, A. Schürr, Encapsulated Hierarchical Graphs, Graph Types, and
Meta Types, Vakgroep Informatica, Rijksuniversiteit Leiden, 1995.
date_created: 2019-03-03T16:12:51Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
language:
- iso: eng
publisher: Vakgroep Informatica, Rijksuniversiteit Leiden
report_number: 95-21
status: public
title: Encapsulated Hierarchical Graphs, Graph Types, and Meta Types
type: report
user_id: '52534'
year: '1995'
...
---
_id: '8266'
author:
- first_name: Luuk
full_name: Groenewegen, Luuk
last_name: Groenewegen
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
citation:
ama: 'Groenewegen L, Engels G. Coordination by Behavioural Views and Communication
Patterns. In: Proceedings of the 4th European Workshop on Software Process
Technology (EWSPT 1995), Noordwijkerhout (The Netherlands). Vol 913. LNCS.
Berlin/Heidelberg: Springer; 1995:189-192. doi:http://dx.doi.org/10.1007/3-540-59205-9_56'
apa: 'Groenewegen, L., & Engels, G. (1995). Coordination by Behavioural Views
and Communication Patterns. In Proceedings of the 4th European Workshop on
Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)
(Vol. 913, pp. 189–192). Berlin/Heidelberg: Springer. http://dx.doi.org/10.1007/3-540-59205-9_56'
bibtex: '@inproceedings{Groenewegen_Engels_1995, place={Berlin/Heidelberg}, series={LNCS},
title={Coordination by Behavioural Views and Communication Patterns}, volume={913},
DOI={http://dx.doi.org/10.1007/3-540-59205-9_56},
booktitle={Proceedings of the 4th European Workshop on Software Process Technology
(EWSPT 1995), Noordwijkerhout (The Netherlands)}, publisher={Springer}, author={Groenewegen,
Luuk and Engels, Gregor}, year={1995}, pages={189–192}, collection={LNCS} }'
chicago: 'Groenewegen, Luuk, and Gregor Engels. “Coordination by Behavioural Views
and Communication Patterns.” In Proceedings of the 4th European Workshop on
Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands),
913:189–92. LNCS. Berlin/Heidelberg: Springer, 1995. http://dx.doi.org/10.1007/3-540-59205-9_56.'
ieee: L. Groenewegen and G. Engels, “Coordination by Behavioural Views and Communication
Patterns,” in Proceedings of the 4th European Workshop on Software Process
Technology (EWSPT 1995), Noordwijkerhout (The Netherlands), 1995, vol. 913,
pp. 189–192.
mla: Groenewegen, Luuk, and Gregor Engels. “Coordination by Behavioural Views and
Communication Patterns.” Proceedings of the 4th European Workshop on Software
Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands), vol. 913,
Springer, 1995, pp. 189–92, doi:http://dx.doi.org/10.1007/3-540-59205-9_56.
short: 'L. Groenewegen, G. Engels, in: Proceedings of the 4th European Workshop
on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands),
Springer, Berlin/Heidelberg, 1995, pp. 189–192.'
date_created: 2019-03-04T11:52:17Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1007/3-540-59205-9_56
intvolume: ' 913'
language:
- iso: eng
page: 189-192
place: Berlin/Heidelberg
publication: Proceedings of the 4th European Workshop on Software Process Technology
(EWSPT 1995), Noordwijkerhout (The Netherlands)
publisher: Springer
series_title: LNCS
status: public
title: Coordination by Behavioural Views and Communication Patterns
type: conference
user_id: '52534'
volume: 913
year: '1995'
...
---
_id: '8267'
abstract:
- lang: eng
text: Based on a categorical semantics that has been developed for typed graph grammars
we uses colimits (pushouts) to model composition and (reverse) graph grammar morphisms
to describe refinements of typed graph grammars. Composition of graph grammars
w.r.t. common subgrammars is shown to be compatible with the semantics, i.e. the
semantics of the composed grammar is obtained as the composition of the semantics
of the component grammars. Moreover, the structure of a composed grammar is preserved
during a refinement step in the sense that compatible refinements of the components
induce a refinement of the composition. The concepts and results are illustrated
by an example.
author:
- first_name: Andrea
full_name: Corradini, Andrea
last_name: Corradini
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
citation:
ama: 'Corradini A, Heckel R. A Compositional Approach to Structuring and Refinement
of Typed Graph Grammars. In: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy).
Vol 2. Electronic Notes in Theoretical Computer Science . Elsevier; 1995:46-55.'
apa: Corradini, A., & Heckel, R. (1995). A Compositional Approach to Structuring
and Refinement of Typed Graph Grammars. In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)
(Vol. 2, pp. 46–55). Elsevier.
bibtex: '@inproceedings{Corradini_Heckel_1995, series={Electronic Notes in Theoretical
Computer Science }, title={A Compositional Approach to Structuring and Refinement
of Typed Graph Grammars}, volume={2}, booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)},
publisher={Elsevier}, author={Corradini, Andrea and Heckel, Reiko}, year={1995},
pages={46–55}, collection={Electronic Notes in Theoretical Computer Science }
}'
chicago: Corradini, Andrea, and Reiko Heckel. “A Compositional Approach to Structuring
and Refinement of Typed Graph Grammars.” In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
2:46–55. Electronic Notes in Theoretical Computer Science . Elsevier, 1995.
ieee: A. Corradini and R. Heckel, “A Compositional Approach to Structuring and Refinement
of Typed Graph Grammars,” in Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
1995, vol. 2, pp. 46–55.
mla: Corradini, Andrea, and Reiko Heckel. “A Compositional Approach to Structuring
and Refinement of Typed Graph Grammars.” Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
vol. 2, Elsevier, 1995, pp. 46–55.
short: 'A. Corradini, R. Heckel, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
Elsevier, 1995, pp. 46–55.'
date_created: 2019-03-04T11:52:18Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
intvolume: ' 2'
language:
- iso: eng
page: 46-55
publication: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)
publisher: Elsevier
series_title: 'Electronic Notes in Theoretical Computer Science '
status: public
title: A Compositional Approach to Structuring and Refinement of Typed Graph Grammars
type: conference
user_id: '52534'
volume: 2
year: '1995'
...
---
_id: '8268'
abstract:
- lang: eng
text: The overall aim of this paper is a proposal how to bridge the gap between
formal specification techniques developed in research projects and semi--formal
or informal specifications used in industrial practice. The main idea to overcome
these problems is to develop graphical support for formal methods in order to
increase acceptance by practitioners and to provide means for integration of formal
and semi--formal methods. More specifically suitable concepts will be developed
to combine algebraic specifications, Petri Nets, and Graph Grammars with each
other and with distinguished graphical components to be used by industrial partners.
author:
- first_name: Bernhard
full_name: Bardohl, Bernhard
last_name: Bardohl
- first_name: Roswitha
full_name: Bardohl, Roswitha
last_name: Bardohl
- first_name: Paulo
full_name: Castro, Paulo
last_name: Castro
- first_name: Hartmut
full_name: Ehrig, Hartmut
last_name: Ehrig
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Leila
full_name: Ribeiro, Leila
last_name: Ribeiro
- first_name: Daltro
full_name: Nunes, Daltro
last_name: Nunes
- first_name: Alfio
full_name: Martini, Alfio
last_name: Martini
citation:
ama: 'Bardohl B, Bardohl R, Castro P, et al. GRAPHIT: Graphical Support and Integration
of Formal and Semiformal Methods for Software Specification and Development. In:
Proceedings of the 3rd German-Brazilian Workshop on Information Technology
(1995), Berlin (Germany). Vol 26. Bilateral Seminars of the International
Bureau. Forschungszentrum Jülich GmbH; 1995.'
apa: 'Bardohl, B., Bardohl, R., Castro, P., Ehrig, H., Heckel, R., Ribeiro, L.,
… Martini, A. (1995). GRAPHIT: Graphical Support and Integration of Formal and
Semiformal Methods for Software Specification and Development. In Proceedings
of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin
(Germany) (Vol. 26). Forschungszentrum Jülich GmbH.'
bibtex: '@inproceedings{Bardohl_Bardohl_Castro_Ehrig_Heckel_Ribeiro_Nunes_Martini_1995,
series={Bilateral Seminars of the International Bureau}, title={GRAPHIT: Graphical
Support and Integration of Formal and Semiformal Methods for Software Specification
and Development}, volume={26}, booktitle={Proceedings of the 3rd German-Brazilian
Workshop on Information Technology (1995), Berlin (Germany)}, publisher={Forschungszentrum
Jülich GmbH}, author={Bardohl, Bernhard and Bardohl, Roswitha and Castro, Paulo
and Ehrig, Hartmut and Heckel, Reiko and Ribeiro, Leila and Nunes, Daltro and
Martini, Alfio}, year={1995}, collection={Bilateral Seminars of the International
Bureau} }'
chicago: 'Bardohl, Bernhard, Roswitha Bardohl, Paulo Castro, Hartmut Ehrig, Reiko
Heckel, Leila Ribeiro, Daltro Nunes, and Alfio Martini. “GRAPHIT: Graphical Support
and Integration of Formal and Semiformal Methods for Software Specification and
Development.” In Proceedings of the 3rd German-Brazilian Workshop on Information
Technology (1995), Berlin (Germany), Vol. 26. Bilateral Seminars of the International
Bureau. Forschungszentrum Jülich GmbH, 1995.'
ieee: 'B. Bardohl et al., “GRAPHIT: Graphical Support and Integration of
Formal and Semiformal Methods for Software Specification and Development,” in
Proceedings of the 3rd German-Brazilian Workshop on Information Technology
(1995), Berlin (Germany), 1995, vol. 26.'
mla: 'Bardohl, Bernhard, et al. “GRAPHIT: Graphical Support and Integration of Formal
and Semiformal Methods for Software Specification and Development.” Proceedings
of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin
(Germany), vol. 26, Forschungszentrum Jülich GmbH, 1995.'
short: 'B. Bardohl, R. Bardohl, P. Castro, H. Ehrig, R. Heckel, L. Ribeiro, D. Nunes,
A. Martini, in: Proceedings of the 3rd German-Brazilian Workshop on Information
Technology (1995), Berlin (Germany), Forschungszentrum Jülich GmbH, 1995.'
date_created: 2019-03-04T11:52:19Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
intvolume: ' 26'
language:
- iso: eng
publication: Proceedings of the 3rd German-Brazilian Workshop on Information Technology
(1995), Berlin (Germany)
publisher: Forschungszentrum Jülich GmbH
series_title: Bilateral Seminars of the International Bureau
status: public
title: 'GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods
for Software Specification and Development'
type: conference
user_id: '52534'
volume: 26
year: '1995'
...
---
_id: '8269'
abstract:
- lang: eng
text: Currently existing graph grammar-based specification languages have serious
problems with supporting any kind of “specification-in-the-large” activities.
More precisely, they have deficiencies with respect to modeling hierarchical data
structures or specifying meta activities like manipulation of graph schemata.
Furthermore, already proposed graph grammar module concepts are still too abstract
to be useful in practice. Our contribution addresses these problems by introducing
a new hierarchical graph data model with an infinite number of schema, meta-schema,
etc. layers. It forms the base for a forthcoming concrete modular graph grammar
specification language where in addition information hiding aspects like explicit
export and import interfaces are expressible.
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Andy
full_name: Schürr, Andy
last_name: Schürr
citation:
ama: 'Engels G, Schürr A. Encapsulated Hierarchical Graphs, Graph Types, and Meta
Types. In: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph
Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy). Electronic Notes
in Theoretical Computer Science. Amsterdam, The Netherlands: Elsevier; 1995:101-109.
doi:http://dx.doi.org/10.1016/S1571-0661(05)80186-0'
apa: 'Engels, G., & Schürr, A. (1995). Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types. In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop
on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy) (pp.
101–109). Amsterdam, The Netherlands: Elsevier. http://dx.doi.org/10.1016/S1571-0661(05)80186-0'
bibtex: '@inproceedings{Engels_Schürr_1995, place={Amsterdam, The Netherlands},
series={Electronic Notes in Theoretical Computer Science}, title={Encapsulated
Hierarchical Graphs, Graph Types, and Meta Types}, DOI={http://dx.doi.org/10.1016/S1571-0661(05)80186-0},
booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)}, publisher={Elsevier}, author={Engels,
Gregor and Schürr, Andy}, year={1995}, pages={101–109}, collection={Electronic
Notes in Theoretical Computer Science} }'
chicago: 'Engels, Gregor, and Andy Schürr. “Encapsulated Hierarchical Graphs, Graph
Types, and Meta Types.” In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop
on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), 101–9.
Electronic Notes in Theoretical Computer Science. Amsterdam, The Netherlands:
Elsevier, 1995. http://dx.doi.org/10.1016/S1571-0661(05)80186-0.'
ieee: G. Engels and A. Schürr, “Encapsulated Hierarchical Graphs, Graph Types, and
Meta Types,” in Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph
Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), 1995, pp. 101–109.
mla: Engels, Gregor, and Andy Schürr. “Encapsulated Hierarchical Graphs, Graph Types,
and Meta Types.” Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on
Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy), Elsevier,
1995, pp. 101–09, doi:http://dx.doi.org/10.1016/S1571-0661(05)80186-0.
short: 'G. Engels, A. Schürr, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
Elsevier, Amsterdam, The Netherlands, 1995, pp. 101–109.'
date_created: 2019-03-04T11:52:20Z
date_updated: 2022-01-06T07:03:52Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1016/S1571-0661(05)80186-0
language:
- iso: eng
page: 101-109
place: Amsterdam, The Netherlands
publication: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)
publisher: Elsevier
series_title: Electronic Notes in Theoretical Computer Science
status: public
title: Encapsulated Hierarchical Graphs, Graph Types, and Meta Types
type: conference
user_id: '52534'
year: '1995'
...
---
_id: '8270'
author:
- first_name: Reiko
full_name: Heckel, Reiko
last_name: Heckel
- first_name: Annika
full_name: Wagner, Annika
last_name: Wagner
citation:
ama: 'Heckel R, Wagner A. Ensuring Consistency of Conditional Graph Grammars - A
constructive Approach. In: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop
on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy). Vol
2. Electronic Notes in Theoretical Computer Science. Elsevier; 1995:118-126. doi:http://dx.doi.org/10.1016/S1571-0661(05)80188-4'
apa: Heckel, R., & Wagner, A. (1995). Ensuring Consistency of Conditional Graph
Grammars - A constructive Approach. In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)
(Vol. 2, pp. 118–126). Elsevier. http://dx.doi.org/10.1016/S1571-0661(05)80188-4
bibtex: '@inproceedings{Heckel_Wagner_1995, series={Electronic Notes in Theoretical
Computer Science}, title={Ensuring Consistency of Conditional Graph Grammars -
A constructive Approach}, volume={2}, DOI={http://dx.doi.org/10.1016/S1571-0661(05)80188-4},
booktitle={Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)}, publisher={Elsevier}, author={Heckel,
Reiko and Wagner, Annika}, year={1995}, pages={118–126}, collection={Electronic
Notes in Theoretical Computer Science} }'
chicago: Heckel, Reiko, and Annika Wagner. “Ensuring Consistency of Conditional
Graph Grammars - A Constructive Approach.” In Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
2:118–26. Electronic Notes in Theoretical Computer Science. Elsevier, 1995. http://dx.doi.org/10.1016/S1571-0661(05)80188-4.
ieee: R. Heckel and A. Wagner, “Ensuring Consistency of Conditional Graph Grammars
- A constructive Approach,” in Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
1995, vol. 2, pp. 118–126.
mla: Heckel, Reiko, and Annika Wagner. “Ensuring Consistency of Conditional Graph
Grammars - A Constructive Approach.” Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
vol. 2, Elsevier, 1995, pp. 118–26, doi:http://dx.doi.org/10.1016/S1571-0661(05)80188-4.
short: 'R. Heckel, A. Wagner, in: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH
Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy),
Elsevier, 1995, pp. 118–126.'
date_created: 2019-03-04T11:52:21Z
date_updated: 2022-01-06T07:03:53Z
department:
- _id: '66'
doi: http://dx.doi.org/10.1016/S1571-0661(05)80188-4
intvolume: ' 2'
language:
- iso: eng
page: 118-126
publication: Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA 1995), Volterra (Italy)
publisher: Elsevier
series_title: Electronic Notes in Theoretical Computer Science
status: public
title: Ensuring Consistency of Conditional Graph Grammars - A constructive Approach
type: conference
user_id: '52534'
volume: 2
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'
...