50 years Univerity of Lübeck

Prof. Dr. math. K. Rüdiger Reischuk

Publications


2019

  • Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Proper Learning of k-term DNF Formulas from Satisfying Assignments.
    Journal of Computer and System Sciences, 2019 (to appear).

2018

  • A. Bernstein, W. Effelsberg, F. Freiling, S. Hölldobler, H.-P. Lenhof, P. Molitor, G. Neumann, R. Reischuk, N. Schweikardt, M. Spiliopoulou, S. Süsstrunk:
    Ausgezeichnete Informatikdissertationen 2017.
    Volume 18 of Lecture Notes in Informatics, Gesellschaft für Informatik, 2018.
  • Florian Thaeter, Rüdiger Reischuk:
    Improving Anonymization Clustering.
    In SICHERHEIT 2018, pp. 69-82. Gesellschaft für Informatik e.V., 2018.
    Go to website

2017

  • Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Learning Residual Alternating Automata.
    Electronic Colloquium on Computational Complexity (ECCC), 24(46)2017.
    Go to website | Show abstract
  • Sebastian Berndt, Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Learning Residual Alternating Automata.
    Proc. 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 1749-1755. AAAI Press, 2017.
    Go to website | Show abstract
  • Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk:
    Proper Learning of k-term DNF Formulas from Satisfying Assignments.
    Electronic Colloquium on Computational Complexity (ECCC), 24(114)2017.
    Go to website | Show abstract
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Security levels in steganography - Insecurity does not imply detectability.
    Theoret. Comput. Sci., (692):25-45, 2017.
    Go to website
  • A. Bernstein, W. Effelsberg, F. Freiling, S. Hölldobler, H.-P. Lenhof, P. Molitor, G. Neumann, R. Reischuk, N. Schweikardt, M. Spiliopoulou, S. Süsstrunk:
    Ausgezeichnete Informatikdissertationen 2016.
    Volume 17 of Lecture Notes in Informatics, GI, 2017.

2016

  • Sebastian Berndt, Rüdiger Reischuk:
    Steganography Based on Pattern Languages.
    In Language and Automata Theory and Applications, 10th International Conference LATA 2016 Prague, Czech Republic, March 14-18, 2016, Volume Volume 9618 of Lecture Notes in Computer Science (LNCS), pp. 387-399. Springer, 2016.
    Go to website | Show abstract
  • A. Bernstein, W. Effelsberg, F. Freiling, S. Hölldobler, H.-P. Lenhof, P. Molitor, G. Neumann, R. Reischuk, N. Schweikardt, M. Spiliopoulou, H. Störrle, S. Süsstrunk:
    Ausgezeichnete Informatikdissertationen 2015.
    Volume 16 of Lecture Notes in Informatics, Dissertationen, GI, 2016.

2015

  • Matthias Ernst, Maciej Liskiewicz, Rüdiger Reischuk:
    Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples.
    In Proc. International Symposium on Algorithms and Computation (ISAAC 2015), Volume 9472 of Lecture Notes in Computer Science, pp. 151-162. Springer, 2015.
    Go to website | Show abstract
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Security Levels in Steganography - Insecurity does not Imply Detectability.
    Electronic Colloquium on Computational Complexity (ECCC), 22(10)2015.
    Go to website | Show abstract
  • A. Bernstein, W. Effelsberg, F. Freiling, S. Hölldobler, H.-P. Lenhof, P. Molitor, G. Neumann, R. Reischuk, N. Schweikardt, M. Spiliopoulou, H. Störrle, S. Süsstrunk:
    Ausgezeichnete Informatikdissertationen 2014.
    Volume 165 of Lecture Notes in Informatics, Dissertationen, GI, 2015.

2014

  • A. Bernstein, W. Effelsberg, S. Hölldobler, H.-P. Lenhof, K.-P. Löhr, P. Molitor, G. Neumann, R. Reischuk, N. Schweikardt, M. Spiliopoulou, H. Störrle, S. Süsstrunk:
    Ausgezeichnete Informatikdissertationen 2013.
    Volume 14 of Lecture Notes in Informatics, Dissertationen, GI, 2014.

2013

  • A. Bernstein, W. Effelsberg, S. Hölldoble, H.-P. Lenhof, K.-P. Löhr, P. Molitor, G. Neumann, R. Reischuk, N. Schweikardt, M. Spiliopoulou, H. Störrle, S. Süsstrunk:
    Ausgezeichnete Informatikdissertationen 2012.
    Volume 13 of Lecture Notes in Informatics, Dissertationen, GI, 2013.
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Grey-box steganography.
    Theoretical Computer Science, (505):27-41, 2013.
    Go to website

