2007 |
33 | EE | Tomasz Jurdzinski,
Krzysztof Lorys:
Lower bound technique for length-reducing automata.
Inf. Comput. 205(9): 1387-1412 (2007) |
32 | EE | Tomasz Jurdzinski,
Krzysztof Lorys:
Leftist Grammars and the Chomsky Hierarchy.
Theory Comput. Syst. 41(2): 233-256 (2007) |
2006 |
31 | EE | Piotr Krysta,
Krzysztof Lorys:
Efficient approximation algorithms for the achromatic number.
Theor. Comput. Sci. 361(2-3): 150-171 (2006) |
2005 |
30 | EE | Tomasz Jurdzinski,
Krzysztof Lorys:
Leftist Grammars and the Chomsky Hierarchy.
FCT 2005: 293-304 |
2003 |
29 | EE | Krzysztof Lorys,
Katarzyna E. Paluch:
New approximation algorithm for RTILE problem.
Theor. Comput. Sci. 2-3(303): 517-537 (2003) |
2002 |
28 | EE | Krzysztof Lorys,
Grazyna Zwozniak:
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs.
ESA 2002: 686-697 |
27 | EE | Tomasz Jurdzinski,
Krzysztof Lorys:
Church-Rosser Languages vs. UCFL.
ICALP 2002: 147-158 |
2000 |
26 | EE | Krzysztof Lorys,
Katarzyna E. Paluch:
Rectangle tiling.
APPROX 2000: 206-213 |
25 | EE | Miroslaw Kutylowski,
Krzysztof Lorys,
Brigitte Oesterdiekhoff,
Rolf Wanka:
Periodification scheme: constructing sorting networks with constant period.
J. ACM 47(5): 944-967 (2000) |
1999 |
24 | EE | Tomasz Jurdzinski,
Miroslaw Kutylowski,
Krzysztof Lorys:
Multi-party Finite Computations.
COCOON 1999: 318-329 |
23 | EE | Piotr Krysta,
Krzysztof Lorys:
Efficient Approximation Algorithms for the Achromatic Number.
ESA 1999: 402-413 |
22 | EE | Artur Czumaj,
Przemyslawa Kanarek,
Miroslaw Kutylowski,
Krzysztof Lorys:
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
SODA 1999: 271-280 |
1998 |
21 | EE | Pavol Duris,
Tomasz Jurdzinski,
Miroslaw Kutylowski,
Krzysztof Lorys:
Power of Cooperation and Multihead Finite Systems.
ICALP 1998: 896-907 |
20 | | Artur Czumaj,
Przemyslawa Kanarek,
Miroslaw Kutylowski,
Krzysztof Lorys:
Fast Generation of Random Permutations Via Networks Simulation.
Algorithmica 21(1): 2-20 (1998) |
19 | EE | Miroslaw Kutylowski,
Krzysztof Lorys,
Brigitte Oesterdiekhoff:
Periodic Merging Networks.
Theory Comput. Syst. 31(5): 551-578 (1998) |
1996 |
18 | | Artur Czumaj,
Przemyslawa Kanarek,
Miroslaw Kutylowski,
Krzysztof Lorys:
Fast Generation of Random Permutations via Networks Simulation.
ESA 1996: 246-260 |
17 | | Miroslaw Kutylowski,
Krzysztof Lorys:
Limitations of the QRQW and EREW PRAM Models.
FSTTCS 1996: 310-321 |
16 | | Miroslaw Kutylowski,
Krzysztof Lorys,
Brigitte Oesterdiekhoff:
Periodic Merging Networks.
ISAAC 1996: 336-345 |
15 | | Artur Czumaj,
Przemyslawa Kanarek,
Miroslaw Kutylowski,
Krzysztof Lorys:
Fast Generation of Random Permutations via Networks Simulation
Universität Trier, Mathematik/Informatik, Forschungsbericht 96-26: (1996) |
1995 |
14 | | Juraj Hromkovic,
Krzysztof Lorys,
Przemyslawa Kanarek,
Ralf Klasing,
Walter Unger,
Hubert Wagener:
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
STACS 1995: 255-266 |
13 | | Faith E. Fich,
Miroslaw Kowaluk,
Miroslaw Kutylowski,
Krzysztof Lorys,
Prabhakar Ragde:
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.
Computational Complexity 5(2): 113-131 (1995) |
1994 |
12 | | Miroslaw Kutylowski,
Krzysztof Lorys,
Brigitte Oesterdiekhoff,
Rolf Wanka:
Fast and Feasible Periodic Sorting Networks of Constant Depth
FOCS 1994: 369-380 |
11 | | Gerhard Buntrock,
Krzysztof Lorys:
The Variable Membership Problem: Succinctness Versus Complexity.
STACS 1994: 595-606 |
1992 |
10 | | Gerhard Buntrock,
Krzysztof Lorys:
On Growing Context-Sensitive Languages.
ICALP 1992: 77-88 |
9 | | Krzysztof Lorys:
New Time Hierarchy Results for Deterministic TMs.
STACS 1992: 329-336 |
8 | | Faith E. Fich,
Miroslaw Kowaluk,
Krzysztof Lorys,
Miroslaw Kutylowski,
Prabhakar Ragde:
Retrieval of scattered information by EREW, CREW and CRCW PRAMs.
SWAT 1992: 30-41 |
1990 |
7 | | Miroslaw Kutylowski,
Maciej Liskiewicz,
Krzysztof Lorys:
Reversal Complexity Classes for Alternating Turing Machines.
SIAM J. Comput. 19(2): 207-221 (1990) |
6 | | Maciej Liskiewicz,
Krzysztof Lorys:
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones.
SIAM J. Comput. 19(3): 511-521 (1990) |
1989 |
5 | | Maciej Liskiewicz,
Krzysztof Lorys:
Some Time-Space Bounds for One-Tape Deterministic Turing Machines.
FCT 1989: 297-307 |
4 | | Maciej Liskiewicz,
Krzysztof Lorys:
On Reversal Complexity for Alternating Turing Machines (Extended Abstract)
FOCS 1989: 618-623 |
1988 |
3 | | Krzysztof Lorys,
Maciej Liskiewicz:
Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.
MFCS 1988: 445-453 |
2 | | Maciej Liskiewicz,
Krzysztof Lorys:
Alternating Real-Time Computations.
Inf. Process. Lett. 28(6): 311-316 (1988) |
1987 |
1 | | Maciej Liskiewicz,
Krzysztof Lorys,
Marek Piotrów:
On Reversal Bounded Alternating Turing Machines.
Theor. Comput. Sci. 54: 331-339 (1987) |