Logowanie

Języki

  • Polski
  • English

publikacje w roku  

Zakład Teorii Informatyki - 1996

  1. W. Charatonik, A. Podelski, The independence property of a class set constraints, Proc. of the Conference on Principles and Practice of Constraint Programming, Cambridge, USA, 1996, Lecture Notes in Computer Science 1118, Springer, 76-90.
  2. A. Kościelski, L. Pacholski, Complexity of Makanin's algorithm, Journal of the Association for Computing Machinery, 43 (1996), 670-684.
  3. 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.
  4. 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.
  5. 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.
  6. M. Kutyłowski, T. Wierzbicki, Approximate compaction and padded sorting on exclusive write PRAMs, International Parallel Processing Symposium, Proceedings, Honolulu, USA, April'96, IEEE Press 1996, 174-181.
  7. J. Marcinkowski, Undecidability of uniform boundedness for single rule DATALOG programs, Proc. 11th Annual IEEE Symposium on Logic in Comp. Sc., IEEE Press, 1996, 13-24.
  8. J. Marcinkowski, The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG programs, Proc. 13th STACS, Lecture Notes in Computer Science 1046, Springer, Berlin 1996, 427-438.
  9. 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.
  10. Z. J. Czech, G. Havas, B. S. Majewski, N. C. Wormald, A family of prefect hashing methods, The Computer Journal 39 (1996), 547-554.
  11. Z. J. Czech, G. Havas, B.S. Majewski, N.C. Wormald, A family of perfect hashing methods, The Computer Journal 39 (1996), 547-554.
  12. Z. J. Czech, W. Mikanik, Randomized PRAM simulation using T9000 transputers, Proc. of the International Conf. on High-Performance Computing and Networking (HPCN), Brussels, Belgium, April 1996; Lectures Notes in Computer Science 1067, Springer, 1996, 736-743.
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