2012

  • A. Bernstein, S. Hölldobler, G. Hotz, K.-P. Löhr, P. Molitor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, H. Störrle, D. Wagner::
    Ausgezeichnete Informatikdissertationen 2011.
    Volume D-12 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2012.

2011

  • Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Chritian Scheideler, Heribert Vollmer, Dorothea Wagner (Eds.):
    Algorithms Unplugged.
    Springer Verlag, Heidelberg, 2011.
    Go to website
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Grey-Box Steganography.
    Volume 6648 of Lecture Notes in Computer Science, pp. 390-402. Springer Verlag, Heidelberg, in Proceedings 8. TAMC, 2011.
    Go to website
  • Rüdiger Reischuk:
    One-Way Functions: Mind the Trap -- Escape Only for the Initiated.
    In Algorithms Unplugged, pp. 131-140. Springer, 2011.
    Go to website
  • Rüdiger Reischuk, Markus Hinkelmann:
    One-Way Functions. Mind the Trap – Escape Only for the Initiated.
    In Algorithms Unplugged, pp. 131-139. Springer, 2011.
    Go to website
  • Rüdiger Reischuk, Johannes Textor:
    Stochastic Search With Locally Clustered Targets: Learning from T Cells.
    In 10th International Conference on Artificial Immune Systems (ICARIS 2011), Volume 6825 of Lecture Notes in Computer Science, pp. 146-159. Springer, 2011.
  • A. Bernstein, S. Hölldobler, G. Hotz, K.-P. Löhr, P. Molitor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, H. Störrle, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2010.
    Volume 11 of Lecture Notes in Informatics, Dissertationen, GI, 2011.

2010

  • A. Bernstein, S. Hölldobler, G. Hotz, K.-P. Löhr, P. Molitor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, H. Störrle, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2009.
    Volume 10 of Lecture Notes in Informatics, Dissertationen, GI, 2010.

2009

  • Wolfgang Bein, Lawrence L. Larmore, Rüdiger Reischuk:
    Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
    International Journal of Foundations of Computer Science, 20(1):167-184, 2009.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
    Improving the Average Delay of Sorting.
    Theoretical Computer Science, 410(11):1030-1041, 2009.
    Go to website
  • Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel:
    Grey-Box Steganography.
    Technical report SIIM-TR-A-09-03, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2009.
    Show PDF | Show abstract
  • S. Fischer, E. Maehle, R. Reischuk:
    Informatik 2009 - Im Fokus das Leben.
    Volume 154 of Lecture Notes in Informatics, Gesellschaft für Informatik, 2009.
    Go to website
  • A. Bernstein, T. Dreier, S. Hölldobler, G. Hotz, K.-P. Löhr, P. Moltor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, H. Sörrle, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2008.
    Volume 9 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2009.
    Go to website

2008

  • W. Bein, L. Larmore, R. Reischuk:
    Knowledge States: A Tool for Randomized Online Algorithms.
    In Proceedings of 41. HICSS Int. Conference on System Sciences, pp. 476. IEEE Computer Society, 2008.
    Go to website
  • A. Bernstein, T. Dreier, S. Hölldobler, G. Hotz, K. Löhr, P. Molitor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, H. Störle, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2007.
    Volume D3 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2008.
  • Rüdiger Reischuk, Markus Hinkelmann:
    Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!
    In Taschenbuch der Algorithmen, pp. 139-148. Springer, 2008.
    Show abstract
  • B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner:
    Taschenbuch der Algorithmen.
    eXamen.press, Springer, 2008.
    Go to website

2007

  • Jan Arpe, Rüdiger Reischuk:
    Learning Juntas in the Presence of Noise.
    Theoretical Computer Science, 1(384):2-21, 2007.
    Go to website
  • Jan Arpe, Rüdiger Reischuk:
    When Does Greedy Learning of Relevant Attributes Succeed? - A Fourier-based Characterization.
    In 13th Annual International Conference, Computing and Combinatorics, COCOON 2007, Volume 4598 of Lecture Notes in Computer Science, pp. 296-306. Springer, 2007.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
    Improving the Average Delay of Sorting.
    In 4th International Conference, Theory and Applications of Models of Computation, TAMC 2007, Volume 4484 of Lecture Notes in Computer Science, pp. 330-341. Springer, 2007.
    Go to website
  • Maciej Liskiewicz, Rüdiger Reischuk, Guest Eds.:
    Theory of Computing Systems.
    Volume 41/2 of Theory of Computing Systems, Springer, 2007.
    Go to website
  • Bodo Manthey, Rüdiger Reischuk:
    Smoothed Analysis of Binary Search Trees.
    Theoretical Computer Science, 378(3):292-315, 2007.
    Go to website | Show abstract
  • Rüdiger Reischuk:
    Designing Boolean Sorting Circuits with Optimal Average Delay.
    In Oberwolfach Reports X, Mathematisches Forschungsinstitut Oberwolfach, 2007.
  • A. Bernstein, T. Dreier, S. Hölldobler, G. Hotz, K. Lohr, P. Molitor, R. Reischuk, D. Saupe, M. Spiliopoulou, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2006.
    Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2007.

