Tomasz Jurdzinski

According to our database1, Tomasz Jurdzinski authored at least 76 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Token traversal in ad hoc wireless networks via implicit carrier sensing.
Theor. Comput. Sci., 2020

2019
Online packet scheduling under adversarial errors.
Theor. Comput. Sci., 2019

Communication and location discovery in geometric ring networks.
Inf. Comput., 2019

Packet-oblivious stable routing in multi-hop wireless networks.
CoRR, 2019

Stable Memoryless Queuing under Contention.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Energy Efficient Adversarial Routing in Shared Channels.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

mmWave Wireless Backhaul Scheduling of Stochastic Packet Arrivals.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

Optimal Channel Utilization with Limited Feedback.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

2018
Distributed Online and Stochastic Queueing on a Multiple Access Channel.
ACM Trans. Algorithms, 2018

Local Queuing Under Contention.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

On Range and Edge Capacity in the Congested Clique.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

MST in O(1) Rounds of Congested Clique.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Communication Complexity in Vertex Partition Whiteboard Model.
Proceedings of the Structural Information and Communication Complexity, 2018

Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique.
Proceedings of the Structural Information and Communication Complexity, 2018

Deterministic Digital Clustering of Wireless Ad Hoc Networks.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
Routing in Wireless Networks With Interferences.
IEEE Communications Letters, 2017

MST in O(1) Rounds of the Congested Clique.
CoRR, 2017

MSF and Connectivity in Limited Variants of the Congested Clique.
CoRR, 2017

Brief Announcement: On Connectivity in the Broadcast Congested Clique.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Token Traversal in Ad Hoc Wireless Networks via Implicit Carrier Sensing.
Proceedings of the Structural Information and Communication Complexity, 2017

Fault-Tolerant Online Packet Scheduling on Parallel Channels.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

Subquadratic Non-adaptive Threshold Group Testing.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

Deterministic Oblivious Local Broadcast in the SINR Model.
Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016
Wake-Up Problem in Multi-Hop Radio Networks.
Encyclopedia of Algorithms, 2016

Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.
Encyclopedia of Algorithms, 2016

2015
The Cost of Synchronizing Multiple-Access Channels.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

On setting-up asynchronous ad hoc wireless networks.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Provable fairness for TDMA scheduling.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

Deterministic Symmetry Breaking in Ring Networks.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
Online Packet Scheduling Under Adversarial Jamming.
Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

On the impact of geometry on ad hoc communication in wireless networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Distributed Randomized Broadcasting in Wireless Networks under the SINR Model.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
Distributed Deterministic Broadcasting in Wireless Networks under the SINR Model
CoRR, 2012

Distributed Broadcasting in Wireless Networks under the SINR Model
CoRR, 2012

Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks
CoRR, 2012

Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Distributed Online and Stochastic Queuing on a Multiple Access Channel.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Length-reducing Automata (almost) without Auxiliary Symbols.
Journal of Automata, Languages and Combinatorics, 2011

Growing Grammars and Length-reducing Automata.
Fundam. Inform., 2011

2009
Probabilistic Length-Reducing Two-Pushdown Automata.
Theory Comput. Syst., 2009

2008
On the Complexity of 2-Monotone Restarting Automata.
Theory Comput. Syst., 2008

The Boolean Closure of Growing Context-Sensitive Languages.
Fundam. Inform., 2008

Leftist Grammars Are Non-primitive Recursive.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
On complexity of grammars related to the safety problem.
Theor. Comput. Sci., 2007

Leftist Grammars and the Chomsky Hierarchy.
Theory Comput. Syst., 2007

Sequential monotonicity for restarting automata.
ITA, 2007

Ambiguity by Restarting Automata.
Int. J. Found. Comput. Sci., 2007

Shrinking Restarting Automata.
Int. J. Found. Comput. Sci., 2007

Lower bound technique for length-reducing automata.
Inf. Comput., 2007

2006
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata.
Theor. Comput. Sci., 2006

Restarting automata with restricted utilization of auxiliary symbols.
Theor. Comput. Sci., 2006

Degrees of non-monotonicity for restarting automata.
Theor. Comput. Sci., 2006

Probabilistic Length-Reducing Automata.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio Networks.
Theory Comput. Syst., 2005

Efficient simulation of synchronous systems by multi-speed systems.
ITA, 2005

Deterministic Two-Way Restarting Automata and Marcus Contextual Grammars.
Fundam. Inform., 2005

Restricting the Use of Auxiliary Symbols for Restarting Automata.
Proceedings of the Implementation and Application of Automata, 2005

Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004
Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.
Journal of Automata, Languages and Combinatorics, 2004

On Left-Monotone Deterministic Restarting Automata.
Proceedings of the Developments in Language Theory, 2004

2003
Some Results On Random Unsatisfiable K-Sat Instances And Approximation Algorithms Applied To Random Structures.
Combinatorics, Probability & Computing, 2003

Weak communication in single-hop radio networks: adjusting algorithms to industrial standards.
Concurrency and Computation: Practice and Experience, 2003

2002
Efficient algorithms for leader election in radio networks.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Church-Rosser Languages vs. UCFL.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

Weak Communication in Radio Networks.
Proceedings of the Euro-Par 2002, 2002

Energy-Efficient Size Approximation of Radio Networks with No Collision Detection.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Communication Complexity for Asynchronous Systems of Finite Devices.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

Communication Gap for Finite Memory Devices.
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1999
Multi-party Finite Computations.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998
Power of Cooperation and Multihead Finite Systems.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998


  Loading...