default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrzysztof Lorys
Person information
- affiliation: University of Wroclaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j17]Grzegorz Gluch, Krzysztof Lorys
:
4/3 rectangle tiling lower bound. Inf. Process. Lett. 188: 106523 (2025)
2010 – 2019
- 2019
- [j16]Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
Online packet scheduling under adversarial errors. Theor. Comput. Sci. 795: 492-509 (2019) - 2018
- [c23]Tomasz Jurdzinski, Krzysztof Lorys, Krzysztof Nowicki:
Communication Complexity in Vertex Partition Whiteboard Model. SIROCCO 2018: 264-279 - 2017
- [c22]Pawel Garncarek, Tomasz Jurdzinski, Krzysztof Lorys:
Fault-Tolerant Online Packet Scheduling on Parallel Channels. IPDPS 2017: 347-356 - [i3]Grzegorz Gluch, Krzysztof Lorys:
4/3 Rectangle Tiling lower bound. CoRR abs/1703.01475 (2017) - 2014
- [c21]Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
Online Packet Scheduling Under Adversarial Jamming. WAOA 2014: 193-206 - 2013
- [i2]Tomasz Jurdzinski, Dariusz R. Kowalski, Krzysztof Lorys:
Online Packet Scheduling under Adversarial Jamming. CoRR abs/1310.4935 (2013)
2000 – 2009
- 2009
- [j15]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): 1612-1645 (2009) - 2007
- [j14]Tomasz Jurdzinski, Krzysztof Lorys:
Lower bound technique for length-reducing automata. Inf. Comput. 205(9): 1387-1412 (2007) - [j13]Tomasz Jurdzinski, Krzysztof Lorys:
Leftist Grammars and the Chomsky Hierarchy. Theory Comput. Syst. 41(2): 233-256 (2007) - 2006
- [j12]Piotr Krysta, Krzysztof Lorys:
Efficient approximation algorithms for the achromatic number. Theor. Comput. Sci. 361(2-3): 150-171 (2006) - 2005
- [c20]Tomasz Jurdzinski, Krzysztof Lorys:
Leftist Grammars and the Chomsky Hierarchy. FCT 2005: 293-304 - 2004
- [j11]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): 407-437 (2004) - 2003
- [j10]Krzysztof Lorys, Katarzyna E. Paluch:
New approximation algorithm for RTILE problem. Theor. Comput. Sci. 303(2-3): 517-537 (2003) - 2002
- [c19]Krzysztof Lorys, Grazyna Zwozniak:
Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs. ESA 2002: 686-697 - [c18]Tomasz Jurdzinski, Krzysztof Lorys:
Church-Rosser Languages vs. UCFL. ICALP 2002: 147-158 - 2000
- [j9]Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka:
Periodification scheme: constructing sorting networks with constant period. J. ACM 47(5): 944-967 (2000) - [c17]Krzysztof Lorys, Katarzyna E. Paluch:
Rectangle tiling. APPROX 2000: 206-213
1990 – 1999
- 1999
- [c16]Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys:
Multi-party Finite Computations. COCOON 1999: 318-329 - [c15]Piotr Krysta, Krzysztof Lorys:
Efficient Approximation Algorithms for the Achromatic Number. ESA 1999: 402-413 - [c14]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. SODA 1999: 271-280 - 1998
- [j8]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations Via Networks Simulation. Algorithmica 21(1): 2-20 (1998) - [j7]Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff:
Periodic Merging Networks. Theory Comput. Syst. 31(5): 551-578 (1998) - [c13]Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys:
Power of Cooperation and Multihead Finite Systems. ICALP 1998: 896-907 - 1996
- [c12]Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations via Networks Simulation. ESA 1996: 246-260 - [c11]Miroslaw Kutylowski, Krzysztof Lorys:
Limitations of the QRQW and EREW PRAM Models. FSTTCS 1996: 310-321 - [c10]Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff:
Periodic Merging Networks. ISAAC 1996: 336-345 - [i1]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
- [j6]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): 113-131 (1995) - [c9]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 - 1994
- [c8]Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oesterdiekhoff, Rolf Wanka:
Fast and Feasible Periodic Sorting Networks of Constant Depth. FOCS 1994: 369-380 - [c7]Gerhard Buntrock, Krzysztof Lorys:
The Variable Membership Problem: Succinctness Versus Complexity. STACS 1994: 595-606 - 1992
- [c6]Gerhard Buntrock, Krzysztof Lorys:
On Growing Context-Sensitive Languages. ICALP 1992: 77-88 - [c5]Krzysztof Lorys:
New Time Hierarchy Results for Deterministic TMs. STACS 1992: 329-336 - [c4]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
- [j5]Miroslaw Kutylowski, Maciej Liskiewicz, Krzysztof Lorys:
Reversal Complexity Classes for Alternating Turing Machines. SIAM J. Comput. 19(2): 207-221 (1990) - [j4]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)
1980 – 1989
- 1989
- [c3]Maciej Liskiewicz, Krzysztof Lorys:
Some Time-Space Bounds for One-Tape Deterministic Turing Machines. FCT 1989: 297-307 - [c2]Maciej Liskiewicz, Krzysztof Lorys:
On Reversal Complexity for Alternating Turing Machines (Extended Abstract). FOCS 1989: 618-623 - 1988
- [j3]Maciej Liskiewicz, Krzysztof Lorys:
Alternating Real-Time Computations. Inf. Process. Lett. 28(6): 311-316 (1988) - [c1]Krzysztof Lorys, Maciej Liskiewicz:
Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs. MFCS 1988: 445-453 - 1987
- [j2]Miroslaw Kutylowski, Krzysztof Lorys:
A Note on "ℰ. Math. Log. Q. 33(2): 115-121 (1987) - [j1]Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów:
On Reversal Bounded Alternating Turing Machines. Theor. Comput. Sci. 54: 331-339 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
