Krzysztof Lorys

According to our database, Krzysztof Lorys authored at least 35 papers between 1987 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

4/3 rectangle tiling lower bound.

Grzegorz Gluch, Krzysztof Lorys

Inf. Process. Lett., 2025

2019

Online packet scheduling under adversarial errors.

Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys

Theor. Comput. Sci., 2019

2018

Communication Complexity in Vertex Partition Whiteboard Model.

Tomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki

Proceedings of the Structural Information and Communication Complexity, 2018

2017

Fault-Tolerant Online Packet Scheduling on Parallel Channels.

Pawel Garncarek, Tomasz Jurdzinski, Krzysztof Lorys

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2014

Online Packet Scheduling Under Adversarial Jamming.

Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2009

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener

SIAM J. Discret. Math., 2009

2007

Leftist Grammars and the Chomsky Hierarchy.

Tomasz Jurdzinski, Krzysztof Lorys

Theory Comput. Syst., 2007

Lower bound technique for length-reducing automata.

Tomasz Jurdzinski, Krzysztof Lorys

Inf. Comput., 2007

2006

Efficient approximation algorithms for the achromatic number.

Piotr Krysta, Krzysztof Lorys

Theor. Comput. Sci., 2006

2004

Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.

Tomasz Jurdzinski, Krzysztof Lorys, Gundula Niemann, Friedrich Otto

J. Autom. Lang. Comb., 2004

2003

New approximation algorithm for RTILE problem.

Krzysztof Lorys, Katarzyna E. Paluch

Theor. Comput. Sci., 2003

2002

Church-Rosser Languages vs. UCFL.

Tomasz Jurdzinski, Krzysztof Lorys

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs.

Krzysztof Lorys, Grazyna Zwozniak

Proceedings of the Algorithms, 2002

2000

Periodification scheme: constructing sorting networks with constant period.

Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka

J. ACM, 2000

Rectangle tiling.

Krzysztof Lorys, Katarzyna E. Paluch

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.

Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Multi-party Finite Computations.

Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Periodic Merging Networks.

Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff

Theory Comput. Syst., 1998

Fast Generation of Random Permutations Via Networks Simulation.

Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys

Algorithmica, 1998

Power of Cooperation and Multihead Finite Systems.

Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1996

Limitations of the QRQW and EREW PRAM Models.

Miroslaw Kutylowski, Krzysztof Lorys

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

1995

Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.

Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde

Comput. Complex., 1995

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener

Proceedings of the STACS 95, 1995

1994

The Variable Membership Problem: Succinctness Versus Complexity.

Gerhard Buntrock, Krzysztof Lorys

Proceedings of the STACS 94, 1994

Fast and Feasible Periodic Sorting Networks of Constant Depth

Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1992

New Time Hierarchy Results for Deterministic TMs.

Krzysztof Lorys

Proceedings of the STACS 92, 1992

On Growing Context-Sensitive Languages.

Gerhard Buntrock, Krzysztof Lorys

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1990

Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones.

Maciej Liskiewicz, Krzysztof Lorys

SIAM J. Comput., 1990

Reversal Complexity Classes for Alternating Turing Machines.

Miroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys

SIAM J. Comput., 1990

1989

On Reversal Complexity for Alternating Turing Machines (Extended Abstract)

Maciej Liskiewicz, Krzysztof Lorys

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Some Time-Space Bounds for One-Tape Deterministic Turing Machines.

Maciej Liskiewicz, Krzysztof Lorys

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Alternating Real-Time Computations.

Maciej Liskiewicz, Krzysztof Lorys

Inf. Process. Lett., 1988

Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.

Krzysztof Lorys, Maciej Liskiewicz

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

On Reversal Bounded Alternating Turing Machines.

Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów

Theor. Comput. Sci., 1987

A Note on "ℰ.

Miroslaw Kutylowski, Krzysztof Lorys

Math. Log. Q., 1987