Dominik Pajak

According to our database1, Dominik Pajak
  • authored at least 32 papers between 2011 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Collision-free network exploration.
J. Comput. Syst. Sci., 2017

Time and space optimality of rotor-router graph exploration.
Inf. Process. Lett., 2017

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.
Distributed Computing, 2017

Broadcast in radio networks: time vs. energy tradeoffs.
CoRR, 2017

Multiple Random Walks on Paths and Grids.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016
Bounds on the cover time of parallel rotor walks.
J. Comput. Syst. Sci., 2016

On Location Hiding in Distributed Systems.
CoRR, 2016

Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry?
Proceedings of the Structural Information and Communication Complexity, 2016

Approximating the Size of a Radio Network in Beeping Model.
Proceedings of the Structural Information and Communication Complexity, 2016

Linear Search by a Pair of Distinct-Speed Robots.
Proceedings of the Structural Information and Communication Complexity, 2016

Fence Patrolling with Two-speed Robots.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

2015
Distinguishing views in symmetric networks: A tight lower bound.
Theor. Comput. Sci., 2015

Fast collaborative graph exploration.
Inf. Comput., 2015

On the power of one bit: How to explore a graph when you cannot backtrack?
CoRR, 2015

Electing a Leader in Wireless Networks Quickly Despite Jamming.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Information Spreading by Mobile Particles on a Line.
Proceedings of the Structural Information and Communication Complexity, 2015

2014
Algorithms for deterministic parallel graph exploration. (Algorithmes pour l'exploration parallèle d'un graphe déterminé).
PhD thesis, 2014

k-Selection Protocols from Energetic Complexity Perspective.
IJNC, 2014

Distinguishing Views in Symmetric Networks: A Tight Lower Bound.
CoRR, 2014

Evacuating Robots via Unknown Exit in a Disk.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Bounds on the Cover Time of Parallel Rotor Walks.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Patrolling by Robots Equipped with Visibility.
Proceedings of the Structural Information and Communication Complexity, 2014

Collision-Free Network Exploration.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Maximum matching in multi-interface networks.
Theor. Comput. Sci., 2013

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

K-Selection Protocols from Energetic Complexity Perspective.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Energy-Efficient Leader Election Protocols for Single-Hop Radio Networks.
Proceedings of the 42nd International Conference on Parallel Processing, 2013

Fast Collaborative Graph Exploration.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
On λ-Alert Problem.
Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

Maximum Matching in Multi-Interface Networks.
Proceedings of the Combinatorial Optimization and Applications, 2012

2011
Review of SIROCCO 2011.
SIGACT News, 2011


  Loading...