dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Rüdiger Reischuk (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBerthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Algorithms Unplugged Springer 2011
106no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBerthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner: Taschenbuch der Algorithmen Springer 2008
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk: Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs Electronic Colloquium on Computational Complexity (ECCC) 2(4): (1995)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin 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)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Dietzfelbinger, Miroslaw Kutylowski, Rüdiger Reischuk: Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes. SPAA 1990: 125-135

Selection of 6 from 115 records - Rüdiger Reischuk has 51 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page