Krzysztof Lorys

43 papers A* 6A 7B 6Misc 1Journal 20Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
4/3 rectangle tiling lower bound.
Inf. Process. Lett.
Grzegorz Gluch, Krzysztof Lorys
2019 J jnl
Online packet scheduling under adversarial errors.
Theor. Comput. Sci.
Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys
2018 B conf
Communication Complexity in Vertex Partition Whiteboard Model.
SIROCCO
Tomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki
2017 J jnl
4/3 Rectangle Tiling lower bound.
CoRR
Grzegorz Gluch, Krzysztof Lorys
2017 A conf
Fault-Tolerant Online Packet Scheduling on Parallel Channels.
IPDPS
Pawel Garncarek, Tomasz Jurdzinski, Krzysztof Lorys
2014 B conf
Online Packet Scheduling Under Adversarial Jamming.
WAOA
Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys
2013 J jnl
Online Packet Scheduling under Adversarial Jamming.
CoRR
Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys
2009 J jnl
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discret. Math.
Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener
2007 J jnl
Leftist Grammars and the Chomsky Hierarchy.
Theory Comput. Syst.
Tomasz Jurdzinski, Krzysztof Lorys
2007 J jnl
Lower bound technique for length-reducing automata.
Inf. Comput.
Tomasz Jurdzinski, Krzysztof Lorys
2006 J jnl
Efficient approximation algorithms for the achromatic number.
Theor. Comput. Sci.
Piotr Krysta, Krzysztof Lorys
2005 B conf
Leftist Grammars and the Chomsky Hierarchy.
FCT
Tomasz Jurdzinski, Krzysztof Lorys
2004 J jnl
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.
J. Autom. Lang. Comb.
Tomasz Jurdzinski, Krzysztof Lorys, Gundula Niemann, Friedrich Otto
2003 J jnl
New approximation algorithm for RTILE problem.
Theor. Comput. Sci.
Krzysztof Lorys, Katarzyna E. Paluch
2002 A conf
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs.
ESA
Krzysztof Lorys, Grazyna Zwozniak
2002 A* conf
Church-Rosser Languages vs. UCFL.
ICALP
Tomasz Jurdzinski, Krzysztof Lorys
2000 J jnl
Periodification scheme: constructing sorting networks with constant period.
J. ACM
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka
2000 — conf
Rectangle tiling.
APPROX
Krzysztof Lorys, Katarzyna E. Paluch
1999 A* conf
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
SODA
Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1999 A conf
Efficient Approximation Algorithms for the Achromatic Number.
ESA
Piotr Krysta, Krzysztof Lorys
1999 Misc conf
Multi-party Finite Computations.
COCOON
Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys
1998 J jnl
Fast Generation of Random Permutations Via Networks Simulation.
Algorithmica
Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1998 J jnl
Periodic Merging Networks.
Theory Comput. Syst.
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff
1998 A* conf
Power of Cooperation and Multihead Finite Systems.
ICALP
Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys
1996 J jnl
Fast Generation of Random Permutations via Networks Simulation
Universität Trier, Mathematik/Informatik, Forschungsbericht
Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1996 A conf
Fast Generation of Random Permutations via Networks Simulation.
ESA
Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
1996 — conf
Limitations of the QRQW and EREW PRAM Models.
FSTTCS
Miroslaw Kutylowski, Krzysztof Lorys
1996 B conf
Periodic Merging Networks.
ISAAC
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff
1995 A conf
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
STACS
Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener
1995 J jnl
Retrieval of Scattered Information by EREW, CREW, and CRCW PRAMs.
Comput. Complex.
Faith E. Fich, Miroslaw Kowaluk, Miroslaw Kutylowski, Krzysztof Lorys, Prabhakar Ragde
1994 A* conf
Fast and Feasible Periodic Sorting Networks of Constant Depth
FOCS
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka
1994 A conf
The Variable Membership Problem: Succinctness Versus Complexity.
STACS
Gerhard Buntrock, Krzysztof Lorys
1992 A conf
New Time Hierarchy Results for Deterministic TMs.
STACS
Krzysztof Lorys
1992 A* conf
On Growing Context-Sensitive Languages.
ICALP
Gerhard Buntrock, Krzysztof Lorys
1992 — conf
Retrieval of scattered information by EREW, CREW and CRCW PRAMs.
SWAT
Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
1990 J jnl
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones.
SIAM J. Comput.
Maciej Liskiewicz, Krzysztof Lorys
1990 J jnl
Reversal Complexity Classes for Alternating Turing Machines.
SIAM J. Comput.
Miroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys
1989 A* conf
On Reversal Complexity for Alternating Turing Machines (Extended Abstract)
FOCS
Maciej Liskiewicz, Krzysztof Lorys
1989 B conf
Some Time-Space Bounds for One-Tape Deterministic Turing Machines.
FCT
Maciej Liskiewicz, Krzysztof Lorys
1988 J jnl
Alternating Real-Time Computations.
Inf. Process. Lett.
Maciej Liskiewicz, Krzysztof Lorys
1988 B conf
Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs.
MFCS
Krzysztof Lorys, Maciej Liskiewicz
1987 J jnl
A Note on "ℰ.
Math. Log. Q.
Miroslaw Kutylowski, Krzysztof Lorys
1987 J jnl
On Reversal Bounded Alternating Turing Machines.
Theor. Comput. Sci.
Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów