April 1999

• New Approximation Algorithm for the RTILE Problem,, (joint work with K.Paluch), Theoretical Computer Science, 2-3(303), 2003, 517-537,
• Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs,, (joint work with G.Zwozniak), ESA'02, Lecture Notes in Computer Science, Vol. 2461 (Springer, Berlin,2002) 686-697.,
• Some results on RRW- and RRWW-automata and their relationship to the class of growin context sensitive languages,, (joint work with T.Jurdzinski, G. Niemann and F.Otto), , .
• Church-Rosser Languages vs UCFL,, (joint work with T.Jurdzinski) ICALP'02, Lecture Notes in Computer Science, Vol. 2380 (Springer, Berlin,2002), 147-158. .
• Switching Networks for Generating Random Permutations, (joint work with A.Czumaj, P.Kanarek and M.Kutylowski), in: {\em Switching Networks: Recent Advances}, D.Z.Du, H.Q.Ngo (eds.) (Kluwer, 2001).
• Periodic Shifting Networks, (joint work with P.Kanarek), in: {\em Switching Networks: Recent Advances}, D.Z.Du, H.Q.Ngo (eds.) (Kluwer, 2001)
• Rectangle Tiling,, (joint work with K.Paluch), APPROX'00, Lecture Notes in Computer Science, Vol. 1913 (Springer, Berlin,2000)206-213.,
• Efficient Approximation Algorithms for the Achromatic Number, (joint work with P.Krysta), ESA'99, Lecture Notes in Computer Science, Vol. 1643 (Springer, Berlin,1999), 402-413.
• Multiparty Finite Computations, (joint work with T.Jurdzinski and M.Kutylowski), COCOON'99, Lecture Notes in Computer Science, vol. 1627, (Springer, Berlin, 1999), 318-329.
• Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes, (joint work with A.Czumaj, P.Kanarek and M.Kutylowski), SODA'99, ACM/SIAM, 1999, 281-290.
• Power of Cooperation and Multihead Finite Systems, (joint work with P.Duris, T.Jurdzinski and M.Kutylowski), ICALP'98, , Lecture Notes in Computer Science, vol. 1443 (Springer, Berlin, 1998), 896-907.
• Periodic merging networks, ( joint work with M.Kutylowski and B.Oesterdiekhof), ISAAC'96, Lecture Notes in Computer Science, vol. 1178 (Springer, Berlin, 1996), 336-345.
  • full journal version: Periodic merging networks, Theory of Computing Systems, 31.5 (1998), 551-578.
• Limitations of the QRQW and EREW PRAM models, (joint work with M.Kutylowski), FST&TCS'96, Lecture Notes in Computer Science, vol. 1180 (Springer, Berlin, 1996), 310-321.
• Fast generation of random permutations via network simulation, (joint work with A.Czumaj, P.Kanarek and M.Kutylowski), ESA'96 , Lecture Notes in Computer Science, vol. 1136 (Springer, Berlin, 1996), 246-260.
  • full journal version: Fast generation of random permutations via network simulation , Algorithmica, 21 (1998), 2-20.
• On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks, (joint work with J. Hromkovic, P. Kanarek, R. Klassing, W. Unger and H. Wagener), STACS'95, Lecture Notes in Computer Science, vol. 900 (Springer, Berlin, 1995), 255-266.
• Fast and feasible periodic sorting networks of constant depth, (joint work with M.Kutylowski, B.Oesterdiekhoff and R.Wanka), FOCS'94, IEEE Comp. Soc. Press, 1994, 369-380.
  • journal version: Periodification scheme: constructing sorting networks with constant period, JACM 47(5), 2000, 944-967.
• The Variable Membership Problem: Succinctness versus Complexity, (joint work with G.Buntrock), STACS'94, Lecture Notes in Computer Science, vol. 775 (Springer, Berlin, 1994),595-606.
• Retrieval of scattered information by EREW, CREW and CREW PRAMs (joint work with F.Fich, M.Kowaluk, M.Kutylowski and P.Ragde), Algorithm Theory - SWAT'92, Lecture Notes in Computer Science, Vol. 621, (Springer, Berlin,1992), 30-41.
  • a journal version: Retrieval of scattered information by EREW, CREW and CREW PRAMs , Computational Complexity 5 (1995), 113-131.
• On growing context-sensitive languages (joint work with G.Buntrock), ICALP'92, Lecture Notes in Computer Science, Vol. 623 (Springer, Berlin,1992), 77-88.
• New time hierarchy results for deterministic TMs, STACS'92, Lecture Notes in Computer Science, Vol. 577 (Springer, Berlin, 1992), 329-336.
• Fast simulations of time-bounded one-tape TMs by space-bounded ones (joint work with M.Liskiewicz ), SIAM Journal on Computing 19(1990), 511-521.
• Reversal complexity for alternating TMs, (joint work with M.Liskiewicz and M.Kutylowski ), SIAM Journal on Computing 19 (1990), 207-221.
• Some time-space bounds for one-tape deterministic Turing machines, (joint work with M.Liskiewicz ), FCT'89, Lecture Notes in Computer Science, Vol.380 (Springer, Berlin, 1989), 297-307.
• On reversal complexity for alternating Turing machines, (joint work with M.Liskiewicz), FOCS'89, IEEE Comp. Soc. Press, 1989, 618-623.
• Two applications of Furer's counter to one-tape nondeterministic TMs, (joint work with M.Liskiewicz ), MFCS'88, Lecture Notes in Computer Science, Vol. 324 (Springer, Berlin, 1988),445-453.
• Alternating real-time computations, (joint work with M.Liskiewicz ), IPL 28(1988), 311-316.
• A note on ${\cal E}^*_0={\cal E}^*_2$ ? problem, (joint work with M.Kutylowski), Zeitschrift f\"{u}r Mathematische Logik und Grundlagen der Mathematik 33(1987), 115-121.
• On reversal bounded alternating Turing machines (joint work with M.Liskiewicz and M.Piotrow ), Theoretical Computer Science 54(1987), 331-339.
• The characterization of some complexity classes by recursion schemata (joint work with M.Liskiewicz and M.Piotrow), in: L.Lovasz and E.Szemeredi, eds., Theory of Algorithms, North Holland, 1985, 313-339.