Krzysztof Lorys - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2019

Online packet scheduling under adversarial errorsPawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys. TCS, 795:492-509, 2019. [doi]

2018

Communication Complexity in Vertex Partition Whiteboard ModelTomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki 0002. sirocco 2018: 264-279 [doi]

2017

Fault-Tolerant Online Packet Scheduling on Parallel ChannelsPawel Garncarek, Tomasz Jurdzinski, Krzysztof Lorys. ipps 2017: 347-356 [doi]

2014

Online Packet Scheduling Under Adversarial JammingTomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys. waoa 2015: 193-206 [doi]

2009

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree NetworksJuraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener. siamdm, 23(3):1612-1645, 2009. [doi]

2007

Leftist Grammars and the Chomsky HierarchyTomasz Jurdzinski, Krzysztof Lorys. mst, 41(2):233-256, 2007. [doi]

Lower bound technique for length-reducing automataTomasz Jurdzinski, Krzysztof Lorys. iandc, 205(9):1387-1412, 2007. [doi]

2006

Efficient approximation algorithms for the achromatic numberPiotr Krysta, Krzysztof Lorys. TCS, 361(2-3):150-171, 2006. [doi]

2005

Leftist Grammars and the Chomsky HierarchyTomasz Jurdzinski, Krzysztof Lorys. fct 2005: 293-304 [doi]

2003

New approximation algorithm for RTILE problemKrzysztof Lorys, Katarzyna E. Paluch. TCS, 2-3(303):517-537, 2003. [doi]

2002

Church-Rosser Languages vs. UCFLTomasz Jurdzinski, Krzysztof Lorys. icalp 2002: 147-158 [doi]

Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic GraphsKrzysztof Lorys, Grazyna Zwozniak. esa 2002: 686-697 [doi]

2000

Periodification scheme: constructing sorting networks with constant periodMiroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka. JACM, 47(5):944-967, 2000. [doi]

Rectangle tilingKrzysztof Lorys, Katarzyna E. Paluch. approx 2000: 206-213 [doi]

1999

Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic ProcessesArtur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys. soda 1999: 271-280 [doi]

Multi-party Finite ComputationsTomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys. cocoon 1999: 318-329 [doi]

Efficient Approximation Algorithms for the Achromatic NumberPiotr Krysta, Krzysztof Lorys. esa 1999: 402-413 [doi]

1998

Fast Generation of Random Permutations Via Networks SimulationArtur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys. algorithmica, 21(1):2-20, 1998.

Power of Cooperation and Multihead Finite SystemsPavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys. icalp 1998: 896-907 [doi]

Periodic Merging NetworksMiroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff. mst, 31(5):551-578, 1998. [doi]

1996

Fast Generation of Random Permutations via Networks SimulationArtur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys. esa 1996: 246-260

Periodic Merging NetworksMiroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff. isaac 1996: 336-345

Limitations of the QRQW and EREW PRAM ModelsMiroslaw Kutylowski, Krzysztof Lorys. fsttcs 1996: 310-321

1995

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMsFaith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde. cc, 5(2):113-131, 1995.

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree NetworksJuraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener. STACS 1995: 255-266

1994

The Variable Membership Problem: Succinctness Versus ComplexityGerhard Buntrock, Krzysztof Lorys. STACS 1994: 595-606

Fast and Feasible Periodic Sorting Networks of Constant DepthMiroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka. focs 1994: 369-380

1992

On Growing Context-Sensitive LanguagesGerhard Buntrock, Krzysztof Lorys. icalp 1992: 77-88

Retrieval of scattered information by EREW, CREW and CRCW PRAMsFaith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde. swat 1992: 30-41

New Time Hierarchy Results for Deterministic TMsKrzysztof Lorys. STACS 1992: 329-336

1990

Reversal Complexity Classes for Alternating Turing MachinesMiroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys. SICOMP, 19(2):207-221, 1990.

Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded OnesMaciej Liskiewicz, Krzysztof Lorys. SICOMP, 19(3):511-521, 1990.

1989

Some Time-Space Bounds for One-Tape Deterministic Turing MachinesMaciej Liskiewicz, Krzysztof Lorys. fct 1989: 297-307

On Reversal Complexity for Alternating Turing Machines (Extended Abstract)Maciej Liskiewicz, Krzysztof Lorys. focs 1989: 618-623

1988

Alternating Real-Time ComputationsMaciej Liskiewicz, Krzysztof Lorys. ipl, 28(6):311-316, 1988.

Two Applications of Fürer s Counter to One-Tape Nondeterministic TMsKrzysztof Lorys, Maciej Liskiewicz. mfcs 1988: 445-453

1987

A Note on "ℰMiroslaw Kutylowski, Krzysztof Lorys. mlq, 33(2):115-121, 1987. [doi]

On Reversal Bounded Alternating Turing MachinesMaciej Liskiewicz, Krzysztof Lorys, Marek Piotrów. TCS, 54:331-339, 1987.

Sign in or sign up to see more results.

runs on WebDSL