Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("JURDZINSKI, Tomasz")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 18 of 18

  • Page / 1
Export

Selection :

  • and

On complexity of grammars related to the safety problemJURDZINSKI, Tomasz.Theoretical computer science. 2007, Vol 389, Num 1-2, pp 56-72, issn 0304-3975, 17 p.Article

On Complexity of Grammars Related to the Safety ProblemJURDZINSKI, Tomasz.Lecture notes in computer science. 2006, pp 432-443, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Sequential monotonicity for restarting automataJURDZINSKI, Tomasz; OTTO, Friedrich.Informatique théorique et applications (Imprimé). 2007, Vol 41, Num 2, pp 157-175, issn 0988-3754, 19 p.Article

Lower bound technique for length-reducing automataJURDZINSKI, Tomasz; LORYS, Krzysztof.Information and computation (Print). 2007, Vol 205, Num 9, pp 1387-1412, issn 0890-5401, 26 p.Article

Shrinking restarting automataJURDZINSKI, Tomasz; OTTO, Friedrich.Lecture notes in computer science. 2005, pp 532-543, issn 0302-9743, isbn 3-540-28702-7, 12 p.Conference Paper

Restarting automata with restricted utilization of auxiliary symbolsJURDZINSKI, Tomasz; OTTO, Friedrich.Theoretical computer science. 2006, Vol 363, Num 2, pp 162-181, issn 0304-3975, 20 p.Article

Probabilistic length-reducing automataJURDZINSKI, Tomasz.Lecture notes in computer science. 2006, pp 561-572, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 12 p.Conference Paper

Efficient simulation of synchronous systems by multi-speed systemsJURDZINSKI, Tomasz; KUTYŁOWSKI, Mirosław; ZATOPIANSKI, Jan et al.Informatique théorique et applications (Imprimé). 2005, Vol 39, Num 2, pp 403-419, issn 0988-3754, 17 p.Article

The boolean closure of growing context-sensitive languagesJURDZINSKI, Tomasz.Lecture notes in computer science. 2006, pp 248-259, issn 0302-9743, isbn 3-540-35428-X, 1Vol, 12 p.Conference Paper

Leftist grammars and the chomsky hierarchyJURDZINSKI, Tomasz; LORYS, Krzysztof.Lecture notes in computer science. 2005, pp 293-304, issn 0302-9743, isbn 3-540-28193-2, 12 p.Conference Paper

Probabilistic algorithms for the wakeup problem in single-hop radio networksJURDZINSKI, Tomasz; STACHOWIAK, Grzegorz.Lecture notes in computer science. 2002, pp 535-549, issn 0302-9743, isbn 3-540-00142-5, 15 p.Conference Paper

Restricting the Use of Auxiliary Symbols for Restarting AutomataJURDZINSKI, Tomasz; OTTO, Friedrich.Lecture notes in computer science. 2006, pp 176-187, issn 0302-9743, isbn 3-540-31023-1, 1Vol, 12 p.Conference Paper

Weak communication in radio networksJURDZINSKI, Tomasz; KUTYŁOWSKI, Miroslaw; ZATOPIANSKI, Jan et al.Lecture notes in computer science. 2002, pp 965-972, issn 0302-9743, isbn 3-540-44049-6, 8 p.Conference Paper

Energy-efficient size approximation of radio networks with no collision detectionJURDZINSKI, Tomasz; KUTYLOWSKI, Miroslaw; ZATOPIANSKI, Jan et al.Lecture notes in computer science. 2002, pp 279-289, issn 0302-9743, isbn 3-540-43996-X, 11 p.Conference Paper

Communication gap for finite memory devicesJURDZINSKI, Tomasz; KUTYŁOWSKI, Mirosław.Lecture notes in computer science. 2001, pp 1052-1064, issn 0302-9743, isbn 3-540-42287-0Conference Paper

Some results on random unsatisfiable k-Sat instances and approximation algorithms applied to random structuresGOERDT, Andreas; JURDZINSKI, Tomasz.Lecture notes in computer science. 2002, pp 280-291, issn 0302-9743, isbn 3-540-44040-2, 12 p.Conference Paper

Monotone deterministic RL-automata Don't need auxiliary symbolsJURDZINSKI, Tomasz; MRAZ, Frantisek; OTTO, Friedrich et al.Lecture notes in computer science. 2005, pp 284-295, issn 0302-9743, isbn 3-540-26546-5, 12 p.Conference Paper

Church-Rosser Languages vs. UCFLJURDZINSKI, Tomasz; LORYS, Krzysztof.Lecture notes in computer science. 2002, pp 147-158, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

  • Page / 1