Krzysztof Lorys

Publication Activity (10 Years)

Years Active: 1987-2019
Publications (10 Years): 4

Top Topics

Branch And Bound

Super Resolution

Packet Scheduling

Top Venues

Theor. Comput. Sci.

Publications

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