---
_id: '2428'
abstract:
- lang: eng
text: ' In this paper we present instance-specific accelerators for minimum-cost
covering problems. We first define the covering problem and discuss a branch&bound
algorithm to solve it. Then we describe an instance-specific hardware architecture
that implements branch&bound in 3-valued logic and uses reduction techniques usually
found in software solvers. Results for small unate covering problems reveal significant
raw speedups. '
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
citation:
ama: 'Plessl C, Platzner M. Instance-Specific Accelerators for Minimum Covering.
In: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA). CSREA Press; 2001:85-91.'
apa: Plessl, C., & Platzner, M. (2001). Instance-Specific Accelerators for Minimum
Covering. In Proc. Int. Conf. on Engineering of Reconfigurable Systems and
Algorithms (ERSA) (pp. 85–91). CSREA Press.
bibtex: '@inproceedings{Plessl_Platzner_2001, title={Instance-Specific Accelerators
for Minimum Covering}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Plessl, Christian
and Platzner, Marco}, year={2001}, pages={85–91} }'
chicago: Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators
for Minimum Covering.” In Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA), 85–91. CSREA Press, 2001.
ieee: C. Plessl and M. Platzner, “Instance-Specific Accelerators for Minimum Covering,”
in Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA), 2001, pp. 85–91.
mla: Plessl, Christian, and Marco Platzner. “Instance-Specific Accelerators for
Minimum Covering.” Proc. Int. Conf. on Engineering of Reconfigurable Systems
and Algorithms (ERSA), CSREA Press, 2001, pp. 85–91.
short: 'C. Plessl, M. Platzner, in: Proc. Int. Conf. on Engineering of Reconfigurable
Systems and Algorithms (ERSA), CSREA Press, 2001, pp. 85–91.'
date_created: 2018-04-17T15:39:17Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '518'
- _id: '78'
keyword:
- minimum covering
- accelerator
- funding-sundance
page: 85-91
publication: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms
(ERSA)
publisher: CSREA Press
status: public
title: Instance-Specific Accelerators for Minimum Covering
type: conference
user_id: '24135'
year: '2001'
...
---
_id: '2429'
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Erik
full_name: Wilde, Erik
last_name: Wilde
citation:
ama: Plessl C, Wilde E. Server-Side-Techniken im Web – ein Überblick. iX.
2001:88-93.
apa: Plessl, C., & Wilde, E. (2001). Server-Side-Techniken im Web – ein Überblick.
IX, 88–93.
bibtex: '@article{Plessl_Wilde_2001, title={Server-Side-Techniken im Web – ein Überblick},
journal={iX}, publisher={Heise Verlag}, author={Plessl, Christian and Wilde, Erik},
year={2001}, pages={88–93} }'
chicago: Plessl, Christian, and Erik Wilde. “Server-Side-Techniken Im Web – Ein
Überblick.” IX, 2001, 88–93.
ieee: C. Plessl and E. Wilde, “Server-Side-Techniken im Web – ein Überblick,” iX,
pp. 88–93, 2001.
mla: Plessl, Christian, and Erik Wilde. “Server-Side-Techniken Im Web – Ein Überblick.”
IX, Heise Verlag, 2001, pp. 88–93.
short: C. Plessl, E. Wilde, IX (2001) 88–93.
date_created: 2018-04-17T15:43:29Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '518'
page: 88-93
publication: iX
publisher: Heise Verlag
status: public
title: Server-Side-Techniken im Web – ein Überblick
type: journal_article
user_id: '24135'
year: '2001'
...
---
_id: '2430'
abstract:
- lang: eng
text: In this report the design and implementation of an instance-specific accelerator
for solving minimum covering problems will be presented. After an introduction
to configurable computing in general, the minimum covering problem is defined
and a branch and bound algorithm to solve it in software is presented. The remainder
of the report shows how this branch and bound algorithm can be adopted to hardware.
Specifically it is stressed how the various sophisticated strategies for deducing
conditions for variables used by software solvers can be adopted to hardware and
how a system which uses 3-valued logic to solve this problem can be designed.
In addition to these considerations focusing on the architecture of the system,
some important details of the actual implementation are given. A prototype has
been implemented for showing the feasibility of the concept and for gaining information
about speed and size of the hardware implementation. Cycle-accurate simulations
for a set of benchmark problems have been done for determining the performance
of the accelerator. The speed of the resulting accelerators has been compared
to the time a reference software solver (espresso) needs and the resulting speedups
have been calculated. I have shown that a raw speedup of several orders of maginitude
can be achieved for many problems; for some problems no speedup is achieved yet.
After a discussion of the results, ideas for future work are presented.
author:
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
citation:
ama: Plessl C. Reconfigurable Accelerators for Minimum Covering. Computer
Engineering and Networks Lab, ETH Zurich, Switzerland; 2001.
apa: Plessl, C. (2001). Reconfigurable Accelerators for Minimum Covering.
Computer Engineering and Networks Lab, ETH Zurich, Switzerland.
bibtex: '@book{Plessl_2001, title={Reconfigurable Accelerators for Minimum Covering},
publisher={Computer Engineering and Networks Lab, ETH Zurich, Switzerland}, author={Plessl,
Christian}, year={2001} }'
chicago: Plessl, Christian. Reconfigurable Accelerators for Minimum Covering.
Computer Engineering and Networks Lab, ETH Zurich, Switzerland, 2001.
ieee: C. Plessl, Reconfigurable Accelerators for Minimum Covering. Computer
Engineering and Networks Lab, ETH Zurich, Switzerland, 2001.
mla: Plessl, Christian. Reconfigurable Accelerators for Minimum Covering.
Computer Engineering and Networks Lab, ETH Zurich, Switzerland, 2001.
short: C. Plessl, Reconfigurable Accelerators for Minimum Covering, Computer Engineering
and Networks Lab, ETH Zurich, Switzerland, 2001.
date_created: 2018-04-17T15:47:26Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '518'
publisher: Computer Engineering and Networks Lab, ETH Zurich, Switzerland
status: public
title: Reconfigurable Accelerators for Minimum Covering
type: mastersthesis
user_id: '24135'
year: '2001'
...
---
_id: '2432'
abstract:
- lang: eng
text: In this paper, we present the analysis of applications from the domain of
handheld and wearable computing. This analysis is the first step to derive and
evaluate design parameters for dynamically reconfigurable processors. We discuss
the selection of representative benchmarks for handhelds and wearables and group
the applications into multimedia, communications, and cryptography programs. We
simulate the applications on a cycle-accurate processor simulator and gather statistical
data such as instruction mix, cache hit rates and memory requirements for an embedded
processor model. A breakdown of the executed cycles into different functions identifies
the most compute-intensive code sections - the kernels. Then, we analyze the applications
and discuss parameters that strongly influence the design of dynamically reconfigurable
processors. Finally, we outline the construction of a parameterizable simulation
model for a reconfigurable unit that is attached to a processor core.
author:
- first_name: Rolf
full_name: Enzler, Rolf
last_name: Enzler
- first_name: Marco
full_name: Platzner, Marco
id: '398'
last_name: Platzner
- first_name: Christian
full_name: Plessl, Christian
id: '16153'
last_name: Plessl
orcid: 0000-0001-5728-9982
- first_name: Lothar
full_name: Thiele, Lothar
last_name: Thiele
- first_name: Gerhard
full_name: Tröster, Gerhard
last_name: Tröster
citation:
ama: 'Enzler R, Platzner M, Plessl C, Thiele L, Tröster G. Reconfigurable Processors
for Handhelds and Wearables: Application Analysis. In: Reconfigurable Technology:
FPGAs and Reconfigurable Processors for Computing and Communications III.
Vol 4525. Proc. SPIE. ; 2001:135-146. doi:10.1117/12.434376'
apa: 'Enzler, R., Platzner, M., Plessl, C., Thiele, L., & Tröster, G. (2001).
Reconfigurable Processors for Handhelds and Wearables: Application Analysis. In
Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing
and Communications III (Vol. 4525, pp. 135–146). https://doi.org/10.1117/12.434376'
bibtex: '@inproceedings{Enzler_Platzner_Plessl_Thiele_Tröster_2001, series={Proc.
SPIE}, title={Reconfigurable Processors for Handhelds and Wearables: Application
Analysis}, volume={4525}, DOI={10.1117/12.434376},
booktitle={Reconfigurable Technology: FPGAs and Reconfigurable Processors for
Computing and Communications III}, author={Enzler, Rolf and Platzner, Marco and
Plessl, Christian and Thiele, Lothar and Tröster, Gerhard}, year={2001}, pages={135–146},
collection={Proc. SPIE} }'
chicago: 'Enzler, Rolf, Marco Platzner, Christian Plessl, Lothar Thiele, and Gerhard
Tröster. “Reconfigurable Processors for Handhelds and Wearables: Application Analysis.”
In Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing
and Communications III, 4525:135–46. Proc. SPIE, 2001. https://doi.org/10.1117/12.434376.'
ieee: 'R. Enzler, M. Platzner, C. Plessl, L. Thiele, and G. Tröster, “Reconfigurable
Processors for Handhelds and Wearables: Application Analysis,” in Reconfigurable
Technology: FPGAs and Reconfigurable Processors for Computing and Communications
III, 2001, vol. 4525, pp. 135–146.'
mla: 'Enzler, Rolf, et al. “Reconfigurable Processors for Handhelds and Wearables:
Application Analysis.” Reconfigurable Technology: FPGAs and Reconfigurable
Processors for Computing and Communications III, vol. 4525, 2001, pp. 135–46,
doi:10.1117/12.434376.'
short: 'R. Enzler, M. Platzner, C. Plessl, L. Thiele, G. Tröster, in: Reconfigurable
Technology: FPGAs and Reconfigurable Processors for Computing and Communications
III, 2001, pp. 135–146.'
date_created: 2018-04-17T15:51:39Z
date_updated: 2022-01-06T06:56:17Z
department:
- _id: '518'
- _id: '78'
doi: 10.1117/12.434376
intvolume: ' 4525'
keyword:
- benchmark
page: 135-146
publication: 'Reconfigurable Technology: FPGAs and Reconfigurable Processors for Computing
and Communications III'
series_title: Proc. SPIE
status: public
title: 'Reconfigurable Processors for Handhelds and Wearables: Application Analysis'
type: conference
user_id: '24135'
volume: 4525
year: '2001'
...
---
_id: '3244'
author:
- first_name: Arend
full_name: Rensink, Arend
last_name: Rensink
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Rensink A, Wehrheim H. Process algebra with action dependencies. Acta Inf.
2001;(3):155--234. doi:10.1007/s002360100070
apa: Rensink, A., & Wehrheim, H. (2001). Process algebra with action dependencies.
Acta Inf., (3), 155--234. https://doi.org/10.1007/s002360100070
bibtex: '@article{Rensink_Wehrheim_2001, title={Process algebra with action dependencies},
DOI={10.1007/s002360100070},
number={3}, journal={Acta Inf.}, author={Rensink, Arend and Wehrheim, Heike},
year={2001}, pages={155--234} }'
chicago: 'Rensink, Arend, and Heike Wehrheim. “Process Algebra with Action Dependencies.”
Acta Inf., no. 3 (2001): 155--234. https://doi.org/10.1007/s002360100070.'
ieee: A. Rensink and H. Wehrheim, “Process algebra with action dependencies,” Acta
Inf., no. 3, pp. 155--234, 2001.
mla: Rensink, Arend, and Heike Wehrheim. “Process Algebra with Action Dependencies.”
Acta Inf., no. 3, 2001, pp. 155--234, doi:10.1007/s002360100070.
short: A. Rensink, H. Wehrheim, Acta Inf. (2001) 155--234.
date_created: 2018-06-14T07:12:39Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/s002360100070
issue: '3'
page: 155--234
publication: Acta Inf.
status: public
title: Process algebra with action dependencies
type: journal_article
user_id: '29719'
year: '2001'
...
---
_id: '3245'
author:
- first_name: Detlef
full_name: Bartetzko, Detlef
last_name: Bartetzko
- first_name: Clemens
full_name: Fischer, Clemens
last_name: Fischer
- first_name: Michael
full_name: Möller, Michael
last_name: Möller
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: Bartetzko D, Fischer C, Möller M, Wehrheim H. Jass - Java with Assertions.
Electr Notes Theor Comput Sci. 2001;(2):103--117. doi:10.1016/S1571-0661(04)00247-6
apa: Bartetzko, D., Fischer, C., Möller, M., & Wehrheim, H. (2001). Jass - Java
with Assertions. Electr. Notes Theor. Comput. Sci., (2), 103--117. https://doi.org/10.1016/S1571-0661(04)00247-6
bibtex: '@article{Bartetzko_Fischer_Möller_Wehrheim_2001, title={Jass - Java with
Assertions}, DOI={10.1016/S1571-0661(04)00247-6},
number={2}, journal={Electr. Notes Theor. Comput. Sci.}, author={Bartetzko, Detlef
and Fischer, Clemens and Möller, Michael and Wehrheim, Heike}, year={2001}, pages={103--117}
}'
chicago: 'Bartetzko, Detlef, Clemens Fischer, Michael Möller, and Heike Wehrheim.
“Jass - Java with Assertions.” Electr. Notes Theor. Comput. Sci., no. 2
(2001): 103--117. https://doi.org/10.1016/S1571-0661(04)00247-6.'
ieee: D. Bartetzko, C. Fischer, M. Möller, and H. Wehrheim, “Jass - Java with Assertions,”
Electr. Notes Theor. Comput. Sci., no. 2, pp. 103--117, 2001.
mla: Bartetzko, Detlef, et al. “Jass - Java with Assertions.” Electr. Notes Theor.
Comput. Sci., no. 2, 2001, pp. 103--117, doi:10.1016/S1571-0661(04)00247-6.
short: D. Bartetzko, C. Fischer, M. Möller, H. Wehrheim, Electr. Notes Theor. Comput.
Sci. (2001) 103--117.
date_created: 2018-06-14T07:14:07Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1016/S1571-0661(04)00247-6
issue: '2'
page: 103--117
publication: Electr. Notes Theor. Comput. Sci.
status: public
title: Jass - Java with Assertions
type: journal_article
user_id: '29719'
year: '2001'
...
---
_id: '3246'
author:
- first_name: Clemens
full_name: Fischer, Clemens
last_name: Fischer
- first_name: Ernst-Rüdiger
full_name: Olderog, Ernst-Rüdiger
last_name: Olderog
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
citation:
ama: 'Fischer C, Olderog E-R, Wehrheim H. A {CSP} View on {UML-RT} Structure Diagrams.
In: Hu{\ss}mann H, ed. Fundamental Approaches to Software Engineering, 4th
International Conference, {FASE} 2001 Held as Part of the Joint European Conferences
on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001,
Proceedings. Lecture Notes in Computer Science. ; 2001:91--108. doi:10.1007/3-540-45314-8_8'
apa: Fischer, C., Olderog, E.-R., & Wehrheim, H. (2001). A {CSP} View on {UML-RT}
Structure Diagrams. In H. Hu{\ss}mann (Ed.), Fundamental Approaches to Software
Engineering, 4th International Conference, {FASE} 2001 Held as Part of the Joint
European Conferences on Theory and Practice of Software, {ETAPS} 2001 Genova,
Italy, April 2-6, 2001, Proceedings (pp. 91--108). https://doi.org/10.1007/3-540-45314-8_8
bibtex: '@inproceedings{Fischer_Olderog_Wehrheim_2001, series={Lecture Notes in
Computer Science}, title={A {CSP} View on {UML-RT} Structure Diagrams}, DOI={10.1007/3-540-45314-8_8}, booktitle={Fundamental
Approaches to Software Engineering, 4th International Conference, {FASE} 2001
Held as Part of the Joint European Conferences on Theory and Practice of Software,
{ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings}, author={Fischer, Clemens
and Olderog, Ernst-Rüdiger and Wehrheim, Heike}, editor={Hu{\ss}mann, HeinrichEditor},
year={2001}, pages={91--108}, collection={Lecture Notes in Computer Science} }'
chicago: Fischer, Clemens, Ernst-Rüdiger Olderog, and Heike Wehrheim. “A {CSP} View
on {UML-RT} Structure Diagrams.” In Fundamental Approaches to Software Engineering,
4th International Conference, {FASE} 2001 Held as Part of the Joint European Conferences
on Theory and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001,
Proceedings, edited by Heinrich Hu{\ss}mann, 91--108. Lecture Notes in Computer
Science, 2001. https://doi.org/10.1007/3-540-45314-8_8.
ieee: C. Fischer, E.-R. Olderog, and H. Wehrheim, “A {CSP} View on {UML-RT} Structure
Diagrams,” in Fundamental Approaches to Software Engineering, 4th International
Conference, {FASE} 2001 Held as Part of the Joint European Conferences on Theory
and Practice of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings,
2001, pp. 91--108.
mla: Fischer, Clemens, et al. “A {CSP} View on {UML-RT} Structure Diagrams.” Fundamental
Approaches to Software Engineering, 4th International Conference, {FASE} 2001
Held as Part of the Joint European Conferences on Theory and Practice of Software,
{ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings, edited by Heinrich
Hu{\ss}mann, 2001, pp. 91--108, doi:10.1007/3-540-45314-8_8.
short: 'C. Fischer, E.-R. Olderog, H. Wehrheim, in: H. Hu{\ss}mann (Ed.), Fundamental
Approaches to Software Engineering, 4th International Conference, {FASE} 2001
Held as Part of the Joint European Conferences on Theory and Practice of Software,
{ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings, 2001, pp. 91--108.'
date_created: 2018-06-14T07:15:07Z
date_updated: 2022-01-06T06:59:07Z
department:
- _id: '77'
doi: 10.1007/3-540-45314-8_8
editor:
- first_name: Heinrich
full_name: Hu{\ss}mann, Heinrich
last_name: Hu{\ss}mann
page: 91--108
publication: Fundamental Approaches to Software Engineering, 4th International Conference,
{FASE} 2001 Held as Part of the Joint European Conferences on Theory and Practice
of Software, {ETAPS} 2001 Genova, Italy, April 2-6, 2001, Proceedings
series_title: Lecture Notes in Computer Science
status: public
title: A {CSP} View on {UML-RT} Structure Diagrams
type: conference
user_id: '29719'
year: '2001'
...
---
_id: '2139'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Meyer auf der Heide F, Scheideler C. Deterministic Routing With Bounded Buffers:
Turning Offline Into Online Protocols. Combinatorica. 2001;21(1):95--138.
doi:10.1007/s004930170007'
apa: 'Meyer auf der Heide, F., & Scheideler, C. (2001). Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica,
21(1), 95--138. https://doi.org/10.1007/s004930170007'
bibtex: '@article{Meyer auf der Heide_Scheideler_2001, title={Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols}, volume={21}, DOI={10.1007/s004930170007}, number={1},
journal={Combinatorica}, author={Meyer auf der Heide, Friedhelm and Scheideler,
Christian}, year={2001}, pages={95--138} }'
chicago: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic
Routing With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica
21, no. 1 (2001): 95--138. https://doi.org/10.1007/s004930170007.'
ieee: 'F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded
Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21,
no. 1, pp. 95--138, 2001.'
mla: 'Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing
With Bounded Buffers: Turning Offline Into Online Protocols.” Combinatorica,
vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.'
short: F. Meyer auf der Heide, C. Scheideler, Combinatorica 21 (2001) 95--138.
date_created: 2018-04-03T05:47:20Z
date_updated: 2022-01-06T06:54:57Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s004930170007
intvolume: ' 21'
issue: '1'
language:
- iso: eng
page: 95--138
publication: Combinatorica
status: public
title: 'Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols'
type: journal_article
user_id: '14955'
volume: 21
year: '2001'
...
---
_id: '2140'
author:
- first_name: Baruch
full_name: Awerbuch, Baruch
last_name: Awerbuch
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Awerbuch B, Berenbrink P, Brinkmann A, Scheideler C. Simple Routing Strategies
for Adversarial Systems. In: FOCS. IEEE Computer Society; 2001:158--167.'
apa: Awerbuch, B., Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). Simple
Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE
Computer Society.
bibtex: '@inproceedings{Awerbuch_Berenbrink_Brinkmann_Scheideler_2001, title={Simple
Routing Strategies for Adversarial Systems}, booktitle={FOCS}, publisher={IEEE
Computer Society}, author={Awerbuch, Baruch and Berenbrink, Petra and Brinkmann,
André and Scheideler, Christian}, year={2001}, pages={158--167} }'
chicago: Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler.
“Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167.
IEEE Computer Society, 2001.
ieee: B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler, “Simple Routing
Strategies for Adversarial Systems,” in FOCS, 2001, pp. 158--167.
mla: Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.”
FOCS, IEEE Computer Society, 2001, pp. 158--167.
short: 'B. Awerbuch, P. Berenbrink, A. Brinkmann, C. Scheideler, in: FOCS, IEEE
Computer Society, 2001, pp. 158--167.'
date_created: 2018-04-03T05:48:28Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:59:00Z
date_updated: 2018-04-12T08:59:00Z
file_id: '2302'
file_name: FOCS-01.pdf
file_size: 151156
relation: main_file
file_date_updated: 2018-04-12T08:59:00Z
has_accepted_license: '1'
oa: '1'
page: 158--167
publication: FOCS
publisher: IEEE Computer Society
status: public
title: Simple Routing Strategies for Adversarial Systems
type: conference
urn: '21406'
user_id: '15504'
year: '2001'
...
---
_id: '2141'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Brinkmann A, Scheideler C. SIMLAB-A Simulation Environment for
Storage Area Networks. In: PDP. IEEE Computer Society; 2001:227--234.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2001). SIMLAB-A Simulation
Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer
Society.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2001, title={SIMLAB-A Simulation
Environment for Storage Area Networks}, booktitle={PDP}, publisher={IEEE Computer
Society}, author={Berenbrink, Petra and Brinkmann, André and Scheideler, Christian},
year={2001}, pages={227--234} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A
Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE
Computer Society, 2001.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “SIMLAB-A Simulation Environment
for Storage Area Networks,” in PDP, 2001, pp. 227--234.
mla: Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area
Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDP, IEEE Computer Society,
2001, pp. 227--234.'
date_created: 2018-04-03T05:49:21Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:39:01Z
date_updated: 2018-04-12T08:39:01Z
file_id: '2298'
file_name: PDP-00.pdf
file_size: 85778
relation: main_file
file_date_updated: 2018-04-12T08:39:01Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 227--234
publication: PDP
publisher: IEEE Computer Society
status: public
title: SIMLAB-A Simulation Environment for Storage Area Networks
type: conference
urn: '21415'
user_id: '14955'
year: '2001'
...
---
_id: '2142'
author:
- first_name: Petr
full_name: Kolman, Petr
last_name: Kolman
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kolman P, Scheideler C. Simple on-line algorithms for the maximum disjoint
paths problem. In: SPAA. ; 2001:38--47.'
apa: Kolman, P., & Scheideler, C. (2001). Simple on-line algorithms for the
maximum disjoint paths problem. In SPAA (pp. 38--47).
bibtex: '@inproceedings{Kolman_Scheideler_2001, title={Simple on-line algorithms
for the maximum disjoint paths problem}, booktitle={SPAA}, author={Kolman, Petr
and Scheideler, Christian}, year={2001}, pages={38--47} }'
chicago: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for
the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.
ieee: P. Kolman and C. Scheideler, “Simple on-line algorithms for the maximum disjoint
paths problem,” in SPAA, 2001, pp. 38--47.
mla: Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the
Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.
short: 'P. Kolman, C. Scheideler, in: SPAA, 2001, pp. 38--47.'
date_created: 2018-04-03T05:50:16Z
date_updated: 2022-01-06T06:54:59Z
ddc:
- '040'
department:
- _id: '79'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:58:07Z
date_updated: 2018-04-12T08:58:07Z
file_id: '2301'
file_name: SPAA-01.pdf
file_size: 335171
relation: main_file
file_date_updated: 2018-04-12T08:58:07Z
has_accepted_license: '1'
oa: '1'
page: 38--47
publication: SPAA
status: public
title: Simple on-line algorithms for the maximum disjoint paths problem
type: conference
urn: '21421'
user_id: '15504'
year: '2001'
...
---
_id: '18749'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
citation:
ama: Czumaj A, Sohler C. Testing Hypergraph Coloring. Proceedings of the 28th
International Colloquium on Automata, Languages and Programming (ICALP). 2001:493-505.
doi:10.1007/3-540-48224-5_41
apa: Czumaj, A., & Sohler, C. (2001). Testing Hypergraph Coloring. Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
493–505. https://doi.org/10.1007/3-540-48224-5_41
bibtex: '@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={10.1007/3-540-48224-5_41},
journal={Proceedings of the 28th International Colloquium on Automata, Languages
and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001},
pages={493–505} }'
chicago: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, 493–505. https://doi.org/10.1007/3-540-48224-5_41.
ieee: A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” Proceedings of
the 28th International Colloquium on Automata, Languages and Programming (ICALP),
pp. 493–505, 2001.
mla: Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” Proceedings
of the 28th International Colloquium on Automata, Languages and Programming (ICALP),
2001, pp. 493–505, doi:10.1007/3-540-48224-5_41.
short: A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on
Automata, Languages and Programming (ICALP) (2001) 493–505.
date_created: 2020-09-01T10:48:38Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
doi: 10.1007/3-540-48224-5_41
language:
- iso: eng
page: 493-505
publication: Proceedings of the 28th International Colloquium on Automata, Languages
and Programming (ICALP)
publication_identifier:
isbn:
- '9783540422877'
- '9783540482246'
issn:
- 0302-9743
publication_status: published
status: public
title: Testing Hypergraph Coloring
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18750'
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: 'Sohler C, Czumaj A. Soft Kinetic Data Structures. In: Proceedings of the
12th ACM-SIAM Symposium on Discrete Algorithms. ; 2001:865-872.'
apa: Sohler, C., & Czumaj, A. (2001). Soft Kinetic Data Structures. In Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms (pp. 865–872).
bibtex: '@inproceedings{Sohler_Czumaj_2001, title={Soft Kinetic Data Structures},
booktitle={Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms},
author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={865–872} }'
chicago: Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” In
Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, 865–72,
2001.
ieee: C. Sohler and A. Czumaj, “Soft Kinetic Data Structures,” in Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–872.
mla: Sohler, Christian, and Artur Czumaj. “Soft Kinetic Data Structures.” Proceedings
of the 12th ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 865–72.
short: 'C. Sohler, A. Czumaj, in: Proceedings of the 12th ACM-SIAM Symposium on
Discrete Algorithms, 2001, pp. 865–872.'
date_created: 2020-09-01T10:56:39Z
date_updated: 2022-01-06T06:53:51Z
department:
- _id: '63'
language:
- iso: eng
page: 865-872
publication: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms
status: public
title: Soft Kinetic Data Structures
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '18857'
abstract:
- lang: eng
text: "This paper investigates geometric problems in the context of property testing
algorithms. Property testing is an emerging area in computer science in which
one is aiming at verifying whether a given object has a predetermined property
or is “far” from any object having the property. Although there has been some
research previously done in testing geometric properties, prior works have been
mostly dealing with the study of combinatorial notion of the distance defining
whether an object is “far” or it is “close”; very little research has been done
for geometric notion of distance measures, that is, distance measures that are
based on the geometry underlying input objects.\r\n\r\nThe main objective of this
work is to develop sound models to study geometric problems in the context of
property testing. Comparing to the previous work in property testing, there are
two novel aspects developed in this paper: geometric measures of being close to
an object having the predetermined property, and the use of geometric data structures
as basic primitives to design the testers. We believe that the second aspect is
of special importance in the context of property testing and that the use of specialized
data structures as basic primitives in the testers can be applied to other important
problems in this area.\r\n\r\nWe shall discuss a number of models that in our
opinion fit best geometric problems and apply them to study geometric properties
for three very fundamental and representative problems in the area: testing convex
position, testing map labeling, and testing clusterability."
author:
- first_name: Christian
full_name: Sohler, Christian
last_name: Sohler
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
citation:
ama: Sohler C, Czumaj A. Property Testing with Geometric Queries. Proceedings
of the 9th Annual European Symposium on Algorithms (ESA`01). 2001:266-277.
doi:10.1007/3-540-44676-1_22
apa: Sohler, C., & Czumaj, A. (2001). Property Testing with Geometric Queries.
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
266–277. https://doi.org/10.1007/3-540-44676-1_22
bibtex: '@article{Sohler_Czumaj_2001, title={Property Testing with Geometric Queries},
DOI={10.1007/3-540-44676-1_22},
journal={Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)},
author={Sohler, Christian and Czumaj, Artur}, year={2001}, pages={266–277} }'
chicago: Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
2001, 266–77. https://doi.org/10.1007/3-540-44676-1_22.
ieee: C. Sohler and A. Czumaj, “Property Testing with Geometric Queries,” Proceedings
of the 9th Annual European Symposium on Algorithms (ESA`01), pp. 266–277,
2001.
mla: Sohler, Christian, and Artur Czumaj. “Property Testing with Geometric Queries.”
Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01),
2001, pp. 266–77, doi:10.1007/3-540-44676-1_22.
short: C. Sohler, A. Czumaj, Proceedings of the 9th Annual European Symposium on
Algorithms (ESA`01) (2001) 266–277.
date_created: 2020-09-02T12:24:25Z
date_updated: 2022-01-06T06:53:53Z
department:
- _id: '63'
doi: 10.1007/3-540-44676-1_22
language:
- iso: eng
page: 266-277
publication: Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01)
status: public
title: Property Testing with Geometric Queries
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18964'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Anil
full_name: Maheshwari, Anil
last_name: Maheshwari
- first_name: Norbert
full_name: Zeh, Norbert
last_name: Zeh
citation:
ama: 'Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and
Its Applications to Proximity Problems. In: Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS. ; 2001. doi:10.1007/3-540-45294-x_21'
apa: Lukovszki, T., Maheshwari, A., & Zeh, N. (2001). I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems. In Proceedings of
the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS. https://doi.org/10.1007/3-540-45294-x_21
bibtex: '@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems}, DOI={10.1007/3-540-45294-x_21},
booktitle={Proceedings of the 21st Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki,
Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }'
chicago: Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched
Range Counting and Its Applications to Proximity Problems.” In Proceedings
of the 21st Annual Conference on Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2001), LNCS, 2001. https://doi.org/10.1007/3-540-45294-x_21.
ieee: T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting
and Its Applications to Proximity Problems,” in Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS, 2001.
mla: Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications
to Proximity Problems.” Proceedings of the 21st Annual Conference on Foundations
of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS,
2001, doi:10.1007/3-540-45294-x_21.
short: 'T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual
Conference on Foundations of Software Technology and Theoretical Computer Science
(FSTTCS 2001), LNCS, 2001.'
date_created: 2020-09-03T13:26:01Z
date_updated: 2022-01-06T06:53:55Z
department:
- _id: '63'
doi: 10.1007/3-540-45294-x_21
language:
- iso: eng
publication: Proceedings of the 21st Annual Conference on Foundations of Software
Technology and Theoretical Computer Science (FSTTCS 2001), LNCS
publication_identifier:
isbn:
- '9783540430025'
- '9783540452942'
issn:
- 0302-9743
publication_status: published
status: public
title: I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '23731'
abstract:
- lang: eng
text: "\r\n On 22 May 2000, the factorization of a pseudorandom
polynomial of degree 1 048 543 over the binary field Z\r\n 2\r\n
\ was completed on a 4-processor Linux PC, using roughly 100 CPU-hours.
The basic approach is a combination of the factorization software BIPOLAR and
a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn
University BSP library) is used for the implementation of the parallel communication.\r\n
\ "
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Joachim
full_name: von zur Gathen, Joachim
last_name: von zur Gathen
- first_name: Jürgen
full_name: Gerhard, Jürgen
last_name: Gerhard
- first_name: Olaf
full_name: Müller, Olaf
last_name: Müller
citation:
ama: Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial
of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333
apa: Bonorden, O., von zur Gathen, J., Gerhard, J., & Müller, O. (2001). Factoring
a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18.
https://doi.org/10.1145/504331.504333
bibtex: '@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring
a binary polynomial of degree over one million}, DOI={10.1145/504331.504333},
journal={ACM SIGSAM Bulletin}, author={Bonorden, Olaf and von zur Gathen, Joachim
and Gerhard, Jürgen and Müller, Olaf}, year={2001}, pages={16–18} }'
chicago: Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller.
“Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin,
2001, 16–18. https://doi.org/10.1145/504331.504333.
ieee: O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary
polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18,
2001.
mla: Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.”
ACM SIGSAM Bulletin, 2001, pp. 16–18, doi:10.1145/504331.504333.
short: O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin
(2001) 16–18.
date_created: 2021-09-03T09:08:27Z
date_updated: 2022-01-06T06:55:58Z
department:
- _id: '63'
doi: 10.1145/504331.504333
language:
- iso: eng
page: 16-18
publication: ACM SIGSAM Bulletin
publication_identifier:
issn:
- 0163-5824
publication_status: published
status: public
title: Factoring a binary polynomial of degree over one million
type: journal_article
user_id: '15415'
year: '2001'
...
---
_id: '18152'
abstract:
- lang: eng
text: Computing the spectral decomposition of a normal matrix is among the most
frequent tasks to numerical mathematics. A vast range of methods are employed
to do so, but all of them suffer from instabilities when applied to degenerate
matrices, i.e., those having multiple eigenvalues. We investigate the spectral
representation's effectivity properties on the sound formal basis of computable
analysis. It turns out that in general the eigenvectors cannot be computed from
a given matrix. If however the size of the matrix' spectrum (=number of different
eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in
principle the spectral decomposition can be computed under remarkably weak non-degeneracy
conditions.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: Vasco
full_name: Brattka, Vasco
last_name: Brattka
citation:
ama: 'Ziegler M, Brattka V. A Computable Spectral Theorem. In: Proceedings of
the 4th Workshop on Computability and Complexity in Analysis (CCA’2000). Vol
2064. Berlin, Heidelberg; 2001:378-388. doi:10.1007/3-540-45335-0_23'
apa: Ziegler, M., & Brattka, V. (2001). A Computable Spectral Theorem. In Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)
(Vol. 2064, pp. 378–388). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45335-0_23
bibtex: '@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A
Computable Spectral Theorem}, volume={2064}, DOI={10.1007/3-540-45335-0_23},
booktitle={Proceedings of the 4th Workshop on Computability and Complexity in
Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001},
pages={378–388} }'
chicago: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In
Proceedings of the 4th Workshop on Computability and Complexity in Analysis
(CCA’2000), 2064:378–88. Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45335-0_23.
ieee: M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
2001, vol. 2064, pp. 378–388.
mla: Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” Proceedings
of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000),
vol. 2064, 2001, pp. 378–88, doi:10.1007/3-540-45335-0_23.
short: 'M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability
and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.'
date_created: 2020-08-24T10:14:06Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.1007/3-540-45335-0_23
intvolume: ' 2064'
language:
- iso: eng
page: 378-388
place: Berlin, Heidelberg
publication: Proceedings of the 4th Workshop on Computability and Complexity in Analysis
(CCA'2000)
publication_identifier:
isbn:
- '9783540421979'
- '9783540453352'
issn:
- 0302-9743
publication_status: published
status: public
title: A Computable Spectral Theorem
type: conference
user_id: '15415'
volume: 2064
year: '2001'
...
---
_id: '18166'
abstract:
- lang: eng
text: What is the maximum number of edges of the d-dimensional hypercube, denoted
by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial
properties of Euclidean geometry arising from linear separability considerations
in the theory of Perceptrons has become an issue on its own. We use computational
and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen
earlier results on hypercube cut numbers.
author:
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
- first_name: M. Reza
full_name: Emamy-Khansari, M. Reza
last_name: Emamy-Khansari
citation:
ama: 'Ziegler M, Emamy-Khansari MR. New Bounds for Hypercube Slicing Numbers. In:
Proceedings of the First International Conference on Discrete Models - Combinatorics,
Computation and Geometry (DM-CCG’2001). Vol AA. ; 2001:155-164.'
apa: Ziegler, M., & Emamy-Khansari, M. R. (2001). New Bounds for Hypercube Slicing
Numbers. In Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG’2001) (Vol. AA, pp. 155–164).
bibtex: '@inproceedings{Ziegler_Emamy-Khansari_2001, title={New Bounds for Hypercube
Slicing Numbers}, volume={AA}, booktitle={Proceedings of the First International
Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001)},
author={Ziegler, Martin and Emamy-Khansari, M. Reza}, year={2001}, pages={155–164}
}'
chicago: Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube
Slicing Numbers.” In Proceedings of the First International Conference on Discrete
Models - Combinatorics, Computation and Geometry (DM-CCG’2001), AA:155–64,
2001.
ieee: M. Ziegler and M. R. Emamy-Khansari, “New Bounds for Hypercube Slicing Numbers,”
in Proceedings of the First International Conference on Discrete Models - Combinatorics,
Computation and Geometry (DM-CCG’2001), 2001, vol. AA, pp. 155–164.
mla: Ziegler, Martin, and M. Reza Emamy-Khansari. “New Bounds for Hypercube Slicing
Numbers.” Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG’2001), vol. AA, 2001, pp.
155–64.
short: 'M. Ziegler, M.R. Emamy-Khansari, in: Proceedings of the First International
Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG’2001),
2001, pp. 155–164.'
date_created: 2020-08-24T11:29:08Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 155-164
publication: Proceedings of the First International Conference on Discrete Models
- Combinatorics, Computation and Geometry (DM-CCG'2001)
status: public
title: New Bounds for Hypercube Slicing Numbers
type: conference
user_id: '15415'
volume: AA
year: '2001'
...
---
_id: '18168'
abstract:
- lang: eng
text: 'We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing
rather than the RealRAM model. Asking for mere computability of a function''s
maximum over some closed domain, we show that the common presumptions ''full-dimensional''
and `bounded'' in fact cannot be omitted: The sound framework of Recursive Analysis
enables us to rigorously prove this folkloristic observation! On the other hand,
convexity of this domain may be weakened to connectedness, and even NON-linear
functions turn out to be effectively optimizable.'
author:
- first_name: Vasco
full_name: Brattka, Vasco
last_name: Brattka
- first_name: Martin
full_name: Ziegler, Martin
last_name: Ziegler
citation:
ama: 'Brattka V, Ziegler M. Turing Computability of (Non-)Linear Optimization. In:
Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01).
; 2001:181-184.'
apa: Brattka, V., & Ziegler, M. (2001). Turing Computability of (Non-)Linear
Optimization. In Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01) (pp. 181–184).
bibtex: '@inproceedings{Brattka_Ziegler_2001, title={Turing Computability of (Non-)Linear
Optimization}, booktitle={Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01)}, author={Brattka, Vasco and Ziegler, Martin}, year={2001},
pages={181–184} }'
chicago: Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear
Optimization.” In Proceedings of the 13th Canadian Conference on Computational
Geometry (CCCG’01), 181–84, 2001.
ieee: V. Brattka and M. Ziegler, “Turing Computability of (Non-)Linear Optimization,”
in Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01),
2001, pp. 181–184.
mla: Brattka, Vasco, and Martin Ziegler. “Turing Computability of (Non-)Linear Optimization.”
Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG’01),
2001, pp. 181–84.
short: 'V. Brattka, M. Ziegler, in: Proceedings of the 13th Canadian Conference
on Computational Geometry (CCCG’01), 2001, pp. 181–184.'
date_created: 2020-08-24T11:33:12Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
page: 181-184
publication: Proceedings of the 13th Canadian Conference on Computational Geometry
(CCCG'01)
status: public
title: Turing Computability of (Non-)Linear Optimization
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '18370'
abstract:
- lang: eng
text: We present a new approximate occlusion-culling algorithm that in contrast
to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For
generating a frame, as far as possible only the visible objects are rendered that
can be found quickly by an edge of the graph. The algorithm allows a real-time
navigation with over 20 frames per second in complex scenes consisting of over
10 millions of polygons. Moreover, approximation errors are very low.
author:
- first_name: Jan
full_name: Klein, Jan
last_name: Klein
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the
3D-Sectorgraph. In: Proc. of 3. GI-Informatiktage 2001. Bad Schussenried;
2001:275-278.'
apa: Klein, J., & Fischer, M. (2001). Occlusion Culling for Virtual Environments
based on the 3D-Sectorgraph. In Proc. of 3. GI-Informatiktage 2001 (pp.
275–278). Bad Schussenried.
bibtex: '@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion
Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc.
of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001},
pages={275–278} }'
chicago: Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments
Based on the 3D-Sectorgraph.” In Proc. of 3. GI-Informatiktage 2001, 275–78.
Bad Schussenried, 2001.
ieee: J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based
on the 3D-Sectorgraph,” in Proc. of 3. GI-Informatiktage 2001, 2001, pp.
275–278.
mla: Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments
Based on the 3D-Sectorgraph.” Proc. of 3. GI-Informatiktage 2001, 2001,
pp. 275–78.
short: 'J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried,
2001, pp. 275–278.'
date_created: 2020-08-26T13:08:24Z
date_updated: 2022-01-06T06:53:30Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-08-26T13:08:08Z
date_updated: 2020-08-26T13:08:08Z
file_id: '18371'
file_name: hni-id-1450.pdf
file_size: 146136
relation: main_file
success: 1
file_date_updated: 2020-08-26T13:08:08Z
has_accepted_license: '1'
language:
- iso: eng
page: 275 - 278
place: Bad Schussenried
publication: Proc. of 3. GI-Informatiktage 2001
status: public
title: Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph
type: conference
user_id: '15415'
year: '2001'
...