2006

  • Jan Arpe, Rüdiger Reischuk:
    Learning Juntas in the Presence of Noise.
    In Proc. Theory and Applications of Models of Computation TAMC'2006, Volume 3959 of Lecture Notes in Computer Science, pp. 387-398. Springer, 2006.
    Go to website
  • Jan Arpe, Rüdiger Reischuk:
    On the Complexity of Optimal Grammar Based Compression.
    In Proc. 16. Data Compression Conference DCC'2006, pp. 173-182. IEEE Computer Society, 2006.
    Go to website
  • A. Bernstein, T. Dreier, S. Hölldobler, K. Löhr, P. Molitor, G. Neumann, R. Reischuk, D. Saupe, M. Spiliopoulou, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2005.
    Volume D6 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2006.
    Go to website
  • John Case, Sanjey Jain, Rüdiger Reischuk, Thomas Zeugmann:
    Learning a Subclass of Regular Patterns in Polynomial Time.
    Theoretical Computer Science, 1(364):115-131, 2006.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Space Efficient Algorithms for Directed Series-Parallel Graphs.
    Journal of Algorithms, 2(60):85-114, 2006.
    Go to website
  • Matthias Krause, Pavel Pudlak, Rüdiger Reischuk, Dieter van Melkebeek:
    Complexity of Boolean Functions.
    Volume 06111 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl GmbH, 2006.
    Go to website
  • Rüdiger Reischuk, Markus Hinkelmann:
    Einweg-Funktionen - Vorsicht Falle - Rückweg nur für Eingeweihte!
    Algorithmus der Woche zum Informatikjahr 2006
    Go to website | Show abstract

2005

  • T. Dreier, O. Günther, S. Hölldobler, K. Löhr, P. Molitor, R. Reischuk, D. Saupe, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2004.
    Volume D5 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2005.
    Go to website
  • Maciej Liskiewicz, Rüdiger Reischuk:
    Proceedings of the 15th International Symposium On Fundamentals of Computation Theory (FCT), Lübeck 2005.
    Volume 3623 of Lecture Notes in Computer Science, Springer, 2005.
    Go to website
  • Bodo Manthey, Rüdiger Reischuk:
    Smoothed Analysis of Binary Search Trees.
    Technical report SIIM-TR-A-05-17, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2005.
    Show postscript | Show abstract
  • Bodo Manthey, Rüdiger Reischuk:
    The Intractability of Computing the Hamming Distance.
    Theoretical Computer Science, 1-3(337):331-346, 2005.
    Go to website

2004

  • Jan Arpe, Rüdiger Reischuk:
    On the Complexity of Optimal Grammar Based Compression.
    Technical report SIIM-TR-A-04-14, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2004.
    Show postscript | Show abstract
  • H. Beilner, T. Dreier, M. Gross, O. Günther, S. Hölldobler, K. Löhr, R. Reischuk, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2003.
    Volume D4 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2004.
    Go to website
  • Wolfgang Bein, Larry Larmore, Rüdiger Reischuk:
    Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.
    In llel Architectures, Algorithms and Networks ISPAN'2004, pp. 307-312. IEEE Computer Society, 2004.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Approximating Schedules for Dynamic Graphs Efficiently.
    Journal of Discrete Algorithms, 4(2):471-500, 2004.
    Go to website

2003

  • Jan Arpe, Rüdiger Reischuk:
    Robust Inference of Funtional Relations.
    In 14 Int. Conference on Algorithmic Learning Theory ALT'2003, Volume 2842 of Lecture Notes in Artificial Intelligence, pp. 99-113. Springer, 2003.
    Go to website
  • Jan Arpe, Rüdiger Reischuk:
    Robust Inference of Functional Relations.
    Technical report SIIM-TR-A-03-12, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2003.
    Show postscript | Show abstract
  • H. Beilner, H. Fiedler, M. Gross, O. Günther, S. Hölldobler, G. Hotz, K. Löhr, R. Reischuk, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2002.
    Volume D3 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2003.
    Go to website
  • John Case, Sanjey Jain, Rüdiger Reischuk, Frank Stephan, Thomas Zeugmann:
    Learning a Subclass of Regular Pattern in Polynomial Time.
    In 14 Int. Conference on Algorithmic Learning Theory ALT'2003, Volume 2842 of Lecture Notes in Artificial Intelligence, pp. 234-246. Springer, 2003.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Private Computations in Networks: Topology versus Randomness.
    In 21 GI Symposium on Theoretical Aspects of Computer Science STACS'2003, Volume 2607 of Lecture Notes in Computer Science, pp. 189-198. Springer, 2003.
    Go to website
  • Bodo Manthey, Rüdiger Reischuk:
    The Intractability of Computing the Hamming Distance.
    In 14. Int. Symposium on Algorithms and Computation ISAAC'2003, Volume 2906 of Lecture Notes in Computer Science, pp. 88-97. Springer, 2003.
    Go to website
  • Rüdiger Reischuk:
    Planung und Realisation von Informationssystemen: Algorithmische Komplexität.
    In Taschenbuch der Wirtschaftsinformatik und Wirtschaftsmathematik, Kap. 6.2, pp. 246-252. Harri Deutsch, 2003.
    Go to website

