---
_id: '24276'
abstract:
- lang: eng
text: "We define a natural generalization of the prominent k-server problem, the
k-resource problem. It occurs in metric spaces with some demands and resources
given at its points. The demands may vary with time, but the total demand may
never exceed k. The goal of an online algorithm is to satisfy demands by moving
resources, while minimizing the cost for transporting resources. We give an asymptotically
optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive
deterministic one for the k-resource problem on uniform metric spaces consisting
of n points. This extends known results for paging to the more general setting
of k-resource.\r\nBasing on the results for uniform metric spaces, we develop
a randomized algorithm solving the k-resource and the k-server problem on metric
spaces which can be decomposed into components far away from each other. The algorithm
achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra
resources more than the optimal algorithm.\r\n"
author:
- first_name: Marcin
full_name: Bienkowski, Marcin
last_name: Bienkowski
- first_name: Jarosław
full_name: Kutyłowski, Jarosław
last_name: Kutyłowski
citation:
ama: 'Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly
Decomposable Metric Spaces. In: Lecture Notes in Computer Science. ; 2007.
doi:10.1007/978-3-540-73951-7_30'
apa: Bienkowski, M., & Kutyłowski, J. (2007). The k-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces. Lecture Notes in Computer Science.
https://doi.org/10.1007/978-3-540-73951-7_30
bibtex: '@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg},
title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric
Spaces}, DOI={10.1007/978-3-540-73951-7_30},
booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and
Kutyłowski, Jarosław}, year={2007} }'
chicago: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on
Uniform and on Uniformly Decomposable Metric Spaces.” In Lecture Notes in Computer
Science. Berlin, Heidelberg, 2007. https://doi.org/10.1007/978-3-540-73951-7_30.
ieee: 'M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on
Uniformly Decomposable Metric Spaces,” 2007, doi: 10.1007/978-3-540-73951-7_30.'
mla: Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform
and on Uniformly Decomposable Metric Spaces.” Lecture Notes in Computer Science,
2007, doi:10.1007/978-3-540-73951-7_30.
short: 'M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin,
Heidelberg, 2007.'
date_created: 2021-09-13T13:07:57Z
date_updated: 2022-01-06T06:56:13Z
department:
- _id: '63'
doi: 10.1007/978-3-540-73951-7_30
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
type: conference
user_id: '15415'
year: '2007'
...
---
_id: '24366'
abstract:
- lang: eng
text: "Dieses Buch beschäftigt sich mit Algorithmen und Methoden der Peer-to-Peer-Netzwerke
und gibt einen Einblick in die aktuelle Forschung.\r\n\r\nUrsprünglich waren Peer-to-Peer-Netzwerke
nur für File-Sharing konzipiert. Mittlerweile hat sich Peer-to-Peer zum Paradigma
für Rechnernetzwerke entwickelt. Ziel dieses Buches ist es, dem Leser ein grundlegendes
Verständnis der Techniken hinter den aktuellen Peer-to-Peer-Netzwerken aufzuzeigen
und im nächsten Schritt Algorithmen vorzustellen, die vielleicht erst in einigen
Jahren umgesetzt werden.\r\n\r\nDas Buch richtet sich in erster Linie an Informatiker
(Studenten ab dem 5. Semester). Aber auch interessierte Nichtinformatiker können
von diesem Buch profitieren, wobei grundlegende Kenntnisse aus den Bereichen der
Mathematik und Informatik vorausgesetzt werden. Die Ziele, Kernaussagen und Ergebnisse
sollten jedoch auch ohne akademischen Hintergrund klar werden."
author:
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: Mahlmann P, Schindelhauer C. Peer-to-Peer-Netzwerke. Springer; 2007.
doi:10.1007/978-3-540-33992-2
apa: Mahlmann, P., & Schindelhauer, C. (2007). Peer-to-Peer-Netzwerke.
Springer. https://doi.org/10.1007/978-3-540-33992-2
bibtex: '@book{Mahlmann_Schindelhauer_2007, place={Berlin}, title={Peer-to-Peer-Netzwerke},
DOI={10.1007/978-3-540-33992-2},
publisher={Springer}, author={Mahlmann, Peter and Schindelhauer, Christian}, year={2007}
}'
chicago: 'Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Berlin: Springer, 2007. https://doi.org/10.1007/978-3-540-33992-2.'
ieee: 'P. Mahlmann and C. Schindelhauer, Peer-to-Peer-Netzwerke. Berlin:
Springer, 2007.'
mla: Mahlmann, Peter, and Christian Schindelhauer. Peer-to-Peer-Netzwerke.
Springer, 2007, doi:10.1007/978-3-540-33992-2.
short: P. Mahlmann, C. Schindelhauer, Peer-to-Peer-Netzwerke, Springer, Berlin,
2007.
date_created: 2021-09-14T10:29:29Z
date_updated: 2022-01-06T06:56:18Z
department:
- _id: '63'
doi: 10.1007/978-3-540-33992-2
language:
- iso: eng
place: Berlin
publication_identifier:
isbn:
- '9783540339915'
publication_status: published
publisher: Springer
status: public
title: Peer-to-Peer-Netzwerke
type: book
user_id: '15415'
year: '2007'
...
---
_id: '3211'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Derrick J, Wehrheim H. On using data abstractions for model checking refinements.
Acta Inf. 2007;(1):41--71. doi:10.1007/s00236-007-0042-3
apa: Derrick, J., & Wehrheim, H. (2007). On using data abstractions for model
checking refinements. Acta Inf., (1), 41--71. https://doi.org/10.1007/s00236-007-0042-3
bibtex: '@article{Derrick_Wehrheim_2007, title={On using data abstractions for model
checking refinements}, DOI={10.1007/s00236-007-0042-3},
number={1}, journal={Acta Inf.}, author={Derrick, John and Wehrheim, Heike}, year={2007},
pages={41--71} }'
chicago: 'Derrick, John, and Heike Wehrheim. “On Using Data Abstractions for Model
Checking Refinements.” Acta Inf., no. 1 (2007): 41--71. https://doi.org/10.1007/s00236-007-0042-3.'
ieee: J. Derrick and H. Wehrheim, “On using data abstractions for model checking
refinements,” Acta Inf., no. 1, pp. 41--71, 2007.
mla: Derrick, John, and Heike Wehrheim. “On Using Data Abstractions for Model Checking
Refinements.” Acta Inf., no. 1, 2007, pp. 41--71, doi:10.1007/s00236-007-0042-3.
short: J. Derrick, H. Wehrheim, Acta Inf. (2007) 41--71.
date_created: 2018-06-13T09:56:17Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1007/s00236-007-0042-3
issue: '1'
page: 41--71
publication: Acta Inf.
status: public
title: On using data abstractions for model checking refinements
type: journal_article
user_id: '29719'
year: '2007'
...
---
_id: '3212'
author:
- first_name: Björn
full_name: Metzler, Björn
last_name: Metzler
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Metzler B, Wehrheim H. Extending a Component Specification Language with Time.
Electr Notes Theor Comput Sci. 2007;(2):47--67. doi:10.1016/j.entcs.2006.02.031
apa: Metzler, B., & Wehrheim, H. (2007). Extending a Component Specification
Language with Time. Electr. Notes Theor. Comput. Sci., (2), 47--67. https://doi.org/10.1016/j.entcs.2006.02.031
bibtex: '@article{Metzler_Wehrheim_2007, title={Extending a Component Specification
Language with Time}, DOI={10.1016/j.entcs.2006.02.031},
number={2}, journal={Electr. Notes Theor. Comput. Sci.}, author={Metzler, Björn
and Wehrheim, Heike}, year={2007}, pages={47--67} }'
chicago: 'Metzler, Björn, and Heike Wehrheim. “Extending a Component Specification
Language with Time.” Electr. Notes Theor. Comput. Sci., no. 2 (2007): 47--67.
https://doi.org/10.1016/j.entcs.2006.02.031.'
ieee: B. Metzler and H. Wehrheim, “Extending a Component Specification Language
with Time,” Electr. Notes Theor. Comput. Sci., no. 2, pp. 47--67, 2007.
mla: Metzler, Björn, and Heike Wehrheim. “Extending a Component Specification Language
with Time.” Electr. Notes Theor. Comput. Sci., no. 2, 2007, pp. 47--67,
doi:10.1016/j.entcs.2006.02.031.
short: B. Metzler, H. Wehrheim, Electr. Notes Theor. Comput. Sci. (2007) 47--67.
date_created: 2018-06-13T09:57:37Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1016/j.entcs.2006.02.031
issue: '2'
page: 47--67
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Extending a Component Specification Language with Time
type: journal_article
user_id: '29719'
year: '2007'
...
---
_id: '3213'
author:
- first_name: H.{-}Christian
full_name: Estler, H.{-}Christian
last_name: Estler
- first_name: Thomas
full_name: Ruhroth, Thomas
last_name: Ruhroth
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Estler H.-}Christian, Ruhroth T, Wehrheim H. Modelchecking Correctness of Refactorings
- Some Experiments. Electr Notes Theor Comput Sci. 2007:3--17. doi:10.1016/j.entcs.2006.08.041
apa: Estler, H. .-}Christian, Ruhroth, T., & Wehrheim, H. (2007). Modelchecking
Correctness of Refactorings - Some Experiments. Electr. Notes Theor. Comput.
Sci., 3--17. https://doi.org/10.1016/j.entcs.2006.08.041
bibtex: '@article{Estler_Ruhroth_Wehrheim_2007, title={Modelchecking Correctness
of Refactorings - Some Experiments}, DOI={10.1016/j.entcs.2006.08.041},
journal={Electr. Notes Theor. Comput. Sci.}, author={Estler, H.{-}Christian and
Ruhroth, Thomas and Wehrheim, Heike}, year={2007}, pages={3--17} }'
chicago: Estler, H.{-}Christian, Thomas Ruhroth, and Heike Wehrheim. “Modelchecking
Correctness of Refactorings - Some Experiments.” Electr. Notes Theor. Comput.
Sci., 2007, 3--17. https://doi.org/10.1016/j.entcs.2006.08.041.
ieee: H. .-}Christian Estler, T. Ruhroth, and H. Wehrheim, “Modelchecking Correctness
of Refactorings - Some Experiments,” Electr. Notes Theor. Comput. Sci.,
pp. 3--17, 2007.
mla: Estler, H. .. }Christian, et al. “Modelchecking Correctness of Refactorings
- Some Experiments.” Electr. Notes Theor. Comput. Sci., 2007, pp. 3--17,
doi:10.1016/j.entcs.2006.08.041.
short: H..-}Christian Estler, T. Ruhroth, H. Wehrheim, Electr. Notes Theor. Comput.
Sci. (2007) 3--17.
date_created: 2018-06-13T09:59:12Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1016/j.entcs.2006.08.041
page: 3--17
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Modelchecking Correctness of Refactorings - Some Experiments
type: journal_article
user_id: '29719'
year: '2007'
...
---
_id: '3214'
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Baris
full_name: Güldali, Baris
last_name: Güldali
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Engels G, Güldali B, Soltenborn C, Wehrheim H. Assuring Consistency of Business
Process Models and Web Services Using Visual Contracts. In: Sch{\"{u}}rr A, Nagl
M, Z{\"{u}}ndorf A, eds. Applications of Graph Transformations with Industrial
Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October
10-12, 2007, Revised Selected and Invited Papers. Lecture Notes in Computer
Science. ; 2007:17--31. doi:10.1007/978-3-540-89020-1_2'
apa: Engels, G., Güldali, B., Soltenborn, C., & Wehrheim, H. (2007). Assuring
Consistency of Business Process Models and Web Services Using Visual Contracts.
In A. Sch{\"{u}}rr, M. Nagl, & A. Z{\"{u}}ndorf (Eds.), Applications of
Graph Transformations with Industrial Relevance, Third International Symposium,
{AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited
Papers (pp. 17--31). https://doi.org/10.1007/978-3-540-89020-1_2
bibtex: '@inproceedings{Engels_Güldali_Soltenborn_Wehrheim_2007, series={Lecture
Notes in Computer Science}, title={Assuring Consistency of Business Process Models
and Web Services Using Visual Contracts}, DOI={10.1007/978-3-540-89020-1_2},
booktitle={Applications of Graph Transformations with Industrial Relevance, Third
International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007,
Revised Selected and Invited Papers}, author={Engels, Gregor and Güldali, Baris
and Soltenborn, Christian and Wehrheim, Heike}, editor={Sch{\"{u}}rr, Andy and
Nagl, Manfred and Z{\"{u}}ndorf, AlbertEditors}, year={2007}, pages={17--31},
collection={Lecture Notes in Computer Science} }'
chicago: Engels, Gregor, Baris Güldali, Christian Soltenborn, and Heike Wehrheim.
“Assuring Consistency of Business Process Models and Web Services Using Visual
Contracts.” In Applications of Graph Transformations with Industrial Relevance,
Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12,
2007, Revised Selected and Invited Papers, edited by Andy Sch{\"{u}}rr, Manfred
Nagl, and Albert Z{\"{u}}ndorf, 17--31. Lecture Notes in Computer Science, 2007.
https://doi.org/10.1007/978-3-540-89020-1_2.
ieee: G. Engels, B. Güldali, C. Soltenborn, and H. Wehrheim, “Assuring Consistency
of Business Process Models and Web Services Using Visual Contracts,” in Applications
of Graph Transformations with Industrial Relevance, Third International Symposium,
{AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised Selected and Invited
Papers, 2007, pp. 17--31.
mla: Engels, Gregor, et al. “Assuring Consistency of Business Process Models and
Web Services Using Visual Contracts.” Applications of Graph Transformations
with Industrial Relevance, Third International Symposium, {AGTIVE} 2007, Kassel,
Germany, October 10-12, 2007, Revised Selected and Invited Papers, edited
by Andy Sch{\"{u}}rr et al., 2007, pp. 17--31, doi:10.1007/978-3-540-89020-1_2.
short: 'G. Engels, B. Güldali, C. Soltenborn, H. Wehrheim, in: A. Sch{\"{u}}rr,
M. Nagl, A. Z{\"{u}}ndorf (Eds.), Applications of Graph Transformations with Industrial
Relevance, Third International Symposium, {AGTIVE} 2007, Kassel, Germany, October
10-12, 2007, Revised Selected and Invited Papers, 2007, pp. 17--31.'
date_created: 2018-06-13T10:00:14Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1007/978-3-540-89020-1_2
editor:
- first_name: Andy
full_name: Sch{\"{u}}rr, Andy
last_name: Sch{\"{u}}rr
- first_name: Manfred
full_name: Nagl, Manfred
last_name: Nagl
- first_name: Albert
full_name: Z{\"{u}}ndorf, Albert
last_name: Z{\"{u}}ndorf
language:
- iso: eng
page: 17--31
publication: Applications of Graph Transformations with Industrial Relevance, Third
International Symposium, {AGTIVE} 2007, Kassel, Germany, October 10-12, 2007, Revised
Selected and Invited Papers
series_title: Lecture Notes in Computer Science
status: public
title: Assuring Consistency of Business Process Models and Web Services Using Visual
Contracts
type: conference
user_id: '14955'
year: '2007'
...
---
_id: '3215'
author:
- first_name: Gregor
full_name: Engels, Gregor
id: '107'
last_name: Engels
- first_name: Christian
full_name: Soltenborn, Christian
id: '1737'
last_name: Soltenborn
orcid: 0000-0002-0342-8227
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Engels G, Soltenborn C, Wehrheim H. Analysis of {UML} Activities Using Dynamic
Meta Modeling. In: M. Bonsangue M, Broch Johnsen E, eds. Formal Methods for
Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference,
{FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings. Lecture Notes
in Computer Science. ; 2007:76--90. doi:10.1007/978-3-540-72952-5_5'
apa: Engels, G., Soltenborn, C., & Wehrheim, H. (2007). Analysis of {UML} Activities
Using Dynamic Meta Modeling. In M. M. Bonsangue & E. Broch Johnsen (Eds.),
Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1
International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings
(pp. 76--90). https://doi.org/10.1007/978-3-540-72952-5_5
bibtex: '@inproceedings{Engels_Soltenborn_Wehrheim_2007, series={Lecture Notes in
Computer Science}, title={Analysis of {UML} Activities Using Dynamic Meta Modeling},
DOI={10.1007/978-3-540-72952-5_5},
booktitle={Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007,
Proceedings}, author={Engels, Gregor and Soltenborn, Christian and Wehrheim, Heike},
editor={M. Bonsangue, Marcello and Broch Johnsen, EinarEditors}, year={2007},
pages={76--90}, collection={Lecture Notes in Computer Science} }'
chicago: Engels, Gregor, Christian Soltenborn, and Heike Wehrheim. “Analysis of
{UML} Activities Using Dynamic Meta Modeling.” In Formal Methods for Open Object-Based
Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007,
Paphos, Cyprus, June 6-8, 2007, Proceedings, edited by Marcello M. Bonsangue
and Einar Broch Johnsen, 76--90. Lecture Notes in Computer Science, 2007. https://doi.org/10.1007/978-3-540-72952-5_5.
ieee: G. Engels, C. Soltenborn, and H. Wehrheim, “Analysis of {UML} Activities Using
Dynamic Meta Modeling,” in Formal Methods for Open Object-Based Distributed
Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos,
Cyprus, June 6-8, 2007, Proceedings, 2007, pp. 76--90.
mla: Engels, Gregor, et al. “Analysis of {UML} Activities Using Dynamic Meta Modeling.”
Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1
International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings,
edited by Marcello M. Bonsangue and Einar Broch Johnsen, 2007, pp. 76--90, doi:10.1007/978-3-540-72952-5_5.
short: 'G. Engels, C. Soltenborn, H. Wehrheim, in: M. M. Bonsangue, E. Broch Johnsen
(Eds.), Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG}
6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings,
2007, pp. 76--90.'
date_created: 2018-06-13T10:01:31Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1007/978-3-540-72952-5_5
editor:
- first_name: Marcello
full_name: M. Bonsangue, Marcello
last_name: M. Bonsangue
- first_name: Einar
full_name: Broch Johnsen, Einar
last_name: Broch Johnsen
language:
- iso: eng
page: 76--90
publication: Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007,
Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Analysis of {UML} Activities Using Dynamic Meta Modeling
type: conference
user_id: '14955'
year: '2007'
...
---
_id: '3216'
author:
- first_name: Thomas
full_name: Ruhroth, Thomas
last_name: Ruhroth
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Ruhroth T, Wehrheim H. Refactoring Object-Oriented Specifications with Data
and Processes. In: M. Bonsangue M, Broch Johnsen E, eds. Formal Methods for
Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International Conference,
{FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings. Lecture Notes
in Computer Science. ; 2007:236--251. doi:10.1007/978-3-540-72952-5_15'
apa: Ruhroth, T., & Wehrheim, H. (2007). Refactoring Object-Oriented Specifications
with Data and Processes. In M. M. Bonsangue & E. Broch Johnsen (Eds.), Formal
Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International
Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings (pp.
236--251). https://doi.org/10.1007/978-3-540-72952-5_15
bibtex: '@inproceedings{Ruhroth_Wehrheim_2007, series={Lecture Notes in Computer
Science}, title={Refactoring Object-Oriented Specifications with Data and Processes},
DOI={10.1007/978-3-540-72952-5_15},
booktitle={Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007,
Proceedings}, author={Ruhroth, Thomas and Wehrheim, Heike}, editor={M. Bonsangue,
Marcello and Broch Johnsen, EinarEditors}, year={2007}, pages={236--251}, collection={Lecture
Notes in Computer Science} }'
chicago: Ruhroth, Thomas, and Heike Wehrheim. “Refactoring Object-Oriented Specifications
with Data and Processes.” In Formal Methods for Open Object-Based Distributed
Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos,
Cyprus, June 6-8, 2007, Proceedings, edited by Marcello M. Bonsangue and Einar
Broch Johnsen, 236--251. Lecture Notes in Computer Science, 2007. https://doi.org/10.1007/978-3-540-72952-5_15.
ieee: T. Ruhroth and H. Wehrheim, “Refactoring Object-Oriented Specifications with
Data and Processes,” in Formal Methods for Open Object-Based Distributed Systems,
9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June
6-8, 2007, Proceedings, 2007, pp. 236--251.
mla: Ruhroth, Thomas, and Heike Wehrheim. “Refactoring Object-Oriented Specifications
with Data and Processes.” Formal Methods for Open Object-Based Distributed
Systems, 9th {IFIP} {WG} 6.1 International Conference, {FMOODS} 2007, Paphos,
Cyprus, June 6-8, 2007, Proceedings, edited by Marcello M. Bonsangue and Einar
Broch Johnsen, 2007, pp. 236--251, doi:10.1007/978-3-540-72952-5_15.
short: 'T. Ruhroth, H. Wehrheim, in: M. M. Bonsangue, E. Broch Johnsen (Eds.), Formal
Methods for Open Object-Based Distributed Systems, 9th {IFIP} {WG} 6.1 International
Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007, Proceedings, 2007,
pp. 236--251.'
date_created: 2018-06-13T10:03:09Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1007/978-3-540-72952-5_15
editor:
- first_name: Marcello
full_name: M. Bonsangue, Marcello
last_name: M. Bonsangue
- first_name: Einar
full_name: Broch Johnsen, Einar
last_name: Broch Johnsen
page: 236--251
publication: Formal Methods for Open Object-Based Distributed Systems, 9th {IFIP}
{WG} 6.1 International Conference, {FMOODS} 2007, Paphos, Cyprus, June 6-8, 2007,
Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Refactoring Object-Oriented Specifications with Data and Processes
type: conference
user_id: '29719'
year: '2007'
...
---
_id: '3221'
author:
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Schäfer W, Wehrheim H. The Challenges of Building Advanced Mechatronic Systems.
In: C. Briand L, L. Wolf A, eds. International Conference on Software Engineering,
{ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May
23-25, 2007, Minneapolis, MN, {USA}. ; 2007:72--84. doi:10.1109/FOSE.2007.28'
apa: Schäfer, W., & Wehrheim, H. (2007). The Challenges of Building Advanced
Mechatronic Systems. In L. C. Briand & A. L. Wolf (Eds.), International
Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software
Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA} (pp. 72--84).
https://doi.org/10.1109/FOSE.2007.28
bibtex: '@inproceedings{Schäfer_Wehrheim_2007, title={The Challenges of Building
Advanced Mechatronic Systems}, DOI={10.1109/FOSE.2007.28},
booktitle={International Conference on Software Engineering, {ISCE} 2007, Workshop
on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis,
MN, {USA}}, author={Schäfer, Wilhelm and Wehrheim, Heike}, editor={C. Briand,
Lionel and L. Wolf, AlexanderEditors}, year={2007}, pages={72--84} }'
chicago: Schäfer, Wilhelm, and Heike Wehrheim. “The Challenges of Building Advanced
Mechatronic Systems.” In International Conference on Software Engineering,
{ISCE} 2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May
23-25, 2007, Minneapolis, MN, {USA}, edited by Lionel C. Briand and Alexander
L. Wolf, 72--84, 2007. https://doi.org/10.1109/FOSE.2007.28.
ieee: W. Schäfer and H. Wehrheim, “The Challenges of Building Advanced Mechatronic
Systems,” in International Conference on Software Engineering, {ISCE} 2007,
Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007,
Minneapolis, MN, {USA}, 2007, pp. 72--84.
mla: Schäfer, Wilhelm, and Heike Wehrheim. “The Challenges of Building Advanced
Mechatronic Systems.” International Conference on Software Engineering, {ISCE}
2007, Workshop on the Future of Software Engineering, {FOSE} 2007, May 23-25,
2007, Minneapolis, MN, {USA}, edited by Lionel C. Briand and Alexander L.
Wolf, 2007, pp. 72--84, doi:10.1109/FOSE.2007.28.
short: 'W. Schäfer, H. Wehrheim, in: L. C. Briand, A. L. Wolf (Eds.), International
Conference on Software Engineering, {ISCE} 2007, Workshop on the Future of Software
Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis, MN, {USA}, 2007, pp. 72--84.'
date_created: 2018-06-14T06:30:41Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1109/FOSE.2007.28
editor:
- first_name: Lionel
full_name: C. Briand, Lionel
last_name: C. Briand
- first_name: Alexander
full_name: L. Wolf, Alexander
last_name: L. Wolf
page: 72--84
publication: International Conference on Software Engineering, {ISCE} 2007, Workshop
on the Future of Software Engineering, {FOSE} 2007, May 23-25, 2007, Minneapolis,
MN, {USA}
status: public
title: The Challenges of Building Advanced Mechatronic Systems
type: conference
user_id: '29719'
year: '2007'
...
---
_id: '3222'
author:
- first_name: John
full_name: Derrick, John
last_name: Derrick
- first_name: Gerhard
full_name: Schellhorn, Gerhard
last_name: Schellhorn
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Derrick J, Schellhorn G, Wehrheim H. Proving Linearizability Via Non-atomic
Refinement. In: Davies J, Gibbons J, eds. Integrated Formal Methods, 6th International
Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings. Lecture Notes
in Computer Science. ; 2007:195--214. doi:10.1007/978-3-540-73210-5_11'
apa: Derrick, J., Schellhorn, G., & Wehrheim, H. (2007). Proving Linearizability
Via Non-atomic Refinement. In J. Davies & J. Gibbons (Eds.), Integrated
Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK, July 2-5,
2007, Proceedings (pp. 195--214). https://doi.org/10.1007/978-3-540-73210-5_11
bibtex: '@inproceedings{Derrick_Schellhorn_Wehrheim_2007, series={Lecture Notes
in Computer Science}, title={Proving Linearizability Via Non-atomic Refinement},
DOI={10.1007/978-3-540-73210-5_11},
booktitle={Integrated Formal Methods, 6th International Conference, {IFM} 2007,
Oxford, UK, July 2-5, 2007, Proceedings}, author={Derrick, John and Schellhorn,
Gerhard and Wehrheim, Heike}, editor={Davies, Jim and Gibbons, JeremyEditors},
year={2007}, pages={195--214}, collection={Lecture Notes in Computer Science}
}'
chicago: Derrick, John, Gerhard Schellhorn, and Heike Wehrheim. “Proving Linearizability
Via Non-Atomic Refinement.” In Integrated Formal Methods, 6th International
Conference, {IFM} 2007, Oxford, UK, July 2-5, 2007, Proceedings, edited by
Jim Davies and Jeremy Gibbons, 195--214. Lecture Notes in Computer Science, 2007.
https://doi.org/10.1007/978-3-540-73210-5_11.
ieee: J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving Linearizability Via Non-atomic
Refinement,” in Integrated Formal Methods, 6th International Conference, {IFM}
2007, Oxford, UK, July 2-5, 2007, Proceedings, 2007, pp. 195--214.
mla: Derrick, John, et al. “Proving Linearizability Via Non-Atomic Refinement.”
Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford,
UK, July 2-5, 2007, Proceedings, edited by Jim Davies and Jeremy Gibbons,
2007, pp. 195--214, doi:10.1007/978-3-540-73210-5_11.
short: 'J. Derrick, G. Schellhorn, H. Wehrheim, in: J. Davies, J. Gibbons (Eds.),
Integrated Formal Methods, 6th International Conference, {IFM} 2007, Oxford, UK,
July 2-5, 2007, Proceedings, 2007, pp. 195--214.'
date_created: 2018-06-14T06:32:05Z
date_updated: 2022-01-06T06:59:05Z
department:
- _id: '77'
doi: 10.1007/978-3-540-73210-5_11
editor:
- first_name: Jim
full_name: Davies, Jim
last_name: Davies
- first_name: Jeremy
full_name: Gibbons, Jeremy
last_name: Gibbons
page: 195--214
publication: Integrated Formal Methods, 6th International Conference, {IFM} 2007,
Oxford, UK, July 2-5, 2007, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: Proving Linearizability Via Non-atomic Refinement
type: conference
user_id: '29719'
year: '2007'
...
---
_id: '2912'
author:
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: Krummel V. Tamper Resistance of AES -- Models, Attacks and Countermeasures.
Universität Paderborn; 2007.
apa: Krummel, V. (2007). Tamper Resistance of AES -- Models, Attacks and Countermeasures.
Universität Paderborn.
bibtex: '@book{Krummel_2007, title={Tamper Resistance of AES -- Models, Attacks
and Countermeasures}, publisher={Universität Paderborn}, author={Krummel, Volker},
year={2007} }'
chicago: Krummel, Volker. Tamper Resistance of AES -- Models, Attacks and Countermeasures.
Universität Paderborn, 2007.
ieee: V. Krummel, Tamper Resistance of AES -- Models, Attacks and Countermeasures.
Universität Paderborn, 2007.
mla: Krummel, Volker. Tamper Resistance of AES -- Models, Attacks and Countermeasures.
Universität Paderborn, 2007.
short: V. Krummel, Tamper Resistance of AES -- Models, Attacks and Countermeasures,
Universität Paderborn, 2007.
date_created: 2018-05-25T10:49:53Z
date_updated: 2022-01-06T06:58:46Z
department:
- _id: '64'
main_file_link:
- url: http://nbn-resolving.de/urn:nbn:de:hbz:466-20080110018
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
title: Tamper Resistance of AES -- Models, Attacks and Countermeasures
type: dissertation
user_id: '25078'
year: '2007'
...
---
_id: '3002'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Volker
full_name: Krummel, Volker
last_name: Krummel
citation:
ama: 'Blömer J, Krummel V. Analysis of Countermeasures Against Access Driven Cache
Attacks on AES. In: Selected Areas in Cryptography. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2007:96-109. doi:10.1007/978-3-540-77360-3_7'
apa: 'Blömer, J., & Krummel, V. (2007). Analysis of Countermeasures Against
Access Driven Cache Attacks on AES. In Selected Areas in Cryptography (pp.
96–109). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-77360-3_7'
bibtex: '@inbook{Blömer_Krummel_2007, place={Berlin, Heidelberg}, title={Analysis
of Countermeasures Against Access Driven Cache Attacks on AES}, DOI={10.1007/978-3-540-77360-3_7},
booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and Krummel, Volker}, year={2007}, pages={96–109} }'
chicago: 'Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against
Access Driven Cache Attacks on AES.” In Selected Areas in Cryptography,
96–109. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/978-3-540-77360-3_7.'
ieee: 'J. Blömer and V. Krummel, “Analysis of Countermeasures Against Access Driven
Cache Attacks on AES,” in Selected Areas in Cryptography, Berlin, Heidelberg:
Springer Berlin Heidelberg, 2007, pp. 96–109.'
mla: Blömer, Johannes, and Volker Krummel. “Analysis of Countermeasures Against
Access Driven Cache Attacks on AES.” Selected Areas in Cryptography, Springer
Berlin Heidelberg, 2007, pp. 96–109, doi:10.1007/978-3-540-77360-3_7.
short: 'J. Blömer, V. Krummel, in: Selected Areas in Cryptography, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2007, pp. 96–109.'
date_created: 2018-06-05T08:12:18Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-540-77360-3_7
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2007/282
oa: '1'
page: 96-109
place: Berlin, Heidelberg
publication: Selected Areas in Cryptography
publication_identifier:
isbn:
- '9783540773597'
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Analysis of Countermeasures Against Access Driven Cache Attacks on AES
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3019'
author:
- first_name: Alexander
full_name: May, Alexander
last_name: May
citation:
ama: 'May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: Advances
in Cryptology — CRYPTO 2002. Berlin, Heidelberg: Springer Berlin Heidelberg;
2007:242-256. doi:10.1007/3-540-45708-9_16'
apa: 'May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In
Advances in Cryptology — CRYPTO 2002 (pp. 242–256). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45708-9_16'
bibtex: '@inbook{May_2007, place={Berlin, Heidelberg}, title={Cryptanalysis of Unbalanced
RSA with Small CRT-Exponent}, DOI={10.1007/3-540-45708-9_16},
booktitle={Advances in Cryptology — CRYPTO 2002}, publisher={Springer Berlin Heidelberg},
author={May, Alexander}, year={2007}, pages={242–256} }'
chicago: 'May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”
In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45708-9_16.'
ieee: 'A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in Advances
in Cryptology — CRYPTO 2002, Berlin, Heidelberg: Springer Berlin Heidelberg,
2007, pp. 242–256.'
mla: May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”
Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, 2007,
pp. 242–56, doi:10.1007/3-540-45708-9_16.
short: 'A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2007, pp. 242–256.'
date_created: 2018-06-05T08:26:03Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-45708-9_16
page: 242-256
place: Berlin, Heidelberg
publication: Advances in Cryptology — CRYPTO 2002
publication_identifier:
isbn:
- '9783540440505'
- '9783540457084'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3020'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Alexander
full_name: May, Alexander
last_name: May
citation:
ama: 'Blömer J, May A. Low Secret Exponent RSA Revisited. In: Lecture Notes in
Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19.
doi:10.1007/3-540-44670-2_2'
apa: 'Blömer, J., & May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture
Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin
Heidelberg. https://doi.org/10.1007/3-540-44670-2_2'
bibtex: '@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret
Exponent RSA Revisited}, DOI={10.1007/3-540-44670-2_2},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }'
chicago: 'Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”
In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_2.'
ieee: 'J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture
Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg,
2007, pp. 4–19.'
mla: Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” Lecture
Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.
short: 'J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin
Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.'
date_created: 2018-06-05T08:26:29Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-44670-2_2
page: 4-19
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540424888'
- '9783540446705'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Low Secret Exponent RSA Revisited
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3021'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
- first_name: Alexander
full_name: May, Alexander
last_name: May
citation:
ama: 'Blömer J, May A. Key Revocation with Interval Cover Families. In: Selected
Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341.
doi:10.1007/3-540-45537-x_26'
apa: 'Blömer, J., & May, A. (2007). Key Revocation with Interval Cover Families.
In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer
Berlin Heidelberg. https://doi.org/10.1007/3-540-45537-x_26'
bibtex: '@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Key Revocation
with Interval Cover Families}, DOI={10.1007/3-540-45537-x_26},
booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg},
author={Blömer, Johannes and May, Alexander}, year={2007}, pages={325–341} }'
chicago: 'Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover
Families.” In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-45537-x_26.'
ieee: 'J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected
Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007,
pp. 325–341.'
mla: Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”
Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41,
doi:10.1007/3-540-45537-x_26.
short: 'J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2007, pp. 325–341.'
date_created: 2018-06-05T08:26:50Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-45537-x_26
page: 325-341
place: Berlin, Heidelberg
publication: Selected Areas in Cryptography
publication_identifier:
isbn:
- '9783540430667'
- '9783540455370'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Key Revocation with Interval Cover Families
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3022'
author:
- first_name: Alexander
full_name: May, Alexander
last_name: May
- first_name: Joseph H.
full_name: Silverman, Joseph H.
last_name: Silverman
citation:
ama: 'May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices.
In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2007:110-125. doi:10.1007/3-540-44670-2_10'
apa: 'May, A., & Silverman, J. H. (2007). Dimension Reduction Methods for Convolution
Modular Lattices. In Lecture Notes in Computer Science (pp. 110–125). Berlin,
Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-44670-2_10'
bibtex: '@inbook{May_Silverman_2007, place={Berlin, Heidelberg}, title={Dimension
Reduction Methods for Convolution Modular Lattices}, DOI={10.1007/3-540-44670-2_10},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={May, Alexander and Silverman, Joseph H.}, year={2007}, pages={110–125}
}'
chicago: 'May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods
for Convolution Modular Lattices.” In Lecture Notes in Computer Science,
110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-44670-2_10.'
ieee: 'A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution
Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg:
Springer Berlin Heidelberg, 2007, pp. 110–125.'
mla: May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution
Modular Lattices.” Lecture Notes in Computer Science, Springer Berlin Heidelberg,
2007, pp. 110–25, doi:10.1007/3-540-44670-2_10.
short: 'A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.'
date_created: 2018-06-05T08:27:10Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-44670-2_10
page: 110-125
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783540424888'
- '9783540446705'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Dimension Reduction Methods for Convolution Modular Lattices
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '3026'
author:
- first_name: Johannes
full_name: Blömer, Johannes
id: '23'
last_name: Blömer
citation:
ama: 'Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational
Numbers. In: Algorithms — ESA’ 98. Berlin, Heidelberg: Springer Berlin
Heidelberg; 2007:151-162. doi:10.1007/3-540-68530-8_13'
apa: 'Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots
of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-68530-8_13'
bibtex: '@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic
Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={10.1007/3-540-68530-8_13},
booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer,
Johannes}, year={2007}, pages={151–162} }'
chicago: 'Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving
Roots of Rational Numbers.” In Algorithms — ESA’ 98, 151–62. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2007. https://doi.org/10.1007/3-540-68530-8_13.'
ieee: 'J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of
Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer
Berlin Heidelberg, 2007, pp. 151–162.'
mla: Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots
of Rational Numbers.” Algorithms — ESA’ 98, Springer Berlin Heidelberg,
2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.
short: 'J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin,
Heidelberg, 2007, pp. 151–162.'
date_created: 2018-06-05T08:28:39Z
date_updated: 2022-01-06T06:58:51Z
department:
- _id: '64'
doi: 10.1007/3-540-68530-8_13
page: 151-162
place: Berlin, Heidelberg
publication: Algorithms — ESA’ 98
publication_identifier:
isbn:
- '9783540648482'
- '9783540685302'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
type: book_chapter
user_id: '25078'
year: '2007'
...
---
_id: '20949'
author:
- first_name: A.
full_name: Delic, A.
last_name: Delic
- first_name: Z.
full_name: Avdagic, Z.
last_name: Avdagic
- first_name: Wilhelm
full_name: Schäfer, Wilhelm
last_name: Schäfer
- first_name: Dusanka
full_name: Boskovic, Dusanka
last_name: Boskovic
- first_name: Matthias
full_name: Meyer, Matthias
id: '683'
last_name: Meyer
citation:
ama: 'Delic A, Avdagic Z, Schäfer W, Boskovic D, Meyer M. Program evaluation using
fuzzy logic with bad smells as inputs. In: Proc. of the 21st International
Symposium on Information, Communication and Automation Technologies (ICAT 2007),
Sarajevo, Bosnia Herzegovina. Faculty of Electrical Engineering, University
of Sarajevo; 2007.'
apa: Delic, A., Avdagic, Z., Schäfer, W., Boskovic, D., & Meyer, M. (2007).
Program evaluation using fuzzy logic with bad smells as inputs. Proc. of the
21st International Symposium on Information, Communication and Automation Technologies
(ICAT 2007), Sarajevo, Bosnia Herzegovina.
bibtex: '@inproceedings{Delic_Avdagic_Schäfer_Boskovic_Meyer_2007, title={Program
evaluation using fuzzy logic with bad smells as inputs}, booktitle={Proc. of the
21st International Symposium on Information, Communication and Automation Technologies
(ICAT 2007), Sarajevo, Bosnia Herzegovina}, publisher={Faculty of Electrical Engineering,
University of Sarajevo}, author={Delic, A. and Avdagic, Z. and Schäfer, Wilhelm
and Boskovic, Dusanka and Meyer, Matthias}, year={2007} }'
chicago: Delic, A., Z. Avdagic, Wilhelm Schäfer, Dusanka Boskovic, and Matthias
Meyer. “Program Evaluation Using Fuzzy Logic with Bad Smells as Inputs.” In Proc.
of the 21st International Symposium on Information, Communication and Automation
Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina. Faculty of Electrical
Engineering, University of Sarajevo, 2007.
ieee: A. Delic, Z. Avdagic, W. Schäfer, D. Boskovic, and M. Meyer, “Program evaluation
using fuzzy logic with bad smells as inputs,” 2007.
mla: Delic, A., et al. “Program Evaluation Using Fuzzy Logic with Bad Smells as
Inputs.” Proc. of the 21st International Symposium on Information, Communication
and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina, Faculty
of Electrical Engineering, University of Sarajevo, 2007.
short: 'A. Delic, Z. Avdagic, W. Schäfer, D. Boskovic, M. Meyer, in: Proc. of the
21st International Symposium on Information, Communication and Automation Technologies
(ICAT 2007), Sarajevo, Bosnia Herzegovina, Faculty of Electrical Engineering,
University of Sarajevo, 2007.'
date_created: 2021-01-13T10:18:05Z
date_updated: 2022-01-06T06:54:42Z
department:
- _id: '76'
language:
- iso: eng
publication: Proc. of the 21st International Symposium on Information, Communication
and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina
publisher: Faculty of Electrical Engineering, University of Sarajevo
status: public
title: Program evaluation using fuzzy logic with bad smells as inputs
type: conference
user_id: '5786'
year: '2007'
...
---
_id: '17567'
author:
- first_name: Stefano
full_name: Leonardi, Stefano
last_name: Leonardi
- first_name: Peter
full_name: Mahlmann, Peter
last_name: Mahlmann
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
- first_name: Gerhard
full_name: Weikum, Gerhard
last_name: Weikum
citation:
ama: Leonardi S, Mahlmann P, Meyer auf der Heide F, Spirakis PG, Weikum G. Guarding
our digital society’s well-being. e-Strategies, www.britishpublishers.com.
2007;3-10-2007.
apa: Leonardi, S., Mahlmann, P., Meyer auf der Heide, F., Spirakis, P. G., &
Weikum, G. (2007). Guarding our digital society’s well-being. E-Strategies,
Www.Britishpublishers.Com, 3-10–2007.
bibtex: '@article{Leonardi_Mahlmann_Meyer auf der Heide_Spirakis_Weikum_2007, title={Guarding
our digital society’s well-being}, volume={3-10–2007}, journal={e-Strategies,
www.britishpublishers.com}, author={Leonardi, Stefano and Mahlmann, Peter and
Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}, year={2007}
}'
chicago: Leonardi, Stefano, Peter Mahlmann, Friedhelm Meyer auf der Heide, Paul
G. Spirakis, and Gerhard Weikum. “Guarding Our Digital Society’s Well-Being.”
E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).
ieee: S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P. G. Spirakis, and G. Weikum,
“Guarding our digital society’s well-being,” e-Strategies, www.britishpublishers.com,
vol. 3-10–2007, 2007.
mla: Leonardi, Stefano, et al. “Guarding Our Digital Society’s Well-Being.” E-Strategies,
Www.Britishpublishers.Com, vol. 3-10–2007, 2007.
short: S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P.G. Spirakis, G. Weikum,
E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).
date_created: 2020-08-03T14:26:31Z
date_updated: 2022-01-06T06:53:15Z
department:
- _id: '63'
language:
- iso: eng
publication: e-Strategies, www.britishpublishers.com
status: public
title: Guarding our digital society's well-being
type: journal_article
user_id: '15415'
volume: 3-10-2007
year: '2007'
...
---
_id: '18928'
author:
- first_name: Miroslaw
full_name: Dynia, Miroslaw
last_name: Dynia
- first_name: Jakub
full_name: Łopuszański, Jakub
last_name: Łopuszański
- first_name: Christian
full_name: Schindelhauer, Christian
last_name: Schindelhauer
citation:
ama: 'Dynia M, Łopuszański J, Schindelhauer C. Why Robots Need Maps. In: Proc.
of the 14th Colloquium on Structural Information and Communication Complexity
(SIROCCO). ; 2007:37-- 46. doi:10.1007/978-3-540-72951-8_5'
apa: Dynia, M., Łopuszański, J., & Schindelhauer, C. (2007). Why Robots Need
Maps. In Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 37-- 46). https://doi.org/10.1007/978-3-540-72951-8_5
bibtex: '@inproceedings{Dynia_Łopuszański_Schindelhauer_2007, title={Why Robots
Need Maps}, DOI={10.1007/978-3-540-72951-8_5},
booktitle={Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO)}, author={Dynia, Miroslaw and Łopuszański, Jakub and Schindelhauer,
Christian}, year={2007}, pages={37-- 46} }'
chicago: Dynia, Miroslaw, Jakub Łopuszański, and Christian Schindelhauer. “Why Robots
Need Maps.” In Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO), 37-- 46, 2007. https://doi.org/10.1007/978-3-540-72951-8_5.
ieee: M. Dynia, J. Łopuszański, and C. Schindelhauer, “Why Robots Need Maps,” in
Proc. of the 14th Colloquium on Structural Information and Communication Complexity
(SIROCCO), 2007, pp. 37-- 46.
mla: Dynia, Miroslaw, et al. “Why Robots Need Maps.” Proc. of the 14th Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2007, pp.
37-- 46, doi:10.1007/978-3-540-72951-8_5.
short: 'M. Dynia, J. Łopuszański, C. Schindelhauer, in: Proc. of the 14th Colloquium
on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37--
46.'
date_created: 2020-09-03T10:24:29Z
date_updated: 2022-01-06T06:53:54Z
department:
- _id: '63'
doi: 10.1007/978-3-540-72951-8_5
language:
- iso: eng
page: 37-- 46
publication: Proc. of the 14th Colloquium on Structural Information and Communication
Complexity (SIROCCO)
publication_identifier:
isbn:
- '9783540729181'
- '9783540729518'
publication_status: published
status: public
title: Why Robots Need Maps
type: conference
user_id: '15415'
year: '2007'
...