×
Author ID: reischuk.rudiger Recent zbMATH articles by "Reischuk, Rüdiger"
Published as: Reischuk, Rüdiger; Reischuk, Ruediger; Reischuk, R.; Reischuk, Karl Rüdiger; Reischuk, K. Ruediger; Reischuk, Ruediger K.; Reischuk, K. Rüdiger
Homepage: https://www.tcs.uni-luebeck.de/mitarbeiter/reischuk/
External Links: MGP · dblp · GND

Publications by Year

Citations contained in zbMATH Open

61 Publications have been cited 478 times in 422 Documents Cited by Year
Upper and lower time bounds for parallel random access machines without simultaneous writes. Zbl 0591.68049
Cook, Stephen; Dwork, Cynthia; Reischuk, Rüdiger
87
1986
Renaming in an asynchronous environment. Zbl 0699.68034
Attiya, Hagit; Bar-Noy, Amotz; Dolev, Danny; Peleg, David; Reischuk, Rüdiger
63
1990
Early stopping in Byzantine Agreement. Zbl 0711.68008
Dolev, Danny; Reischuk, Ruediger; Strong, H. Raymond
44
1990
Bounds on information exchange for byzantine agreement. Zbl 0629.68026
Dolev, Danny; Reischuk, Rüdiger
35
1985
On alternation. Zbl 0437.68025
Paul, Wolfgang J.; Prauß, Ernst J.; Reischuk, Rüdiger
22
1980
Probabilistic parallel algorithms for sorting and selection. Zbl 0578.68040
Reischuk, Rüdiger
18
1985
The sublogarithmic alternating space world. Zbl 0857.68039
Liśkiewicz, Maciej; Reischuk, Rüdiger
15
1996
Exact lower time bounds for computing Boolean functions on CREW PRAMs. Zbl 0822.68049
Dietzfelbinger, Martin; Kutyłowski, Mirosław; Reischuk, Rüdiger
14
1994
On alternation. II. A graph theoretic approach to determinism versus nondeterminism. Zbl 0447.68043
Paul, Wolfgang; Reischuk, Rüdiger
13
1980
Relations between communication complexity classes. Zbl 0715.68029
Halstenberg, Bernd; Reischuk, Rüdiger
10
1990
An average-case optimal one-variable pattern language learner. Zbl 0955.68098
Reischuk, Rüdiger; Zeugmann, Thomas
10
2000
Smoothed analysis of binary search trees. Zbl 1120.68043
Manthey, Bodo; Reischuk, Rüdiger
9
2007
A new solution for the Byzantine generals problem. Zbl 0575.68025
Reischuk, Rüdiger
8
1985
On time versus space. II. Zbl 0462.68029
Paul, W.; Reischuk, R.
7
1981
Space efficient algorithms for directed series-parallel graphs. Zbl 1100.68080
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
7
2006
Private computations in networks: Topology versus randomness. Zbl 1035.68502
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
7
2003
Different modes of communication. Zbl 0782.68065
Halstenberg, Bernd; Reischuk, Rüdiger
7
1993
Separating the lower levels of the sublogarithmic space hierarchy. Zbl 0799.68092
Liśkiewicz, Maciej; Reischuk, Rüdiger
7
1993
Einführung in die Komplexitätstheorie. (Introduction to complexity theory). Zbl 0705.68053
Reischuk, Karl Rüdiger
6
1990
Knowledge state algorithms. Zbl 1223.68124
Bein, Wolfgang; Larmore, Lawrence L.; Noga, John; Reischuk, Rüdiger
5
2011
The complexity of broadcasting in planar and decomposable graphs. Zbl 0901.68086
Jakoby, Andreas; Reischuk, Rüdiger; Schindelhauer, Christian
5
1998
Circuit complexity: from the worst case to the average case. Zbl 1345.68160
Jakoby, Andreas; Reischuk, Rüdiger; Schindelhauer, Christian
5
1994
A ”Fast implementation” of a multidimensional storage into a tree storage. Zbl 0443.68035
Reischuk, Rüdiger
4
1980
Grey-box steganography. Zbl 1302.94054
Liśkiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich
4
2013
The intractability of computing the Hamming distance. Zbl 1078.68044
Manthey, Bodo; Reischuk, Rüdiger
4
2005
Two nonlinear lower bounds for on-line computations. Zbl 0589.68039
Ďuriš, Pavol; Galil, Zvi; Paul, Wolfgang; Reischuk, Ruediger
4
1984
Precise average case complexity. Zbl 0799.68093
Reischuk, Rüdiger; Schindelhauer, Christian
4
1993
The complexity of scheduling problems with communication delays for trees. Zbl 1502.68048
Jakoby, Andreas; Reischuk, Rüdiger
4
1992
Learning juntas in the presence of noise. Zbl 1158.68400
Arpe, Jan; Reischuk, Rüdiger
3
2006
A fast implementation of a multidimensional storage into a tree storage. Zbl 0489.68043
Reischuk, K. Ruediger
3
1982
Learning juntas in the presence of noise. Zbl 1124.68051
Arpe, Jan; Reischuk, Rüdiger
3
2007
Computing with sublogarithmic space. Zbl 0880.68043
Liśkiewicz, Maciej; Reischuk, Rüdiger
3
1997
Learning one-variable pattern languages in linear average time. Zbl 0952.68086
Reischuk, Rüdiger; Zeugmann, Thomas
3
1998
Smoothed analysis of binary search trees. Zbl 1173.68457
Manthey, Bodo; Reischuk, Rüdiger
2
2005
Knowledge states for the caching problem in shared memory multiprocessor systems. Zbl 1170.68346
Bein, Wolfgang; Larmore, Lawrence L.; Reischuk, Rüdiger
2
2009
The average case complexity of the parallel prefix problem. Zbl 1422.68117
Jakoby, Andreas; Schindelhauer, Christian; Reischuk, Rüdiger; Weis, Stephan
2
1994
On alternation. I. Zbl 0545.68039
Paul, Wolfgang J.; Prauss, Ernst J.; Reischuk, Ruediger
2
1983
Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random-access machines. Zbl 0864.68037
Dietzfelbinger, Martin; Kutyłowski, Mirosław; Reischuk, Rüdiger
2
1996
STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Zbl 0885.68009
2
1997
Robust inference of relevant attributes. Zbl 1263.68125
Arpe, Jan; Reischuk, Rüdiger
2
2003
When does greedy learning of relevant attributes succeed? A Fourier-based characterization. Zbl 1206.68156
Arpe, Jan; Reischuk, Rüdiger
1
2007
Grey-box steganography. Zbl 1260.94045
Liśkiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich
1
2011
Improved bounds on the problem of time-space trade-off in the pebble game. Zbl 0468.05030
Reischuk, Rüdiger
1
1980
Learning a subclass of regular patterns in polynomial time. Zbl 1153.68021
Case, John; Jain, Sanjay; Reischuk, Rüdiger; Stephan, Frank; Zeugmann, Thomas
1
2006
Improved bounds on the problem of time-space trade-off in the pebble game. Zbl 0468.68068
Reischuk, Rüdiger
1
1980
Pocket bock of algorithms. (Taschenbuch der Algorithmen.) Zbl 1138.68669
1
2008
On alternation. II. A graph theoretic approach to determinism versus nondeterminism. Zbl 0545.68040
Paul, Wolfgang; Reischuk, Ruediger
1
1983
The intractability of computing the Hamming distance. Zbl 1205.68173
Manthey, Bodo; Reischuk, Rüdiger
1
2003
Lower bounds for synchronous networks and the advantage of local information. Zbl 0644.68064
Reischuk, Rüdiger; Koshors, Meinolf
1
1988
Space efficient algorithms for series-parallel graphs. Zbl 0981.68712
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
1
2001
The expressive power and complexity of dynamic process graphs. Zbl 0988.68130
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
1
2000
The complexity of physical mapping with strict chimerism. Zbl 0994.68072
Weis, Stephan; Reischuk, Rüdiger
1
2000
An average complexity measure that yields tight hierarchies. Zbl 0868.68059
Reischuk, R.; Schindelhauer, C.
1
1997
Parallel machines and their communication theoretical limits. Zbl 0585.68038
Reischuk, K. Rüdiger
1
1986
Algorithms unplugged. Zbl 1206.68024
1
2011
Observable clock synchronization (extended abstract). Zbl 1374.68068
Dolev, Danny; Reischuk, Rüdiger; Strong, Ray
1
1994
Malign distributions for average case circuit complexity. Zbl 1379.68143
Jakoby, Andreas; Reischuk, Rüdiger; Schindelhauer, Christian
1
1995
Security levels in steganography – insecurity does not imply detectability. Zbl 1372.68089
Liśkiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich
1
2017
Algorithmic learning for steganography: proper learning of \(k\)-term DNF formulas from positive samples. Zbl 1472.68072
Ernst, Matthias; Liśkiewicz, Maciej; Reischuk, Rüdiger
1
2015
Area efficient methods to increase the reliability of combinatorial circuits. Zbl 1492.68049
Reischuk, Rüdiger; Schmeltz, Bernd
1
1989
Dynamic kernels for hitting sets and set packing. Zbl 07608296
Bannach, Max; Heinrich, Zacharias; Reischuk, Rüdiger; Tantau, Till
1
2022
Dynamic kernels for hitting sets and set packing. Zbl 07608296
Bannach, Max; Heinrich, Zacharias; Reischuk, Rüdiger; Tantau, Till
1
2022
Security levels in steganography – insecurity does not imply detectability. Zbl 1372.68089
Liśkiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich
1
2017
Algorithmic learning for steganography: proper learning of \(k\)-term DNF formulas from positive samples. Zbl 1472.68072
Ernst, Matthias; Liśkiewicz, Maciej; Reischuk, Rüdiger
1
2015
Grey-box steganography. Zbl 1302.94054
Liśkiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich
4
2013
Knowledge state algorithms. Zbl 1223.68124
Bein, Wolfgang; Larmore, Lawrence L.; Noga, John; Reischuk, Rüdiger
5
2011
Grey-box steganography. Zbl 1260.94045
Liśkiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich
1
2011
Algorithms unplugged. Zbl 1206.68024
1
2011
Knowledge states for the caching problem in shared memory multiprocessor systems. Zbl 1170.68346
Bein, Wolfgang; Larmore, Lawrence L.; Reischuk, Rüdiger
2
2009
Pocket bock of algorithms. (Taschenbuch der Algorithmen.) Zbl 1138.68669
1
2008
Smoothed analysis of binary search trees. Zbl 1120.68043
Manthey, Bodo; Reischuk, Rüdiger
9
2007
Learning juntas in the presence of noise. Zbl 1124.68051
Arpe, Jan; Reischuk, Rüdiger
3
2007
When does greedy learning of relevant attributes succeed? A Fourier-based characterization. Zbl 1206.68156
Arpe, Jan; Reischuk, Rüdiger
1
2007
Space efficient algorithms for directed series-parallel graphs. Zbl 1100.68080
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
7
2006
Learning juntas in the presence of noise. Zbl 1158.68400
Arpe, Jan; Reischuk, Rüdiger
3
2006
Learning a subclass of regular patterns in polynomial time. Zbl 1153.68021
Case, John; Jain, Sanjay; Reischuk, Rüdiger; Stephan, Frank; Zeugmann, Thomas
1
2006
The intractability of computing the Hamming distance. Zbl 1078.68044
Manthey, Bodo; Reischuk, Rüdiger
4
2005
Smoothed analysis of binary search trees. Zbl 1173.68457
Manthey, Bodo; Reischuk, Rüdiger
2
2005
Private computations in networks: Topology versus randomness. Zbl 1035.68502
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
7
2003
Robust inference of relevant attributes. Zbl 1263.68125
Arpe, Jan; Reischuk, Rüdiger
2
2003
The intractability of computing the Hamming distance. Zbl 1205.68173
Manthey, Bodo; Reischuk, Rüdiger
1
2003
Space efficient algorithms for series-parallel graphs. Zbl 0981.68712
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
1
2001
An average-case optimal one-variable pattern language learner. Zbl 0955.68098
Reischuk, Rüdiger; Zeugmann, Thomas
10
2000
The expressive power and complexity of dynamic process graphs. Zbl 0988.68130
Jakoby, Andreas; Liśkiewicz, Maciej; Reischuk, Rüdiger
1
2000
The complexity of physical mapping with strict chimerism. Zbl 0994.68072
Weis, Stephan; Reischuk, Rüdiger
1
2000
The complexity of broadcasting in planar and decomposable graphs. Zbl 0901.68086
Jakoby, Andreas; Reischuk, Rüdiger; Schindelhauer, Christian
5
1998
Learning one-variable pattern languages in linear average time. Zbl 0952.68086
Reischuk, Rüdiger; Zeugmann, Thomas
3
1998
Computing with sublogarithmic space. Zbl 0880.68043
Liśkiewicz, Maciej; Reischuk, Rüdiger
3
1997
STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Zbl 0885.68009
2
1997
An average complexity measure that yields tight hierarchies. Zbl 0868.68059
Reischuk, R.; Schindelhauer, C.
1
1997
The sublogarithmic alternating space world. Zbl 0857.68039
Liśkiewicz, Maciej; Reischuk, Rüdiger
15
1996
Feasible time-optimal algorithms for Boolean functions on exclusive-write parallel random-access machines. Zbl 0864.68037
Dietzfelbinger, Martin; Kutyłowski, Mirosław; Reischuk, Rüdiger
2
1996
Malign distributions for average case circuit complexity. Zbl 1379.68143
Jakoby, Andreas; Reischuk, Rüdiger; Schindelhauer, Christian
1
1995
Exact lower time bounds for computing Boolean functions on CREW PRAMs. Zbl 0822.68049
Dietzfelbinger, Martin; Kutyłowski, Mirosław; Reischuk, Rüdiger
14
1994
Circuit complexity: from the worst case to the average case. Zbl 1345.68160
Jakoby, Andreas; Reischuk, Rüdiger; Schindelhauer, Christian
5
1994
The average case complexity of the parallel prefix problem. Zbl 1422.68117
Jakoby, Andreas; Schindelhauer, Christian; Reischuk, Rüdiger; Weis, Stephan
2
1994
Observable clock synchronization (extended abstract). Zbl 1374.68068
Dolev, Danny; Reischuk, Rüdiger; Strong, Ray
1
1994
Different modes of communication. Zbl 0782.68065
Halstenberg, Bernd; Reischuk, Rüdiger
7
1993
Separating the lower levels of the sublogarithmic space hierarchy. Zbl 0799.68092
Liśkiewicz, Maciej; Reischuk, Rüdiger
7
1993
Precise average case complexity. Zbl 0799.68093
Reischuk, Rüdiger; Schindelhauer, Christian
4
1993
The complexity of scheduling problems with communication delays for trees. Zbl 1502.68048
Jakoby, Andreas; Reischuk, Rüdiger
4
1992
Renaming in an asynchronous environment. Zbl 0699.68034
Attiya, Hagit; Bar-Noy, Amotz; Dolev, Danny; Peleg, David; Reischuk, Rüdiger
63
1990
Early stopping in Byzantine Agreement. Zbl 0711.68008
Dolev, Danny; Reischuk, Ruediger; Strong, H. Raymond
44
1990
Relations between communication complexity classes. Zbl 0715.68029
Halstenberg, Bernd; Reischuk, Rüdiger
10
1990
Einführung in die Komplexitätstheorie. (Introduction to complexity theory). Zbl 0705.68053
Reischuk, Karl Rüdiger
6
1990
Area efficient methods to increase the reliability of combinatorial circuits. Zbl 1492.68049
Reischuk, Rüdiger; Schmeltz, Bernd
1
1989
Lower bounds for synchronous networks and the advantage of local information. Zbl 0644.68064
Reischuk, Rüdiger; Koshors, Meinolf
1
1988
Upper and lower time bounds for parallel random access machines without simultaneous writes. Zbl 0591.68049
Cook, Stephen; Dwork, Cynthia; Reischuk, Rüdiger
87
1986
Parallel machines and their communication theoretical limits. Zbl 0585.68038
Reischuk, K. Rüdiger
1
1986
Bounds on information exchange for byzantine agreement. Zbl 0629.68026
Dolev, Danny; Reischuk, Rüdiger
35
1985
Probabilistic parallel algorithms for sorting and selection. Zbl 0578.68040
Reischuk, Rüdiger
18
1985
A new solution for the Byzantine generals problem. Zbl 0575.68025
Reischuk, Rüdiger
8
1985
Two nonlinear lower bounds for on-line computations. Zbl 0589.68039
Ďuriš, Pavol; Galil, Zvi; Paul, Wolfgang; Reischuk, Ruediger
4
1984
On alternation. I. Zbl 0545.68039
Paul, Wolfgang J.; Prauss, Ernst J.; Reischuk, Ruediger
2
1983
On alternation. II. A graph theoretic approach to determinism versus nondeterminism. Zbl 0545.68040
Paul, Wolfgang; Reischuk, Ruediger
1
1983
A fast implementation of a multidimensional storage into a tree storage. Zbl 0489.68043
Reischuk, K. Ruediger
3
1982
On time versus space. II. Zbl 0462.68029
Paul, W.; Reischuk, R.
7
1981
On alternation. Zbl 0437.68025
Paul, Wolfgang J.; Prauß, Ernst J.; Reischuk, Rüdiger
22
1980
On alternation. II. A graph theoretic approach to determinism versus nondeterminism. Zbl 0447.68043
Paul, Wolfgang; Reischuk, Rüdiger
13
1980
A ”Fast implementation” of a multidimensional storage into a tree storage. Zbl 0443.68035
Reischuk, Rüdiger
4
1980
Improved bounds on the problem of time-space trade-off in the pebble game. Zbl 0468.05030
Reischuk, Rüdiger
1
1980
Improved bounds on the problem of time-space trade-off in the pebble game. Zbl 0468.68068
Reischuk, Rüdiger
1
1980
all top 5

