---
_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'
...
---
_id: '16492'
abstract:
- lang: eng
text: We present a new output-sensitive rendering algorithm, the randomized z-buffer
algorithm. It renders an image of an arbitrary three-dimensional scene consisting
of triangular primitives by reconstruction from a dynamically chosen set of random
surface sample points. This approach is independent of mesh connectivity and topology.
The resulting rendering time grows only logarithmically with the numbers of triangles
in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles
at interactive frame rates. Automatic identification of low detail scene components
ensures that the rendering speed of the randomized z-buffer cannot drop below
that of conventional z-buffer rendering. Experimental and analytical evidence
is given that the image quality is comparable to that of common approaches like
z-buffer rendering. The precomputed data structures employed by the randomized
z-buffer allow for interactive dynamic updates of the scene. Their memory requirements
grow only linearly with the number of triangles and allow for a scene graph based
instantiation scheme to further reduce memory consumption.
author:
- first_name: Michael
full_name: Wand, Michael
last_name: Wand
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Ingmar
full_name: Peter, Ingmar
last_name: Peter
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Wolfgang
full_name: Straßer, Wolfgang
last_name: Straßer
citation:
ama: 'Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized
z-buffer algorithm. In: Proceedings of the 28th Annual Conference on Computer
Graphics and Interactive Techniques - SIGGRAPH ’01. ; 2001. doi:10.1145/383259.383299'
apa: Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., & Straßer, W.
(2001). The randomized z-buffer algorithm. In Proceedings of the 28th annual
conference on Computer graphics and interactive techniques - SIGGRAPH ’01.
https://doi.org/10.1145/383259.383299
bibtex: '@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The
randomized z-buffer algorithm}, DOI={10.1145/383259.383299},
booktitle={Proceedings of the 28th annual conference on Computer graphics and
interactive techniques - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias
and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001}
}'
chicago: Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der
Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In Proceedings
of the 28th Annual Conference on Computer Graphics and Interactive Techniques
- SIGGRAPH ’01, 2001. https://doi.org/10.1145/383259.383299.
ieee: M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The
randomized z-buffer algorithm,” in Proceedings of the 28th annual conference
on Computer graphics and interactive techniques - SIGGRAPH ’01, 2001.
mla: Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” Proceedings of
the 28th Annual Conference on Computer Graphics and Interactive Techniques -
SIGGRAPH ’01, 2001, doi:10.1145/383259.383299.
short: 'M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings
of the 28th Annual Conference on Computer Graphics and Interactive Techniques
- SIGGRAPH ’01, 2001.'
date_created: 2020-04-09T10:36:54Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1145/383259.383299
language:
- iso: eng
publication: Proceedings of the 28th annual conference on Computer graphics and interactive
techniques - SIGGRAPH '01
publication_identifier:
isbn:
- 158113374X
publication_status: published
status: public
title: The randomized z-buffer algorithm
type: conference
user_id: '15415'
year: '2001'
...
---
_id: '16493'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Data Management in Networks. In: Graph-Theoretic
Concepts in Computer Science. Vol 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg; 2001. doi:10.1007/3-540-45477-2_2'
apa: Meyer auf der Heide, F. (2001). Data Management in Networks. In Graph-Theoretic
Concepts in Computer Science (Vol. 2204). Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_2
bibtex: '@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={
Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204},
DOI={10.1007/3-540-45477-2_2},
booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der
Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science}
}'
chicago: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In Graph-Theoretic
Concepts in Computer Science, Vol. 2204. Lecture Notes in Computer Science.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45477-2_2.
ieee: F. Meyer auf der Heide, “Data Management in Networks,” in Graph-Theoretic
Concepts in Computer Science, vol. 2204, Berlin, Heidelberg, 2001.
mla: Meyer auf der Heide, Friedhelm. “Data Management in Networks.” Graph-Theoretic
Concepts in Computer Science, vol. 2204, 2001, doi:10.1007/3-540-45477-2_2.
short: 'F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science,
Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:40:48Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45477-2_2
intvolume: ' 2204'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Graph-Theoretic Concepts in Computer Science
publication_identifier:
isbn:
- '9783540427070'
- '9783540454779'
issn:
- 0302-9743
publication_status: published
series_title: ' Lecture Notes in Computer Science'
status: public
title: Data Management in Networks
type: book_chapter
user_id: '15415'
volume: 2204
year: '2001'
...
---
_id: '16494'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact
on Algorithm Design. In: Computational Science - ICCS 2001. Berlin, Heidelberg;
2001. doi:10.1007/3-540-45718-6_68'
apa: Meyer auf der Heide, F., & Wanka, R. (2001). Parallel Bridging Models and
Their Impact on Algorithm Design. In Computational Science - ICCS 2001.
Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_68
bibtex: '@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel
Bridging Models and Their Impact on Algorithm Design}, DOI={10.1007/3-540-45718-6_68},
booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm
and Wanka, Rolf}, year={2001} }'
chicago: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models
and Their Impact on Algorithm Design.” In Computational Science - ICCS 2001.
Berlin, Heidelberg, 2001. https://doi.org/10.1007/3-540-45718-6_68.
ieee: F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact
on Algorithm Design,” in Computational Science - ICCS 2001, Berlin, Heidelberg,
2001.
mla: Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and
Their Impact on Algorithm Design.” Computational Science - ICCS 2001, 2001,
doi:10.1007/3-540-45718-6_68.
short: 'F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001,
Berlin, Heidelberg, 2001.'
date_created: 2020-04-09T10:51:36Z
date_updated: 2022-01-06T06:52:51Z
department:
- _id: '63'
doi: 10.1007/3-540-45718-6_68
language:
- iso: eng
place: Berlin, Heidelberg
publication: Computational Science - ICCS 2001
publication_identifier:
isbn:
- '9783540422334'
- '9783540457183'
issn:
- 0302-9743
publication_status: published
status: public
title: Parallel Bridging Models and Their Impact on Algorithm Design
type: book_chapter
user_id: '15415'
year: '2001'
...
---
_id: '16722'
citation:
ama: 'Meyer auf der Heide F, ed. Algorithms — ESA 2001, 9th Annual European Symposium
Århus, Denmark. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin,
Heidelberg: Springer ; 2001. doi:10.1007/3-540-44676-1'
apa: 'Meyer auf der Heide, F. (Ed.). (2001). Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark (Lecture Notes in Computer Science (LNCS,
volume 2161)). Berlin, Heidelberg: Springer . https://doi.org/10.1007/3-540-44676-1'
bibtex: '@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture
Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001,
9th Annual European Symposium Århus, Denmark}, DOI={10.1007/3-540-44676-1},
publisher={Springer }, year={2001} }'
chicago: 'Meyer auf der Heide, Friedhelm, ed. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161). Berlin, Heidelberg: Springer , 2001. https://doi.org/10.1007/3-540-44676-1.'
ieee: 'F. Meyer auf der Heide, Ed., Algorithms — ESA 2001, 9th Annual European
Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, Volume
2161). Berlin, Heidelberg: Springer , 2001.'
mla: Meyer auf der Heide, Friedhelm, editor. Algorithms — ESA 2001, 9th Annual
European Symposium Århus, Denmark. Lecture Notes in Computer Science (LNCS,
Volume 2161), Springer , 2001, doi:10.1007/3-540-44676-1.
short: F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium
Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer
, Berlin, Heidelberg, 2001.
date_created: 2020-04-17T10:59:08Z
date_updated: 2022-01-06T06:52:55Z
department:
- _id: '63'
doi: 10.1007/3-540-44676-1
edition: Lecture Notes in Computer Science (LNCS, volume 2161)
editor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783540424932'
- '9783540446767'
issn:
- 0302-9743
publication_status: published
publisher: 'Springer '
status: public
title: Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark
type: book_editor
user_id: '15415'
year: '2001'
...
---
_id: '19620'
author:
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
citation:
ama: Rieping I. Communication in Parallel Systems-Models, Algorithms and Implementations.
Vol 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2000.
apa: Rieping, I. (2000). Communication in Parallel Systems-Models, Algorithms
and Implementations (Vol. 81). Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn.
bibtex: '@book{Rieping_2000, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn}, title={Communication in Parallel Systems-Models, Algorithms and Implementations},
volume={81}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn},
author={Rieping, Ingo}, year={2000}, collection={Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn} }'
chicago: Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms
and Implementations. Vol. 81. Verlagsschriftenreihe Des Heinz Nixdorf Instituts,
Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
ieee: I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations,
vol. 81. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
mla: Rieping, Ingo. Communication in Parallel Systems-Models, Algorithms and
Implementations. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2000.
short: I. Rieping, Communication in Parallel Systems-Models, Algorithms and Implementations,
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.
date_created: 2020-09-22T10:06:31Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 81'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-80-9
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: Communication in Parallel Systems-Models, Algorithms and Implementations
type: dissertation
user_id: '5786'
volume: 81
year: '2000'
...
---
_id: '19621'
author:
- first_name: Matthias
full_name: Westermann, Matthias
last_name: Westermann
citation:
ama: 'Westermann M. Caching in Networks: Non-Uniform Algorithms and Memory Capacity
Constraints. Vol 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn;
2000.'
apa: 'Westermann, M. (2000). Caching in Networks: Non-Uniform Algorithms and
Memory Capacity Constraints (Vol. 90). Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn.'
bibtex: '@book{Westermann_2000, series={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn}, title={Caching in Networks: Non-Uniform Algorithms and
Memory Capacity Constraints}, volume={90}, publisher={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, author={Westermann, Matthias}, year={2000},
collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }'
chicago: 'Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and
Memory Capacity Constraints. Vol. 90. Verlagsschriftenreihe Des Heinz Nixdorf
Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2000.'
ieee: 'M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory
Capacity Constraints, vol. 90. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2000.'
mla: 'Westermann, Matthias. Caching in Networks: Non-Uniform Algorithms and Memory
Capacity Constraints. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn,
2000.'
short: 'M. Westermann, Caching in Networks: Non-Uniform Algorithms and Memory Capacity
Constraints, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2000.'
date_created: 2020-09-22T10:16:35Z
date_updated: 2022-01-06T06:54:08Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 90'
language:
- iso: eng
publication_identifier:
isbn:
- 3-931466-89-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
related_material:
link:
- relation: confirmation
url: https://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20000101283
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
title: 'Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints'
type: dissertation
user_id: '5786'
volume: 90
year: '2000'
...
---
_id: '19733'
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Ingo
full_name: Rieping, Ingo
last_name: Rieping
- first_name: Ingo
full_name: von Otte, Ingo
last_name: von Otte
- first_name: Bernhardus
full_name: Juurlink, Bernhardus
last_name: Juurlink
citation:
ama: Bonorden O, Rieping I, von Otte I, Juurlink B. PUB-Library, Release 7.0,
User Guide and Function Reference.; 2000.
apa: Bonorden, O., Rieping, I., von Otte, I., & Juurlink, B. (2000). PUB-Library,
Release 7.0, User Guide and Function Reference.
bibtex: '@book{Bonorden_Rieping_von Otte_Juurlink_2000, title={PUB-Library, Release
7.0, User Guide and Function Reference}, author={Bonorden, Olaf and Rieping, Ingo
and von Otte, Ingo and Juurlink, Bernhardus}, year={2000} }'
chicago: Bonorden, Olaf, Ingo Rieping, Ingo von Otte, and Bernhardus Juurlink. PUB-Library,
Release 7.0, User Guide and Function Reference, 2000.
ieee: O. Bonorden, I. Rieping, I. von Otte, and B. Juurlink, PUB-Library, Release
7.0, User Guide and Function Reference. 2000.
mla: Bonorden, Olaf, et al. PUB-Library, Release 7.0, User Guide and Function
Reference. 2000.
short: O. Bonorden, I. Rieping, I. von Otte, B. Juurlink, PUB-Library, Release 7.0,
User Guide and Function Reference, 2000.
date_created: 2020-09-28T12:20:20Z
date_updated: 2022-01-06T06:54:10Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
content_type: application/pdf
creator: koala
date_created: 2020-09-28T12:20:10Z
date_updated: 2020-09-28T12:20:10Z
file_id: '19734'
file_name: pub-hni-1656.pdf
file_size: 271118
relation: main_file
success: 1
file_date_updated: 2020-09-28T12:20:10Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: PUB-Library, Release 7.0, User Guide and Function Reference
type: report
user_id: '15415'
year: '2000'
...
---
_id: '19849'
author:
- first_name: M.
full_name: Bednara, M.
last_name: Bednara
- first_name: O.
full_name: Beyer, O.
last_name: Beyer
- first_name: J.
full_name: Teich, J.
last_name: Teich
- first_name: Rolf
full_name: Wanka, Rolf
last_name: Wanka
citation:
ama: 'Bednara M, Beyer O, Teich J, Wanka R. Tradeoff analysis and architecture design
of a hybrid hardware/software sorter. In: Proc. Int. Conf. on Application Specific
Systems, Architectures, and Processors (ASAP). ; 2000:299-308. doi:10.1109/asap.2000.862400'
apa: Bednara, M., Beyer, O., Teich, J., & Wanka, R. (2000). Tradeoff analysis
and architecture design of a hybrid hardware/software sorter. Proc. Int. Conf.
on Application Specific Systems, Architectures, and Processors (ASAP), 299–308.
https://doi.org/10.1109/asap.2000.862400
bibtex: '@inproceedings{Bednara_Beyer_Teich_Wanka_2000, title={Tradeoff analysis
and architecture design of a hybrid hardware/software sorter}, DOI={10.1109/asap.2000.862400},
booktitle={Proc. Int. Conf. on Application Specific Systems, Architectures, and
Processors (ASAP)}, author={Bednara, M. and Beyer, O. and Teich, J. and Wanka,
Rolf}, year={2000}, pages={299–308} }'
chicago: Bednara, M., O. Beyer, J. Teich, and Rolf Wanka. “Tradeoff Analysis and
Architecture Design of a Hybrid Hardware/Software Sorter.” In Proc. Int. Conf.
on Application Specific Systems, Architectures, and Processors (ASAP), 299–308,
2000. https://doi.org/10.1109/asap.2000.862400.
ieee: 'M. Bednara, O. Beyer, J. Teich, and R. Wanka, “Tradeoff analysis and architecture
design of a hybrid hardware/software sorter,” in Proc. Int. Conf. on Application
Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308,
doi: 10.1109/asap.2000.862400.'
mla: Bednara, M., et al. “Tradeoff Analysis and Architecture Design of a Hybrid
Hardware/Software Sorter.” Proc. Int. Conf. on Application Specific Systems,
Architectures, and Processors (ASAP), 2000, pp. 299–308, doi:10.1109/asap.2000.862400.
short: 'M. Bednara, O. Beyer, J. Teich, R. Wanka, in: Proc. Int. Conf. on Application
Specific Systems, Architectures, and Processors (ASAP), 2000, pp. 299–308.'
date_created: 2020-10-02T10:30:38Z
date_updated: 2022-01-06T06:54:13Z
department:
- _id: '63'
doi: 10.1109/asap.2000.862400
language:
- iso: eng
page: 299-308
publication: Proc. Int. Conf. on Application Specific Systems, Architectures, and
Processors (ASAP)
publication_identifier:
isbn:
- '0769507166'
publication_status: published
status: public
title: Tradeoff analysis and architecture design of a hybrid hardware/software sorter
type: conference
user_id: '15415'
year: '2000'
...
---
_id: '2143'
author:
- first_name: Micah
full_name: Adler, Micah
last_name: Adler
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Adler M, Scheideler C. Efficient Communication Strategies for Ad Hoc Wireless
Networks. Theory Comput Syst. 2000;33(5/6):337--391. doi:10.1007/s002240010006
apa: Adler, M., & Scheideler, C. (2000). Efficient Communication Strategies
for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391.
https://doi.org/10.1007/s002240010006
bibtex: '@article{Adler_Scheideler_2000, title={Efficient Communication Strategies
for Ad Hoc Wireless Networks}, volume={33}, DOI={10.1007/s002240010006},
number={5/6}, journal={Theory Comput. Syst.}, author={Adler, Micah and Scheideler,
Christian}, year={2000}, pages={337--391} }'
chicago: 'Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad Hoc Wireless Networks.” Theory Comput. Syst. 33, no. 5/6 (2000):
337--391. https://doi.org/10.1007/s002240010006.'
ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad Hoc
Wireless Networks,” Theory Comput. Syst., vol. 33, no. 5/6, pp. 337--391,
2000.
mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad Hoc Wireless Networks.” Theory Comput. Syst., vol. 33, no. 5/6,
2000, pp. 337--391, doi:10.1007/s002240010006.
short: M. Adler, C. Scheideler, Theory Comput. Syst. 33 (2000) 337--391.
date_created: 2018-04-03T05:51:02Z
date_updated: 2022-01-06T06:54:59Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240010006
intvolume: ' 33'
issue: 5/6
language:
- iso: eng
page: 337--391
publication: Theory Comput. Syst.
status: public
title: Efficient Communication Strategies for Ad Hoc Wireless Networks
type: journal_article
user_id: '14955'
volume: 33
year: '2000'
...
---
_id: '2145'
author:
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
- first_name: Berthold
full_name: Vöcking, Berthold
last_name: Vöcking
citation:
ama: 'Scheideler C, Vöcking B. From Static to Dynamic Routing: Efficient Transformations
of Store-and-Forward Protocols. SIAM J Comput. 2000;30(4):1126--1155. doi:10.1137/S0097539799353431'
apa: 'Scheideler, C., & Vöcking, B. (2000). From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput.,
30(4), 1126--1155. https://doi.org/10.1137/S0097539799353431'
bibtex: '@article{Scheideler_Vöcking_2000, title={From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols}, volume={30}, DOI={10.1137/S0097539799353431},
number={4}, journal={SIAM J. Comput.}, author={Scheideler, Christian and Vöcking,
Berthold}, year={2000}, pages={1126--1155} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput.
30, no. 4 (2000): 1126--1155. https://doi.org/10.1137/S0097539799353431.'
ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
Transformations of Store-and-Forward Protocols,” SIAM J. Comput., vol.
30, no. 4, pp. 1126--1155, 2000.'
mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” SIAM J. Comput.,
vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.'
short: C. Scheideler, B. Vöcking, SIAM J. Comput. 30 (2000) 1126--1155.
date_created: 2018-04-03T06:12:15Z
date_updated: 2022-01-06T06:55:00Z
department:
- _id: '79'
- _id: '63'
doi: 10.1137/S0097539799353431
intvolume: ' 30'
issue: '4'
language:
- iso: eng
page: 1126--1155
publication: SIAM J. Comput.
status: public
title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
Protocols'
type: journal_article
user_id: '14955'
volume: 30
year: '2000'
...
---
_id: '2146'
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. Distributed Path Selection for Storage
Networks. In: PDPTA. ; 2000.'
apa: Berenbrink, P., Brinkmann, A., & Scheideler, C. (2000). Distributed Path
Selection for Storage Networks. In PDPTA.
bibtex: '@inproceedings{Berenbrink_Brinkmann_Scheideler_2000, title={Distributed
Path Selection for Storage Networks}, booktitle={PDPTA}, author={Berenbrink, Petra
and Brinkmann, André and Scheideler, Christian}, year={2000} }'
chicago: Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed
Path Selection for Storage Networks.” In PDPTA, 2000.
ieee: P. Berenbrink, A. Brinkmann, and C. Scheideler, “Distributed Path Selection
for Storage Networks,” in PDPTA, 2000.
mla: Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.”
PDPTA, 2000.
short: 'P. Berenbrink, A. Brinkmann, C. Scheideler, in: PDPTA, 2000.'
date_created: 2018-04-03T06:13:07Z
date_updated: 2022-01-06T06:55:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:47:50Z
date_updated: 2018-04-12T08:47:50Z
file_id: '2299'
file_name: PDPTA-00.pdf
file_size: 168677
relation: main_file
file_date_updated: 2018-04-12T08:47:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
publication: PDPTA
status: public
title: Distributed Path Selection for Storage Networks
type: conference
urn: '21467'
user_id: '14955'
year: '2000'
...
---
_id: '2147'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. Coloring non-uniform hypergraphs: a new algorithmic
approach to the general Lovász local lemma. In: SODA. ; 2000:30--39.'
apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring non-uniform hypergraphs:
a new algorithmic approach to the general Lovász local lemma. In SODA (pp.
30--39).'
bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={Coloring non-uniform hypergraphs:
a new algorithmic approach to the general Lovász local lemma}, booktitle={SODA},
author={Czumaj, Artur and Scheideler, Christian}, year={2000}, pages={30--39}
}'
chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA,
30--39, 2000.'
ieee: 'A. Czumaj and C. Scheideler, “Coloring non-uniform hypergraphs: a new algorithmic
approach to the general Lovász local lemma,” in SODA, 2000, pp. 30--39.'
mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000,
pp. 30--39.'
short: 'A. Czumaj, C. Scheideler, in: SODA, 2000, pp. 30--39.'
date_created: 2018-04-03T06:16:48Z
date_updated: 2022-01-06T06:55:00Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:36:17Z
date_updated: 2018-04-12T08:36:17Z
file_id: '2295'
file_name: SODA-00.pdf
file_size: 185001
relation: main_file
file_date_updated: 2018-04-12T08:36:17Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 30--39
publication: SODA
status: public
title: 'Coloring non-uniform hypergraphs: a new algorithmic approach to the general
Lovász local lemma'
type: conference
urn: '21476'
user_id: '14955'
year: '2000'
...
---
_id: '2148'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic
approach to the general Lovász local lemma. Random Struct Algorithms. 2000;17(3-4):213--237.'
apa: 'Czumaj, A., & Scheideler, C. (2000). Coloring nonuniform hypergraphs:
A new algorithmic approach to the general Lovász local lemma. Random Struct.
Algorithms, 17(3–4), 213--237.'
bibtex: '@article{Czumaj_Scheideler_2000, title={Coloring nonuniform hypergraphs:
A new algorithmic approach to the general Lovász local lemma}, volume={17}, number={3–4},
journal={Random Struct. Algorithms}, author={Czumaj, Artur and Scheideler, Christian},
year={2000}, pages={213--237} }'
chicago: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct.
Algorithms 17, no. 3–4 (2000): 213--237.'
ieee: 'A. Czumaj and C. Scheideler, “Coloring nonuniform hypergraphs: A new algorithmic
approach to the general Lovász local lemma,” Random Struct. Algorithms,
vol. 17, no. 3–4, pp. 213--237, 2000.'
mla: 'Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs:
A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct.
Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.'
short: A. Czumaj, C. Scheideler, Random Struct. Algorithms 17 (2000) 213--237.
date_created: 2018-04-03T06:17:52Z
date_updated: 2022-01-06T06:55:00Z
department:
- _id: '79'
- _id: '63'
intvolume: ' 17'
issue: 3-4
language:
- iso: eng
page: 213--237
publication: Random Struct. Algorithms
status: public
title: 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general
Lovász local lemma'
type: journal_article
user_id: '14955'
volume: 17
year: '2000'
...
---
_id: '2149'
author:
- first_name: André
full_name: Brinkmann, André
last_name: Brinkmann
- first_name: Kay
full_name: Salzwedel, Kay
last_name: Salzwedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Brinkmann A, Salzwedel K, Scheideler C. Efficient, distributed data placement
strategies for storage area networks (extended abstract). In: SPAA. ; 2000:119--128.'
apa: Brinkmann, A., Salzwedel, K., & Scheideler, C. (2000). Efficient, distributed
data placement strategies for storage area networks (extended abstract). In SPAA
(pp. 119--128).
bibtex: '@inproceedings{Brinkmann_Salzwedel_Scheideler_2000, title={Efficient, distributed
data placement strategies for storage area networks (extended abstract)}, booktitle={SPAA},
author={Brinkmann, André and Salzwedel, Kay and Scheideler, Christian}, year={2000},
pages={119--128} }'
chicago: Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient,
Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).”
In SPAA, 119--128, 2000.
ieee: A. Brinkmann, K. Salzwedel, and C. Scheideler, “Efficient, distributed data
placement strategies for storage area networks (extended abstract),” in SPAA,
2000, pp. 119--128.
mla: Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies
for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.
short: 'A. Brinkmann, K. Salzwedel, C. Scheideler, in: SPAA, 2000, pp. 119--128.'
date_created: 2018-04-03T06:18:45Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:38:13Z
date_updated: 2018-04-12T08:38:13Z
file_id: '2297'
file_name: spaa_00.pdf
file_size: 222176
relation: main_file
file_date_updated: 2018-04-12T08:38:13Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 119--128
publication: SPAA
status: public
title: Efficient, distributed data placement strategies for storage area networks
(extended abstract)
type: conference
urn: '21493'
user_id: '14955'
year: '2000'
...
---
_id: '2150'
author:
- first_name: Artur
full_name: Czumaj, Artur
last_name: Czumaj
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local
lemma with applications to scheduling and satisfiability problems (extended abstract).
In: STOC. ACM; 2000:38--47.'
apa: Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general
Lovász local lemma with applications to scheduling and satisfiability problems
(extended abstract). In STOC (pp. 38--47). ACM.
bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={A new algorithm approach
to the general Lovász local lemma with applications to scheduling and satisfiability
problems (extended abstract)}, booktitle={STOC}, publisher={ACM}, author={Czumaj,
Artur and Scheideler, Christian}, year={2000}, pages={38--47} }'
chicago: Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the
General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.
ieee: A. Czumaj and C. Scheideler, “A new algorithm approach to the general Lovász
local lemma with applications to scheduling and satisfiability problems (extended
abstract),” in STOC, 2000, pp. 38--47.
mla: Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General
Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems
(Extended Abstract).” STOC, ACM, 2000, pp. 38--47.
short: 'A. Czumaj, C. Scheideler, in: STOC, ACM, 2000, pp. 38--47.'
date_created: 2018-04-03T06:21:11Z
date_updated: 2022-01-06T06:55:02Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:49:23Z
date_updated: 2018-04-12T08:49:23Z
file_id: '2300'
file_name: STOC-00.pdf
file_size: 190083
relation: main_file
file_date_updated: 2018-04-12T08:49:23Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 38--47
publication: STOC
publisher: ACM
status: public
title: A new algorithm approach to the general Lovász local lemma with applications
to scheduling and satisfiability problems (extended abstract)
type: conference
urn: '21509'
user_id: '14955'
year: '2000'
...