Tomasz Jurdzinski

	2008
37		Tomasz Jurdzinski: Leftist Grammars Are Non-primitive Recursive. ICALP (2) 2008: 51-62
36		Tomasz Jurdzinski: The Boolean Closure of Growing Context-Sensitive Languages. Fundam. Inform. 89(2-3): 289-305 (2008)
35		Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek: On the Complexity of 2-Monotone Restarting Automata. Theory Comput. Syst. 42(4): 488-518 (2008)
	2007
34		Lars Arge, Christian Cachin, Tomasz Jurdzinski, Andrzej Tarlecki: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings Springer 2007
33		Tomasz Jurdzinski, Friedrich Otto: Sequential monotonicity for restarting automata. ITA 41(2): 157-175 (2007)
32		Tomasz Jurdzinski, Krzysztof Lorys: Lower bound technique for length-reducing automata. Inf. Comput. 205(9): 1387-1412 (2007)
31		Tomasz Jurdzinski, Friedrich Otto: Shrinking Restarting Automata. Int. J. Found. Comput. Sci. 18(2): 361-385 (2007)
30		Frantisek Mráz, Martin Plátek, Tomasz Jurdzinski: Ambiguity by Restarting Automata. Int. J. Found. Comput. Sci. 18(6): 1343-1352 (2007)
29		Tomasz Jurdzinski: On complexity of grammars related to the safety problem. Theor. Comput. Sci. 389(1-2): 56-72 (2007)
28		Tomasz Jurdzinski, Krzysztof Lorys: Leftist Grammars and the Chomsky Hierarchy. Theory Comput. Syst. 41(2): 233-256 (2007)
	2006
27		Tomasz Jurdzinski: The Boolean Closure of Growing Context-Sensitive Languages. Developments in Language Theory 2006: 248-259
26		Tomasz Jurdzinski: On Complexity of Grammars Related to the Safety Problem. ICALP (2) 2006: 432-443
25		Tomasz Jurdzinski: Probabilistic Length-Reducing Automata. MFCS 2006: 561-572
24		Tomasz Jurdzinski, Friedrich Otto: Restarting automata with restricted utilization of auxiliary symbols. Theor. Comput. Sci. 363(2): 162-181 (2006)
23		Frantisek Mráz, Friedrich Otto, Martin Plátek, Tomasz Jurdzinski: Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata. Theor. Comput. Sci. 366(3): 272-296 (2006)
22		Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek: Degrees of non-monotonicity for restarting automata. Theor. Comput. Sci. 369(1-3): 1-34 (2006)
	2005
21		Tomasz Jurdzinski, Friedrich Otto: Restricting the Use of Auxiliary Symbols for Restarting Automata. CIAA 2005: 176-187
20		Tomasz Jurdzinski, Frantisek Mráz, Friedrich Otto, Martin Plátek: Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols. Developments in Language Theory 2005: 284-295
19		Tomasz Jurdzinski, Krzysztof Lorys: Leftist Grammars and the Chomsky Hierarchy. FCT 2005: 293-304
18		Tomasz Jurdzinski, Friedrich Otto: Shrinking Restarting Automata. MFCS 2005: 532-543
17		Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek: Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars. Fundam. Inform. 64(1-4): 217-228 (2005)
16		Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski: Efficient simulation of synchronous systems by multi-speed systems. ITA 39(2): 403-419 (2005)
15		Tomasz Jurdzinski, Grzegorz Stachowiak: Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks. Theory Comput. Syst. 38(3): 347-367 (2005)
	2004
14		Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek: On the Complexity of 2-Monotone Restarting Automata. Developments in Language Theory 2004: 237-248
13		Tomasz Jurdzinski, Friedrich Otto, Frantisek Mráz, Martin Plátek: On Left-Monotone Deterministic Restarting Automata. Developments in Language Theory 2004: 249-260
	2003
12		Andreas Goerdt, Tomasz Jurdzinski: Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures. Combinatorics, Probability & Computing 12(3): (2003)
11		Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski: Weak communication in single-hop radio networks: adjusting algorithms to industrial standards. Concurrency and Computation: Practice and Experience 15(11-12): 1117-1131 (2003)
	2002
10		Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski: Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. COCOON 2002: 279-289
9		Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski: Weak Communication in Radio Networks. Euro-Par 2002: 965-972
8		Tomasz Jurdzinski, Krzysztof Lorys: Church-Rosser Languages vs. UCFL. ICALP 2002: 147-158
7		Tomasz Jurdzinski, Grzegorz Stachowiak: Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. ISAAC 2002: 535-549
6		Andreas Goerdt, Tomasz Jurdzinski: Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. MFCS 2002: 280-291
5		Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski: Efficient algorithms for leader election in radio networks. PODC 2002: 51-57
	2001
4		Tomasz Jurdzinski, Miroslaw Kutylowski: Communication Gap for Finite Memory Devices. ICALP 2001: 1052-1064
3		Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski: Communication Complexity for Asynchronous Systems of Finite Devices. IPDPS 2001: 139
	1999
2		Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys: Multi-party Finite Computations. COCOON 1999: 318-329
	1998
1		Pavol Duris, Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys: Power of Cooperation and Multihead Finite Systems. ICALP 1998: 896-907

Coauthor Index

1	Lars Arge	[34]
2	Christian Cachin	[34]
3	Pavol Duris	[1]
4	Andreas Goerdt	[6] [12]
5	Miroslaw Kutylowski	[1] [2] [3] [4] [5] [9] [10] [11] [16]
6	Krzysztof Lorys	[1] [2] [8] [19] [28] [32]
7	Frantisek Mráz	[13] [14] [17] [20] [22] [23] [30] [35]
8	Friedrich Otto	[13] [14] [17] [18] [20] [21] [22] [23] [24] [31] [33] [35]
9	Martin Plátek	[13] [14] [17] [20] [22] [23] [30] [35]
10	Grzegorz Stachowiak	[7] [15]
11	Andrzej Tarlecki	[34]
12	Jan Zatopianski	[3] [5] [9] [10] [11] [16]

Colors in the list of coauthors