default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRüdiger Reischuk
K. Rüdiger Reischuk
Person information
- affiliation: University of Lübeck, Institute for Theoretical Computer Science
SPARQL queries 
🛈 Please note that only 71% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[e35]Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Maike Buchin, Anna Förster, Felix C. Freiling, Jan Mendling, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Ingo Scholtes, Nicole Schweikardt, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2023. LNI D-24, GI 2024 [contents]- 2023
- [e34]Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2022. LNI D-23, GI 2023 [contents] - 2022
- [j44]Max Bannach, Zacharias Heinrich
, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. Algorithmica 84(11): 3459-3488 (2022) - [j43]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning residual alternating automata. Inf. Comput. 289(Part): 104981 (2022) - [j42]Rüdiger Reischuk:
The kangaroo problem. Theor. Comput. Sci. 898: 50-58 (2022) - [e33]Steffen Hölldobler, Rüdiger Reischuk, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2021. LNI D-22, GI 2022, ISBN 978-3-88579-980-1 [contents] - 2021
- [j41]Florian Thaeter, Rüdiger Reischuk:
Hardness of k-anonymous microaggregation. Discret. Appl. Math. 303: 149-158 (2021) - [c62]Florian Thaeter, Rüdiger Reischuk:
Improving Time Complexity and Utility of k-anonymous Microaggregation. ICETE (Selected Papers) 2021: 195-223 - [c61]Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. IPEC 2021: 7:1-7:18 - [c60]Florian Thaeter, Rüdiger Reischuk:
Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss. SECRYPT 2021: 87-98 - [e32]Steffen Hölldobler, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Rüdiger Reischuk, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2020. LNI D-21, GI 2021, ISBN 978-3-88579-775-3 [contents] - 2020
- [e31]Steffen Hölldobler, Sven Apel, Abraham Bernstein, Felix C. Freiling, Hans-Peter Lenhof, Gustaf Neumann, Rüdiger Reischuk, Kay Uwe Römer, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2019. LNI D-20, GI 2020, ISBN 978-3-88579-775-3 [contents]
2010 – 2019
- 2019
- [j40]Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Proper learning of k-term DNF formulas from satisfying assignments. J. Comput. Syst. Sci. 106: 129-144 (2019) - [e30]Sven Apel, Abraham Bernstein, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Björn Scheuermann, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk, Klaus Wehrle:
Ausgezeichnete Informatikdissertationen 2018. LNI D-19, GI 2019, ISBN 978-3-88579-977-1 [contents] - [i21]Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c59]Florian Thaeter, Rüdiger Reischuk:
Improving Anonymization Clustering. Sicherheit 2018: 69-82 - [e29]Sven Apel, Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Björn Scheuermann, Myra Spiliopoulou, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2017. LNI D-18, GI 2018, ISBN 978-3-88579-977-1 [contents] - 2017
- [j39]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Security levels in steganography - Insecurity does not imply detectability. Theor. Comput. Sci. 692: 25-45 (2017) - [c58]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning Residual Alternating Automata. AAAI 2017: 1749-1755 - [e28]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2016. LNI D-17, GI 2017, ISBN 978-3-88579-976-4 [contents] - [i20]Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Learning Residual Alternating Automata. Electron. Colloquium Comput. Complex. TR17 (2017) - [i19]Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
Proper Learning of k-term DNF Formulas from Satisfying Assignments. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c57]Sebastian Berndt, Rüdiger Reischuk:
Steganography Based on Pattern Languages. LATA 2016: 387-399 - [e27]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2015. LNI D-16, GI 2016, ISBN 978-3-88579-975-7 [contents] - 2015
- [c56]Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk:
Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples. ISAAC 2015: 151-162 - [e26]Abraham Bernstein, Wolfgang Effelsberg, Felix C. Freiling, Steffen Hölldobler, Hans-Peter Lenhof, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2014. LNI D-15, GI 2015, ISBN 978-3-88579-419-6 [contents] - [i18]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Security Levels in Steganography - Insecurity does not Imply Detectability. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [e25]Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2013. LNI D-14, GI 2014, ISBN 978-3-88579-418-9 [contents] - [i17]Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports 4(3): 62-84 (2014) - 2013
- [j38]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Grey-box steganography. Theor. Comput. Sci. 505: 27-41 (2013) - [e24]Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk:
Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Lecture Notes in Computer Science 8165, Springer 2013, ISBN 978-3-642-45042-6 [contents] - 2012
- [e23]Abraham Bernstein, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2011. LNI D-12, GI 2012, ISBN 978-3-88579-416-5 [contents] - [e22]Abraham Bernstein, Wolfgang Effelsberg, Steffen Hölldobler, Hans-Peter Lenhof, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Nicole Schweikardt, Myra Spiliopoulou, Harald Störrle, Sabine Süsstrunk:
Ausgezeichnete Informatikdissertationen 2012. LNI D-13, GI 2012, ISBN 978-3-88579-417-2 [contents] - 2011
- [j37]Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk:
Knowledge State Algorithms. Algorithmica 60(3): 653-678 (2011) - [c55]Rüdiger Reischuk, Johannes Textor:
Stochastic Search with Locally Clustered Targets: Learning from T Cells. ICARIS 2011: 146-159 - [c54]Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
Grey-Box Steganography. TAMC 2011: 390-402 - [p3]Rüdiger Reischuk, Markus Hinkelmann:
One-Way Functions - Mind the Trap - Escape Only for the Initiated. Algorithms Unplugged 2011: 131-139 - [e21]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Algorithms Unplugged. Springer 2011, ISBN 978-3-642-15327-3 [contents] - [e20]Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2010. LNI D-11, GI 2011, ISBN 978-3-88579-415-8 [contents] - [i16]Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports 1(3): 42-66 (2011) - 2010
- [e19]Abraham Bernstein, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2009. LNI D-10, GI 2010, ISBN 978-3-88579-414-1 [contents] - [e18]Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2008. LNI D-9, GI 2010, ISBN 978-3-88579-413-4 [contents]
2000 – 2009
- 2009
- [j36]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. Int. J. Found. Comput. Sci. 20(1): 167-183 (2009) - [j35]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
Improving the average delay of sorting. Theor. Comput. Sci. 410(11): 1030-1041 (2009) - [e17]Stefan Fischer, Erik Maehle, Rüdiger Reischuk:
39. Jahrestagung der Gesellschaft für Informatik, Im Focus das Leben, INFORMATIK 2009, Lübeck, Germany, September 28 - October 2, 2009, Proceedings. LNI P-154, GI 2009, ISBN 978-3-88579-248-2 [contents] - 2008
- [c53]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States: A Tool for Randomized Online Algorithms. HICSS 2008: 476 - [p2]Rüdiger Reischuk, Markus Hinkelmann:
Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!. Taschenbuch der Algorithmen 2008: 139-148 - [e16]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
Computational Complexity of Discrete Problems, 14.09. - 19.09.2008. Dagstuhl Seminar Proceedings 08381, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [e15]Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Harald Störrle, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2007. LNI D-8, GI 2008, ISBN 978-3-88579-412-7 [contents] - [e14]Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner:
Taschenbuch der Algorithmen. eXamen.press, Springer 2008, ISBN 978-3-540-76393-2 [contents] - [i15]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Abstracts Collection - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems 2008 - [i14]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Executive Summary - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems 2008 - 2007
- [j34]Maciej Liskiewicz, Rüdiger Reischuk:
Preface. Theory Comput. Syst. 41(2): 209-210 (2007) - [j33]Bodo Manthey, Rüdiger Reischuk:
Smoothed analysis of binary search trees. Theor. Comput. Sci. 378(3): 292-315 (2007) - [j32]Jan Arpe, Rüdiger Reischuk:
Learning juntas in the presence of noise. Theor. Comput. Sci. 384(1): 2-21 (2007) - [c52]Jan Arpe, Rüdiger Reischuk:
When Does Greedy Learning of Relevant Attributes Succeed? COCOON 2007: 296-306 - [c51]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
Improving the Average Delay of Sorting. TAMC 2007: 330-341 - [i13]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge State Algorithms: Randomization with Limited Information. CoRR abs/cs/0701142 (2007) - 2006
- [j31]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60(2): 85-114 (2006) - [j30]Nicolò Cesa-Bianchi, Rüdiger Reischuk, Thomas Zeugmann:
Foreword. Theor. Comput. Sci. 350(1): 1-2 (2006) - [j29]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
Learning a subclass of regular patterns in polynomial time. Theor. Comput. Sci. 364(1): 115-131 (2006) - [c50]Jan Arpe, Rüdiger Reischuk:
On the Complexity of Optimal Grammar-Based Compression. DCC 2006: 173-182 - [c49]Jan Arpe, Rüdiger Reischuk:
Learning Juntas in the Presence of Noise. TAMC 2006: 387-398 - [e13]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
Complexity of Boolean Functions, 12.03. - 17.03.2006. Dagstuhl Seminar Proceedings 06111, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [e12]Abraham Bernstein, Thomas Dreier, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Paul Molitor, Gustaf Neumann, Rüdiger Reischuk, Dietmar Saupe, Myra Spiliopoulou, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2005. LNI D-6, GI 2006, ISBN 978-3-88579-410-3 [contents] - [i12]Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk:
06111 Executive Summary -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - [i11]Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek:
06111 Abstracts Collection -- Complexity of Boolean Functions. Complexity of Boolean Functions 2006 - [i10]Jan Arpe, Rüdiger Reischuk:
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j28]Bodo Manthey, Rüdiger Reischuk:
The intractability of computing the Hamming distance. Theor. Comput. Sci. 337(1-3): 331-346 (2005) - [c48]Bodo Manthey, Rüdiger Reischuk:
Smoothed Analysis of Binary Search Trees. ISAAC 2005: 483-492 - [e11]Maciej Liskiewicz, Rüdiger Reischuk:
Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings. Lecture Notes in Computer Science 3623, Springer 2005, ISBN 3-540-28193-2 [contents] - [e10]Thomas Dreier, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Paul Molitor, Rüdiger Reischuk, Dietmar Saupe, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2004. LNI D-5, GI 2005, ISBN 3-88579-409-8 [contents] - [i9]Bodo Manthey, Rüdiger Reischuk:
Smoothed Analysis of the Height of Binary Search Trees. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j27]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Approximating schedules for dynamic process graphs efficiently. J. Discrete Algorithms 2(4): 471-500 (2004) - [c47]Wolfgang W. Bein, Lawrence L. Larmore, Rüdiger Reischuk:
Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems. ISPAN 2004: 307-312 - [e9]Heinz Beilner, Thomas Dreier, Markus Gross, Oliver Günther, Steffen Hölldobler, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2003. LNI D-4, GI 2004, ISBN 3-88579-408-X [contents] - [i8]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
A Polynomial Time Learner for a Subclass of Regular Patterns. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c46]Jan Arpe, Rüdiger Reischuk:
Robust Inference of Relevant Attributes. ALT 2003: 99-113 - [c45]John Case, Sanjay Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
Learning a Subclass of Regular Patterns in Polynomial Time. ALT 2003: 234-246 - [c44]Bodo Manthey, Rüdiger Reischuk:
The Intractability of Computing the Hamming Distance. ISAAC 2003: 88-97 - [c43]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Private Computations in Networks: Topology versus Randomness. STACS 2003: 121-132 - 2002
- [c42]Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk:
Editors' Introduction. ALT 2002: 1-6 - [e8]Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk:
Algorithmic Learning Theory, 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings. Lecture Notes in Computer Science 2533, Springer 2002, ISBN 3-540-00170-0 [contents] - [e7]Heinz Beilner, Herbert Fiedler, Markus Gross, Oliver Günther, Steffen Hölldobler, Günter Hotz, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2002. LNI D-3, GI 2002, ISBN 3-88579-407-1 [contents] - [i7]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space Efficient Algorithms for Directed Series-Parallel Graphs. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [c41]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Space Efficient Algorithms for Series-Parallel Graphs. STACS 2001: 339-352 - [e6]Heinz Beilner, Herbert Fiedler, Oliver Günther, Steffen Hölldobler, Günter Hotz, Peter Liggesmeyer, Klaus-Peter Löhr, Rüdiger Reischuk, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2001. LNI D-2, GI 2001, ISBN 3-88579-406-3 [contents] - [i6]Rüdiger Reischuk:
Approximating Schedules for Dynamic Graphs Efficiently. Electron. Colloquium Comput. Complex. TR01 (2001) - [i5]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Dynamic Process Graphs and the Complexity of Scheduling. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j26]Rüdiger Reischuk, Thomas Zeugmann:
An Average-Case Optimal One-Variable Pattern Language Learner. J. Comput. Syst. Sci. 60(2): 302-335 (2000) - [j25]Rüdiger Reischuk:
Can large fanin circuits perform reliable computations in the presence of faults? Theor. Comput. Sci. 240(2): 319-335 (2000) - [c40]Andreas Jakoby, Rüdiger Reischuk:
Average Case Complexity of Unbounded Fanin Circuits. CCC 2000: 170- - [c39]Stephan Weis, Rüdiger Reischuk:
The Complexity of Physical Mapping with Strict Chimerism. COCOON 2000: 383-395 - [c38]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
The Expressive Power and Complexity of Dynamic Process Graphs. WG 2000: 230-242 - [e5]Herbert Fiedler, Oliver Günther, Werner Grass, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 1999. Teubner 2000, ISBN 978-3-519-02650-1 [contents] - [e4]Herbert Fiedler, Werner Grass, Oliver Günther, Steffen Hölldobler, Günter Hotz, Rüdiger Reischuk, Bernhard Seeger, Dorothea Wagner:
Ausgezeichnete Informatikdissertationen 2000. LNI D-1, GI 2000, ISBN 3-88579-405-5 [contents]
1990 – 1999
- 1999
- [j24]Maciej Liskiewicz, Rüdiger Reischuk:
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games. Comput. Complex. 8(3): 273-307 (1999) - [j23]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
Malign Distributions for Average Case Circuit Complexity. Inf. Comput. 150(2): 187-208 (1999) - [c37]Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Scheduling Dynamic Graphs. STACS 1999: 383-392 - [c36]Rüdiger Reischuk, Thomas Zeugmann:
A Complete and Tight Average-Case Analysis of Learning Monomials. STACS 1999: 414-423 - 1998
- [j22]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
The complexity of broadcasting in planar and decomposable graphs. Discret. Appl. Math. 83(1-3): 179-206 (1998) - [c35]Rüdiger Reischuk, Thomas Zeugmann:
Learning One-Variable Pattern Languages in Linear Average Time. COLT 1998: 198-208 - [e3]Wolfgang Bibel, Herbert Fiedler, Werner Grass, Peter Gorny, Günter Hotz, Immo O. Kerner, Rüdiger Reischuk, Friedrich Roithmayr:
Ausgezeichnete Informatikdissertationen 1996. Vieweg+Teubner Verlag 1998, ISBN 978-3-519-02646-4 [contents] - [i4]Rüdiger Reischuk, Thomas Zeugmann:
An Average-Case Optimal One-Variable Pattern Language Learner. Electron. Colloquium Comput. Complex. TR98 (1998) - [i3]Rüdiger Reischuk:
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise? Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j21]Rüdiger Reischuk, Christian Schindelhauer:
An Average Complexity Measure that Yields Tight Hierarchies. Comput. Complex. 6(2): 133-173 (1997) - [j20]Danny Dolev, Rüdiger Reischuk, Fred B. Schneider, H. Raymond Strong:
Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996. Real Time Syst. 12(3): 329-345 (1997) - [c34]Rüdiger Reischuk:
Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise ? COCOON 1997: 72-81 - [c33]Maciej Liskiewicz, Rüdiger Reischuk:
Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds. MFCS 1997: 91-107 - [e2]Rüdiger Reischuk, Michel Morvan:
STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings. Lecture Notes in Computer Science 1200, Springer 1997, ISBN 3-540-62616-6 [contents] - 1996
- [j19]Maciej Liskiewicz, Rüdiger Reischuk:
The Sublogarithmic Alternating Space World. SIAM J. Comput. 25(4): 828-861 (1996) - [j18]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines. SIAM J. Comput. 25(6): 1196-123 (1996) - [e1]Claude Puech, Rüdiger Reischuk:
STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings. Lecture Notes in Computer Science 1046, Springer 1996, ISBN 3-540-60922-9 [contents] - 1995
- [c32]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
Malign Distributions for Average Case Circuit Complexity. STACS 1995: 628-639 - [c31]Andreas Jakoby, Rüdiger Reischuk:
Data Transmission in Processor Networks. WDAG 1995: 145-159 - [i2]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Maciej Liskiewicz, Rüdiger Reischuk:
The Sublogarithmic Alternating Space World. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j17]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs. J. Comput. Syst. Sci. 48(2): 231-254 (1994) - [c30]Maciej Liskiewicz, Rüdiger Reischuk:
The Complexity World below Logarithmic Space. SCT 1994: 64-78 - [c29]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer, Stephan Weis:
The Average Case Complexity of the Parallel Prefix Problem. ICALP 1994: 593-604 - [c28]Danny Dolev, Rüdiger Reischuk, H. Raymond Strong:
Observable Clock Synchronization (Extended Abstract). PODC 1994: 284-293 - [c27]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
Circuit complexity: from the worst case to the average case. STOC 1994: 58-67 - [c26]Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
The Complexity of Broadcasting in Planar and Decomposable Graphs. WG 1994: 219-231 - 1993
- [j16]Bernd Halstenberg, Rüdiger Reischuk:
Different Modes of Communication. SIAM J. Comput. 22(5): 913-934 (1993) - [c25]Maciej Liskiewicz, Rüdiger Reischuk:
Separating the Lower Levels of the Sublogarithmic Space Hierarchy. STACS 1993: 16-27 - [c24]Rüdiger Reischuk, Christian Schindelhauer:
Precise Average Case Complexity. STACS 1993: 650-661 - 1992
- [c23]Rüdiger Reischuk, Bernd Schmeltz:
Area Efficient Methods to Increase the Reliability of Circuits. Data Structures and Efficient Algorithms 1992: 363-389 - [c22]Andreas Jakoby, Rüdiger Reischuk:
The Complexity of Scheduling Problems with Communication Delays for Trees. SWAT 1992: 165-177 - [p1]Bernd Halstenberg, Rüdiger Reischuk:
Über den Nutzen von Orakelfragen bei nichtdeterministischen Kommunikationsprotokollen. Informatik 1992: 169-183 - 1991
- [c21]Rüdiger Reischuk:
Graph Theoretical Methods for the Design of Parallel Algorithms. FCT 1991: 61-67 - [c20]Rüdiger Reischuk, Bernd Schmeltz:
Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound. FOCS 1991: 602-611 - 1990
- [b2]Rüdiger Reischuk:
Einführung in die Komplexitätstheorie. Teubner 1990, ISBN 3-519-02275-3 - [j15]Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
Renaming in an Asynchronous Environment. J. ACM 37(3): 524-548 (1990) - [j14]Danny Dolev, Rüdiger Reischuk, H. Raymond Strong:
Early Stopping in Byzantine Agreement. J. ACM 37(4): 720-741 (1990) - [j13]Bernd Halstenberg, Rüdiger Reischuk:
Relations between Communication Complexity Classes. J. Comput. Syst. Sci. 41(3): 402-429 (1990) - [c19]Martin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk:
Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA 1990: 125-135
1980 – 1989
- 1989
- [j12]Rüdiger Reischuk:
Parallele Maschinenmodelle und Komplexitätsklassen. it Inf. Technol. 31(1): 59-77 (1989) - [c18]Rüdiger Reischuk, Bernd Schmeltz:
Area Efficient Methods to Increase the Reliability of Combinatorial Circuits. STACS 1989: 314-326 - 1988
- [c17]Bernd Halstenberg, Rüdiger Reischuk:
Relations between communication complexity classes. SCT 1988: 19-28 - [c16]Bernd Halstenberg, Rüdiger Reischuk:
On Different Modes of Communication (Extended Abstract). STOC 1988: 162-172 - 1987
- [j11]Rüdiger Reischuk:
Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions. J. ACM 34(1): 163-178 (1987) - [c15]Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk:
Achievable Cases in an Asynchronous Environment (Extended Abstract). FOCS 1987: 337-346 - [c14]Rüdiger Reischuk:
Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle. GI Jahrestagung 1987: 65-81 - [c13]Rüdiger Reischuk, Meinolf Koshors:
Lower Bounds for Synchronous Networks and the Advantage of Local Information. WDAG 1987: 374-387 - 1986
- [j10]Stephen A. Cook, Cynthia Dwork, Rüdiger Reischuk:
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. SIAM J. Comput. 15(1): 87-97 (1986) - [c12]Rüdiger Reischuk:
Parallel Machines and their Communication Theoretical Limits. STACS 1986: 359-368 - 1985
- [j9]Rüdiger Reischuk:
A New Solution for the Byzantine Generals Problem. Inf. Control. 64(1-3): 23-42 (1985) - [j8]Danny Dolev, Rüdiger Reischuk:
Bounds on Information Exchange for Byzantine Agreement. J. ACM 32(1): 191-204 (1985) - [j7]Rüdiger Reischuk:
Probabilistic Parallel Algorithms for Sorting and Selection. SIAM J. Comput. 14(2): 396-409 (1985) - 1984
- [j6]Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk:
Two Nonlinear Lower Bounds for On-Line Computations. Inf. Control. 60(1-3): 1-11 (1984) - [c11]Friedhelm Meyer auf der Heide, Rüdiger Reischuk:
On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication. FOCS 1984: 56-64 - 1983
- [c10]Rüdiger Reischuk:
A New Solution for the Byzantine Generals Problem (Extended Abstract). FCT 1983: 382-393 - [c9]Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk:
Two Nonlinear Lower Bounds. STOC 1983: 127-132 - 1982
- [j5]Rüdiger Reischuk:
A Fast Implementation of a Multidimensional Storage Into a Tree Storage. Theor. Comput. Sci. 19: 253-266 (1982) - [c8]Danny Dolev, Rüdiger Reischuk, H. Raymond Strong:
'Eventual' Is Earlier than 'Immediate'. FOCS 1982: 196-203 - [c7]Danny Dolev, Rüdiger Reischuk:
Bounds on Information Exchange for Byzantine Agreement. PODC 1982: 132-140 - 1981
- [j4]Wolfgang J. Paul, Rüdiger Reischuk:
On Time versus Space II. (Turing Machines). J. Comput. Syst. Sci. 22(3): 312-327 (1981) - [c6]Rüdiger Reischuk:
A Fast Probabilistic Parallel Sorting Algorithm. FOCS 1981: 212-219 - 1980
- [j3]Wolfgang J. Paul, Ernst-Jürgen Prauß, Rüdiger Reischuk:
On Alternation. Acta Informatica 14: 243-255 (1980) - [j2]Wolfgang J. Paul, Rüdiger Reischuk:
On Alternation II. A Graph Theoretic Approach to Determinism Versus Nondeterminism. Acta Informatica 14: 391-403 (1980) - [j1]Rüdiger Reischuk:
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game. J. ACM 27(4): 839-849 (1980) - [c5]Rüdiger Reischuk:
A "Fast Implementation" of a Multidimensional Storage into a Tree Storage. ICALP 1980: 531-542
1970 – 1979
- 1979
- [b1]Rüdiger Reischuk:
Beziehungen zwischen Rechenzeit, Speicherplatz und Speicherstruktur. University of Bielefeld, Germany, 1979 - [c4]Wolfgang J. Paul, Rüdiger Reischuk:
On Time versus Space II. FOCS 1979: 298-306 - [c3]Wolfgang J. Paul, Rüdiger Reischuk:
A Graph Theoretic Approach to Determinism versus Non-Determinism. Theoretical Computer Science 1979: 222-232 - 1978
- [c2]Rüdiger Reischuk:
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version). FOCS 1978: 84-91 - [c1]Wolfgang J. Paul, Ernst-Jürgen Prauß, Rüdiger Reischuk:
On Alternation (Preliminary Version). FOCS 1978: 113-122
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 01:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
