Logowanie

Języki

  • Polski
  • English
fotopracownik

Nawigacja

dr hab. Tomasz Jurdziński

Pracownik  

2015

  1. M. Bieńkowski, J. Byrka, T. Jurdziński, K.Chrobak, D. R. Kowalski, Provable fairness for TDMA scheduling, IEEE Conference on Computer Communications, INFOCOM 2015, Kowloon, Hong Kong, April 26 - May 1, 2015, Proceedings. - Piscataway : IEEE, 2015.- S. 1320-1327. (http://dx.doi.org/10.1109/INFOCOM.2015.7218508)
  2. T. Jurdziński, G. Stachowiak, Deterministic symmetry breaking in ring networks, 2015 IEEE 35th International Conference on Distributed Computing Systems (ICDCS 2015) ; Columbus, Ohio, USA, 29 June - 2 July 2015. - Piscataway, NJ : IEEE, 2015.- S. 517-526. (http://dx.doi.org/10.1109/ICDCS.2015.59)
  3. T. Jurdziński, M. Różański, G. Stachowiak, On setting-up asynchronous ad hoc wireless networks, 2015 IEEE Conference on Computer Communications (INFOCOM 2015) : Kowloon, Hong Kong, 26 April - 1 May 2015. - Piscataway, NJ : IEEE, 2015. - S. 2191 - 2199. (http://dx.doi.org/10.1109/INFOCOM.2015.7218605)
  4. 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)
  5. T. Jurdziński, G. Stachowiak, The cost of synchronizing multiple-access channels, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing - PODC '15 . - New York : ACM , 2015.- S. 421-430. (http://dx.doi.org/10.1145/2767386.2767439)

2014

  1. T. Jurdziński, D. Kowalski, M. Różański, G. Stachowiak, On the Impact of Geometry on Ad Hoc Communication in Wireless Networks, 33rd ACM Symposium on Principles of Distributed Computing, PODC 2014, wydane w Proceedings of the 2014 ACM symposium on Principles of distributed computing, 2014, st. 357-366. (http://dl.acm.org/citation.cfm?doid=2611462.2611487)

2013

  1. T. Jurdziński, D. R. Kowalski, G. Stachowiak, Distributed deterministic broadcasting in wireless networks of weak devices, Automata, languages, and programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8 - 12, 2013, Part II / Fedor V. Fomin, Rusinš Freivalds, Marta Kwiatkowska, David Peleg (eds.). - Berlin, Heidelberg : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.7966). - S. 632-644. (http://dx.doi.org/10.1007/978-3- 642-39212-2_55)
  2. T. Jurdziński, G. Stachowiak, Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks, Fundamentals of Computation Theory - 19th International Symposium (FCT 2013) : Springer, 2013. - (Lecture Notes in Computer Science ; Vol.8070). - s. 195-209. (http://dx.doi.org/10.1007/978-3-642-40164-0_20)
  3. T. Jurdziński, D. R. Kowalski, M. Różański, G. Stachowiak, Distributed Randomized Broadcasting in Wireless Networks under the SINR Model. Distributed Computing, 27th International Symposium (DISC 2013), : Springer 2013. - (Lecture Notes in Computer Science Volume 8205). s. 373-387. (http://dx.doi.org/10.1007/978-3-642-41527-2_26)

2012

  1. M. Bieńkowski, T. Jurdziński, M. Korzeniowski, D. R. Kowalski, Distributed Online and Stochastic Queuing on a Multiple Access Channel, 26 Int. Symposum on DIStributed Computing (DISC), Lecture Notes in Computer Science vol. 7611, 121-135, 2012. (http://www.ii.uni.wroc.pl/~mbi/papers/2012-disc-online-mac.pdf)
  2. A. Jeż, T. Jurdziński, Length-reducing Automata (almost) without Auxiliary Symbols, Journal of Automata, Languages and Combinatorics, Otto-von-Guericke-Universitat, 16(2-4): 141-164 (2011); RK.
  3. T. Jurdziński, D. R. Kowalski, Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks, Distributed Computing - 26th International Sympodium (DISC 2012), LNCS 7611, Springer, 2012, 106-120; RK.
  4. T. Jurdziński, D. R. Kowalski, On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks, 16th International Conference On Principles Of Distributed Systems (OPODIS 2012), LNCS 7702, Springer, 2012, 209-224;RK.

2011

  1. T. Jurdziński, Growing grammars and length-reducing automata, Fundamenta Informaticae, Vol. 112, nr 2-3 (2011), 193-217. (http://www.mimuw.edu.pl/~fundam/FI/previous/abs112.html#12)

2009

  1. T. Jurdziński, Probabilistic Length-Reducing Two-Pushdown Automata, Theory of Computing Systems 45(1), Springer, 2009, 74-107.

2008

  1. T. Jurdziński, Leftist Grammars Are Non-primitive Recursive, Automata, Languages and Programming, 35th International Colloquium (ICALP), Springer, 2008 51-62.
  2. T. Jurdziński, F. Mráz, F. Otto, M. Plátek, On the Complexity of 2-Monotone Restarting Automata, Theory Comput. Syst. 42(4), Springer, 2008, 488-518.
  3. T. Jurdziński, The Boolean Closure of Growing Context-Sensitive Languages, Fundamenta Informaticae, IOS Press, 2008, 89(2-3), 2008, 289-305.

2007

  1. T. Jurdziński, F. Mraz, M. Platek, Ambiguity by Restarting Automata, International Journal of Foundations of Computer Science, 18(6), 2007, 1343-1352.
  2. T. Jurdziński, F. Otto, Shrinking Restarting Automata, International Journal of Foundations of Computer Science, 18(2), 2007, 361-386.
  3. T. Jurdziński, F. Otto, Sequential monotonicity for restarting automata, RAIRO – Theoret. Informatics Appl. 41 2 (2007), 157-175.
  4. T. Jurdziński, K. Loryś, Leftist Grammars and the Chomsky Hierarchy, Theory of Computing Systems, 41(2), 233-256.
  5. T. Jurdziński, K. Loryś, Lower bound technique for length-reducing automata, Information and Computation, 205(9), 2007, 1387-1412.
  6. L. Arge, C. Cachin, T. Jurdziński, A. Tarlecki, Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings Springer 2007.
  7. T. Jurdziński, On complexity of grammars related to the safety problem, Theoretical Computer Science, 389 (1-2), 2007, 56-72.

2006

  1. T. Jurdziński, F. Mráz, F. Otto, M. Plátek, Degrees of non-monotonicity for restarting automata, Theoretical Computer Science 2006, 369: 1-34.
  2. T. Jurdziński, F. Otto, Restarting automata with restricted utilization of auxiliary symbols, Theoretical Computer Science, 363 (2), 2006, 162-181.
  3. T. Jurdziński, On Complexity of Grammars Related to the Safety Problem, 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), LNCS 4052, 2006, 432-443.
  4. T. Jurdziński, Probabilistic Length-Reducing Automata, 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), LNCS 4162, 2006, 561-572.
  5. T. Jurdziński, The Boolean Closure of Growing Context-Sensitive Languages, 10th International Conference on Developments in Language Theory (DLT 2006), LNCS 4036, 248-259.
  6. T. Jurdziński, F. Mráz, F. Otto, M. Plátek, Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata, Theoretical Computer Science 2006, 366:272-296.

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.
  2. T. Jurdziński, G. Stachowiak, Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks, Theory of Computing Systems, 38 (3), 2005, 347-367.
  3. T. Jurdziński, F. Otto, Shrinking Restarting Automata, 30th International Symposium on Mathematical Foundations of Computer Science (MFCS 2005), LNCS 3618, 2005, 532-543.
  4. T. Jurdziński, F. Mraz, F. Otto, M. Platek, Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols, Proceedings of 9th International Conference on Developments in Language Theory (DLT'05), LNCS 3572, 2005, 284-295.
  5. T. Jurdziński, M. Kutyłowski, J. Zatopiański, Efficient Simulation of Synchronous Systems by Multi-speed Systems, RAIRO Theoretical Informatics and Applications, 39, 2005, 401-417.
  6. T. Jurdziński, F. Mraz, F. Otto, M. Platek, Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars, Fundamenta Informaticae, 64 (1-4), 2005, 217-228.

2004

  1. T. Jurdziński, F. Mraz, F. Otto, M. Platek, On the Complexity of 2-Monotone Restarting Automata, Proceedings of the 8th International Conference on Developments in Language Theory (DLT'04), Lecture Notes in Computer Science 3340, 2004, 237-248.
  2. T. Jurdziński, F. Mraz, F. Otto, M. Platek, On Left-Monotone Deterministic Restarting Automata, Proceedings of the 8th International Conference on Developments in Language Theory (DLT'04), Lecture Notes in Computer Science 3340, 2004, 249-260.

2003

  1. A. Goerdt, T. Jurdziński, Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures, Combinatorics, Probability and Computing (2003) 1, Cambridge University Press; str. 245-267.
  2. T. Jurdziński, M. Kutyłowski, J. Zatopiański, Weak communication in single-hop radio networks: adjusting algorithms to industrial standards, Concurrency and Computation: practice and experience; wydawca: John Wiley & Sons, Ltd, Vol. 15, Issue 11-12, (September 2003), str. 1117-1131.

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. T. Jurdziński, M. Kutyłowski, J. Zatopiański, Energy-Efficient Size Approximation of Radio Networks with No Collision Detection, LNCS 2387, Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, 279-289.
  3. T. Jurdziński, M. Kutyłowski, J. Zatopiański, Weak Communication in Radio Networks, LNCS 2400, Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference, 965-972.
  4. T. Jurdziński, M. Kutyłowski, J. Zatopiański, Efficient algorithms for leader election in radio networks, ACM Press, Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 51-57.
  5. T. Jurdziński, G. Stachowiak, Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks, LNCS 2518, Algorithms and Computation, 13th International Symposium, ISAAC 2002, 535-549.
  6. A. Goerdt, T. Jurdziński, Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures, LNCS 2420, Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, 280-291.

2001

  1. T. Jurdziński, M. Kutyłowski, P. Rzechonek, J. Zatopiański, Communication Complexity for Multi-speed Cooperating Automata, I Conference for Young Mathematicians, Applied Mathematics – Karpacz 2001.
  2. T. Jurdziński, M. Kutyłowski, Communication Gap for Finite Memory Devices, ICALP 2001, Lecture Notes in Computer Science 2076, Springer 2001, 1052-1064.

1999

  1. 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.

1998

  1. 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.

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