Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

dr hab. Marek Piotrów

Pracownik  

2015

  1. M. Karpiński, M. Piotrów, Smaller selection networks for cardinality constraints encoding, Principles and Practice of Constraint Programming : 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings / Gilles Pesant (ed.). - Cham : Springer International Publishing , 2015. - (Lecture Notes in Computer Science ; 9255).- S. 210-225. (http://dx.doi.org/10.1007/978-3-319-23219-5_16)

2004

  1. M. Piotrów, Depth optimal sorting networks resistant to k Passive Faults, SIAM Journal on Computing, 33, 2004, 1484-1512.

2002

  1. M. Piotrów, A Note on Constructing Binary Heaps with Periodic Networks, Information Processing Letters 83 (2002), 129-134.

2001

  1. M. Piotrów, Periodic Random-Fault-Tolerant Correction Networks, Proc. 13th ACM Symposium on Parallel Algorithms and Architectures, Association for Computing Machinery, 2001, 298-305.

2000

  1. K. Diks, P. Donejko, A. Pelc, M. Piotrów, Reliable minimum finding comparator networks, Fundamenta Informaticae, 42, (2000) 235-249, IOS Press.

1999

  1. M. Kik, M. Kutyłowski, M. Piotrów, Correction Networks, Proc. 1999 International Conference on Parallel Processing, IEEE Computer Society, California 1999, pp. 40-47.

1997

  1. A. Czumaj, L. Gąsieniec, M. Piotrów, W. Rytter, Sequential and parallel approximation of shortest superstrings, Journal of Algorithms 23 (1997), 74-100.

1996

  1. M. Piotrów, Depth optimal sorting networks resistant to k passive faults, Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery, Society for Industrial and Applied Mathematics, 1996, 242-251.

1994

  1. A. Czumaj, L. Gąsieniec, M. Piotrów, W. Rytter, Parallel and Sequential Approximation of Shortest Superstrings, Proc. 4th Scandinavian Workshop on Algorithm Theory (SWAT), (July 1994, Aarhus, Denmark), Lecture Notes in Computer Science 824, Springer-Verlag, 1994, 95-106.
  2. K. Diks, P. Donejko, A. Pelc, M. Piotrów, Reliable minimum finding comparator networks, Proc. 19th International Symposium on Mathematical Foundations of Computer Science (MFCS) (August 1994, Kosice, Slovakia), Lecture Notes in Computer Science 841, Springer-Verlag, 1994, 306-315.

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