Cited by 621 Authors

24 Rajsbaum, Sergio
16 Raynal, Michel
16 Reischuk, Rüdiger
14 Inoue, Katsushi
13 Gafni, Eli M.
11 Geffert, Viliam
11 Herlihy, Maurice P.
10 Castañeda, Armando
10 Jakoby, Andreas
9 Liśkiewicz, Maciej
9 Travers, Corentin
8 Takanami, Itsuo
7 Guerraoui, Rachid
7 Ito, Akira
6 Dolev, Danny
6 Fauconnier, Hugues
6 Hromkovič, Juraj
6 Loui, Michael C.
6 Schindelhauer, Christian
5 Chen, Lin
5 Cohen, Ran
5 Delporte-Gallet, Carole
5 Fich, Faith Ellen
5 Garay, Juan A.
5 Hagerup, Torben
5 Kutyłowski, Mirosław
5 Li, Yuan
5 Loryś, Krzysztof
5 Manthey, Bodo
5 Mostefaoui, Achour
5 Ragde, Prabhakar L.
5 Schnitger, Georg
5 Taubenfeld, Gadi
4 Afek, Yehuda
4 Case, John
4 Coan, Brian A.
4 Gilbert, Seth
4 Lipton, Richard Jay
4 Matias, Yossi
4 Moran, Shlomo
4 Moses, Yoram
4 Okun, Michael S.
4 Olariu, Stephan
4 Patra, Arpita
4 Potop-Butucaru, Maria Gradinariu
4 Ramachandran, Vijaya
4 Reidenbach, Daniel
4 Salomaa, Kai T.
4 Wang, Yue
3 Abraham, Ittai
3 Adeyeye, John Ola-Oluwa
3 Alistarh, Dan
3 Allender, Eric W.
3 Attiya, Hagit
3 Bar-Noy, Amotz
3 Beame, Paul W.
3 Bein, Wolfgang W.
3 Bonomi, Silvia
3 Charron-Bost, Bernadette
3 Chlebus, Bogdan Stanislaw
3 Coretti, Sandro
3 Damm, Carsten
3 Del Pozzo, Antonella
3 Dietzfelbinger, Martin
3 Dinesh, Krishnamoorthy
3 Fraigniaud, Pierre
3 Han, Yijie
3 Han, Yo-Sub
3 Ko, Sang-Ki
3 Kuznetsov, Petr
3 Larmore, Lawrence L.
3 Laubenbacher, Reinhard C.
3 Moruz, Gabriel
3 Negoescu, Andrei
3 Neiger, Gil
3 Ng, Timothy
3 Sarma M. N., Jayalal
3 Shi, Elaine
3 Sibeyn, Jop F.
3 Simon, Janos
3 Taniguchi, Hiroshi
3 Vaidyanathan, Ramachandran
3 Wegener, Ingo
3 Welch, Jennifer Lundelius
3 Williams, Richard Ryan
3 Zeugmann, Thomas
3 Zikas, Vassilis
2 Akutsu, Tatsuya
2 Alwen, Joël
2 Ambainis, Andris
2 Applebaum, Benny
2 Asharov, Gilad
2 Barak, Amnon B.
2 Belanger, Jay
2 Berman, Piotr
2 Berndt, Sebastian
2 Bhagavathi, D.
2 Biely, Martin
2 Bokka, V.
2 Buhrman, Harry
...and 521 more Authors
all top 5

