---
_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'
...
---
_id: '2211'
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 Algorithmic Approach to the General Lovász Local
Lemma with Applications to Scheduling and Satisfiability Problems . In: 32nd
ACM Symposium on Theory of Computing. ; 2000:38-47.'
apa: Czumaj, A., & Scheideler, C. (2000). A New Algorithmic Approach to the
General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).
bibtex: '@inproceedings{Czumaj_Scheideler_2000, title={A New Algorithmic Approach
to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems }, booktitle={32nd ACM Symposium on Theory of Computing}, author={Czumaj,
Artur and Scheideler, Christian}, year={2000}, pages={38–47} }'
chicago: Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to
the General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.
ieee: A. Czumaj and C. Scheideler, “A New Algorithmic Approach to the General Lovász
Local Lemma with Applications to Scheduling and Satisfiability Problems ,” in
32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
mla: Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the
General Lovász Local Lemma with Applications to Scheduling and Satisfiability
Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
short: 'A. Czumaj, C. Scheideler, in: 32nd ACM Symposium on Theory of Computing,
2000, pp. 38–47.'
date_created: 2018-04-05T07:02:46Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:37:23Z
date_updated: 2018-04-12T08:37:23Z
file_id: '2296'
file_name: STOC-00.pdf
file_size: 190083
relation: main_file
file_date_updated: 2018-04-12T08:37:23Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 38-47
publication: 32nd ACM Symposium on Theory of Computing
status: public
title: 'A New Algorithmic Approach to the General Lovász Local Lemma with Applications
to Scheduling and Satisfiability Problems '
type: conference
urn: '22111'
user_id: '14955'
year: '2000'
...
---
_id: '2151'
author:
- first_name: Michele
full_name: Flammini, Michele
last_name: Flammini
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: Flammini M, Scheideler C. Simple, Efficient Routing Schemes for All-Optical
Networks. Theory Comput Syst. 1999;32(3):387--420. doi:10.1007/s002240000123
apa: Flammini, M., & Scheideler, C. (1999). Simple, Efficient Routing Schemes
for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.
https://doi.org/10.1007/s002240000123
bibtex: '@article{Flammini_Scheideler_1999, title={Simple, Efficient Routing Schemes
for All-Optical Networks}, volume={32}, DOI={10.1007/s002240000123},
number={3}, journal={Theory Comput. Syst.}, author={Flammini, Michele and Scheideler,
Christian}, year={1999}, pages={387--420} }'
chicago: 'Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing
Schemes for All-Optical Networks.” Theory Comput. Syst. 32, no. 3 (1999):
387--420. https://doi.org/10.1007/s002240000123.'
ieee: M. Flammini and C. Scheideler, “Simple, Efficient Routing Schemes for All-Optical
Networks,” Theory Comput. Syst., vol. 32, no. 3, pp. 387--420, 1999.
mla: Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes
for All-Optical Networks.” Theory Comput. Syst., vol. 32, no. 3, 1999,
pp. 387--420, doi:10.1007/s002240000123.
short: M. Flammini, C. Scheideler, Theory Comput. Syst. 32 (1999) 387--420.
date_created: 2018-04-03T06:22:14Z
date_updated: 2022-01-06T06:55:02Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000123
intvolume: ' 32'
issue: '3'
language:
- iso: eng
page: 387--420
publication: Theory Comput. Syst.
status: public
title: Simple, Efficient Routing Schemes for All-Optical Networks
type: journal_article
user_id: '14955'
volume: 32
year: '1999'
...
---
_id: '2164'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Scheideler C. Locally Efficient On-Line Strategies for Routing
Packets Along Fixed Paths. In: SODA. ; 1999:112--121.'
apa: Berenbrink, P., & Scheideler, C. (1999). Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
bibtex: '@inproceedings{Berenbrink_Scheideler_1999, title={Locally Efficient On-Line
Strategies for Routing Packets Along Fixed Paths}, booktitle={SODA}, author={Berenbrink,
Petra and Scheideler, Christian}, year={1999}, pages={112--121} }'
chicago: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line
Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.
ieee: P. Berenbrink and C. Scheideler, “Locally Efficient On-Line Strategies for
Routing Packets Along Fixed Paths,” in SODA, 1999, pp. 112--121.
mla: Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies
for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.
short: 'P. Berenbrink, C. Scheideler, in: SODA, 1999, pp. 112--121.'
date_created: 2018-04-03T08:56:06Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:34:50Z
date_updated: 2018-04-12T07:34:50Z
file_id: '2288'
file_name: SODA-99.pdf
file_size: 179058
relation: main_file
file_date_updated: 2018-04-12T07:34:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 112--121
publication: SODA
status: public
title: Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths
type: conference
urn: '21649'
user_id: '14955'
year: '1999'
...
---
_id: '2165'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Marco
full_name: Riedel, Marco
last_name: Riedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Riedel M, Scheideler C. Simple Competitive Request Scheduling
Strategies. In: SPAA. ; 1999:33--42.'
apa: Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Simple Competitive
Request Scheduling Strategies. In SPAA (pp. 33--42).
bibtex: '@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Simple Competitive
Request Scheduling Strategies}, booktitle={SPAA}, author={Berenbrink, Petra and
Riedel, Marco and Scheideler, Christian}, year={1999}, pages={33--42} }'
chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive
Request Scheduling Strategies.” In SPAA, 33--42, 1999.
ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Simple Competitive Request Scheduling
Strategies,” in SPAA, 1999, pp. 33--42.
mla: Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.”
SPAA, 1999, pp. 33--42.
short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: SPAA, 1999, pp. 33--42.'
date_created: 2018-04-03T08:56:45Z
date_updated: 2022-01-06T06:55:09Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:36:27Z
date_updated: 2018-04-12T07:36:27Z
file_id: '2290'
file_name: SPAA-99.pdf
file_size: 144422
relation: main_file
file_date_updated: 2018-04-12T07:36:27Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 33--42
publication: SPAA
status: public
title: Simple Competitive Request Scheduling Strategies
type: conference
urn: '21658'
user_id: '14955'
year: '1999'
...
---
_id: '2210'
author:
- first_name: Petra
full_name: Berenbrink, Petra
last_name: Berenbrink
- first_name: Marco
full_name: Riedel, Marco
last_name: Riedel
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Berenbrink P, Riedel M, Scheideler C. Design of the PRESTO Multimedia Storage
Network (Extended Abstract). In: International Workshop on Communication and
Data Management in Large Networks (CDMLarge). ; 1999:2-12.'
apa: Berenbrink, P., Riedel, M., & Scheideler, C. (1999). Design of the PRESTO
Multimedia Storage Network (Extended Abstract). In International Workshop on
Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
bibtex: '@inproceedings{Berenbrink_Riedel_Scheideler_1999, title={Design of the
PRESTO Multimedia Storage Network (Extended Abstract)}, booktitle={International
Workshop on Communication and Data Management in Large Networks (CDMLarge)}, author={Berenbrink,
Petra and Riedel, Marco and Scheideler, Christian}, year={1999}, pages={2–12}
}'
chicago: Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the
PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop
on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.
ieee: P. Berenbrink, M. Riedel, and C. Scheideler, “Design of the PRESTO Multimedia
Storage Network (Extended Abstract),” in International Workshop on Communication
and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
mla: Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network
(Extended Abstract).” International Workshop on Communication and Data Management
in Large Networks (CDMLarge), 1999, pp. 2–12.
short: 'P. Berenbrink, M. Riedel, C. Scheideler, in: International Workshop on Communication
and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.'
date_created: 2018-04-05T07:00:11Z
date_updated: 2022-01-06T06:55:26Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T08:34:00Z
date_updated: 2018-04-12T08:34:00Z
file_id: '2294'
file_name: CDMLarge-99.pdf
file_size: 211926
relation: main_file
file_date_updated: 2018-04-12T08:34:00Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 2-12
publication: International Workshop on Communication and Data Management in Large
Networks (CDMLarge)
status: public
title: Design of the PRESTO Multimedia Storage Network (Extended Abstract)
type: conference
urn: '22109'
user_id: '14955'
year: '1999'
...
---
_id: '2166'
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. In: STOC. ; 1999:215--224.'
apa: 'Scheideler, C., & Vöcking, B. (1999). From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols. In STOC (pp.
215--224).'
bibtex: '@inproceedings{Scheideler_Vöcking_1999, title={From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols}, booktitle={STOC}, author={Scheideler,
Christian and Vöcking, Berthold}, year={1999}, pages={215--224} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224,
1999.'
ieee: 'C. Scheideler and B. Vöcking, “From Static to Dynamic Routing: Efficient
Transformations of Store-and-Forward Protocols,” in STOC, 1999, pp. 215--224.'
mla: 'Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing:
Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999,
pp. 215--224.'
short: 'C. Scheideler, B. Vöcking, in: STOC, 1999, pp. 215--224.'
date_created: 2018-04-03T08:57:30Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:35:46Z
date_updated: 2018-04-12T07:35:46Z
file_id: '2289'
file_name: STOC-99.pdf
file_size: 227305
relation: main_file
file_date_updated: 2018-04-12T07:35:46Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 215--224
publication: STOC
status: public
title: 'From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward
Protocols'
type: conference
urn: '21668'
user_id: '14955'
year: '1999'
...
---
_id: '2168'
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. Universal Continuous Routing Strategies. Theory
Comput Syst. 1998;31(4):425--449. doi:10.1007/s002240000096
apa: Scheideler, C., & Vöcking, B. (1998). Universal Continuous Routing Strategies.
Theory Comput. Syst., 31(4), 425--449. https://doi.org/10.1007/s002240000096
bibtex: '@article{Scheideler_Vöcking_1998, title={Universal Continuous Routing Strategies},
volume={31}, DOI={10.1007/s002240000096},
number={4}, journal={Theory Comput. Syst.}, author={Scheideler, Christian and
Vöcking, Berthold}, year={1998}, pages={425--449} }'
chicago: 'Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst. 31, no. 4 (1998): 425--449. https://doi.org/10.1007/s002240000096.'
ieee: C. Scheideler and B. Vöcking, “Universal Continuous Routing Strategies,” Theory
Comput. Syst., vol. 31, no. 4, pp. 425--449, 1998.
mla: Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing
Strategies.” Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449,
doi:10.1007/s002240000096.
short: C. Scheideler, B. Vöcking, Theory Comput. Syst. 31 (1998) 425--449.
date_created: 2018-04-03T08:59:06Z
date_updated: 2022-01-06T06:55:10Z
department:
- _id: '79'
- _id: '63'
doi: 10.1007/s002240000096
intvolume: ' 31'
issue: '4'
language:
- iso: eng
page: 425--449
publication: Theory Comput. Syst.
status: public
title: Universal Continuous Routing Strategies
type: journal_article
user_id: '14955'
volume: 31
year: '1998'
...
---
_id: '2169'
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 (Extended Abstract). In: SPAA. ; 1998:259--268.'
apa: Adler, M., & Scheideler, C. (1998). Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).
bibtex: '@inproceedings{Adler_Scheideler_1998, title={Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract)}, booktitle={SPAA}, author={Adler,
Micah and Scheideler, Christian}, year={1998}, pages={259--268} }'
chicago: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.
ieee: M. Adler and C. Scheideler, “Efficient Communication Strategies for Ad-Hoc
Wireless Networks (Extended Abstract),” in SPAA, 1998, pp. 259--268.
mla: Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies
for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.
short: 'M. Adler, C. Scheideler, in: SPAA, 1998, pp. 259--268.'
date_created: 2018-04-03T08:59:55Z
date_updated: 2022-01-06T06:55:10Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:08:12Z
date_updated: 2018-04-12T07:08:12Z
file_id: '2285'
file_name: SPAA98.pdf
file_size: 492778
relation: main_file
file_date_updated: 2018-04-12T07:08:12Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 259--268
publication: SPAA
status: public
title: Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract)
type: conference
urn: '21699'
user_id: '14955'
year: '1998'
...
---
_id: '2170'
author:
- first_name: Uriel
full_name: Feige, Uriel
last_name: Feige
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Feige U, Scheideler C. Improved Bounds for Acyclic Job Shop Scheduling (Extended
Abstract). In: STOC. ; 1998:624--633.'
apa: Feige, U., & Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract). In STOC (pp. 624--633).
bibtex: '@inproceedings{Feige_Scheideler_1998, title={Improved Bounds for Acyclic
Job Shop Scheduling (Extended Abstract)}, booktitle={STOC}, author={Feige, Uriel
and Scheideler, Christian}, year={1998}, pages={624--633} }'
chicago: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job
Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.
ieee: U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling
(Extended Abstract),” in STOC, 1998, pp. 624--633.
mla: Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop
Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.
short: 'U. Feige, C. Scheideler, in: STOC, 1998, pp. 624--633.'
date_created: 2018-04-03T09:00:31Z
date_updated: 2022-01-06T06:55:11Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
file:
- access_level: open_access
content_type: application/pdf
creator: florida
date_created: 2018-04-12T07:15:50Z
date_updated: 2018-04-12T07:15:50Z
file_id: '2286'
file_name: STOC98.pdf
file_size: 228487
relation: main_file
file_date_updated: 2018-04-12T07:15:50Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
page: 624--633
publication: STOC
status: public
title: Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract)
type: conference
urn: '21705'
user_id: '14955'
year: '1998'
...