2002

  • David Barrington, Johan Hastad, Matthias Krause, Rüdiger Reischuk:
    Complexity of Boolean Functions.
    Volume 02121 of Dagstuhl-Seminar-Report, Schloss Dagstuhl GmbH, 2002.
    Go to website
  • H. Beilner, H. Fiedler, O. Günther, S. Hölldobler, G. Hotz, P. Liggesmeyer, K. Löhr, R. Reischuk, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2001.
    Volume D2 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2002.
    Go to website
  • N. Cesa-Bianchi, M. Numao, R. Reischuk:
    Proceedings of the 13. Int. Conference on Algorithmic Learning Theory, ALT'2002.
    Volume 2533 of Lecture Notes in Computer Science, Springer, 2002.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Dynamic Process Graphs and the Complexity of Scheduling.
    Technical report SIIM-TR-A-00-02, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2002.
    Show postscript | Show abstract
  • Bodo Manthey, Rüdiger Reischuk:
    The Intractability of Computing the Hamming Distance.
    Technical report SIIM-TR-A-02-17, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2002.
    Show postscript | Show abstract
  • Rüdiger Reischuk:
    Average-case Computational Complexity.
    In Encyclopaedia of Mathematics, Suppl. III, pp. 111-128. Springer, 2002.

2001

  • H. Fiedler, W. Grass, O. Günther, S. Hölldobler, G. Hotz, R. Reischuk, B. Seeger, D. Wagner:
    Ausgezeichnete Informatikdissertationen 2000.
    Volume D1 of Lecture Notes in Informatics, Dissertationen, Gesellschaft für Informatik, 2001.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Space Efficient Algorithms for Series-Parallel Graphs.
    In 18 GI-MIMD Symposium on Theoretical Aspects of Computer Science STACS'2001, Volume 2010 of Lecture Notes in Computer Science, pp. 339-352. Springer, 2001.
    Go to website

2000

  • H. Fiedler, W. Grass, O. Günther, S. Hölldobler, G. Hotz, R. Reischuk, B. Seeger, D. Wagner:
    Ausgezeichnete Informatikdissertationen 1999.
    GI-Dissertationspreis, Teubner Verlag Stuttgart, Leipzig, 2000.
    Go to website
  • Andreas Jakoby, Rüdiger Reischuk:
    Average Complexity of Unbounded Fanin Circuits.
    In 11. IEEE Conference on Computational Complexity COMPLEXITY'2000, pp. 170-185. IEEE Computer Society, 2000.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    Space Efficient Algorithms for Series-Parallel Graphs.
    Technical report SIIM-TR-A-00-17, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2000.
    Show postscript | Show abstract
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    The Expressive Power and Complexity of Dynamic Process Graphs.
    In 26. Int. Workshop on Graph-Theoretical Concepts in Computer Science WG'2000, Volume 1928 of Lecture Notes in Computer Science, pp. 230-242. Springer, 2000.
    Go to website
  • Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
    The Expressive Power and Complexity of Dynamic Process Graphs.
    Technical report SIIM-TR-A-00-07, Schriftenreihe der Institute für Informatik/Mathematik der Universität zu Lübeck, 2000.
    Show postscript | Show abstract
  • Rüdiger Reischuk, Thomas Zeugmann:
    An Average-Case Optimal One-Variable Pattern Language Learner.
    Journal of Computer and System Sciences, 2(60):302-335, 2000.
    Go to website
  • Rüdiger Reischuk:
    Can Large Fanin Circuits Perform Reliable Computations in the Presence of Faults?
    Theoretical Computer Science, 2(240):319-335, 2000.
    Go to website
  • Stephan Weis, Rüdiger Reischuk:
    The Complexity of Physical Mapping with Strict Chimerism.
    In 6. Int. Symposium on Computing and Combinatorics COCOON'2000, Volume 1858 of Lecture Notes in Computer Science, pp. 383-395. Springer, 2000.
    Go to website