Cited in 51 Serials

100 Theoretical Computer Science
36 Distributed Computing
31 Information and Computation
28 Information Processing Letters
25 Journal of Computer and System Sciences
13 Algorithmica
12 Theory of Computing Systems
11 Discrete Applied Mathematics
10 Mathematical Systems Theory
7 Computational Complexity
5 Acta Informatica
5 SIAM Journal on Computing
5 International Journal of Foundations of Computer Science
4 Journal of Cryptology
2 Computers & Mathematics with Applications
2 Information Sciences
2 Journal of Parallel and Distributed Computing
2 International Journal of Computer Mathematics
2 RAIRO. Informatique Théorique et Applications
2 Parallel Algorithms and Applications
2 Journal of the ACM
2 Journal of Discrete Algorithms
1 International Journal of General Systems
1 Israel Journal of Mathematics
1 Computing
1 Networks
1 SIAM Journal on Numerical Analysis
1 Synthese
1 Advances in Applied Mathematics
1 Combinatorica
1 Physica D
1 Random Structures & Algorithms
1 Computational Geometry
1 Mathematical Structures in Computer Science
1 Computational Statistics
1 Linear Algebra and its Applications
1 Bulletin of the American Mathematical Society. New Series
1 Mathematical Programming. Series A. Series B
1 Combinatorics, Probability and Computing
1 The Bulletin of Symbolic Logic
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Miscelánea Matemática
1 Entropy
1 Natural Computing
1 Quantum Information Processing
1 ACM Journal of Experimental Algorithmics
1 Frontiers of Mathematics in China
1 Journal of Mathematical Cryptology
1 Discrete Mathematics, Algorithms and Applications
1 Journal of Theoretical Biology
1 Computer Science Review

Citations by Year