Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

prof. Krzysztof Loryś

Pracownik  

2015

  1. T. Jurdziński, D. R. Kowalski, K. Loryś, Online packet scheduling under adversarial jamming, Approximation and Online Algorithms : 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014. - Cham : Springer International Publishing, 2015. - (Lecture Notes in Computer Science ; 8952). - S. 193-206. (http://dx.doi.org/10.1007/978-3-319-18263-6_17)

2009

  1. J. Hromkovic, P. Kanarek, R. Klasing, K. Loryś, W. Unger, H. Wagener, On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks, SIAM Journal on Discrete Mathematics, Volume 23, 1612-1645, 2009. (http://www.informatik.uni-trier.de/~ley/db/journals/siamdm/siamdm23.html#HromkovicKKLUW09)

2007

  1. T. Jurdziński, K. Loryś, Leftist Grammars and the Chomsky Hierarchy, Theory of Computing Systems, 41(2), 233-256.
  2. T. Jurdziński, K. Loryś, Lower bound technique for length-reducing automata, Information and Computation, 205(9), 2007, 1387-1412.

2006

  1. P. Krysta, K. Loryś, Efficient approximation algorithms for the achromatic number, Theoretical Computer Science 361(2-3), 2006, 150-171.

2005

  1. T. Jurdziński, K. Loryś, Leftist Grammars and the Chomsky Hierarchy, Proceedings of 15th International Symposium Fundamentals of Computation Theory (FCT'05), LNCS 3623, 2005, 282-293.

2003

  1. K. Loryś, K. Paluch, New approximation algorithm for RTILE problem, Theoretical Computer Science, Vol 303/2-3, 2003, pp 517-537.

2002

  1. T. Jurdziński, K. Loryś, Church-Rosser Languages vs. UCFL, LNCS 2380,Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, 147-158.
  2. K. Loryś, G. Zwoźniak, Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs, 10th Annual European Symposium on Algorithms, Rome, Italy, September 17-21, 2002. Proceedings, 2002, 686-697, Springer, Lecture Notes in Computer Science 2461.

2001

  1. A. Czumaj, P. Kanarek, M. Kutyłowski, K. Loryś, Switching Networks for Generating Random Permutations (red. D. Z. Du, H. Q. Ngo), Switching Networks: Recent Advances, Kluwer, 2001.
  2. P. Kanarek, K. Loryś, Periodic Shifting Networks (red. D. Z. Du, H. Q. Ngo), Switching Networks: Recent Advances, Kluwer, 2001.

2000

  1. M. Kutyłowski, K. Loryś, B. Oesterdiekhoff, R. Wanka, Periodification scheme: constructing sorting networks with constant period, Journal of the ACM, 47(5), 2000, pp. 944-967.
  2. K. Loryś, K. Paluch, Rectangle Tiling, Proc. 3rd Intern. Workshop. APPROX 2000, Lecture Notes in Computer Science, vol. 1913, (Springer, Berlin, 2000), 206-213.

1999

  1. A. Czumaj, P. Kanarek, M. Kutyłowski, K. Loryś, Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes, Proc. of 10th ACM-SIAM Symposium on Discrete Algorithms '99, 271-280.
  2. T. Jurdziński, M. Kutyłowski, K. Loryś, Multiparty Finite Computations, Proceedings of 5th Annual International Conference: Computing and Combinatorics, COCOON'99; Lecture Notes in Computer Science, 1627, 318-329.
  3. P. Krysta, K. Loryś, Efficient Approximation Algorithms for the Achromatic Number, Proc. 7th European Symposium on Algorithms ESA'99, Springer, LNCS 1643.

1998

  1. A. Czumaj, P. Kanarek, M. Kutyłowski, K. Loryś, Fast generation of random permutations via network simulation, Algorithmica 21 (1998), 2-20.
  2. P. Duris, T. Jurdziński, M. Kutyłowski, K. Loryś, Power of cooperation and multihead finite systems, Proceedings ICALP'98, Lecture Notes in Computer Science 1443, Springer, Berlin 1998, 896-907.
  3. M. Kutyłowski, K. Loryś, B. Oesterdiekhoff, Periodic merging networks, Theory of Computing Systems 31 (1998), 551-578.

1996

  1. A. Czumaj, P. Kanarek, M. Kutyłowski, K. Loryś, Fast generation of random permutations via network simulation, Proc. 4th Annual European Symposium on Algorithms, Barcelona, Spain, September'96, Lecture Notes in Computer Science 1136, Springer, Berlin 1996, 246-260.
  2. M. Kutyłowski, K. Loryś, B. Oesterdiekhoff, Periodic merging networks, Proc. 7th International Symposium on Algorithms and Computation, Osaka 1996, Lecture Notes in Computer Science 1178, Springer, Berlin 1996, 336-345.
  3. M. Kutyłowski, K. Loryś, Limitations of the QRQW and EREW PRAM models, Proc. 16th Conference on Software Technology and Theoretical Computer Science, Hyderabad, 1996, Lecture Notes in Computer Science, Springer 1180, Berlin 1996, 310-321.

1995

  1. J. Hromkovivc, P. Kanarek, R. Klassing, K. Loryś, W. Unger, H. Wagener, On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks (red. E. W. Mayr, C. Puech), Symposium on Theoretical Aspects of Computer Science'95, Lecture Notes in Computer Science, vol. 900, Springer, Berlin 1995, 255-266.

1994

  1. M. Kutyłowski, K. Loryś, B. Oesterdiekoff, R. Wanka, Fast and feasible periodic sorting networks of constant depth, Proc. 35th IEEE Symposium on Foundations of Computer Science (FOCS), 1994, 369-380.
  2. G. Buntrock, K. Loryś, The variable membership problem: succinctness versus complexity, Proc. 11th Symposium on Theoretical Aspects of Computer Science (STACS), France, February'94, Proceedings, Lecture Notes in Computer Science 775, Springer-Verlag, 1994, 595-606.

Adres:
Instytut Informatyki
Uniwersytetu Wroclawskiego
ul. Joliot-Curie 15
50-383 Wroclaw
Sekretariat
tel.: 71 375 7800
tel.: 71 325 1271
fax: 71 375 7801
sekretariat@ii.uni.wroc.pl
Dziekanat
tel.: 71 375 7892
dziekan@ii.uni.wroc.pl
sprawy studenckie:
dziekanat@ii.uni.wroc.pl
Portiernia
tel.: 71 375 7958
Redaktor strony WWW
redaktor@ii.uni.wroc.pl
Projekt
MAKOS